oj.uz

답안 #1086153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1086153 2024-09-09T16:05:14 Z hahahaha Passport (JOI23_passport) C++17
100 / 100
 557 ms 134964 KB 
#include<bits/stdc++.h>
#define ll long long
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname "temp"
#define frep freopen(taskname".inp","r",stdin); freopen(taskname".out","w",stdout);
using namespace std;
vector<pair<ll,ll>> adj[800100];
ll id[200010];
void build(ll pos,ll l,ll r){
    if(l==r){
        id[l]=pos;
    }
    else{
        ll mid=(l+r)/2;
        build(2*pos,l,mid);
        build(2*pos+1,mid+1,r);
        adj[2*pos].push_back({pos,0});
        adj[2*pos+1].push_back({pos,0});
    }
}
void add(ll pos,ll l,ll r,ll u,ll v,ll x){
    if(v<l||u>r) return ;
    else if(u<=l&&r<=v){
        adj[pos].push_back({id[x],1});
    }
    else{
        ll mid=(l+r)/2;
        add(2*pos,l,mid,u,v,x);
        add(2*pos+1,mid+1,r,u,v,x);
    }
}
ll n,q;
ll ans[800010];
ll dist[800010];
ll vis[800010];
ll a[200010];
ll b[200010];
ll l[200001];
ll r[200001];
void proc(ll st){
    memset(dist,0x3f,sizeof(dist));
    memset(vis,0,sizeof(vis));
    deque<ll> dq;
    dq.push_front(id[st]);
    dist[id[st]]=0;
    while(!dq.empty()){
        ll u=dq.front();
        dq.pop_front();
        if(vis[u]) continue;
        for(auto [v,w]:adj[u]){
            if(dist[v]>dist[u]+w){
                dist[v]=dist[u]+w;
                if(w==0){
                    dq.push_front(v);
                }
                else{
                    dq.push_back(v);
                }
            }
        }
    }
    dist[id[st]]=1;
    for(int i=1;i<=n;i++){
        if(st==1) a[i]=dist[id[i]];
        if(st==n) b[i]=dist[id[i]];
    }
}
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    //frep;
    cin>>n;
    build(1,1,n+1);
    for(int i=1;i<=n;i++){
        cin>>l[i]>>r[i];
        add(1,1,n+1,l[i],r[i],i);
    }
    proc(1);
    proc(n);
//    for(int i=1;i<=n;i++){
//        cout<<a[i]<<' ';
//    }
//    cout<<ntr;
//    for(int i=1;i<=n;i++){
//        cout<<b[i]<<' ';
//    }
//    cout<<ntr;
//    for(int i=1;i<=n+1;i++){
//        cout<<id[i]<<' ';
//    }
//    cout<<ntr;
    for(int i=1;i<=n;i++){
        adj[id[n+1]].push_back({id[i],max(1LL,a[i]+b[i]-1)});
        //cout<<n+1<<' '<<i<<' '<<a[i]+b[i]<<ntr;
    }
//    cout<<ntr;
//    for(auto [v,w]:adj[id[n+1]]){
//        cout<<id[n+1]<<' '<<v<<' '<<w<<ntr;
//    }
    priority_queue<pair<ll,ll>> pq;
    pq.push({0,id[n+1]});
    memset(dist,0x3f,sizeof(dist));
    memset(vis,0,sizeof(vis));
    dist[id[n+1]]=0;
    while(!pq.empty()){
        ll u=pq.top().second;
        pq.pop();
        if(vis[u]) continue;
        vis[u]=1;
        for(auto [v,w]:adj[u]){
            if(dist[v]>dist[u]+w){
                dist[v]=dist[u]+w;
                pq.push({-dist[v],v});
            }
        }
    }
    for(int i=1;i<=n;i++){
        ans[i]=dist[id[i]];
    }
    cin>>q;
    for(int i=1;i<=q;i++){
        ll x;
        cin>>x;
        cout<<(ans[x]<1e18 ? ans[x] : -1)<<ntr;
    }
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31580 KB Output is correct
2 Correct 15 ms 31580 KB Output is correct
3 Correct 15 ms 31580 KB Output is correct
4 Correct 512 ms 121016 KB Output is correct
5 Correct 285 ms 81600 KB Output is correct
6 Correct 185 ms 71356 KB Output is correct
7 Correct 198 ms 114332 KB Output is correct
8 Correct 128 ms 104676 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31576 KB Output is correct
2 Correct 15 ms 31596 KB Output is correct
3 Correct 15 ms 31616 KB Output is correct
4 Correct 17 ms 31580 KB Output is correct
5 Correct 14 ms 31644 KB Output is correct
6 Correct 14 ms 31580 KB Output is correct
7 Correct 14 ms 31820 KB Output is correct
8 Correct 14 ms 31580 KB Output is correct
9 Correct 14 ms 31580 KB Output is correct
10 Correct 14 ms 31812 KB Output is correct
11 Correct 14 ms 31836 KB Output is correct
12 Correct 15 ms 31872 KB Output is correct
13 Correct 14 ms 31836 KB Output is correct
14 Correct 14 ms 31836 KB Output is correct
15 Correct 14 ms 31832 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31576 KB Output is correct
2 Correct 15 ms 31596 KB Output is correct
3 Correct 15 ms 31616 KB Output is correct
4 Correct 17 ms 31580 KB Output is correct
5 Correct 14 ms 31644 KB Output is correct
6 Correct 14 ms 31580 KB Output is correct
7 Correct 14 ms 31820 KB Output is correct
8 Correct 14 ms 31580 KB Output is correct
9 Correct 14 ms 31580 KB Output is correct
10 Correct 14 ms 31812 KB Output is correct
11 Correct 14 ms 31836 KB Output is correct
12 Correct 15 ms 31872 KB Output is correct
13 Correct 14 ms 31836 KB Output is correct
14 Correct 14 ms 31836 KB Output is correct
15 Correct 14 ms 31832 KB Output is correct
16 Correct 19 ms 32600 KB Output is correct
17 Correct 17 ms 32348 KB Output is correct
18 Correct 19 ms 32860 KB Output is correct
19 Correct 17 ms 32892 KB Output is correct
20 Correct 18 ms 32344 KB Output is correct
21 Correct 17 ms 32348 KB Output is correct
22 Correct 16 ms 32604 KB Output is correct
23 Correct 18 ms 32600 KB Output is correct
24 Correct 16 ms 32604 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31576 KB Output is correct
2 Correct 15 ms 31596 KB Output is correct
3 Correct 15 ms 31616 KB Output is correct
4 Correct 17 ms 31580 KB Output is correct
5 Correct 14 ms 31644 KB Output is correct
6 Correct 14 ms 31580 KB Output is correct
7 Correct 14 ms 31820 KB Output is correct
8 Correct 14 ms 31580 KB Output is correct
9 Correct 14 ms 31580 KB Output is correct
10 Correct 14 ms 31812 KB Output is correct
11 Correct 14 ms 31836 KB Output is correct
12 Correct 15 ms 31872 KB Output is correct
13 Correct 14 ms 31836 KB Output is correct
14 Correct 14 ms 31836 KB Output is correct
15 Correct 14 ms 31832 KB Output is correct
16 Correct 19 ms 32600 KB Output is correct
17 Correct 17 ms 32348 KB Output is correct
18 Correct 19 ms 32860 KB Output is correct
19 Correct 17 ms 32892 KB Output is correct
20 Correct 18 ms 32344 KB Output is correct
21 Correct 17 ms 32348 KB Output is correct
22 Correct 16 ms 32604 KB Output is correct
23 Correct 18 ms 32600 KB Output is correct
24 Correct 16 ms 32604 KB Output is correct
25 Correct 15 ms 31576 KB Output is correct
26 Correct 15 ms 31580 KB Output is correct
27 Correct 16 ms 32604 KB Output is correct
28 Correct 16 ms 32324 KB Output is correct
29 Correct 16 ms 32420 KB Output is correct
30 Correct 16 ms 32276 KB Output is correct
31 Correct 16 ms 32604 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31580 KB Output is correct
2 Correct 15 ms 31580 KB Output is correct
3 Correct 15 ms 31580 KB Output is correct
4 Correct 512 ms 121016 KB Output is correct
5 Correct 285 ms 81600 KB Output is correct
6 Correct 185 ms 71356 KB Output is correct
7 Correct 198 ms 114332 KB Output is correct
8 Correct 128 ms 104676 KB Output is correct
9 Correct 15 ms 31576 KB Output is correct
10 Correct 15 ms 31596 KB Output is correct
11 Correct 15 ms 31616 KB Output is correct
12 Correct 17 ms 31580 KB Output is correct
13 Correct 14 ms 31644 KB Output is correct
14 Correct 14 ms 31580 KB Output is correct
15 Correct 14 ms 31820 KB Output is correct
16 Correct 14 ms 31580 KB Output is correct
17 Correct 14 ms 31580 KB Output is correct
18 Correct 14 ms 31812 KB Output is correct
19 Correct 14 ms 31836 KB Output is correct
20 Correct 15 ms 31872 KB Output is correct
21 Correct 14 ms 31836 KB Output is correct
22 Correct 14 ms 31836 KB Output is correct
23 Correct 14 ms 31832 KB Output is correct
24 Correct 19 ms 32600 KB Output is correct
25 Correct 17 ms 32348 KB Output is correct
26 Correct 19 ms 32860 KB Output is correct
27 Correct 17 ms 32892 KB Output is correct
28 Correct 18 ms 32344 KB Output is correct
29 Correct 17 ms 32348 KB Output is correct
30 Correct 16 ms 32604 KB Output is correct
31 Correct 18 ms 32600 KB Output is correct
32 Correct 16 ms 32604 KB Output is correct
33 Correct 15 ms 31576 KB Output is correct
34 Correct 15 ms 31580 KB Output is correct
35 Correct 16 ms 32604 KB Output is correct
36 Correct 16 ms 32324 KB Output is correct
37 Correct 16 ms 32420 KB Output is correct
38 Correct 16 ms 32276 KB Output is correct
39 Correct 16 ms 32604 KB Output is correct
40 Correct 557 ms 127904 KB Output is correct
41 Correct 299 ms 83260 KB Output is correct
42 Correct 388 ms 134896 KB Output is correct
43 Correct 362 ms 134964 KB Output is correct
44 Correct 203 ms 72752 KB Output is correct
45 Correct 242 ms 87212 KB Output is correct
46 Correct 107 ms 55440 KB Output is correct
47 Correct 320 ms 106176 KB Output is correct
48 Correct 234 ms 102948 KB Output is correct