제출 #503255

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
503255		keta_tsimakuridze	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	64 / 100	560 ms	33328 KiB

sortbooks

#include<bits/stdc++.h>
#define int long long
#define f first
#define s second
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7; // !
int t, a[N], tree[4 * N], lazy[4 * N], n, m;
vector<pair<pii,int> > q[N];
void push(int u,int l,int r) {
	tree[u] += lazy[u];
	if(l != r) {
		lazy[2 * u] += lazy[u];
		lazy[2 * u + 1] += lazy[u];
	}
	lazy[u] = 0;
}
void upd(int u,int st, int en, int l,int r,int val) {
	push(u, l, r);
	if(l > en || r < st) return;
	if(st <= l && r <= en) {
		lazy[u] = val; push(u, l, r);
		return;
	}
	int mid = (l + r) / 2;
	upd(2 * u, st, en, l, mid, val); upd(2 * u + 1, st, en, mid + 1, r, val);
	tree[u] = max(tree[2 * u], tree[2 * u + 1]); 
}
int get(int u,int st,int en,int l,int r) {
	push(u, l, r);
	if(l > en || r < st) return 0;
	if(st <= l && r <= en) return tree[u];
	int mid = (l + r) / 2;
	return max(get(2 * u, st, en, l, mid), get(2 * u + 1, st, en, mid + 1, r));
}
main(){
	cin >> n >> m;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = 1; i <= m; i++) {
		int l,r,k;
		cin >> l >> r >> k;
		q[l].push_back({{r, k}, i});
	}
	stack<pair<pii, pii> > st;
	vector<int> ans(m + 5);
	for(int i = n; i >= 1; i--) {
		int r = i;
		while(st.size() && st.top().f.f < a[i]) {
			r = st.top().s.s;
			if(st.top().f.s == -1) upd(1, st.top().s.f, st.top().s.s, 1, n, st.top().f.f + a[i]);
			else 
			upd(1, st.top().s.f, st.top().s.s, 1, n, - st.top().f.s + a[i]);
			st.pop();
		}
		if(r > i)
		st.push({{a[i], a[i]}, {i + 1, r}});
		st.push({{a[i], -1}, {i, i}});
		for(int j = 0; j < q[i].size(); j++) {
			ans[q[i][j].s] = (get(1,i,q[i][j].f.f,1,n) <= q[i][j].f.s);
		}
	}
	for(int i = 1; i <= m; i++) cout << ans[i] <<" ";
	
}

컴파일 시 표준 에러 (stderr) 메시지

sortbooks.cpp:36:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 | main(){
      | ^~~~
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:58:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int j = 0; j < q[i].size(); j++) {
      |                  ~~^~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 0 / 13
• Subtask 4: 17 / 17
• Subtask 5: 30 / 30
• Subtask 6: 0 / 23