oj.uz

Submission #349756

# Submission time Handle Problem Language Result Execution time Memory
349756 2021-01-18T10:14:40 Z Bill_00 The Potion of Great Power (CEOI20_potion) C++14
38 / 100
 3000 ms 22252 KB 
#include <bits/stdc++.h>
#define N 200000
#define M 100000
#define pb push_back
#define ff first
#define ss second
using namespace std;
int h[M],n;
vector<vector<int>>v[M];
int cnt[N],sz[N];
int q[M][2];
vector<pair<int,bool> >day[N];
void init(int nn,int d, int H[]){
	n=nn;
	for(int i=0;i<n;i++) h[i]=H[i];
}

void curseChanges(int u, int A[], int B[]){
	for(int i=1;i<=u;i++){
		cnt[A[i-1]]++;
		cnt[B[i-1]]++;
	}
	for(int i=0;i<n;i++){
		v[i].resize(cnt[i]);
		sz[i]=cnt[i];
		cnt[i]=0;
	}
	for(int i=1;i<=u;i++){
		q[i][0]=cnt[A[i-1]];
		q[i][1]=cnt[B[i-1]];
		cnt[A[i-1]]++;
		cnt[B[i-1]]++;
	}
	for(int i=0;i<n;i++) cnt[i]=0;
	for(int i=1;i<=u;i++){
		int a=A[i-1],b=B[i-1];
		day[a].pb({i,0});
		day[b].pb({i,1});
		if(cnt[a]>=sz[a] || cnt[b]>=sz[b]) while(1);
		if(cnt[a]==0){
			v[a][cnt[a]].pb(b);
		}
		else{
			bool flag=0;
			for(int j:v[a][cnt[a]-1]){
				if(j==b){
					flag=1;
					continue;
				}
				v[a][cnt[a]].pb(j);
			}
			if(flag==0) v[a][cnt[a]].pb(b);
		}
		if(cnt[b]==0){
			v[b][cnt[b]].pb(a);
		}
		else{
			bool flag=0;
			for(int j:v[b][cnt[b]-1]){
				if(j==a){
					flag=1;
					continue;
				}
				v[b][cnt[b]].pb(j);
			}
			if(flag==0) v[b][cnt[b]].pb(a);
		}
		cnt[a]++;
		cnt[b]++;
	}
}

int question(int x, int y, int z) {
	pair<int,bool>pp={z,1};
	int ans=1e9;
	int id=upper_bound(day[x].begin(),day[x].end(),pp)-day[x].begin();
	--id;
	int e=day[x].size()-1;
	if(id<0 || id>e){
		return ans;
	}
	int a=q[day[x][id].ff][day[x][id].ss];
	id=upper_bound(day[y].begin(),day[y].end(),pp)-day[y].begin();
	--id;
	e=day[y].size()-1;
	if(id<0 || id>e){
		return ans;
	}
	int b=q[day[y][id].ff][day[y][id].ss];

	// cout << a << ' ' << b << '\n';
	if(v[x][a].size()==0 || v[y][b].size()==0){
		return ans;
	}
	vector<int>xx,yy;
	for(int V:v[y][b]){
		yy.pb(h[V]);
	}
	sort(yy.begin(),yy.end());
	for(int U:v[x][a]){
		int id=lower_bound(yy.begin(),yy.end(),h[U])-yy.begin();
		ans=min(ans,abs(h[U]-yy[max(0,id-1)]));
		int r=yy.size()-1;
		ans=min(ans,abs(yy[min(id,r)]-h[U]));
	}
	return ans;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7532 KB Output is correct
2 Correct 7 ms 7532 KB Output is correct
3 Correct 7 ms 7532 KB Output is correct
4 Correct 22 ms 9196 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
0 / 18.0

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

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 9196 KB Output is correct
2 Correct 81 ms 9708 KB Output is correct
3 Correct 113 ms 9708 KB Output is correct
4 Correct 656 ms 16364 KB Output is correct
5 Correct 595 ms 15104 KB Output is correct
6 Correct 102 ms 9752 KB Output is correct
7 Correct 511 ms 14828 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 7 ms 7532 KB Output is correct
3 Correct 7 ms 7532 KB Output is correct
4 Correct 7 ms 7532 KB Output is correct
5 Correct 22 ms 9196 KB Output is correct
6 Execution timed out 3029 ms 22252 KB Time limit exceeded
7 Halted 0 ms 0 KB -