oj.uz

답안 #555278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
555278 2022-04-30T11:10:08 Z kshitij_sodani Fish 2 (JOI22_fish2) C++14
48 / 100
 4000 ms 192032 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
#define endl '\n'

llo it[100001];
vector<llo> aa[100001];
llo pre[100001];
vector<pair<llo,llo>> bb[100001];
vector<pair<llo,llo>> cc[100001];
pair<llo,llo> ne[100001];
llo fin[100001];
llo tree2[4*100001][2];
vector<pair<pair<llo,llo>,pair<llo,llo>>> ee[100001];
vector<pair<llo,llo>> ff[100001];
void build(llo no,llo l,llo r){
	if(l==r){
		tree2[no][0]=it[l]-pre[l];
		tree2[no][1]=it[l]+pre[l+1];
	}
	else{
		llo mid=(l+r)/2;
		build(no*2+1,l,mid);
		build(no*2+2,mid+1,r);
		tree2[no][0]=max(tree2[no*2+1][0],tree2[no*2+2][0]);
		tree2[no][1]=max(tree2[no*2+1][1],tree2[no*2+2][1]);
	}
}
llo query(llo no,llo l,llo r,llo aa,llo bb,llo ind){
	if(r<aa or l>bb or aa>bb){
		return -(llo)1e18;
	}
	if(aa<=l and r<=bb){
		return tree2[no][ind];
	}
	llo mid=(l+r)/2;
	return max(query(no*2+1,l,mid,aa,bb,ind),query(no*2+2,mid+1,r,aa,bb,ind));
}

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ord tree<pair<llo,llo>,null_type,less<pair<llo,llo>>,rb_tree_tag,tree_order_statistics_node_update>
ord tree3[4*100001];
void update2(llo no,llo l,llo r,llo i,llo j){
	tree3[no].insert({j,i});
	if(l<r){
		llo mid=(l+r)/2;
		if(i<=mid){
			update2(no*2+1,l,mid,i,j);
		}
		else{
			update2(no*2+2,mid+1,r,i,j);
		}
	}
}
llo query2(llo no,llo l,llo r,llo aa,llo bb,llo i){
	if(r<aa or l>bb or aa>bb){
		return 0;
	}
	if(aa<=l and r<=bb){
		if(tree3[no].size()==0){
			return 0;
		}

		//for(auto j:tree3[no]){
		//	cout<<j.a<<","<<j.b<<endl;
		//}
		return tree3[no].order_of_key({i,-1});
	}
	llo mid=(l+r)/2;
	return query2(no*2+1,l,mid,aa,bb,i)+query2(no*2+2,mid+1,r,aa,bb,i);
}
llo cot[100001];
llo mi[100001];
llo vis[100001];
llo re[100001];
llo le[100001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	llo n,q;
	cin>>n;
	for(llo i=0;i<n;i++){
		cin>>it[i];
		pre[i+1]=pre[i]+it[i];
	}
	cin>>q;
	if(q<=1000){
		while(q--){
			int tt,l,r;
			cin>>tt>>l>>r;
			if(tt==1){
				l--;
				it[l]=r;
				for(llo i=0;i<n;i++){
					pre[i+1]=pre[i]+it[i];
				}
			}
			else{
				l--;
				r--;
				int ind=l-1;
				for(int i=l+1;i<=r;i++){
					if(it[i]>(pre[i]-pre[l])){
						ind=i-1;
					}
				}
				for(int i=l;i<=r+1;i++){
					vis[i]=0;
				}
/*				for(int j=l;j<=ind;j++){
					vis[j]=0;
				}*/
				vis[l]++;
				vis[ind+1]--;
				ind=r+1;
				for(int j=r-1;j>=l;j--){
					if(it[j]>(pre[r+1]-pre[j+1])){
						ind=j+1;
					}
				}
				vis[ind]++;
				vis[r+1]--;
				vector<pair<llo,llo>> ss;
				for(int i=l;i<=r;i++){
					while(ss.size()){
						if(ss.back().a<=it[i]){
							ss.pop_back();
						}
						else{
							break;
						}
					}
					if(ss.size()){
						le[i]=ss.back().b;
					}
					else{
						le[i]=-1;
					}
					ss.pb({it[i],i});
				}
				ss.clear();
				for(int i=r;i>=l;i--){
					while(ss.size()){
						if(ss.back().a<=it[i]){
							ss.pop_back();
						}
						else{
							break;
						}
					}
					if(ss.size()){
						re[i]=ss.back().b;
					}
					else{
						re[i]=-1;
					}
					ss.pb({it[i],i});
				}
				ss.clear();
				for(int i=l+1;i<=r-1;i++){
					if(le[i]>=0 and re[i]>=0){
						if(it[le[i]]>pre[re[i]]-pre[le[i]+1]){
							if(it[re[i]]>pre[re[i]]-pre[le[i]+1]){
								vis[le[i]+1]++;
								vis[re[i]]--;
								//cout<<le[i]+1<<":"<<re[i]-1<<endl;
							}
						}
					}
				}
				llo su=0;
				llo su2=0;
				for(int j=l;j<=r;j++){
					su+=vis[j];
					if(su==0){
						su2++;
					}
				}
				cout<<su2<<endl;
			}
		}
		return 0;
	}

	for(llo i=0;i<n;i++){
		ne[i]={-1,-1};
	}
	llo ax=0;
	for(llo i=1;i<n;i++){
		if(it[i]<it[i-1]){
			aa[i].pb(i);
		}
		for(auto j:aa[i-1]){
			if(pre[i+1]-pre[j]<it[j-1]){
				aa[i].pb(j);
			}
		}

		if(i<n-1){
			for(auto j:aa[i]){
				if(pre[i+1]-pre[j]<it[i+1]){
					bb[j-1].pb({i,j});
					cc[i+1].pb({i,j});
					ax++;
					//cout<<i<<":"<<j<<endl;
				}
			}
		}

	}
	assert(ax<=2*n);
	multiset<pair<llo,llo>> cur;
	llo ans=n;

	for(llo i=0;i<n;i++){
		for(auto j:cc[i]){
			auto jj=cur.find({j.a,-j.b});
			cur.erase(jj);
		}
		if(cur.size()){
			pair<llo,llo> no=*(cur.begin());
			no.b=-no.b;
			ans--;
			ne[i]={no.b,no.a};
		}
		else{
		}
		for(auto j:bb[i]){
			cur.insert({j.a,-j.b});
		}
	}		
	build(0,0,n-1);
	llo zz=0;
	llo qq=q;

	while(q--){
		llo tt,l,r;
		cin>>tt>>l>>r;
		if(tt==1){
			l--;
			it[l]=r;

			for(llo i=0;i<n;i++){
				ne[i]={-1,-1};
				aa[i].clear();
				bb[i].clear();
				cc[i].clear();
			}
			for(int i=0;i<n;i++){
				pre[i+1]=pre[i]+it[i];
			}
			for(llo i=1;i<n;i++){
				if(it[i]<it[i-1]){
					aa[i].pb(i);
				}
				for(auto j:aa[i-1]){
					if(pre[i+1]-pre[j]<it[j-1]){
						aa[i].pb(j);
					}
				}

				if(i<n-1){
					for(auto j:aa[i]){
						if(pre[i+1]-pre[j]<it[i+1]){
							bb[j-1].pb({i,j});
							cc[i+1].pb({i,j});
							//cout<<i<<":"<<j<<endl;

						}
					}
				}
			}
			multiset<pair<llo,llo>> cur;
			llo ans=n;
			for(llo i=0;i<n;i++){
				for(auto j:cc[i]){
					auto jj=cur.find({j.a,-j.b});
					cur.erase(jj);
				}
				if(cur.size()){
					pair<llo,llo> no=*(cur.begin());
					no.b=-no.b;
					ans--;
					ne[i]={no.b,no.a};
				}
				else{
				}
				for(auto j:bb[i]){
					cur.insert({j.a,-j.b});
				}
			}		
			build(0,0,n-1);
		}
		else{
			l--;
			r--;
			if(l==r){
				fin[zz]=1;
				if(n<=500 and qq<=500){
					cout<<1<<endl;
				}
				zz++;
				/*if(n<=500 and qq<=500){
					cout<<1<<endl;
				}*/
				continue;
			}
			llo ind=r+1;
			for(llo j=19;j>=0;j--){
				if(ind-(1<<j)>l){
					if(query(0,0,n-1,ind-(1<<j),r,0)+pre[l]<=0){
						//cout<<query(0,0,n-1,ind-(1<<j),r,0)+pre[l]<<","<<ind-(1<<j)<<","<<r<<endl;
						ind-=(1<<j);
					}
				}
			}
			ind--;
			//cout<<ind<<":"<<endl;
		/*	llo ind=low-1;
			for(llo i=l+1;i<=r;i++){
				if(it[i]-(pre[i]-pre[l])>0){
					ind=i;
				}
			}*/
			llo ind2=l-1;
			for(llo j=19;j>=0;j--){
				if(ind2+(1<<j)<r){
					if(query(0,0,n-1,l,ind2+(1<<j),1)-pre[r+1]<=0){
						ind2+=(1<<j);
					}
				}
			}
			ind2++;
			/*for(llo i=r-1;i>=l;i--){
				if(it[i]-(pre[r+1]-pre[i+1])>0){
					ind2=i;
				}
			}
			ind2++;*/

			llo su=0;
			if(ind>ind2){
				fin[zz]=0;
			}
			else{
				ee[ind].pb({{ind,ind2},{ind2,zz}});
			}
			if(n<=500 and qq<=500){
				for(llo j=ind;j<=ind2;j++){
					if(ne[j].a>=0){
						if(ne[j].a>l and ne[j].b<r){
							continue;
						}
					}
					su++;
				}
				cout<<su<<endl;
			}
		
			zz++;
		}
	}

	for(llo i=0;i<n;i++){
		if(ne[i].a>=0){
			//cout<<i<<":"<<ne[i].a<<":"<<ne[i].b<<endl;
			ff[ne[i].a].pb({i,ne[i].b});
		}

	}
	for(int i=0;i<n;i++){
		cot[i]=n;
	}
	for(llo i=n-1;i>=0;i--){
		for(auto j:ee[i]){
			llo xx=(j.a.b-j.a.a+1)-query2(0,0,n-1,j.a.a,j.a.b,j.b.a);
			/*for(int ii=j.a.a;ii<=j.a.b;ii++){
				if(cot[ii]<j.b.a){

				}
				else{
					xx++;
				}
			}*/
		//	cout<<i<<","<<j.a.a<<","<<j.a.b<<","<<j.b.a<<","<<j.b.b<<endl;
			//cout<<xx<<endl;
			//xx=(j.a.b-j.a.a+1)-xx;
			fin[j.b.b]=xx;
		}
		for(auto j:ff[i]){
			//cout<<j.a<<"::"<<j.b<<endl;
			cot[j.a]=j.b;
			update2(0,0,n-1,j.a,j.b);
		}
	}

		if(n<=500 and qq<=500){
			return 0;
		}
	for(llo i=0;i<zz;i++){
		cout<<fin[i]<<endl;
	}








	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 49668 KB Output is correct
2 Correct 34 ms 49676 KB Output is correct
3 Correct 35 ms 49572 KB Output is correct
4 Correct 33 ms 49592 KB Output is correct
5 Correct 34 ms 49684 KB Output is correct
6 Correct 36 ms 49648 KB Output is correct
7 Correct 35 ms 49652 KB Output is correct
8 Correct 34 ms 49640 KB Output is correct
9 Correct 35 ms 49620 KB Output is correct
10 Correct 34 ms 49628 KB Output is correct
11 Correct 36 ms 49612 KB Output is correct
12 Correct 33 ms 49676 KB Output is correct
13 Correct 37 ms 49600 KB Output is correct
14 Correct 34 ms 49592 KB Output is correct
15 Correct 35 ms 49688 KB Output is correct
16 Correct 36 ms 49620 KB Output is correct
17 Correct 34 ms 49656 KB Output is correct
18 Correct 37 ms 49780 KB Output is correct
19 Correct 34 ms 49664 KB Output is correct
20 Correct 38 ms 49692 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 49568 KB Output is correct
2 Correct 46 ms 54092 KB Output is correct
3 Correct 43 ms 53872 KB Output is correct
4 Correct 43 ms 54056 KB Output is correct
5 Correct 43 ms 53840 KB Output is correct
6 Correct 49 ms 54380 KB Output is correct
7 Correct 45 ms 53692 KB Output is correct
8 Correct 49 ms 54444 KB Output is correct
9 Correct 52 ms 53672 KB Output is correct
10 Correct 48 ms 54096 KB Output is correct
11 Correct 41 ms 53836 KB Output is correct
12 Correct 44 ms 53708 KB Output is correct
13 Correct 44 ms 53864 KB Output is correct
14 Correct 45 ms 54092 KB Output is correct
15 Correct 46 ms 54092 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 49668 KB Output is correct
2 Correct 34 ms 49676 KB Output is correct
3 Correct 35 ms 49572 KB Output is correct
4 Correct 33 ms 49592 KB Output is correct
5 Correct 34 ms 49684 KB Output is correct
6 Correct 36 ms 49648 KB Output is correct
7 Correct 35 ms 49652 KB Output is correct
8 Correct 34 ms 49640 KB Output is correct
9 Correct 35 ms 49620 KB Output is correct
10 Correct 34 ms 49628 KB Output is correct
11 Correct 36 ms 49612 KB Output is correct
12 Correct 33 ms 49676 KB Output is correct
13 Correct 37 ms 49600 KB Output is correct
14 Correct 34 ms 49592 KB Output is correct
15 Correct 35 ms 49688 KB Output is correct
16 Correct 36 ms 49620 KB Output is correct
17 Correct 34 ms 49656 KB Output is correct
18 Correct 37 ms 49780 KB Output is correct
19 Correct 34 ms 49664 KB Output is correct
20 Correct 38 ms 49692 KB Output is correct
21 Correct 33 ms 49568 KB Output is correct
22 Correct 46 ms 54092 KB Output is correct
23 Correct 43 ms 53872 KB Output is correct
24 Correct 43 ms 54056 KB Output is correct
25 Correct 43 ms 53840 KB Output is correct
26 Correct 49 ms 54380 KB Output is correct
27 Correct 45 ms 53692 KB Output is correct
28 Correct 49 ms 54444 KB Output is correct
29 Correct 52 ms 53672 KB Output is correct
30 Correct 48 ms 54096 KB Output is correct
31 Correct 41 ms 53836 KB Output is correct
32 Correct 44 ms 53708 KB Output is correct
33 Correct 44 ms 53864 KB Output is correct
34 Correct 45 ms 54092 KB Output is correct
35 Correct 46 ms 54092 KB Output is correct
36 Correct 563 ms 54220 KB Output is correct
37 Correct 798 ms 53960 KB Output is correct
38 Correct 899 ms 53908 KB Output is correct
39 Correct 277 ms 54148 KB Output is correct
40 Correct 972 ms 53856 KB Output is correct
41 Correct 976 ms 54460 KB Output is correct
42 Correct 1219 ms 54476 KB Output is correct
43 Correct 957 ms 53760 KB Output is correct
44 Correct 1134 ms 53820 KB Output is correct
45 Correct 558 ms 54132 KB Output is correct
46 Correct 763 ms 54036 KB Output is correct
47 Correct 1058 ms 54092 KB Output is correct
48 Correct 432 ms 53836 KB Output is correct
49 Correct 1246 ms 53848 KB Output is correct
50 Correct 613 ms 54092 KB Output is correct
51 Correct 2540 ms 54256 KB Output is correct
52 Correct 2724 ms 54280 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 49568 KB Output is correct
2 Correct 46 ms 54092 KB Output is correct
3 Correct 43 ms 53872 KB Output is correct
4 Correct 43 ms 54056 KB Output is correct
5 Correct 43 ms 53840 KB Output is correct
6 Correct 49 ms 54380 KB Output is correct
7 Correct 45 ms 53692 KB Output is correct
8 Correct 49 ms 54444 KB Output is correct
9 Correct 52 ms 53672 KB Output is correct
10 Correct 48 ms 54096 KB Output is correct
11 Correct 41 ms 53836 KB Output is correct
12 Correct 44 ms 53708 KB Output is correct
13 Correct 44 ms 53864 KB Output is correct
14 Correct 45 ms 54092 KB Output is correct
15 Correct 46 ms 54092 KB Output is correct
16 Correct 36 ms 49616 KB Output is correct
17 Correct 1668 ms 186116 KB Output is correct
18 Correct 1701 ms 180552 KB Output is correct
19 Correct 1609 ms 185272 KB Output is correct
20 Correct 1635 ms 185420 KB Output is correct
21 Correct 1649 ms 185656 KB Output is correct
22 Correct 1707 ms 180560 KB Output is correct
23 Correct 1631 ms 185288 KB Output is correct
24 Correct 1701 ms 185804 KB Output is correct
25 Correct 1677 ms 185780 KB Output is correct
26 Correct 1718 ms 186012 KB Output is correct
27 Correct 1263 ms 118812 KB Output is correct
28 Correct 1180 ms 118728 KB Output is correct
29 Correct 1160 ms 119020 KB Output is correct
30 Correct 1496 ms 165308 KB Output is correct
31 Correct 1843 ms 181268 KB Output is correct
32 Correct 1988 ms 192032 KB Output is correct
33 Correct 2121 ms 184392 KB Output is correct
34 Correct 2003 ms 191532 KB Output is correct
35 Correct 1957 ms 191360 KB Output is correct
36 Correct 1862 ms 187168 KB Output is correct
37 Correct 1763 ms 178768 KB Output is correct
38 Correct 1561 ms 159848 KB Output is correct
39 Correct 1582 ms 149264 KB Output is correct
40 Correct 1497 ms 149644 KB Output is correct

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 49568 KB Output is correct
2 Correct 46 ms 54092 KB Output is correct
3 Correct 43 ms 53872 KB Output is correct
4 Correct 43 ms 54056 KB Output is correct
5 Correct 43 ms 53840 KB Output is correct
6 Correct 49 ms 54380 KB Output is correct
7 Correct 45 ms 53692 KB Output is correct
8 Correct 49 ms 54444 KB Output is correct
9 Correct 52 ms 53672 KB Output is correct
10 Correct 48 ms 54096 KB Output is correct
11 Correct 41 ms 53836 KB Output is correct
12 Correct 44 ms 53708 KB Output is correct
13 Correct 44 ms 53864 KB Output is correct
14 Correct 45 ms 54092 KB Output is correct
15 Correct 46 ms 54092 KB Output is correct
16 Correct 37 ms 49612 KB Output is correct
17 Execution timed out 4083 ms 64912 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 49668 KB Output is correct
2 Correct 34 ms 49676 KB Output is correct
3 Correct 35 ms 49572 KB Output is correct
4 Correct 33 ms 49592 KB Output is correct
5 Correct 34 ms 49684 KB Output is correct
6 Correct 36 ms 49648 KB Output is correct
7 Correct 35 ms 49652 KB Output is correct
8 Correct 34 ms 49640 KB Output is correct
9 Correct 35 ms 49620 KB Output is correct
10 Correct 34 ms 49628 KB Output is correct
11 Correct 36 ms 49612 KB Output is correct
12 Correct 33 ms 49676 KB Output is correct
13 Correct 37 ms 49600 KB Output is correct
14 Correct 34 ms 49592 KB Output is correct
15 Correct 35 ms 49688 KB Output is correct
16 Correct 36 ms 49620 KB Output is correct
17 Correct 34 ms 49656 KB Output is correct
18 Correct 37 ms 49780 KB Output is correct
19 Correct 34 ms 49664 KB Output is correct
20 Correct 38 ms 49692 KB Output is correct
21 Correct 33 ms 49568 KB Output is correct
22 Correct 46 ms 54092 KB Output is correct
23 Correct 43 ms 53872 KB Output is correct
24 Correct 43 ms 54056 KB Output is correct
25 Correct 43 ms 53840 KB Output is correct
26 Correct 49 ms 54380 KB Output is correct
27 Correct 45 ms 53692 KB Output is correct
28 Correct 49 ms 54444 KB Output is correct
29 Correct 52 ms 53672 KB Output is correct
30 Correct 48 ms 54096 KB Output is correct
31 Correct 41 ms 53836 KB Output is correct
32 Correct 44 ms 53708 KB Output is correct
33 Correct 44 ms 53864 KB Output is correct
34 Correct 45 ms 54092 KB Output is correct
35 Correct 46 ms 54092 KB Output is correct
36 Correct 563 ms 54220 KB Output is correct
37 Correct 798 ms 53960 KB Output is correct
38 Correct 899 ms 53908 KB Output is correct
39 Correct 277 ms 54148 KB Output is correct
40 Correct 972 ms 53856 KB Output is correct
41 Correct 976 ms 54460 KB Output is correct
42 Correct 1219 ms 54476 KB Output is correct
43 Correct 957 ms 53760 KB Output is correct
44 Correct 1134 ms 53820 KB Output is correct
45 Correct 558 ms 54132 KB Output is correct
46 Correct 763 ms 54036 KB Output is correct
47 Correct 1058 ms 54092 KB Output is correct
48 Correct 432 ms 53836 KB Output is correct
49 Correct 1246 ms 53848 KB Output is correct
50 Correct 613 ms 54092 KB Output is correct
51 Correct 2540 ms 54256 KB Output is correct
52 Correct 2724 ms 54280 KB Output is correct
53 Correct 36 ms 49616 KB Output is correct
54 Correct 1668 ms 186116 KB Output is correct
55 Correct 1701 ms 180552 KB Output is correct
56 Correct 1609 ms 185272 KB Output is correct
57 Correct 1635 ms 185420 KB Output is correct
58 Correct 1649 ms 185656 KB Output is correct
59 Correct 1707 ms 180560 KB Output is correct
60 Correct 1631 ms 185288 KB Output is correct
61 Correct 1701 ms 185804 KB Output is correct
62 Correct 1677 ms 185780 KB Output is correct
63 Correct 1718 ms 186012 KB Output is correct
64 Correct 1263 ms 118812 KB Output is correct
65 Correct 1180 ms 118728 KB Output is correct
66 Correct 1160 ms 119020 KB Output is correct
67 Correct 1496 ms 165308 KB Output is correct
68 Correct 1843 ms 181268 KB Output is correct
69 Correct 1988 ms 192032 KB Output is correct
70 Correct 2121 ms 184392 KB Output is correct
71 Correct 2003 ms 191532 KB Output is correct
72 Correct 1957 ms 191360 KB Output is correct
73 Correct 1862 ms 187168 KB Output is correct
74 Correct 1763 ms 178768 KB Output is correct
75 Correct 1561 ms 159848 KB Output is correct
76 Correct 1582 ms 149264 KB Output is correct
77 Correct 1497 ms 149644 KB Output is correct
78 Correct 37 ms 49612 KB Output is correct
79 Execution timed out 4083 ms 64912 KB Time limit exceeded
80 Halted 0 ms 0 KB -