oj.uz

Submission #967393

# Submission time Handle Problem Language Result Execution time Memory
967393 2024-04-22T04:27:04 Z irmuun Evacuation plan (IZhO18_plan) C++17
100 / 100
 759 ms 68928 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

struct dsu{
    ll n;
    vector<ll>sz,par;
    dsu(ll n):n(n){
        sz.resize(n+1);
        par.resize(n+1);
        reset();
    }
    void reset(){
        fill(all(sz),1);
        iota(all(par),0);
    }
    ll find(ll x){
        if(x==par[x]) return x;
        return par[x]=find(par[x]);
    }
    bool same(ll x,ll y){
        x=find(x);
        y=find(y);
        return x==y;
    }
    void merge(ll x,ll y){
        x=find(x);
        y=find(y);
        if(x!=y){
            if(x<y) swap(x,y);
            par[y]=x;
            sz[x]+=sz[y];
        }
    }
};

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m;
    cin>>n>>m;
    vector<pair<ll,ll>>adj[n+5];
    vector<array<ll,2>>edge;
    for(ll i=1;i<=m;i++){
        ll a,b,w;
        cin>>a>>b>>w;
        edge.pb({a,b});
        adj[a].pb({b,w});
        adj[b].pb({a,w});
    }
    ll k;
    cin>>k;
    ll g[k+5];
    ll dist[n+5];
    fill(dist,dist+n+1,1e18);
    set<pair<ll,ll>>st;
    for(ll i=1;i<=k;i++){
        cin>>g[i];
        st.insert({0,g[i]});
        dist[g[i]]=0;
    }
    while(!st.empty()){
        auto [y,i]=*st.begin();
        st.erase(st.begin());
        if(dist[i]!=y) continue;
        for(auto [j,w]:adj[i]){
            if(dist[i]+w<dist[j]){
                dist[j]=dist[i]+w;
                st.insert({dist[j],j});
            }
        }
    }
    vector<array<ll,3>>ord;
    for(auto [a,b]:edge){
        ord.pb({min(dist[a],dist[b]),a,b});
    }
    sort(rall(ord));
    ll q;
    cin>>q;
    vector<array<ll,3>>ask;
    ll s[q+5],t[q+5];
    for(ll i=1;i<=q;i++){
        cin>>s[i]>>t[i];
        ask.pb({0,(ll)1e9,i});
    }
    ll lg=30;
    dsu ds(n);
    while(lg--){
        ds.reset();
        sort(rall(ask));
        ll cur=0;
        for(ll i=0;i<ask.size();i++){
            ll l=ask[i][0],r=ask[i][1],j=ask[i][2];
            if(l==r) continue;
            ll mid=(l+r+1)/2;
            while(cur<m&&ord[cur][0]>=mid){
                ds.merge(ord[cur][1],ord[cur][2]);
                cur++;
            }
            if(ds.same(s[j],t[j])){
                ask[i]={mid,r,j};
            }
            else{
                ask[i]={l,mid-1,j};
            }
        }
    }
    ll ans[q+5];
    for(ll i=0;i<q;i++){
        ans[ask[i][2]]=ask[i][0];
    }
    for(ll i=1;i<=q;i++){
        cout<<ans[i]<<"\n";
    }
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:98:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |         for(ll i=0;i<ask.size();i++){
      |                    ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 3 ms 676 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 3 ms 604 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 3 ms 676 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 371 ms 24104 KB Output is correct
17 Correct 759 ms 68568 KB Output is correct
18 Correct 51 ms 6912 KB Output is correct
19 Correct 310 ms 25960 KB Output is correct
20 Correct 720 ms 68440 KB Output is correct
21 Correct 503 ms 37180 KB Output is correct
22 Correct 329 ms 21768 KB Output is correct
23 Correct 707 ms 65956 KB Output is correct
24 Correct 707 ms 67748 KB Output is correct
25 Correct 713 ms 68120 KB Output is correct
26 Correct 289 ms 26544 KB Output is correct
27 Correct 317 ms 25992 KB Output is correct
28 Correct 302 ms 26036 KB Output is correct
29 Correct 308 ms 26312 KB Output is correct
30 Correct 294 ms 26544 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 452 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 32440 KB Output is correct
2 Correct 445 ms 65088 KB Output is correct
3 Correct 435 ms 64856 KB Output is correct
4 Correct 75 ms 17348 KB Output is correct
5 Correct 432 ms 63400 KB Output is correct
6 Correct 399 ms 67248 KB Output is correct
7 Correct 421 ms 67396 KB Output is correct
8 Correct 395 ms 65204 KB Output is correct
9 Correct 427 ms 64512 KB Output is correct
10 Correct 435 ms 66464 KB Output is correct
11 Correct 422 ms 65712 KB Output is correct
12 Correct 440 ms 65656 KB Output is correct
13 Correct 422 ms 66388 KB Output is correct
14 Correct 428 ms 65920 KB Output is correct
15 Correct 412 ms 66992 KB Output is correct
16 Correct 412 ms 65968 KB Output is correct
17 Correct 396 ms 66736 KB Output is correct
18 Correct 394 ms 65556 KB Output is correct
19 Correct 44 ms 16992 KB Output is correct
20 Correct 430 ms 65600 KB Output is correct
21 Correct 333 ms 65640 KB Output is correct
22 Correct 89 ms 19932 KB Output is correct
23 Correct 86 ms 17712 KB Output is correct
24 Correct 78 ms 20660 KB Output is correct
25 Correct 78 ms 19764 KB Output is correct
26 Correct 86 ms 16316 KB Output is correct
27 Correct 67 ms 15968 KB Output is correct
28 Correct 79 ms 20400 KB Output is correct
29 Correct 81 ms 17088 KB Output is correct
30 Correct 87 ms 19880 KB Output is correct
31 Correct 68 ms 15808 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 600 KB Output is correct
13 Correct 3 ms 676 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 371 ms 24104 KB Output is correct
17 Correct 759 ms 68568 KB Output is correct
18 Correct 51 ms 6912 KB Output is correct
19 Correct 310 ms 25960 KB Output is correct
20 Correct 720 ms 68440 KB Output is correct
21 Correct 503 ms 37180 KB Output is correct
22 Correct 329 ms 21768 KB Output is correct
23 Correct 707 ms 65956 KB Output is correct
24 Correct 707 ms 67748 KB Output is correct
25 Correct 713 ms 68120 KB Output is correct
26 Correct 289 ms 26544 KB Output is correct
27 Correct 317 ms 25992 KB Output is correct
28 Correct 302 ms 26036 KB Output is correct
29 Correct 308 ms 26312 KB Output is correct
30 Correct 294 ms 26544 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 472 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 452 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 189 ms 32440 KB Output is correct
42 Correct 445 ms 65088 KB Output is correct
43 Correct 435 ms 64856 KB Output is correct
44 Correct 75 ms 17348 KB Output is correct
45 Correct 432 ms 63400 KB Output is correct
46 Correct 399 ms 67248 KB Output is correct
47 Correct 421 ms 67396 KB Output is correct
48 Correct 395 ms 65204 KB Output is correct
49 Correct 427 ms 64512 KB Output is correct
50 Correct 435 ms 66464 KB Output is correct
51 Correct 422 ms 65712 KB Output is correct
52 Correct 440 ms 65656 KB Output is correct
53 Correct 422 ms 66388 KB Output is correct
54 Correct 428 ms 65920 KB Output is correct
55 Correct 412 ms 66992 KB Output is correct
56 Correct 412 ms 65968 KB Output is correct
57 Correct 396 ms 66736 KB Output is correct
58 Correct 394 ms 65556 KB Output is correct
59 Correct 44 ms 16992 KB Output is correct
60 Correct 430 ms 65600 KB Output is correct
61 Correct 333 ms 65640 KB Output is correct
62 Correct 89 ms 19932 KB Output is correct
63 Correct 86 ms 17712 KB Output is correct
64 Correct 78 ms 20660 KB Output is correct
65 Correct 78 ms 19764 KB Output is correct
66 Correct 86 ms 16316 KB Output is correct
67 Correct 67 ms 15968 KB Output is correct
68 Correct 79 ms 20400 KB Output is correct
69 Correct 81 ms 17088 KB Output is correct
70 Correct 87 ms 19880 KB Output is correct
71 Correct 68 ms 15808 KB Output is correct
72 Correct 456 ms 38480 KB Output is correct
73 Correct 715 ms 67892 KB Output is correct
74 Correct 727 ms 68928 KB Output is correct
75 Correct 672 ms 68516 KB Output is correct
76 Correct 711 ms 67772 KB Output is correct
77 Correct 667 ms 67988 KB Output is correct
78 Correct 731 ms 65188 KB Output is correct
79 Correct 693 ms 65952 KB Output is correct
80 Correct 715 ms 65076 KB Output is correct
81 Correct 733 ms 64732 KB Output is correct
82 Correct 713 ms 65008 KB Output is correct
83 Correct 667 ms 65188 KB Output is correct
84 Correct 696 ms 66208 KB Output is correct
85 Correct 677 ms 65696 KB Output is correct
86 Correct 667 ms 65204 KB Output is correct
87 Correct 717 ms 65344 KB Output is correct
88 Correct 729 ms 65112 KB Output is correct
89 Correct 377 ms 20976 KB Output is correct
90 Correct 709 ms 66888 KB Output is correct
91 Correct 635 ms 65188 KB Output is correct
92 Correct 308 ms 25712 KB Output is correct
93 Correct 414 ms 21340 KB Output is correct
94 Correct 315 ms 25012 KB Output is correct
95 Correct 299 ms 25708 KB Output is correct
96 Correct 475 ms 22712 KB Output is correct
97 Correct 379 ms 20656 KB Output is correct
98 Correct 313 ms 25260 KB Output is correct
99 Correct 372 ms 20732 KB Output is correct
100 Correct 301 ms 25532 KB Output is correct