| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 922544 | KiaRez | Passport (JOI23_passport) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
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;
}
ll n, q, dist[3][5*N], vis[3][5*N], x[N], id[2*N], L[N], R[N], cnt;
vector<pll> adj[5*N];
void build(int ind=1) {
id[ind] = ++cnt;
if(ind>=(1<<lg)) {
int f = ind - (1<<lg) + 1;
if(f<=n) adj[f].pb({id[ind], 0});
return;
}
build(2*ind); build(2*ind+1);
adj[id[2*ind+1]].pb({id[ind], 0});
adj[id[2*ind]].pb({id[ind], 0});
}
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[id[ind]].pb({v, 1});
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);
}
priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> pq;
pq.push({0, 0, 1});
pq.push({0, 1, n});
while(size(pq) > 0) {
array<ll, 3> v = pq.top();
pq.pop();
if(vis[v[1]][v[2]] == 1) continue;
vis[v[1]][v[2]] = 1, dist[v[1]][v[2]] = v[0];
if(vis[1][v[2]]==1 && vis[0][v[2]]==1) {
pq.push({dist[1][v[2]]+dist[0][v[2]]-(v[2]>1&&v[2]<n), 2, v[2]});
}
for(auto it : adj[v[2]]) {
pq.push({v[0]+it.S, v[1], it.F});
}
}
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;
}