oj.uz

Submission #540478

# Submission time Handle Problem Language Result Execution time Memory
540478 2022-03-20T13:35:37 Z alvingogo Food Court (JOI21_foodcourt) C++14
24 / 100
 1000 ms 123920 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define cd complex<double>
#define p_q priority_queue
#define int long long
using namespace std;

typedef pair<int,int> pii;
struct BIT{
	int n;
	vector<int> bt;
	void init(int nn){
		n=nn;
		bt.resize(n);
	}
	void update(int x,int y){
		x++;
		for(;x<=n;x+=(x&-x)){
			bt[x]+=y;
		}
	}
	int query(int x){
		x++;
		int ans=0;
		for(;x>0;x-=(x&-x)){
			ans+=bt[x];
		}
		return ans;
	}
};
struct qu{
	int t;
	int l,r,c,k;
	int ans=-1;
};
vector<qu> vq;
struct DS{
	struct no{
		vector<int> tag;
		int cnt=0;
	};
	vector<no> st;
	vector<int> kk;
	void init(int n){
		st.resize(4*n);
		kk.resize(n);
	}
	void upd(int v,int x){
		while(st[v].tag.size()){
			int y=st[v].tag.back();
			if(y<0 && x>0){
				break;
			}
			if(y>0 && x<0){
				st[v].cnt+=min(abs(y),abs(x));
				x+=y;
			}
			else{
				x+=y;
			}
			st[v].tag.pop_back();
		}
		if(x!=0){
			st[v].tag.push_back(x);
		}
	}
	void pudo(int v){
		st[2*v+1].cnt+=st[v].cnt;
		st[2*v+2].cnt+=st[v].cnt;
		for(auto y:st[v].tag){
			upd(2*v+1,y);
			upd(2*v+2,y);
		}
		st[v].cnt=0;
		st[v].tag.clear();
	}
	void update(int v,int L,int R,int l,int r,int k){
		if(l==L && r==R){
			upd(v,k);
			return;
		}
		pudo(v);
		int m=(L+R)/2;
		if(r<=m){
			update(2*v+1,L,m,l,r,k);
		}
		else if(l>m){
			update(2*v+2,m+1,R,l,r,k);
		}
		else{
			update(2*v+1,L,m,l,m,k);
			update(2*v+2,m+1,R,m+1,r,k);
		}
	}
	int query(int v,int L,int R,int pos){
		if(L==R){
			for(auto h:st[v].tag){
				if(h*kk[L]<0){
					st[v].cnt+=min(abs(h),abs(kk[L]));
				}
				kk[L]+=h;
				kk[L]=max(kk[L],0ll);
			}
			st[v].tag.clear();
			return st[v].cnt;
		}
		pudo(v);
		int m=(L+R)/2;
		if(pos<=m){
			return query(2*v+1,L,m,pos);
		}
		else{
			return query(2*v+2,m+1,R,pos);
		}
	}
	void pre(int n){
		for(auto &h:vq){
			if(h.t==1){
				update(0,0,n-1,h.l,h.r,h.k);
			}
			else if(h.t==2){
				update(0,0,n-1,h.l,h.r,-h.k);
			}
			else{
				h.k+=query(0,0,n-1,h.c);
			}
		}
	}
};
struct Q13{
	struct upd{
		int t,u,k;
	};
	vector<vector<int> > qq;
	BIT bt;
	vector<vector<upd> > st;
	map<int,int> s;
	void init(int n,int q){
		bt.init(q+10);
		st.resize(4*n);
		qq.resize(n);
	}
	void update(int v,int L,int R,int l,int r,upd a){
		if(l==L && r==R){
			st[v].push_back(a);
			return;
		}
		int m=(L+R)/2;
		if(r<=m){
			update(2*v+1,L,m,l,r,a);
		}
		else if(l>m){
			update(2*v+2,m+1,R,l,r,a);
		}
		else{
			update(2*v+1,L,m,l,m,a);
			update(2*v+2,m+1,R,m+1,r,a);
		}
	}
	void trav(int v,int L,int R){
		for(auto h:st[v]){
			bt.update(h.t,h.k);
			s[h.t]=h.u;
		}
		if(L==R){
			for(auto h:qq[L]){
				int l=0,r=vq[h].l-1;
				while(r>l){
					int m=(l+r+1)/2;
					if(bt.query(m)<vq[h].k){
						l=m;
					}
					else{
						r=m-1;
					}
				}
				if(bt.query(l+1)<vq[h].k){
					vq[h].ans=0;
				}
				else{
					vq[h].ans=(*s.upper_bound(l)).sc;
				}
			}
		}
		else{
			int m=(L+R)/2;
			trav(2*v+1,L,m);
			trav(2*v+2,m+1,R);
		}
		for(auto h:st[v]){
			bt.update(h.t,-h.k);
			s.erase(h.t);
		}
	}
	void solve(int n,int q){
		for(int i=0;i<q;i++){
			if(vq[i].t==1){
				update(0,0,n-1,vq[i].l,vq[i].r,{i+1,vq[i].c,vq[i].k});
			}
			else if(vq[i].t==3){
				qq[vq[i].c].push_back(i);
			}
		}
		trav(0,0,n-1);
		for(int i=0;i<q;i++){
			if(vq[i].t==3){
				cout << vq[i].ans << "\n";
			}
		}
	}
};
signed main(){
	AquA;
	int n,m,q;
	cin >> n >> m >> q;
	vq.resize(q);
	for(int i=0;i<q;i++){
		cin >> vq[i].t;
		if(vq[i].t==1){
			cin >> vq[i].l >> vq[i].r >> vq[i].c >> vq[i].k;
			vq[i].l--;
			vq[i].r--;
		}
		else if(vq[i].t==2){
			cin >> vq[i].l >> vq[i].r >> vq[i].k;
			vq[i].l--;
			vq[i].r--;
		}
		else{
			cin >> vq[i].c >> vq[i].k;
			vq[i].c--;
			vq[i].l=i;
		}
	}
	DS ds;
	ds.init(n);
	ds.pre(n);
	Q13 ss;
	ss.init(n,q);
	ss.solve(n,q);
	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 5 ms 1236 KB Output is correct
3 Correct 4 ms 1176 KB Output is correct
4 Correct 6 ms 1464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 5 ms 1364 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 6 ms 1364 KB Output is correct
12 Correct 5 ms 1364 KB Output is correct
13 Correct 2 ms 968 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 4 ms 1236 KB Output is correct
16 Correct 5 ms 1364 KB Output is correct
17 Correct 4 ms 1108 KB Output is correct
18 Correct 5 ms 1356 KB Output is correct
19 Correct 3 ms 980 KB Output is correct
20 Correct 4 ms 1228 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 5 ms 1236 KB Output is correct
3 Correct 4 ms 1176 KB Output is correct
4 Correct 6 ms 1464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 5 ms 1364 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 6 ms 1364 KB Output is correct
12 Correct 5 ms 1364 KB Output is correct
13 Correct 2 ms 968 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 4 ms 1236 KB Output is correct
16 Correct 5 ms 1364 KB Output is correct
17 Correct 4 ms 1108 KB Output is correct
18 Correct 5 ms 1356 KB Output is correct
19 Correct 3 ms 980 KB Output is correct
20 Correct 4 ms 1228 KB Output is correct
21 Incorrect 5 ms 1232 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 26292 KB Output is correct
2 Correct 151 ms 27108 KB Output is correct
3 Correct 133 ms 26928 KB Output is correct
4 Correct 130 ms 28176 KB Output is correct
5 Correct 138 ms 29348 KB Output is correct
6 Correct 140 ms 29260 KB Output is correct
7 Correct 30 ms 6288 KB Output is correct
8 Correct 31 ms 6336 KB Output is correct
9 Correct 110 ms 27616 KB Output is correct
10 Correct 116 ms 27656 KB Output is correct
11 Correct 124 ms 27628 KB Output is correct
12 Correct 127 ms 27660 KB Output is correct
13 Correct 105 ms 21676 KB Output is correct
14 Correct 123 ms 28860 KB Output is correct
15 Correct 126 ms 24056 KB Output is correct
16 Correct 137 ms 30300 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1062 ms 123920 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 5 ms 1236 KB Output is correct
3 Correct 4 ms 1176 KB Output is correct
4 Correct 6 ms 1464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 5 ms 1364 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 6 ms 1364 KB Output is correct
12 Correct 5 ms 1364 KB Output is correct
13 Correct 2 ms 968 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 4 ms 1236 KB Output is correct
16 Correct 5 ms 1364 KB Output is correct
17 Correct 4 ms 1108 KB Output is correct
18 Correct 5 ms 1356 KB Output is correct
19 Correct 3 ms 980 KB Output is correct
20 Correct 4 ms 1228 KB Output is correct
21 Correct 120 ms 26292 KB Output is correct
22 Correct 151 ms 27108 KB Output is correct
23 Correct 133 ms 26928 KB Output is correct
24 Correct 130 ms 28176 KB Output is correct
25 Correct 138 ms 29348 KB Output is correct
26 Correct 140 ms 29260 KB Output is correct
27 Correct 30 ms 6288 KB Output is correct
28 Correct 31 ms 6336 KB Output is correct
29 Correct 110 ms 27616 KB Output is correct
30 Correct 116 ms 27656 KB Output is correct
31 Correct 124 ms 27628 KB Output is correct
32 Correct 127 ms 27660 KB Output is correct
33 Correct 105 ms 21676 KB Output is correct
34 Correct 123 ms 28860 KB Output is correct
35 Correct 126 ms 24056 KB Output is correct
36 Correct 137 ms 30300 KB Output is correct
37 Correct 234 ms 32216 KB Output is correct
38 Correct 256 ms 35620 KB Output is correct
39 Correct 25 ms 5644 KB Output is correct
40 Correct 30 ms 6028 KB Output is correct
41 Correct 259 ms 37772 KB Output is correct
42 Correct 274 ms 38072 KB Output is correct
43 Correct 281 ms 37680 KB Output is correct
44 Correct 284 ms 37732 KB Output is correct
45 Correct 271 ms 37824 KB Output is correct
46 Correct 282 ms 37808 KB Output is correct
47 Correct 75 ms 26304 KB Output is correct
48 Correct 231 ms 38428 KB Output is correct
49 Correct 186 ms 26552 KB Output is correct
50 Correct 248 ms 35032 KB Output is correct
51 Correct 281 ms 38012 KB Output is correct
52 Correct 297 ms 38084 KB Output is correct
53 Correct 105 ms 25468 KB Output is correct
54 Correct 136 ms 30236 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 272 ms 37096 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 5 ms 1236 KB Output is correct
3 Correct 4 ms 1176 KB Output is correct
4 Correct 6 ms 1464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 5 ms 1364 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 6 ms 1364 KB Output is correct
12 Correct 5 ms 1364 KB Output is correct
13 Correct 2 ms 968 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 4 ms 1236 KB Output is correct
16 Correct 5 ms 1364 KB Output is correct
17 Correct 4 ms 1108 KB Output is correct
18 Correct 5 ms 1356 KB Output is correct
19 Correct 3 ms 980 KB Output is correct
20 Correct 4 ms 1228 KB Output is correct
21 Incorrect 5 ms 1232 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 5 ms 1236 KB Output is correct
3 Correct 4 ms 1176 KB Output is correct
4 Correct 6 ms 1464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 4 ms 1364 KB Output is correct
8 Correct 5 ms 1364 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 6 ms 1364 KB Output is correct
12 Correct 5 ms 1364 KB Output is correct
13 Correct 2 ms 968 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 4 ms 1236 KB Output is correct
16 Correct 5 ms 1364 KB Output is correct
17 Correct 4 ms 1108 KB Output is correct
18 Correct 5 ms 1356 KB Output is correct
19 Correct 3 ms 980 KB Output is correct
20 Correct 4 ms 1228 KB Output is correct
21 Incorrect 5 ms 1232 KB Output isn't correct
22 Halted 0 ms 0 KB -