Submission #922571

#	Time	Username	Problem	Language	Result	Execution time	Memory
922571		KiaRez	Passport (JOI23_passport)	C++17	100 / 100	938 ms	308108 KiB

passport

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int n, q, dist[3][3*N], vis[3][3*N], x[N], id[2*N], L[N], R[N], cnt;
vector<int> adj[2][3*N];
vector<pii> vec[3*N];

void build(int ind=1) {
	id[ind] = ++cnt;
	if(ind>=(1<<lg)) {
		int f = ind - (1<<lg) + 1;
		if(f<=n) adj[0][f].pb(id[ind]);
		return;
	}
	build(2*ind); build(2*ind+1);
	adj[0][id[2*ind+1]].pb(id[ind]);
	adj[0][id[2*ind]].pb(id[ind]);
}

void query(int v, int l, int r, int ind=1, int lc=1, int rc=(1<<lg)+1) {
	if(l>=rc || lc>=r) return;
	if(lc>=l && rc<=r) {
		adj[1][id[ind]].pb(v);
		return;
	}
	int mid = (lc+rc)/2;
	query(v, l, r, 2*ind, lc, mid);
	query(v, l, r, 2*ind+1, mid, rc);
}

int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n;
	cnt=n;
	for(int i=1; i<=n; i++) cin>>L[i]>>R[i];
	cin>>q;
	for(int i=1; i<=q; i++) cin>>x[i];

	build(1);
	for(int i=1; i<=n; i++) {
		query(i, L[i], i);
		query(i, i+1, R[i]+1);
	}

	int ptr = 0;
	vec[0].pb({0, 1});
	vec[0].pb({1, n});
	while(ptr<n+3) {
		if(size(vec[ptr]) == 0) {
			ptr++; continue;
		}
		pii v = vec[ptr].back();
		vec[ptr].pop_back();
		if(vis[v.F][v.S] == 1) continue;
		vis[v.F][v.S] = 1, dist[v.F][v.S] = ptr;
		if(vis[1][v.S]==1 && vis[0][v.S]==1 && vis[2][v.S] == 0) {
			vec[dist[1][v.S]+dist[0][v.S]-(v.S>1&&v.S<n)].pb({2, v.S});
		}
		for(auto it : adj[0][v.S]) {
			if(vis[v.F][it]==0)vec[ptr].pb({v.F, it});
		}
		for(auto it : adj[1][v.S]) {
			if(vis[v.F][it]==0)vec[ptr+1].pb({v.F, it});
		}
	}
	
	for(int i=1; i<=q; i++) {
		if(vis[2][x[i]] == 1) cout<<dist[2][x[i]]<<endl;
		else cout<<-1<<endl;
	}

	return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 16 / 16
• Subtask 3: 24 / 24
• Subtask 4: 8 / 8
• Subtask 5: 46 / 46