oj.uz

Submission #895154

# Submission time Handle Problem Language Result Execution time Memory
895154 2023-12-29T13:44:55 Z amirhoseinfar1385 Constellation 3 (JOI20_constellation3) C++17
35 / 100
 1500 ms 49820 KB 
#include<bits/stdc++.h>
using namespace std;
const long long maxn=200000+10;
struct node{
	long long x,y,w,l,r;
}allq[maxn];
vector<int>allqi[maxn];
long long all[maxn],q,n;
vector<long long>sn,si;
pair<long long,long long>val[maxn],fakeval[maxn],fa[maxn],mx[maxn];
pair<vector<long long>,vector<long long>>fmx[maxn];
bool cmpn(long long a,long long b){
	return allq[a].y<allq[b].y;
}

bool cmpi(long long a,long long b){
	if(all[a]==all[b]){
		return a<b;
	}
	return all[a]<all[b];
}

void callr()
{
	deque<pair<long long,long long>>allind;
	allind.push_back(make_pair(n+2,0));
	for(int i=1;i<=n;i++){
		for(auto x:allqi[i]){
			int p=lower_bound(allind.begin(),allind.end(),make_pair(allq[x].y,0ll))-allind.begin();
			allq[x].l=allind[p].second;
		}	
		while((int)allind.front().first<all[i]){
			if(mx[i].first==allind.front().first){
				fmx[i].first.push_back(allind.front().second);
			}
			if(mx[i].first<allind.front().first){
				mx[i].first=allind.front().first;
				fmx[i].first.clear();
				fmx[i].first.push_back(allind.front().second);
			}
			allind.pop_front();
		}
		fa[i].first=allind.front().second;
		allind.push_front(make_pair(all[i],i));
	}
	allind.clear();
	allind.push_back(make_pair(n+1,n+1));
	for(int i=n;i>=1;i--){
		for(auto x:allqi[i]){
			int p=lower_bound(allind.begin(),allind.end(),make_pair(allq[x].y,0ll))-allind.begin();
			allq[x].r=allind[p].second;
		}
		while((int)allind.front().first<all[i]){
			if(mx[i].second==allind.front().first){
				fmx[i].second.push_back(allind.front().second);
			}
			if(mx[i].second<allind.front().first){
				mx[i].second=allind.front().first;
				fmx[i].second.clear();
				fmx[i].second.push_back(allind.front().second);
			}
			allind.pop_front();
		}
		fa[i].second=allind.front().second;
		allind.push_front(make_pair(all[i],i));
	}
}
long long mainres=0;

void updn(long long ind){
	long long res=0,resa=0;
	long long maxa=-1;
	for(long long i=allq[ind].x;i<allq[ind].r;i++){
		if(all[i]>=maxa){
			res+=val[i].second;
			maxa=all[i];
		}
	}
	maxa=-1;
	for(long long i=allq[ind].x;i>allq[ind].l;i--){
		if(all[i]>=maxa){
			res+=val[i].first;
			maxa=all[i];
		}
	}
	res+=resa+allq[ind].w;
	fakeval[allq[ind].r].first=max(fakeval[allq[ind].r].first,res);
	fakeval[allq[ind].l].second=max(fakeval[allq[ind].l].second,res);
	mainres=max(mainres,res);
}

void upd(long long ind){
	val[ind]=fakeval[ind];
	long long res=0,maxa=-1;
	vector<long long>v;
	if(fa[ind].first!=ind-1){
		//for(int i=ind-1;i>fa[ind].first;i--){
		//	if(all[i]==mx[ind].first){
		//		v.push_back(i);
		//	}
		//}
		v=fmx[ind].first;
		if((long long)v.size()>0){
			for(auto x:v){
				res+=val[x].second;
			}
			res+=val[v.back()].first;
			val[ind].first=max(val[ind].first,res);
		}
	}
	res=0,maxa=-1;
	v.clear();
	if(fa[ind].second!=ind+1){
		//for(int i=ind+1;i<fa[ind].second;i++){
		//	if(all[i]==mx[ind].second){
		//		v.push_back(i);
		//	}
		//}
		v=fmx[ind].second;
		if((long long)v.size()>0){
			for(auto x:v){
				res+=val[x].first;
			}
			res+=val[v.back()].second;
			val[ind].second=max(val[ind].second,res);
		}
	}
	mainres=max(mainres,max(val[ind].first,val[ind].second));
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(long long i=1;i<=n;i++){
		cin>>all[i];
		si.push_back(i);
	}
	cin>>q;
	long long suma=0;
	for(long long i=1;i<=q;i++){
		sn.push_back(i);
		cin>>allq[i].x>>allq[i].y>>allq[i].w;
		allqi[allq[i].x].push_back(i);
		suma+=allq[i].w;
	}
	callr();
	sort(sn.begin(),sn.end(),cmpn);
	sort(si.begin(),si.end(),cmpi);
	long long i=0,j=0;
	while(i<(long long)sn.size()&&j<(long long)si.size()){
		if(allq[sn[i]].y<=all[si[j]]){
			updn(sn[i]);
			i++;
		}
		else{
			upd(si[j]);
			j++;
		}
	}
	while(i<(long long)sn.size()){
		updn(sn[i]);
		i++;
	}
	while(j<(long long)si.size()){
		upd(si[j]);
		j++;
	}
	long long now=(long long)si.size()-1;
	long long res=val[si[now]].second;
	while(now!=0&&all[si[now-1]]==all[si[now]]){
		now--;
		res+=val[si[now]].second;
	}
	res+=val[si[now]].first;
	mainres=max(mainres,res);
	mainres=suma-mainres;
	cout<<mainres<<"\n";
}

Compilation message

constellation3.cpp: In function 'void upd(long long int)':
constellation3.cpp:94:18: warning: variable 'maxa' set but not used [-Wunused-but-set-variable]
   94 |  long long res=0,maxa=-1;
      |                  ^~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 23132 KB Output is correct
2 Correct 4 ms 23156 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 4 ms 23128 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 23132 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 4 ms 23128 KB Output is correct
11 Correct 4 ms 23232 KB Output is correct
12 Correct 4 ms 23132 KB Output is correct
13 Correct 4 ms 23132 KB Output is correct
14 Correct 4 ms 23132 KB Output is correct
15 Correct 4 ms 23132 KB Output is correct
16 Correct 4 ms 23132 KB Output is correct
17 Correct 5 ms 23132 KB Output is correct
18 Correct 5 ms 23132 KB Output is correct
19 Correct 4 ms 23132 KB Output is correct
20 Correct 4 ms 23132 KB Output is correct
21 Correct 5 ms 23220 KB Output is correct
22 Correct 4 ms 23132 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 23132 KB Output is correct
2 Correct 4 ms 23156 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 4 ms 23128 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 23132 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 4 ms 23128 KB Output is correct
11 Correct 4 ms 23232 KB Output is correct
12 Correct 4 ms 23132 KB Output is correct
13 Correct 4 ms 23132 KB Output is correct
14 Correct 4 ms 23132 KB Output is correct
15 Correct 4 ms 23132 KB Output is correct
16 Correct 4 ms 23132 KB Output is correct
17 Correct 5 ms 23132 KB Output is correct
18 Correct 5 ms 23132 KB Output is correct
19 Correct 4 ms 23132 KB Output is correct
20 Correct 4 ms 23132 KB Output is correct
21 Correct 5 ms 23220 KB Output is correct
22 Correct 4 ms 23132 KB Output is correct
23 Correct 7 ms 23132 KB Output is correct
24 Correct 6 ms 23132 KB Output is correct
25 Correct 6 ms 23132 KB Output is correct
26 Correct 5 ms 23132 KB Output is correct
27 Correct 5 ms 23132 KB Output is correct
28 Correct 5 ms 23588 KB Output is correct
29 Correct 5 ms 23132 KB Output is correct
30 Correct 5 ms 23340 KB Output is correct
31 Correct 5 ms 23132 KB Output is correct
32 Correct 8 ms 23132 KB Output is correct
33 Correct 8 ms 23132 KB Output is correct
34 Correct 8 ms 23372 KB Output is correct
35 Correct 8 ms 23388 KB Output is correct
36 Correct 7 ms 23128 KB Output is correct
37 Correct 7 ms 23384 KB Output is correct
38 Correct 6 ms 23388 KB Output is correct
39 Correct 6 ms 23132 KB Output is correct
40 Correct 7 ms 23132 KB Output is correct
41 Correct 6 ms 23132 KB Output is correct
42 Correct 6 ms 23128 KB Output is correct
43 Correct 8 ms 23132 KB Output is correct
44 Correct 6 ms 23340 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 23132 KB Output is correct
2 Correct 4 ms 23156 KB Output is correct
3 Correct 4 ms 23132 KB Output is correct
4 Correct 4 ms 23128 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 4 ms 23132 KB Output is correct
8 Correct 4 ms 23132 KB Output is correct
9 Correct 4 ms 23132 KB Output is correct
10 Correct 4 ms 23128 KB Output is correct
11 Correct 4 ms 23232 KB Output is correct
12 Correct 4 ms 23132 KB Output is correct
13 Correct 4 ms 23132 KB Output is correct
14 Correct 4 ms 23132 KB Output is correct
15 Correct 4 ms 23132 KB Output is correct
16 Correct 4 ms 23132 KB Output is correct
17 Correct 5 ms 23132 KB Output is correct
18 Correct 5 ms 23132 KB Output is correct
19 Correct 4 ms 23132 KB Output is correct
20 Correct 4 ms 23132 KB Output is correct
21 Correct 5 ms 23220 KB Output is correct
22 Correct 4 ms 23132 KB Output is correct
23 Correct 7 ms 23132 KB Output is correct
24 Correct 6 ms 23132 KB Output is correct
25 Correct 6 ms 23132 KB Output is correct
26 Correct 5 ms 23132 KB Output is correct
27 Correct 5 ms 23132 KB Output is correct
28 Correct 5 ms 23588 KB Output is correct
29 Correct 5 ms 23132 KB Output is correct
30 Correct 5 ms 23340 KB Output is correct
31 Correct 5 ms 23132 KB Output is correct
32 Correct 8 ms 23132 KB Output is correct
33 Correct 8 ms 23132 KB Output is correct
34 Correct 8 ms 23372 KB Output is correct
35 Correct 8 ms 23388 KB Output is correct
36 Correct 7 ms 23128 KB Output is correct
37 Correct 7 ms 23384 KB Output is correct
38 Correct 6 ms 23388 KB Output is correct
39 Correct 6 ms 23132 KB Output is correct
40 Correct 7 ms 23132 KB Output is correct
41 Correct 6 ms 23132 KB Output is correct
42 Correct 6 ms 23128 KB Output is correct
43 Correct 8 ms 23132 KB Output is correct
44 Correct 6 ms 23340 KB Output is correct
45 Correct 285 ms 49356 KB Output is correct
46 Correct 327 ms 49068 KB Output is correct
47 Correct 269 ms 49820 KB Output is correct
48 Correct 276 ms 49260 KB Output is correct
49 Correct 292 ms 48960 KB Output is correct
50 Correct 322 ms 48816 KB Output is correct
51 Correct 259 ms 49092 KB Output is correct
52 Correct 290 ms 49484 KB Output is correct
53 Correct 267 ms 49172 KB Output is correct
54 Execution timed out 1539 ms 48988 KB Time limit exceeded
55 Halted 0 ms 0 KB -