제출 #1306485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306485		ender_shayan	Passport (JOI23_passport)	C++20	0 / 100	224 ms	5752 KiB

passport

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

typedef long long ll;
typedef long double	ld;
typedef pair<int, int>	pii  ;
typedef pair<ll, ll>	pll  ;
typedef vector<pii>     vii  ;
typedef vector<int>     veci ;
typedef vector<pll>     vll  ;
typedef vector<ll>      vecll;

// find_by_order             order_of_key

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl
#define set_dec(x)	    cout << fixed << setprecision(x);
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb              lower_bound
#define ub              upper_bound
#define for1(n)         for(int i=1;i<=n;i++)
#define for0(n)         for(int i=0;i<n;i++)
#define forn(n)         for(int i=n;i>0;i--)
#define pq              priority_queue <pii, vector<pii>, greater<pii>>


const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;

ll inf=1e18;
const int N=1<<18,L=21,bs=701,NN=1e6;
int n,m,k,q,dist[N],vis[N],pos[N];
vector<int>g[N];
int seg[N<<1];
pii A[N];
void build(int l=1,int r=n+1,int v=1){
    seg[v]=N;
    if(r-l==1)return;
    int mid=(l+r)>>1;
    build(l,mid,v<<1);
    build(mid,r,v<<1|1);
}
void upd(int i,int x,int l=1,int r=n+1,int v=1){
    if(r-l==1){
        seg[v]=x;
        return;
    }
    int mid=(l+r)>>1;
    if(i<mid)upd(i,x,l,mid,v<<1);
    else upd(i,x,mid,r,v<<1|1);
    seg[v]=min(seg[v<<1],seg[v<<1|1]);
}
int get(int lx,int rx,int l=1,int r=n+1,int v=1){
    if(lx>=r || rx<=l)return N;
    if(lx<=l && r<=rx)return seg[v];
    int mid=(l+r)>>1;
    return min(get(lx,rx,l,mid,v<<1),get(lx,rx,mid,r,v<<1|1));
}
void build2(int l=1,int r=n+1,int v=1){
    if(r-l==1){
        pos[l]=v;
        return;
    }
    int mid=(l+r)>>1;
    build2(l,mid,v<<1);
    build2(mid,r,v<<1|1);
}
void updd(int lx,int rx,int x,int l=1,int r=n+1,int v=1){
    if(lx>=r || rx<=l)return;
    if(lx<=l && r<=rx){
        g[v].pb(x);
        return;
    }
    int mid=(l+r)>>1;
    updd(lx,rx,x,l,mid,v<<1);
    updd(lx,rx,x,mid,r,v<<1|1);
}
void bfs(){
    vis[0]=1;
    build2();
    for1(n)updd(A[i].F,A[i].S+1,i);
    queue<int>q;
    int mn=N;
    for1(n){
        dist[i]--;
        mn=min(mn,dist[i]);
    }
    for1(n)if(dist[i]==mn)q.push(i);
    while(q.size()){
        int i=q.front();q.pop();
        int v=pos[i];
        while(vis[v]==0){
            for(int u:g[v])if(dist[u]>dist[i]+1){
                dist[u]=dist[i]+1;
                q.push(u);
            }
            vis[v]=1;
            v>>=1;
        }
    }
}
int main(){
    fast_io
    cin>>n;
    for1(n)cin>>A[i].F>>A[i].S;
    build();
    dist[1]=1;upd(1,0);
    for(int i=2;i<=n;i++){
        dist[i]=get(A[i].F,i)+1;
        upd(i,get(A[i].F,i)+1);
    }
    build();upd(n,0);dist[n]++;
    for(int i=n-1;i>=1;i--){
        dist[i]+=get(i,A[i].S+1)+1;
        upd(i,get(i,A[i].S+1)+1);
    }
    bfs();
    cin>>q;
    while(q--){
        int i;cin>>i;
        cout<<(dist[i]>=N ? -1:dist[i])<<endl;
    }




}

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