oj.uz

Submission #378627

# Submission time Handle Problem Language Result Execution time Memory
378627 2021-03-17T02:31:23 Z i_am_noob Evacuation plan (IZhO18_plan) C++17
100 / 100
 985 ms 60644 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define rep(n) rep1(i,n)
#define rep1(i,n) rep2(i,0,n)
#define rep2(i,a,b) for(int i=a; i<b; ++i)
#define rep3(i,a,b) for(int i=a; i>=b; --i)
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define pow2(x) (1ll<<(x))
#define pii pair<int,int>
#define pb push_back

#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x){cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&... y){cerr << x << ' ',_do(y...);}
#else
#define bug(...) 826
#endif

const int maxn=100005;
const int mod=1000000007;

int n,m,k,dis[maxn],q,ans[maxn];
vector<int> vec;
vector<pii> adj[maxn];
priority_queue<pii,vector<pii>,greater<pii>> pq;
bool vis[maxn];

int par[maxn];
unordered_set<int> st[maxn];

int Find(int x){return x==par[x]?x:par[x]=Find(par[x]);}

void Union(int x, int y, int t){
    x=Find(x),y=Find(y);
    if(x==y) return;
    if(sz(st[x])<sz(st[y])) swap(x,y);
    for(auto z: st[y]){
        if(st[x].count(z)){
            ans[z]=t;
            st[x].erase(z);
        }
        else st[x].insert(z);
    }
    par[y]=x;
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    #ifdef i_am_noob
    freopen("input1.txt","r",stdin);
    freopen("output1.txt","w",stdout);
    freopen("output2.txt","w",stderr);
    #endif
    cin >> n >> m;
    rep(m){
        int u,v,w;
        cin >> u >> v >> w;
        u--,v--;
        adj[u].pb({v,w}),adj[v].pb({u,w});
    }
    cin >> k;
    rep(k){
        int x;
        cin >> x;
        x--;
        pq.push({0,x});
    }
    while(!pq.empty()){
        auto [d,u]=pq.top();
        pq.pop();
        if(vis[u]) continue;
        vis[u]=1;
        dis[u]=d;
        vec.pb(u);
        for(auto& [v,w]: adj[u]) pq.push({d+w,v});
    }
    reverse(all(vec));
    

    cin >> q;
    rep(q){
        int u,v;
        cin >> u >> v;
        u--,v--;
        st[u].insert(i),st[v].insert(i);
    }
    rep(n) par[i]=i;
    memset(vis,0,sizeof vis);
    for(auto u: vec){
        vis[u]=1;
        for(auto& [v,w]: adj[u]) if(vis[v]) Union(u,v,dis[u]);
    }
    rep(q) cout << ans[i] << "\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8300 KB Output is correct
2 Correct 8 ms 8428 KB Output is correct
3 Correct 7 ms 8556 KB Output is correct
4 Correct 6 ms 8300 KB Output is correct
5 Correct 8 ms 8560 KB Output is correct
6 Correct 9 ms 8556 KB Output is correct
7 Correct 6 ms 8300 KB Output is correct
8 Correct 8 ms 8300 KB Output is correct
9 Correct 8 ms 8428 KB Output is correct
10 Correct 8 ms 8556 KB Output is correct
11 Correct 7 ms 8428 KB Output is correct
12 Correct 8 ms 8428 KB Output is correct
13 Correct 15 ms 8428 KB Output is correct
14 Correct 8 ms 8576 KB Output is correct
15 Correct 7 ms 8428 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8300 KB Output is correct
2 Correct 8 ms 8428 KB Output is correct
3 Correct 7 ms 8556 KB Output is correct
4 Correct 6 ms 8300 KB Output is correct
5 Correct 8 ms 8560 KB Output is correct
6 Correct 9 ms 8556 KB Output is correct
7 Correct 6 ms 8300 KB Output is correct
8 Correct 8 ms 8300 KB Output is correct
9 Correct 8 ms 8428 KB Output is correct
10 Correct 8 ms 8556 KB Output is correct
11 Correct 7 ms 8428 KB Output is correct
12 Correct 8 ms 8428 KB Output is correct
13 Correct 15 ms 8428 KB Output is correct
14 Correct 8 ms 8576 KB Output is correct
15 Correct 7 ms 8428 KB Output is correct
16 Correct 339 ms 27220 KB Output is correct
17 Correct 971 ms 57680 KB Output is correct
18 Correct 56 ms 12640 KB Output is correct
19 Correct 262 ms 28508 KB Output is correct
20 Correct 928 ms 58040 KB Output is correct
21 Correct 516 ms 37736 KB Output is correct
22 Correct 193 ms 26384 KB Output is correct
23 Correct 937 ms 57524 KB Output is correct
24 Correct 985 ms 57516 KB Output is correct
25 Correct 981 ms 57804 KB Output is correct
26 Correct 253 ms 28232 KB Output is correct
27 Correct 262 ms 28500 KB Output is correct
28 Correct 261 ms 28352 KB Output is correct
29 Correct 256 ms 28380 KB Output is correct
30 Correct 262 ms 28500 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 311 ms 25120 KB Output is correct
2 Correct 734 ms 52528 KB Output is correct
3 Correct 744 ms 52508 KB Output is correct
4 Correct 80 ms 15584 KB Output is correct
5 Correct 743 ms 52548 KB Output is correct
6 Correct 745 ms 52588 KB Output is correct
7 Correct 757 ms 52608 KB Output is correct
8 Correct 768 ms 52652 KB Output is correct
9 Correct 750 ms 52580 KB Output is correct
10 Correct 751 ms 52548 KB Output is correct
11 Correct 757 ms 52572 KB Output is correct
12 Correct 745 ms 52528 KB Output is correct
13 Correct 718 ms 52572 KB Output is correct
14 Correct 752 ms 52692 KB Output is correct
15 Correct 710 ms 52560 KB Output is correct
16 Correct 712 ms 52572 KB Output is correct
17 Correct 735 ms 52572 KB Output is correct
18 Correct 750 ms 52592 KB Output is correct
19 Correct 73 ms 15456 KB Output is correct
20 Correct 725 ms 52872 KB Output is correct
21 Correct 752 ms 52052 KB Output is correct
22 Correct 122 ms 18012 KB Output is correct
23 Correct 97 ms 15840 KB Output is correct
24 Correct 123 ms 18056 KB Output is correct
25 Correct 119 ms 17884 KB Output is correct
26 Correct 114 ms 16096 KB Output is correct
27 Correct 78 ms 15456 KB Output is correct
28 Correct 119 ms 17944 KB Output is correct
29 Correct 73 ms 15456 KB Output is correct
30 Correct 121 ms 17884 KB Output is correct
31 Correct 73 ms 15456 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8300 KB Output is correct
2 Correct 8 ms 8428 KB Output is correct
3 Correct 7 ms 8556 KB Output is correct
4 Correct 6 ms 8300 KB Output is correct
5 Correct 8 ms 8560 KB Output is correct
6 Correct 9 ms 8556 KB Output is correct
7 Correct 6 ms 8300 KB Output is correct
8 Correct 8 ms 8300 KB Output is correct
9 Correct 8 ms 8428 KB Output is correct
10 Correct 8 ms 8556 KB Output is correct
11 Correct 7 ms 8428 KB Output is correct
12 Correct 8 ms 8428 KB Output is correct
13 Correct 15 ms 8428 KB Output is correct
14 Correct 8 ms 8576 KB Output is correct
15 Correct 7 ms 8428 KB Output is correct
16 Correct 339 ms 27220 KB Output is correct
17 Correct 971 ms 57680 KB Output is correct
18 Correct 56 ms 12640 KB Output is correct
19 Correct 262 ms 28508 KB Output is correct
20 Correct 928 ms 58040 KB Output is correct
21 Correct 516 ms 37736 KB Output is correct
22 Correct 193 ms 26384 KB Output is correct
23 Correct 937 ms 57524 KB Output is correct
24 Correct 985 ms 57516 KB Output is correct
25 Correct 981 ms 57804 KB Output is correct
26 Correct 253 ms 28232 KB Output is correct
27 Correct 262 ms 28500 KB Output is correct
28 Correct 261 ms 28352 KB Output is correct
29 Correct 256 ms 28380 KB Output is correct
30 Correct 262 ms 28500 KB Output is correct
31 Correct 7 ms 8300 KB Output is correct
32 Correct 7 ms 8300 KB Output is correct
33 Correct 7 ms 8300 KB Output is correct
34 Correct 6 ms 8300 KB Output is correct
35 Correct 6 ms 8300 KB Output is correct
36 Correct 6 ms 8300 KB Output is correct
37 Correct 6 ms 8300 KB Output is correct
38 Correct 6 ms 8300 KB Output is correct
39 Correct 6 ms 8300 KB Output is correct
40 Correct 6 ms 8300 KB Output is correct
41 Correct 311 ms 25120 KB Output is correct
42 Correct 734 ms 52528 KB Output is correct
43 Correct 744 ms 52508 KB Output is correct
44 Correct 80 ms 15584 KB Output is correct
45 Correct 743 ms 52548 KB Output is correct
46 Correct 745 ms 52588 KB Output is correct
47 Correct 757 ms 52608 KB Output is correct
48 Correct 768 ms 52652 KB Output is correct
49 Correct 750 ms 52580 KB Output is correct
50 Correct 751 ms 52548 KB Output is correct
51 Correct 757 ms 52572 KB Output is correct
52 Correct 745 ms 52528 KB Output is correct
53 Correct 718 ms 52572 KB Output is correct
54 Correct 752 ms 52692 KB Output is correct
55 Correct 710 ms 52560 KB Output is correct
56 Correct 712 ms 52572 KB Output is correct
57 Correct 735 ms 52572 KB Output is correct
58 Correct 750 ms 52592 KB Output is correct
59 Correct 73 ms 15456 KB Output is correct
60 Correct 725 ms 52872 KB Output is correct
61 Correct 752 ms 52052 KB Output is correct
62 Correct 122 ms 18012 KB Output is correct
63 Correct 97 ms 15840 KB Output is correct
64 Correct 123 ms 18056 KB Output is correct
65 Correct 119 ms 17884 KB Output is correct
66 Correct 114 ms 16096 KB Output is correct
67 Correct 78 ms 15456 KB Output is correct
68 Correct 119 ms 17944 KB Output is correct
69 Correct 73 ms 15456 KB Output is correct
70 Correct 121 ms 17884 KB Output is correct
71 Correct 73 ms 15456 KB Output is correct
72 Correct 538 ms 38612 KB Output is correct
73 Correct 941 ms 58360 KB Output is correct
74 Correct 938 ms 58604 KB Output is correct
75 Correct 966 ms 58312 KB Output is correct
76 Correct 935 ms 58440 KB Output is correct
77 Correct 952 ms 58352 KB Output is correct
78 Correct 932 ms 58440 KB Output is correct
79 Correct 927 ms 58292 KB Output is correct
80 Correct 932 ms 58356 KB Output is correct
81 Correct 937 ms 58344 KB Output is correct
82 Correct 925 ms 58360 KB Output is correct
83 Correct 940 ms 58216 KB Output is correct
84 Correct 951 ms 58164 KB Output is correct
85 Correct 947 ms 58460 KB Output is correct
86 Correct 934 ms 58164 KB Output is correct
87 Correct 934 ms 58184 KB Output is correct
88 Correct 933 ms 58184 KB Output is correct
89 Correct 261 ms 28640 KB Output is correct
90 Correct 929 ms 58184 KB Output is correct
91 Correct 956 ms 60644 KB Output is correct
92 Correct 325 ms 29532 KB Output is correct
93 Correct 439 ms 51040 KB Output is correct
94 Correct 329 ms 29560 KB Output is correct
95 Correct 319 ms 29660 KB Output is correct
96 Correct 502 ms 53596 KB Output is correct
97 Correct 311 ms 30304 KB Output is correct
98 Correct 328 ms 29592 KB Output is correct
99 Correct 293 ms 30304 KB Output is correct
100 Correct 320 ms 29532 KB Output is correct