oj.uz

Submission #953894

# Submission time Handle Problem Language Result Execution time Memory
953894 2024-03-26T19:39:30 Z amirhoseinfar1385 Passport (JOI23_passport) C++17
100 / 100
 1084 ms 40456 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=200000+10;
int fl[maxn],fr[maxn],dpl[maxn],kaf=(1<<19),dpr[maxn],dp[maxn],inf=1e8,n;
pair<int,int>all[maxn];
vector<int>adj[maxn];

struct segment{
	pair<int,int>seg[(1<<20)];
	segment(){
		for(int i=0;i<(1<<20);i++){
			seg[i]=make_pair(-inf,-inf);
		}
	}
	void clear(){
		for(int i=0;i<(1<<20);i++){
			seg[i]=make_pair(-inf,-inf);
		}
	}
	void ins(int i,pair<int,int>w){
		i+=kaf;
		seg[i]=w;
		i>>=1;
		while(i>0){
			seg[i]=max(seg[(i<<1)],seg[(i<<1)^1]);
			i>>=1;
		}
	}
	pair<int,int> pors(int i,int l,int r,int tl,int tr){
		if(l>r||l>tr||r<tl||tl>tr){
			return make_pair(-inf,-inf);
		}
		if(l>=tl&&r<=tr){
			return seg[i];
		}
		int m=(l+r)>>1;
		return max(pors((i<<1),l,m,tl,tr),pors((i<<1)^1,m+1,r,tl,tr));
	}
}seg;

void vorod(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>all[i].first>>all[i].second;
	}
}

void calfr(int ind){
	fr[ind]=seg.pors(1,0,kaf-1,all[ind].first,all[ind].second).second;
	if(all[fr[ind]].second==all[ind].second){
		fr[ind]=-1;
	}else{
		adj[fr[ind]].push_back(ind);
	}
}

void calr(){
	seg.clear();
	for(int i=1;i<=n;i++){
		seg.ins(i,make_pair(all[i].second,i));
	}
	for(int i=1;i<=n;i++){
		dpr[i]=inf;
		calfr(i);
	}
	vector<pair<int,int>>v;
	for(int i=1;i<=n;i++){
		v.push_back(make_pair(all[i].second,i));
	}
	sort(v.rbegin(),v.rend());
	for(int i=0;i<n;i++){
		int u=v[i].second;
		if(v[i].first==n){
			dpr[u]=0;
			continue;
		}
		if(fr[u]==-1){
			continue;
		}
		dpr[u]=dpr[fr[u]]+1;
	}
}

void calfl(int ind){
	fl[ind]=-seg.pors(1,0,kaf-1,all[ind].first,all[ind].second).second;
	if(all[fl[ind]].first==all[ind].first){
		fl[ind]=-1;
	}else{
		adj[fl[ind]].push_back(ind);
	}
}

void call(){
	seg.clear();
	for(int i=1;i<=n;i++){
		seg.ins(i,make_pair(-all[i].first,-i));
	}
	for(int i=1;i<=n;i++){
		calfl(i);
		dpl[i]=inf;
	}
	vector<pair<int,int>>v;
	for(int i=1;i<=n;i++){
		v.push_back(make_pair(all[i].first,i));
	}
	sort(v.begin(),v.end());
	for(int i=0;i<n;i++){
		int u=v[i].second;
		if(v[i].first==1){
			dpl[u]=0;
			continue;
		}
		if(fl[u]==-1){
			continue;
		}
		dpl[u]=dpl[fl[u]]+1;
	}
}

void calres(){
	for(int i=1;i<=n;i++){
		dp[i]=dpr[i]+dpl[i]+1;
	}
	for(int asd=0;asd<4;asd++){
		set<pair<int,int>>st;
		for(int i=1;i<=n;i++){
			st.insert(make_pair(dp[i],i));
		}
		vector<int>vis(n+2);
		while((int)st.size()>0){
			auto x=*st.begin();
			st.erase(x);
			if(vis[x.second]==1){
				continue;
			}
			vis[x.second]=1;
			if(x.first<dp[x.second]&&asd>2){
				assert(0);
			}
			dp[x.second]=x.first;
			for(auto y:adj[x.second]){
				st.insert(make_pair(x.first+1,y));
			}
		}		
		vector<pair<int,int>>v;
		for(int i=1;i<=n;i++){
			v.push_back(make_pair(all[i].second-all[i].first+1,i));
		}
		sort(v.rbegin(),v.rend());
		seg.clear();
		for(int i=0;i<n;i++){
			int u=v[i].second;
			seg.ins(u,make_pair(-(dp[u]-1),u));
			int z=-seg.pors(1,0,kaf-1,all[u].first,all[u].second).first+1;
			if(asd>2&&z!=dp[u]){
				assert(0);
			}
			dp[u]=min(dp[u],z);
			seg.ins(u,make_pair(-dp[u],u));
	//		for(int j=all[u].first;j<=all[u].second;j++){
	//			dp[u]=min(dp[u],dp[j]+(j!=u));
	//		}
		}
	}
}

void pre(){
	call();
	calr();
	calres();
}

void khor(){
	int q;
	cin>>q;
	for(int i=1;i<=q;i++){
		int x;
		cin>>x;
		if(dp[x]>=inf/2){
			cout<<-1<<"\n";
		}else{
			cout<<dp[x]<<"\n";
		}
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
//	freopen("inp.txt","r",stdin);
	vorod();
	pre();
	khor();
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16984 KB Output is correct
2 Correct 8 ms 16984 KB Output is correct
3 Correct 8 ms 17044 KB Output is correct
4 Correct 1031 ms 32232 KB Output is correct
5 Correct 921 ms 32804 KB Output is correct
6 Correct 875 ms 35256 KB Output is correct
7 Correct 706 ms 28700 KB Output is correct
8 Correct 606 ms 26532 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16984 KB Output is correct
2 Correct 9 ms 16988 KB Output is correct
3 Correct 7 ms 16988 KB Output is correct
4 Correct 7 ms 17040 KB Output is correct
5 Correct 8 ms 16988 KB Output is correct
6 Correct 8 ms 17040 KB Output is correct
7 Correct 8 ms 16988 KB Output is correct
8 Correct 7 ms 16996 KB Output is correct
9 Correct 8 ms 16988 KB Output is correct
10 Correct 8 ms 16988 KB Output is correct
11 Correct 9 ms 16988 KB Output is correct
12 Correct 9 ms 16988 KB Output is correct
13 Correct 10 ms 17076 KB Output is correct
14 Correct 9 ms 16988 KB Output is correct
15 Correct 8 ms 17032 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16984 KB Output is correct
2 Correct 9 ms 16988 KB Output is correct
3 Correct 7 ms 16988 KB Output is correct
4 Correct 7 ms 17040 KB Output is correct
5 Correct 8 ms 16988 KB Output is correct
6 Correct 8 ms 17040 KB Output is correct
7 Correct 8 ms 16988 KB Output is correct
8 Correct 7 ms 16996 KB Output is correct
9 Correct 8 ms 16988 KB Output is correct
10 Correct 8 ms 16988 KB Output is correct
11 Correct 9 ms 16988 KB Output is correct
12 Correct 9 ms 16988 KB Output is correct
13 Correct 10 ms 17076 KB Output is correct
14 Correct 9 ms 16988 KB Output is correct
15 Correct 8 ms 17032 KB Output is correct
16 Correct 19 ms 17244 KB Output is correct
17 Correct 18 ms 17240 KB Output is correct
18 Correct 19 ms 17444 KB Output is correct
19 Correct 18 ms 16984 KB Output is correct
20 Correct 18 ms 17244 KB Output is correct
21 Correct 15 ms 17280 KB Output is correct
22 Correct 14 ms 17104 KB Output is correct
23 Correct 15 ms 17240 KB Output is correct
24 Correct 16 ms 16988 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16984 KB Output is correct
2 Correct 9 ms 16988 KB Output is correct
3 Correct 7 ms 16988 KB Output is correct
4 Correct 7 ms 17040 KB Output is correct
5 Correct 8 ms 16988 KB Output is correct
6 Correct 8 ms 17040 KB Output is correct
7 Correct 8 ms 16988 KB Output is correct
8 Correct 7 ms 16996 KB Output is correct
9 Correct 8 ms 16988 KB Output is correct
10 Correct 8 ms 16988 KB Output is correct
11 Correct 9 ms 16988 KB Output is correct
12 Correct 9 ms 16988 KB Output is correct
13 Correct 10 ms 17076 KB Output is correct
14 Correct 9 ms 16988 KB Output is correct
15 Correct 8 ms 17032 KB Output is correct
16 Correct 19 ms 17244 KB Output is correct
17 Correct 18 ms 17240 KB Output is correct
18 Correct 19 ms 17444 KB Output is correct
19 Correct 18 ms 16984 KB Output is correct
20 Correct 18 ms 17244 KB Output is correct
21 Correct 15 ms 17280 KB Output is correct
22 Correct 14 ms 17104 KB Output is correct
23 Correct 15 ms 17240 KB Output is correct
24 Correct 16 ms 16988 KB Output is correct
25 Correct 7 ms 16984 KB Output is correct
26 Correct 7 ms 17184 KB Output is correct
27 Correct 18 ms 17120 KB Output is correct
28 Correct 18 ms 17244 KB Output is correct
29 Correct 16 ms 17240 KB Output is correct
30 Correct 15 ms 17244 KB Output is correct
31 Correct 16 ms 17244 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16984 KB Output is correct
2 Correct 8 ms 16984 KB Output is correct
3 Correct 8 ms 17044 KB Output is correct
4 Correct 1031 ms 32232 KB Output is correct
5 Correct 921 ms 32804 KB Output is correct
6 Correct 875 ms 35256 KB Output is correct
7 Correct 706 ms 28700 KB Output is correct
8 Correct 606 ms 26532 KB Output is correct
9 Correct 8 ms 16984 KB Output is correct
10 Correct 9 ms 16988 KB Output is correct
11 Correct 7 ms 16988 KB Output is correct
12 Correct 7 ms 17040 KB Output is correct
13 Correct 8 ms 16988 KB Output is correct
14 Correct 8 ms 17040 KB Output is correct
15 Correct 8 ms 16988 KB Output is correct
16 Correct 7 ms 16996 KB Output is correct
17 Correct 8 ms 16988 KB Output is correct
18 Correct 8 ms 16988 KB Output is correct
19 Correct 9 ms 16988 KB Output is correct
20 Correct 9 ms 16988 KB Output is correct
21 Correct 10 ms 17076 KB Output is correct
22 Correct 9 ms 16988 KB Output is correct
23 Correct 8 ms 17032 KB Output is correct
24 Correct 19 ms 17244 KB Output is correct
25 Correct 18 ms 17240 KB Output is correct
26 Correct 19 ms 17444 KB Output is correct
27 Correct 18 ms 16984 KB Output is correct
28 Correct 18 ms 17244 KB Output is correct
29 Correct 15 ms 17280 KB Output is correct
30 Correct 14 ms 17104 KB Output is correct
31 Correct 15 ms 17240 KB Output is correct
32 Correct 16 ms 16988 KB Output is correct
33 Correct 7 ms 16984 KB Output is correct
34 Correct 7 ms 17184 KB Output is correct
35 Correct 18 ms 17120 KB Output is correct
36 Correct 18 ms 17244 KB Output is correct
37 Correct 16 ms 17240 KB Output is correct
38 Correct 15 ms 17244 KB Output is correct
39 Correct 16 ms 17244 KB Output is correct
40 Correct 1084 ms 34692 KB Output is correct
41 Correct 935 ms 37912 KB Output is correct
42 Correct 962 ms 35080 KB Output is correct
43 Correct 953 ms 34684 KB Output is correct
44 Correct 880 ms 40456 KB Output is correct
45 Correct 680 ms 40176 KB Output is correct
46 Correct 301 ms 25120 KB Output is correct
47 Correct 832 ms 39440 KB Output is correct
48 Correct 885 ms 33984 KB Output is correct