oj.uz

Submission #967392

# Submission time Handle Problem Language Result Execution time Memory
967392 2024-04-22T04:25:16 Z irmuun Evacuation plan (IZhO18_plan) C++17
100 / 100
 997 ms 71332 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(){
    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:97: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]
   97 |         for(ll i=0;i<ask.size();i++){
      |                    ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 648 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 3 ms 620 KB Output is correct
16 Correct 441 ms 24592 KB Output is correct
17 Correct 970 ms 69700 KB Output is correct
18 Correct 68 ms 7020 KB Output is correct
19 Correct 380 ms 26636 KB Output is correct
20 Correct 957 ms 69812 KB Output is correct
21 Correct 541 ms 38192 KB Output is correct
22 Correct 382 ms 22760 KB Output is correct
23 Correct 965 ms 69696 KB Output is correct
24 Correct 980 ms 69704 KB Output is correct
25 Correct 909 ms 70196 KB Output is correct
26 Correct 403 ms 26112 KB Output is correct
27 Correct 385 ms 26796 KB Output is correct
28 Correct 397 ms 26016 KB Output is correct
29 Correct 391 ms 27056 KB Output is correct
30 Correct 381 ms 27308 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 31416 KB Output is correct
2 Correct 607 ms 68732 KB Output is correct
3 Correct 603 ms 68280 KB Output is correct
4 Correct 109 ms 17296 KB Output is correct
5 Correct 632 ms 68572 KB Output is correct
6 Correct 572 ms 67104 KB Output is correct
7 Correct 580 ms 66732 KB Output is correct
8 Correct 628 ms 67544 KB Output is correct
9 Correct 623 ms 66908 KB Output is correct
10 Correct 632 ms 68432 KB Output is correct
11 Correct 611 ms 66540 KB Output is correct
12 Correct 615 ms 66476 KB Output is correct
13 Correct 657 ms 66680 KB Output is correct
14 Correct 618 ms 67556 KB Output is correct
15 Correct 626 ms 66564 KB Output is correct
16 Correct 594 ms 66948 KB Output is correct
17 Correct 587 ms 67248 KB Output is correct
18 Correct 590 ms 67808 KB Output is correct
19 Correct 82 ms 16060 KB Output is correct
20 Correct 627 ms 67932 KB Output is correct
21 Correct 564 ms 67244 KB Output is correct
22 Correct 115 ms 20456 KB Output is correct
23 Correct 123 ms 16328 KB Output is correct
24 Correct 115 ms 21936 KB Output is correct
25 Correct 116 ms 19884 KB Output is correct
26 Correct 126 ms 16604 KB Output is correct
27 Correct 105 ms 16576 KB Output is correct
28 Correct 131 ms 20380 KB Output is correct
29 Correct 103 ms 17252 KB Output is correct
30 Correct 120 ms 20700 KB Output is correct
31 Correct 103 ms 17172 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 648 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 3 ms 604 KB Output is correct
15 Correct 3 ms 620 KB Output is correct
16 Correct 441 ms 24592 KB Output is correct
17 Correct 970 ms 69700 KB Output is correct
18 Correct 68 ms 7020 KB Output is correct
19 Correct 380 ms 26636 KB Output is correct
20 Correct 957 ms 69812 KB Output is correct
21 Correct 541 ms 38192 KB Output is correct
22 Correct 382 ms 22760 KB Output is correct
23 Correct 965 ms 69696 KB Output is correct
24 Correct 980 ms 69704 KB Output is correct
25 Correct 909 ms 70196 KB Output is correct
26 Correct 403 ms 26112 KB Output is correct
27 Correct 385 ms 26796 KB Output is correct
28 Correct 397 ms 26016 KB Output is correct
29 Correct 391 ms 27056 KB Output is correct
30 Correct 381 ms 27308 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 600 KB Output is correct
41 Correct 271 ms 31416 KB Output is correct
42 Correct 607 ms 68732 KB Output is correct
43 Correct 603 ms 68280 KB Output is correct
44 Correct 109 ms 17296 KB Output is correct
45 Correct 632 ms 68572 KB Output is correct
46 Correct 572 ms 67104 KB Output is correct
47 Correct 580 ms 66732 KB Output is correct
48 Correct 628 ms 67544 KB Output is correct
49 Correct 623 ms 66908 KB Output is correct
50 Correct 632 ms 68432 KB Output is correct
51 Correct 611 ms 66540 KB Output is correct
52 Correct 615 ms 66476 KB Output is correct
53 Correct 657 ms 66680 KB Output is correct
54 Correct 618 ms 67556 KB Output is correct
55 Correct 626 ms 66564 KB Output is correct
56 Correct 594 ms 66948 KB Output is correct
57 Correct 587 ms 67248 KB Output is correct
58 Correct 590 ms 67808 KB Output is correct
59 Correct 82 ms 16060 KB Output is correct
60 Correct 627 ms 67932 KB Output is correct
61 Correct 564 ms 67244 KB Output is correct
62 Correct 115 ms 20456 KB Output is correct
63 Correct 123 ms 16328 KB Output is correct
64 Correct 115 ms 21936 KB Output is correct
65 Correct 116 ms 19884 KB Output is correct
66 Correct 126 ms 16604 KB Output is correct
67 Correct 105 ms 16576 KB Output is correct
68 Correct 131 ms 20380 KB Output is correct
69 Correct 103 ms 17252 KB Output is correct
70 Correct 120 ms 20700 KB Output is correct
71 Correct 103 ms 17172 KB Output is correct
72 Correct 597 ms 36476 KB Output is correct
73 Correct 963 ms 69880 KB Output is correct
74 Correct 950 ms 69684 KB Output is correct
75 Correct 937 ms 69760 KB Output is correct
76 Correct 930 ms 69796 KB Output is correct
77 Correct 955 ms 69792 KB Output is correct
78 Correct 938 ms 71332 KB Output is correct
79 Correct 984 ms 69796 KB Output is correct
80 Correct 938 ms 69880 KB Output is correct
81 Correct 988 ms 70264 KB Output is correct
82 Correct 997 ms 69796 KB Output is correct
83 Correct 970 ms 69864 KB Output is correct
84 Correct 990 ms 70100 KB Output is correct
85 Correct 945 ms 70168 KB Output is correct
86 Correct 933 ms 69796 KB Output is correct
87 Correct 973 ms 69708 KB Output is correct
88 Correct 944 ms 69792 KB Output is correct
89 Correct 412 ms 22312 KB Output is correct
90 Correct 941 ms 69924 KB Output is correct
91 Correct 892 ms 69908 KB Output is correct
92 Correct 379 ms 26536 KB Output is correct
93 Correct 516 ms 22548 KB Output is correct
94 Correct 397 ms 26536 KB Output is correct
95 Correct 391 ms 26284 KB Output is correct
96 Correct 545 ms 23900 KB Output is correct
97 Correct 488 ms 21816 KB Output is correct
98 Correct 369 ms 26664 KB Output is correct
99 Correct 462 ms 22504 KB Output is correct
100 Correct 379 ms 26784 KB Output is correct