oj.uz

Submission #1106708

# Submission time Handle Problem Language Result Execution time Memory
1106708 2024-10-30T23:45:30 Z inksamurai Passport (JOI23_passport) C++17
48 / 100
 1441 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int) a.size()
#define all(a) a.begin(),a.end()
#define vec(...) vector<__VA_ARGS__>
#define _3M8yqhy ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

const int inf=1e9;

void slv(){
	int n;
	cin>>n;

	vec(pii) a;
	rep(i,n){
		int l,r;
		cin>>l>>r;
		l-=1,r-=1;
		a.pb({l,r});
	}	

	auto get=[&](vi d,vec(pii) cover_ranges){
		vec(vi) adj(n);
		rep(v,n){
			rng(j,cover_ranges[v].fi,cover_ranges[v].se+1){
				adj[j].pb(v);
			}
		}
		priority_queue<pii,vec(pii),greater<pii>> pq;
		rep(v,n){
			pq.push({d[v],v});
		}
		while(sz(pq)){
			auto [cosu,v]=pq.top();
			pq.pop();
			if(d[v]!=cosu) continue;
			for(auto u:adj[v]){
				if(d[u]>d[v]+1){
					d[u]=d[v]+1;
					pq.push({d[u],u});
				}
			}
		}
		return d;
	};

	vi pns(n,inf);
	// 12 way
	rep(t,2){
		vi d1(n,inf);
		vec(pii) cover_ranges1;
		{
			rep(i,n){
				cover_ranges1.pb({a[i].fi,a[i].se});
				if(a[i].fi==0){
					d1[i]=1;
				}
			}
		}
		vi d2(n,inf);
		vec(pii) cover_ranges2;
		{
			rep(i,n){
				cover_ranges2.pb({0,a[i].se});
				if(a[i].se==n-1){
					d2[i]=1;
				}
			}
		}
		d1=get(d1,cover_ranges1);
		d2=get(d2,cover_ranges2);
		vi d3(n,inf);
		{
			d3[0]=d2[0];
			rng(v,1,n-1){
				d3[v]=d1[v]+d2[v]-1;
			}
			d3[n-1]=d1[n-1];
		}
		vec(pii) cover_ranges3;
		{
			rep(i,n){
				cover_ranges3.pb({a[i].fi,a[i].se});
			}
		}
		d3=get(d3,cover_ranges3);

		rep(v,n){
			if(!t){
				pns[v]=min(pns[v],d3[v]);
			}else{
				pns[n-1-v]=min(pns[n-1-v],d3[v]);
			}
		}

		rep(i,n){
			a[i].fi=n-1-a[i].fi;
			a[i].se=n-1-a[i].se;
			swap(a[i].fi,a[i].se);
		}
		reverse(all(a));
	}

	int q;
	cin>>q;
	rep(i,q){
		int x;
		cin>>x;
		x-=1;
		print(pns[x]==inf?-1:pns[x]);
	}
}

signed main(){
_3M8yqhy;
	slv();
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Runtime error 1441 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 848 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 3 ms 848 KB Output is correct
14 Correct 3 ms 844 KB Output is correct
15 Correct 2 ms 948 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 848 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 3 ms 848 KB Output is correct
14 Correct 3 ms 844 KB Output is correct
15 Correct 2 ms 948 KB Output is correct
16 Correct 87 ms 19948 KB Output is correct
17 Correct 49 ms 17800 KB Output is correct
18 Correct 134 ms 27920 KB Output is correct
19 Correct 156 ms 26764 KB Output is correct
20 Correct 47 ms 17488 KB Output is correct
21 Correct 52 ms 18384 KB Output is correct
22 Correct 132 ms 29388 KB Output is correct
23 Correct 124 ms 25504 KB Output is correct
24 Correct 124 ms 22268 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 848 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 3 ms 848 KB Output is correct
14 Correct 3 ms 844 KB Output is correct
15 Correct 2 ms 948 KB Output is correct
16 Correct 87 ms 19948 KB Output is correct
17 Correct 49 ms 17800 KB Output is correct
18 Correct 134 ms 27920 KB Output is correct
19 Correct 156 ms 26764 KB Output is correct
20 Correct 47 ms 17488 KB Output is correct
21 Correct 52 ms 18384 KB Output is correct
22 Correct 132 ms 29388 KB Output is correct
23 Correct 124 ms 25504 KB Output is correct
24 Correct 124 ms 22268 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 97 ms 21428 KB Output is correct
28 Correct 53 ms 17832 KB Output is correct
29 Correct 48 ms 17516 KB Output is correct
30 Correct 50 ms 18244 KB Output is correct
31 Correct 98 ms 21324 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Runtime error 1441 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -