oj.uz

Submission #565932

# Submission time Handle Problem Language Result Execution time Memory
565932 2022-05-21T14:53:14 Z birthdaycake Evacuation plan (IZhO18_plan) C++17
100 / 100
 1069 ms 70324 KB 
#include<bits/stdc++.h>
#define endl '\n'
#define mod 1000000007
#define boost ios_base::sync_with_stdio(false), cin.tie(NULL);
using namespace std;
 
 
 
vector<pair<int,int>>adj[200001];
int dist[200001],npp[200001];
vector<pair<int,int>> queries[200001];
 
vector<int> cmp[200001]; int vs[200001],cm[200001], ans[200001];
 
 
 

void merge(int a, int b, int dg){
    
    if(cm[a] == cm[b]) return;
    
    if(cmp[cm[a]].size() > cmp[cm[b]].size()) swap(a,b);
    for(auto s: cmp[cm[a]]){
        for(auto f : queries[s]){
            if(cm[f.first] == cm[b]) ans[f.second] = dg;
        }
    }
    for(auto s: cmp[cm[a]]){
        cm[s] = cm[b];
        cmp[cm[b]].push_back(s);
    }

}
signed main(){
    boost;
    
    int n,m; cin >> n >> m;
    set<pair<int,int>>d;
    for(int i = 0; i < m; i++){
        int a,b,c; cin >> a >> b >> c;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
        if(a > b) swap(a,b);
        d.insert({a,b});
    }
    
    int k; cin >> k;
    set<pair<int,int>>bfs;
    
    for(int i = 1; i <= n; i++) npp[i] = INT_MAX;
 
    
    
    for(int i = 1; i <= k; i++) {
        int x; cin >> x;
        npp[x] = 0;
        bfs.insert({0,x});
    }
    
    while(bfs.size()){
        auto x = *bfs.begin();
        bfs.erase(x);
        if(npp[x.second] < x.first) continue;
        for(auto s : adj[x.second]){
            if(npp[x.second] + s.second < npp[s.first]){
                npp[s.first] = npp[x.second] + s.second;
                bfs.insert({npp[s.first], s.first});
            }
        }
    }
   
    int q; cin >> q;
    for(int i = 0; i < q; i++){
        int a,b; cin >> a >> b;
        queries[a].push_back({b,i});
        queries[b].push_back({a,i});
    }
    vector<pair<int,int>>x;
    for(int i = 1; i <= n; i++){
        cm[i] = i;
        cmp[i].push_back(i);
        x.push_back({npp[i],i});
    }
    
    sort(x.begin(), x.end(), greater<pair<int,int>>());
    for(int i = 0; i < x.size(); i++){
        int k = x[i].second;
        for(auto s: adj[k]){
            if(vs[s.first]){
                merge(k,s.first,x[i].first);
            }
        }
        
        vs[k] = 1;
    }
    for(int i = 0; i < q; i++)cout << ans[i] << endl;
   
    return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 9 ms 14620 KB Output is correct
3 Correct 9 ms 14548 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 9 ms 14548 KB Output is correct
6 Correct 9 ms 14616 KB Output is correct
7 Correct 8 ms 14452 KB Output is correct
8 Correct 8 ms 14340 KB Output is correct
9 Correct 9 ms 14524 KB Output is correct
10 Correct 11 ms 14548 KB Output is correct
11 Correct 9 ms 14624 KB Output is correct
12 Correct 8 ms 14548 KB Output is correct
13 Correct 9 ms 14548 KB Output is correct
14 Correct 9 ms 14548 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 9 ms 14620 KB Output is correct
3 Correct 9 ms 14548 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 9 ms 14548 KB Output is correct
6 Correct 9 ms 14616 KB Output is correct
7 Correct 8 ms 14452 KB Output is correct
8 Correct 8 ms 14340 KB Output is correct
9 Correct 9 ms 14524 KB Output is correct
10 Correct 11 ms 14548 KB Output is correct
11 Correct 9 ms 14624 KB Output is correct
12 Correct 8 ms 14548 KB Output is correct
13 Correct 9 ms 14548 KB Output is correct
14 Correct 9 ms 14548 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 230 ms 31368 KB Output is correct
17 Correct 988 ms 62740 KB Output is correct
18 Correct 49 ms 18668 KB Output is correct
19 Correct 242 ms 33868 KB Output is correct
20 Correct 1014 ms 62728 KB Output is correct
21 Correct 419 ms 39472 KB Output is correct
22 Correct 187 ms 32624 KB Output is correct
23 Correct 983 ms 62656 KB Output is correct
24 Correct 1008 ms 62560 KB Output is correct
25 Correct 1012 ms 62720 KB Output is correct
26 Correct 241 ms 33664 KB Output is correct
27 Correct 247 ms 33820 KB Output is correct
28 Correct 237 ms 33756 KB Output is correct
29 Correct 234 ms 33880 KB Output is correct
30 Correct 241 ms 33856 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 35804 KB Output is correct
2 Correct 931 ms 60196 KB Output is correct
3 Correct 930 ms 60044 KB Output is correct
4 Correct 138 ms 28484 KB Output is correct
5 Correct 922 ms 60068 KB Output is correct
6 Correct 915 ms 60268 KB Output is correct
7 Correct 914 ms 60040 KB Output is correct
8 Correct 917 ms 60140 KB Output is correct
9 Correct 938 ms 60212 KB Output is correct
10 Correct 962 ms 60032 KB Output is correct
11 Correct 932 ms 60144 KB Output is correct
12 Correct 953 ms 60188 KB Output is correct
13 Correct 929 ms 60036 KB Output is correct
14 Correct 928 ms 60240 KB Output is correct
15 Correct 953 ms 60312 KB Output is correct
16 Correct 930 ms 60124 KB Output is correct
17 Correct 926 ms 60088 KB Output is correct
18 Correct 916 ms 60140 KB Output is correct
19 Correct 126 ms 28244 KB Output is correct
20 Correct 915 ms 60364 KB Output is correct
21 Correct 865 ms 59184 KB Output is correct
22 Correct 181 ms 29260 KB Output is correct
23 Correct 162 ms 29700 KB Output is correct
24 Correct 183 ms 29504 KB Output is correct
25 Correct 185 ms 29188 KB Output is correct
26 Correct 189 ms 30276 KB Output is correct
27 Correct 166 ms 28488 KB Output is correct
28 Correct 184 ms 29424 KB Output is correct
29 Correct 131 ms 28356 KB Output is correct
30 Correct 183 ms 29248 KB Output is correct
31 Correct 137 ms 28348 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 9 ms 14620 KB Output is correct
3 Correct 9 ms 14548 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 9 ms 14548 KB Output is correct
6 Correct 9 ms 14616 KB Output is correct
7 Correct 8 ms 14452 KB Output is correct
8 Correct 8 ms 14340 KB Output is correct
9 Correct 9 ms 14524 KB Output is correct
10 Correct 11 ms 14548 KB Output is correct
11 Correct 9 ms 14624 KB Output is correct
12 Correct 8 ms 14548 KB Output is correct
13 Correct 9 ms 14548 KB Output is correct
14 Correct 9 ms 14548 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 230 ms 31368 KB Output is correct
17 Correct 988 ms 62740 KB Output is correct
18 Correct 49 ms 18668 KB Output is correct
19 Correct 242 ms 33868 KB Output is correct
20 Correct 1014 ms 62728 KB Output is correct
21 Correct 419 ms 39472 KB Output is correct
22 Correct 187 ms 32624 KB Output is correct
23 Correct 983 ms 62656 KB Output is correct
24 Correct 1008 ms 62560 KB Output is correct
25 Correct 1012 ms 62720 KB Output is correct
26 Correct 241 ms 33664 KB Output is correct
27 Correct 247 ms 33820 KB Output is correct
28 Correct 237 ms 33756 KB Output is correct
29 Correct 234 ms 33880 KB Output is correct
30 Correct 241 ms 33856 KB Output is correct
31 Correct 8 ms 14420 KB Output is correct
32 Correct 8 ms 14420 KB Output is correct
33 Correct 7 ms 14436 KB Output is correct
34 Correct 7 ms 14420 KB Output is correct
35 Correct 8 ms 14420 KB Output is correct
36 Correct 8 ms 14420 KB Output is correct
37 Correct 8 ms 14408 KB Output is correct
38 Correct 7 ms 14420 KB Output is correct
39 Correct 8 ms 14436 KB Output is correct
40 Correct 8 ms 14420 KB Output is correct
41 Correct 340 ms 35804 KB Output is correct
42 Correct 931 ms 60196 KB Output is correct
43 Correct 930 ms 60044 KB Output is correct
44 Correct 138 ms 28484 KB Output is correct
45 Correct 922 ms 60068 KB Output is correct
46 Correct 915 ms 60268 KB Output is correct
47 Correct 914 ms 60040 KB Output is correct
48 Correct 917 ms 60140 KB Output is correct
49 Correct 938 ms 60212 KB Output is correct
50 Correct 962 ms 60032 KB Output is correct
51 Correct 932 ms 60144 KB Output is correct
52 Correct 953 ms 60188 KB Output is correct
53 Correct 929 ms 60036 KB Output is correct
54 Correct 928 ms 60240 KB Output is correct
55 Correct 953 ms 60312 KB Output is correct
56 Correct 930 ms 60124 KB Output is correct
57 Correct 926 ms 60088 KB Output is correct
58 Correct 916 ms 60140 KB Output is correct
59 Correct 126 ms 28244 KB Output is correct
60 Correct 915 ms 60364 KB Output is correct
61 Correct 865 ms 59184 KB Output is correct
62 Correct 181 ms 29260 KB Output is correct
63 Correct 162 ms 29700 KB Output is correct
64 Correct 183 ms 29504 KB Output is correct
65 Correct 185 ms 29188 KB Output is correct
66 Correct 189 ms 30276 KB Output is correct
67 Correct 166 ms 28488 KB Output is correct
68 Correct 184 ms 29424 KB Output is correct
69 Correct 131 ms 28356 KB Output is correct
70 Correct 183 ms 29248 KB Output is correct
71 Correct 137 ms 28348 KB Output is correct
72 Correct 482 ms 40912 KB Output is correct
73 Correct 1006 ms 70128 KB Output is correct
74 Correct 1004 ms 70204 KB Output is correct
75 Correct 1000 ms 70208 KB Output is correct
76 Correct 1000 ms 70300 KB Output is correct
77 Correct 1024 ms 70124 KB Output is correct
78 Correct 1002 ms 70208 KB Output is correct
79 Correct 1000 ms 70228 KB Output is correct
80 Correct 1014 ms 70144 KB Output is correct
81 Correct 1036 ms 70240 KB Output is correct
82 Correct 1033 ms 70088 KB Output is correct
83 Correct 1000 ms 70044 KB Output is correct
84 Correct 995 ms 70200 KB Output is correct
85 Correct 1022 ms 70324 KB Output is correct
86 Correct 1006 ms 70188 KB Output is correct
87 Correct 1010 ms 70272 KB Output is correct
88 Correct 1004 ms 70240 KB Output is correct
89 Correct 198 ms 33832 KB Output is correct
90 Correct 1069 ms 70164 KB Output is correct
91 Correct 964 ms 68328 KB Output is correct
92 Correct 253 ms 33844 KB Output is correct
93 Correct 227 ms 35072 KB Output is correct
94 Correct 233 ms 33732 KB Output is correct
95 Correct 249 ms 33780 KB Output is correct
96 Correct 260 ms 35364 KB Output is correct
97 Correct 196 ms 33600 KB Output is correct
98 Correct 256 ms 33692 KB Output is correct
99 Correct 182 ms 33560 KB Output is correct
100 Correct 244 ms 34012 KB Output is correct