oj.uz

Submission #1085936

# Submission time Handle Problem Language Result Execution time Memory
1085936 2024-09-09T06:32:42 Z Bananabread Passport (JOI23_passport) C++17
54 / 100
 570 ms 134136 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){
    fill(dist+1,dist+4*n+100,1e18);
    fill(vis+1,vis+4*n+100,0);
    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]});
    fill(dist+1,dist+4*n+100,1e18);
    fill(vis+1,vis+4*n+100,0);
    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

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19288 KB Output is correct
2 Correct 8 ms 19288 KB Output is correct
3 Correct 8 ms 19292 KB Output is correct
4 Correct 509 ms 120604 KB Output is correct
5 Correct 280 ms 81376 KB Output is correct
6 Correct 180 ms 71100 KB Output is correct
7 Correct 215 ms 114124 KB Output is correct
8 Correct 120 ms 101872 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19288 KB Output is correct
2 Correct 8 ms 19108 KB Output is correct
3 Correct 8 ms 19240 KB Output is correct
4 Correct 8 ms 19080 KB Output is correct
5 Correct 8 ms 19292 KB Output is correct
6 Correct 8 ms 19292 KB Output is correct
7 Correct 8 ms 19292 KB Output is correct
8 Correct 8 ms 19292 KB Output is correct
9 Correct 10 ms 19292 KB Output is correct
10 Correct 8 ms 19292 KB Output is correct
11 Correct 9 ms 19292 KB Output is correct
12 Correct 9 ms 19256 KB Output is correct
13 Correct 9 ms 19292 KB Output is correct
14 Correct 9 ms 19284 KB Output is correct
15 Correct 8 ms 19288 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19288 KB Output is correct
2 Correct 8 ms 19108 KB Output is correct
3 Correct 8 ms 19240 KB Output is correct
4 Correct 8 ms 19080 KB Output is correct
5 Correct 8 ms 19292 KB Output is correct
6 Correct 8 ms 19292 KB Output is correct
7 Correct 8 ms 19292 KB Output is correct
8 Correct 8 ms 19292 KB Output is correct
9 Correct 10 ms 19292 KB Output is correct
10 Correct 8 ms 19292 KB Output is correct
11 Correct 9 ms 19292 KB Output is correct
12 Correct 9 ms 19256 KB Output is correct
13 Correct 9 ms 19292 KB Output is correct
14 Correct 9 ms 19284 KB Output is correct
15 Correct 8 ms 19288 KB Output is correct
16 Correct 11 ms 20316 KB Output is correct
17 Correct 10 ms 20060 KB Output is correct
18 Correct 11 ms 20572 KB Output is correct
19 Correct 10 ms 20524 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 9 ms 20104 KB Output is correct
22 Correct 10 ms 20316 KB Output is correct
23 Correct 14 ms 20316 KB Output is correct
24 Correct 10 ms 20060 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19288 KB Output is correct
2 Correct 8 ms 19108 KB Output is correct
3 Correct 8 ms 19240 KB Output is correct
4 Correct 8 ms 19080 KB Output is correct
5 Correct 8 ms 19292 KB Output is correct
6 Correct 8 ms 19292 KB Output is correct
7 Correct 8 ms 19292 KB Output is correct
8 Correct 8 ms 19292 KB Output is correct
9 Correct 10 ms 19292 KB Output is correct
10 Correct 8 ms 19292 KB Output is correct
11 Correct 9 ms 19292 KB Output is correct
12 Correct 9 ms 19256 KB Output is correct
13 Correct 9 ms 19292 KB Output is correct
14 Correct 9 ms 19284 KB Output is correct
15 Correct 8 ms 19288 KB Output is correct
16 Correct 11 ms 20316 KB Output is correct
17 Correct 10 ms 20060 KB Output is correct
18 Correct 11 ms 20572 KB Output is correct
19 Correct 10 ms 20524 KB Output is correct
20 Correct 10 ms 19804 KB Output is correct
21 Correct 9 ms 20104 KB Output is correct
22 Correct 10 ms 20316 KB Output is correct
23 Correct 14 ms 20316 KB Output is correct
24 Correct 10 ms 20060 KB Output is correct
25 Correct 8 ms 19292 KB Output is correct
26 Correct 8 ms 19292 KB Output is correct
27 Correct 11 ms 20316 KB Output is correct
28 Correct 10 ms 19928 KB Output is correct
29 Correct 10 ms 20056 KB Output is correct
30 Correct 10 ms 20060 KB Output is correct
31 Correct 13 ms 20160 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19288 KB Output is correct
2 Correct 8 ms 19288 KB Output is correct
3 Correct 8 ms 19292 KB Output is correct
4 Correct 509 ms 120604 KB Output is correct
5 Correct 280 ms 81376 KB Output is correct
6 Correct 180 ms 71100 KB Output is correct
7 Correct 215 ms 114124 KB Output is correct
8 Correct 120 ms 101872 KB Output is correct
9 Correct 11 ms 19288 KB Output is correct
10 Correct 8 ms 19108 KB Output is correct
11 Correct 8 ms 19240 KB Output is correct
12 Correct 8 ms 19080 KB Output is correct
13 Correct 8 ms 19292 KB Output is correct
14 Correct 8 ms 19292 KB Output is correct
15 Correct 8 ms 19292 KB Output is correct
16 Correct 8 ms 19292 KB Output is correct
17 Correct 10 ms 19292 KB Output is correct
18 Correct 8 ms 19292 KB Output is correct
19 Correct 9 ms 19292 KB Output is correct
20 Correct 9 ms 19256 KB Output is correct
21 Correct 9 ms 19292 KB Output is correct
22 Correct 9 ms 19284 KB Output is correct
23 Correct 8 ms 19288 KB Output is correct
24 Correct 11 ms 20316 KB Output is correct
25 Correct 10 ms 20060 KB Output is correct
26 Correct 11 ms 20572 KB Output is correct
27 Correct 10 ms 20524 KB Output is correct
28 Correct 10 ms 19804 KB Output is correct
29 Correct 9 ms 20104 KB Output is correct
30 Correct 10 ms 20316 KB Output is correct
31 Correct 14 ms 20316 KB Output is correct
32 Correct 10 ms 20060 KB Output is correct
33 Correct 8 ms 19292 KB Output is correct
34 Correct 8 ms 19292 KB Output is correct
35 Correct 11 ms 20316 KB Output is correct
36 Correct 10 ms 19928 KB Output is correct
37 Correct 10 ms 20056 KB Output is correct
38 Correct 10 ms 20060 KB Output is correct
39 Correct 13 ms 20160 KB Output is correct
40 Correct 570 ms 126964 KB Output is correct
41 Correct 289 ms 82780 KB Output is correct
42 Correct 387 ms 134136 KB Output is correct
43 Incorrect 245 ms 130800 KB Output isn't correct
44 Halted 0 ms 0 KB -