oj.uz

Submission #895148

# Submission time Handle Problem Language Result Execution time Memory
895148 2023-12-29T13:29:30 Z amirhoseinfar1385 Constellation 3 (JOI20_constellation3) C++17
35 / 100
 1500 ms 30944 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];
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]){
			allind.pop_front();
		}
		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]){
			allind.pop_front();
		}
		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;
	long long i=ind-1;
	while(i!=0&&all[i]<all[ind]){
		if(all[i]>maxa){
			v.clear();
			maxa=all[i];
			v.push_back(i);
		}
		else if(all[i]==maxa){
			v.push_back(i);
		}
		i--;
	}
	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();
	i=ind+1;
	while(i!=n+1&&all[i]<all[ind]){
		if(all[i]>maxa){
			v.clear();
			maxa=all[i];
			v.push_back(i);
		}
		else if(all[i]==maxa){
			v.push_back(i);
		}
		i++;
	}
	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";
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12780 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 3 ms 12780 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 3 ms 12732 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 3 ms 12636 KB Output is correct
13 Correct 3 ms 12776 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 3 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 3 ms 12780 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12780 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 3 ms 12780 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 3 ms 12732 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 3 ms 12636 KB Output is correct
13 Correct 3 ms 12776 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 3 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 3 ms 12780 KB Output is correct
23 Correct 4 ms 12892 KB Output is correct
24 Correct 3 ms 12892 KB Output is correct
25 Correct 4 ms 12892 KB Output is correct
26 Correct 3 ms 12896 KB Output is correct
27 Correct 4 ms 12804 KB Output is correct
28 Correct 4 ms 12896 KB Output is correct
29 Correct 4 ms 12904 KB Output is correct
30 Correct 4 ms 12900 KB Output is correct
31 Correct 4 ms 12892 KB Output is correct
32 Correct 8 ms 12892 KB Output is correct
33 Correct 10 ms 12920 KB Output is correct
34 Correct 7 ms 12900 KB Output is correct
35 Correct 9 ms 12952 KB Output is correct
36 Correct 6 ms 12900 KB Output is correct
37 Correct 7 ms 12892 KB Output is correct
38 Correct 5 ms 12852 KB Output is correct
39 Correct 5 ms 12900 KB Output is correct
40 Correct 8 ms 12916 KB Output is correct
41 Correct 5 ms 12904 KB Output is correct
42 Correct 5 ms 12900 KB Output is correct
43 Correct 8 ms 12932 KB Output is correct
44 Correct 4 ms 12900 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 3 ms 12780 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 3 ms 12780 KB Output is correct
6 Correct 3 ms 12636 KB Output is correct
7 Correct 3 ms 12732 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 3 ms 12636 KB Output is correct
13 Correct 3 ms 12776 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 3 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 3 ms 12780 KB Output is correct
23 Correct 4 ms 12892 KB Output is correct
24 Correct 3 ms 12892 KB Output is correct
25 Correct 4 ms 12892 KB Output is correct
26 Correct 3 ms 12896 KB Output is correct
27 Correct 4 ms 12804 KB Output is correct
28 Correct 4 ms 12896 KB Output is correct
29 Correct 4 ms 12904 KB Output is correct
30 Correct 4 ms 12900 KB Output is correct
31 Correct 4 ms 12892 KB Output is correct
32 Correct 8 ms 12892 KB Output is correct
33 Correct 10 ms 12920 KB Output is correct
34 Correct 7 ms 12900 KB Output is correct
35 Correct 9 ms 12952 KB Output is correct
36 Correct 6 ms 12900 KB Output is correct
37 Correct 7 ms 12892 KB Output is correct
38 Correct 5 ms 12852 KB Output is correct
39 Correct 5 ms 12900 KB Output is correct
40 Correct 8 ms 12916 KB Output is correct
41 Correct 5 ms 12904 KB Output is correct
42 Correct 5 ms 12900 KB Output is correct
43 Correct 8 ms 12932 KB Output is correct
44 Correct 4 ms 12900 KB Output is correct
45 Correct 269 ms 30944 KB Output is correct
46 Correct 261 ms 30544 KB Output is correct
47 Correct 246 ms 30920 KB Output is correct
48 Correct 220 ms 30456 KB Output is correct
49 Correct 213 ms 30652 KB Output is correct
50 Correct 221 ms 30664 KB Output is correct
51 Correct 212 ms 30776 KB Output is correct
52 Correct 223 ms 30816 KB Output is correct
53 Correct 226 ms 30660 KB Output is correct
54 Execution timed out 1551 ms 28388 KB Time limit exceeded
55 Halted 0 ms 0 KB -