oj.uz

Submission #316987

# Submission time Handle Problem Language Result Execution time Memory
316987 2020-10-28T21:41:37 Z ajpiano Evacuation plan (IZhO18_plan) C++11
100 / 100
 579 ms 43536 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

#define FOR(a,b) for(int a=0;a<b;a++)
#define F0R(a,b,c) for(int a = b; a<=c; a++)
#define f first
#define s second
#define m0(x) memset(x,0,sizeof(x))
#define all(x) x.begin(), x.end()

typedef pair<int,int> pi;
typedef long long ll;
typedef vector<int> vi;
typedef vector<pi> vpi;

const int large = 1e5;

struct path{
    int start, finish, val, cost;
    path(int s, int f, int c){
        start = s; finish = f; cost = c;
    }
    bool operator > (const path &b) const{
        return (val > b.val);
    }
    int other(int x){
        if(x == start) return finish;
        else return start;
    }
};

int n,m;
int cur;
vi edges[large+1];
vector<path> roads;
vi parents;
vi dist;
vi members[large+1];
vpi transfers[large+1];

int bpath(int a, int b){
    int asz = transfers[a].size();
    int bsz = transfers[b].size();
    if(asz > bsz){
        swap(a,b);
        swap(asz,bsz);
    }
    int ans = 0;
    F0R(i,1,asz){
        pi aval = transfers[a][asz-i];
        pi bval = transfers[b][bsz-i];
        if(aval.f != bval.f) break;
        ans = min(aval.s, bval.s);
    }
    return ans;
}

void mergeNode(int a, int b){
    a = parents[a];
    b = parents[b];
    if(a == b) return;
    if(members[a].size() < members[b].size()) swap(a,b);
    while(!members[b].empty()){
        int node = members[b].back(); members[b].pop_back();
        members[a].push_back(node);
        parents[node] = a;
        transfers[node].push_back({a,cur});
    }
}

const int inf = 1e9;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    parents.resize(n+1); iota(all(parents),0);
    dist.resize(n+1,inf);
    F0R(i,1,n) members[i].push_back(i);
    F0R(i,1,n) transfers[i].push_back({i,inf});
    FOR(i,m){
        int a, b, w; cin >> a >> b >> w;
        roads.emplace_back(a,b,w);
        edges[a].push_back(i);
        edges[b].push_back(i);
    }
    //run dijkstra
    priority_queue<pi, vpi, greater<pi>> pq;
    int k; cin >> k;
    FOR(i,k){
        int a; cin >> a;
        dist[a] = 0;
        pq.push({0,a});
    }
    while(!pq.empty()){
        pi a = pq.top(); pq.pop();
        if(dist[a.s] < a.f) continue;
        for(int e: edges[a.s]){
            path &p = roads[e];
            int b = p.other(a.s);
            if(a.f+p.cost >= dist[b]) continue;
            dist[b] = a.f+p.cost;
            pq.push({dist[b], b});
        }
    }
    //assign values to paths
    FOR(i,m){
        path &a = roads[i];
        a.val = min(dist[a.start], dist[a.finish]);
    }
    //sort roads
    sort(all(roads), greater<path>());
    //go through roads and do dsu
    for(path &p : roads){
        cur = p.val;
        mergeNode(p.start, p.finish);
    }
    //answer queries
    int q; cin >> q;
    FOR(i,q){
        int a, b; cin >> a >> b;
        cout << bpath(a,b) << "\n";
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 6 ms 7552 KB Output is correct
3 Correct 6 ms 7552 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 6 ms 7552 KB Output is correct
6 Correct 6 ms 7552 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 6 ms 7552 KB Output is correct
10 Correct 6 ms 7552 KB Output is correct
11 Correct 6 ms 7552 KB Output is correct
12 Correct 6 ms 7552 KB Output is correct
13 Correct 7 ms 7552 KB Output is correct
14 Correct 6 ms 7552 KB Output is correct
15 Correct 7 ms 7552 KB Output is correct
16 Correct 208 ms 22988 KB Output is correct
17 Correct 579 ms 42832 KB Output is correct
18 Correct 38 ms 10732 KB Output is correct
19 Correct 208 ms 24676 KB Output is correct
20 Correct 563 ms 42708 KB Output is correct
21 Correct 312 ms 29668 KB Output is correct
22 Correct 176 ms 24040 KB Output is correct
23 Correct 573 ms 42580 KB Output is correct
24 Correct 572 ms 42712 KB Output is correct
25 Correct 570 ms 42712 KB Output is correct
26 Correct 204 ms 24552 KB Output is correct
27 Correct 199 ms 24552 KB Output is correct
28 Correct 198 ms 24552 KB Output is correct
29 Correct 200 ms 24552 KB Output is correct
30 Correct 200 ms 24680 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 27620 KB Output is correct
2 Correct 527 ms 41044 KB Output is correct
3 Correct 535 ms 40916 KB Output is correct
4 Correct 162 ms 22888 KB Output is correct
5 Correct 532 ms 40916 KB Output is correct
6 Correct 525 ms 41056 KB Output is correct
7 Correct 527 ms 41044 KB Output is correct
8 Correct 523 ms 41044 KB Output is correct
9 Correct 536 ms 41044 KB Output is correct
10 Correct 542 ms 41044 KB Output is correct
11 Correct 528 ms 41044 KB Output is correct
12 Correct 553 ms 41056 KB Output is correct
13 Correct 528 ms 41044 KB Output is correct
14 Correct 514 ms 41044 KB Output is correct
15 Correct 532 ms 41684 KB Output is correct
16 Correct 530 ms 41048 KB Output is correct
17 Correct 540 ms 41044 KB Output is correct
18 Correct 518 ms 41056 KB Output is correct
19 Correct 130 ms 21736 KB Output is correct
20 Correct 518 ms 41004 KB Output is correct
21 Correct 477 ms 41172 KB Output is correct
22 Correct 162 ms 23016 KB Output is correct
23 Correct 204 ms 27880 KB Output is correct
24 Correct 161 ms 23016 KB Output is correct
25 Correct 164 ms 23144 KB Output is correct
26 Correct 232 ms 28308 KB Output is correct
27 Correct 155 ms 22956 KB Output is correct
28 Correct 163 ms 23148 KB Output is correct
29 Correct 153 ms 22888 KB Output is correct
30 Correct 156 ms 23144 KB Output is correct
31 Correct 156 ms 22888 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 6 ms 7552 KB Output is correct
3 Correct 6 ms 7552 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 6 ms 7552 KB Output is correct
6 Correct 6 ms 7552 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 6 ms 7552 KB Output is correct
10 Correct 6 ms 7552 KB Output is correct
11 Correct 6 ms 7552 KB Output is correct
12 Correct 6 ms 7552 KB Output is correct
13 Correct 7 ms 7552 KB Output is correct
14 Correct 6 ms 7552 KB Output is correct
15 Correct 7 ms 7552 KB Output is correct
16 Correct 208 ms 22988 KB Output is correct
17 Correct 579 ms 42832 KB Output is correct
18 Correct 38 ms 10732 KB Output is correct
19 Correct 208 ms 24676 KB Output is correct
20 Correct 563 ms 42708 KB Output is correct
21 Correct 312 ms 29668 KB Output is correct
22 Correct 176 ms 24040 KB Output is correct
23 Correct 573 ms 42580 KB Output is correct
24 Correct 572 ms 42712 KB Output is correct
25 Correct 570 ms 42712 KB Output is correct
26 Correct 204 ms 24552 KB Output is correct
27 Correct 199 ms 24552 KB Output is correct
28 Correct 198 ms 24552 KB Output is correct
29 Correct 200 ms 24552 KB Output is correct
30 Correct 200 ms 24680 KB Output is correct
31 Correct 5 ms 7424 KB Output is correct
32 Correct 5 ms 7424 KB Output is correct
33 Correct 5 ms 7424 KB Output is correct
34 Correct 5 ms 7424 KB Output is correct
35 Correct 5 ms 7424 KB Output is correct
36 Correct 5 ms 7424 KB Output is correct
37 Correct 5 ms 7424 KB Output is correct
38 Correct 5 ms 7424 KB Output is correct
39 Correct 5 ms 7424 KB Output is correct
40 Correct 5 ms 7424 KB Output is correct
41 Correct 281 ms 27620 KB Output is correct
42 Correct 527 ms 41044 KB Output is correct
43 Correct 535 ms 40916 KB Output is correct
44 Correct 162 ms 22888 KB Output is correct
45 Correct 532 ms 40916 KB Output is correct
46 Correct 525 ms 41056 KB Output is correct
47 Correct 527 ms 41044 KB Output is correct
48 Correct 523 ms 41044 KB Output is correct
49 Correct 536 ms 41044 KB Output is correct
50 Correct 542 ms 41044 KB Output is correct
51 Correct 528 ms 41044 KB Output is correct
52 Correct 553 ms 41056 KB Output is correct
53 Correct 528 ms 41044 KB Output is correct
54 Correct 514 ms 41044 KB Output is correct
55 Correct 532 ms 41684 KB Output is correct
56 Correct 530 ms 41048 KB Output is correct
57 Correct 540 ms 41044 KB Output is correct
58 Correct 518 ms 41056 KB Output is correct
59 Correct 130 ms 21736 KB Output is correct
60 Correct 518 ms 41004 KB Output is correct
61 Correct 477 ms 41172 KB Output is correct
62 Correct 162 ms 23016 KB Output is correct
63 Correct 204 ms 27880 KB Output is correct
64 Correct 161 ms 23016 KB Output is correct
65 Correct 164 ms 23144 KB Output is correct
66 Correct 232 ms 28308 KB Output is correct
67 Correct 155 ms 22956 KB Output is correct
68 Correct 163 ms 23148 KB Output is correct
69 Correct 153 ms 22888 KB Output is correct
70 Correct 156 ms 23144 KB Output is correct
71 Correct 156 ms 22888 KB Output is correct
72 Correct 326 ms 29308 KB Output is correct
73 Correct 574 ms 42708 KB Output is correct
74 Correct 574 ms 42580 KB Output is correct
75 Correct 576 ms 42660 KB Output is correct
76 Correct 579 ms 42696 KB Output is correct
77 Correct 570 ms 42760 KB Output is correct
78 Correct 565 ms 42708 KB Output is correct
79 Correct 562 ms 42728 KB Output is correct
80 Correct 565 ms 42836 KB Output is correct
81 Correct 572 ms 42756 KB Output is correct
82 Correct 561 ms 42708 KB Output is correct
83 Correct 567 ms 42716 KB Output is correct
84 Correct 563 ms 42712 KB Output is correct
85 Correct 564 ms 43536 KB Output is correct
86 Correct 560 ms 42836 KB Output is correct
87 Correct 575 ms 42708 KB Output is correct
88 Correct 570 ms 42836 KB Output is correct
89 Correct 173 ms 23784 KB Output is correct
90 Correct 573 ms 42836 KB Output is correct
91 Correct 526 ms 42580 KB Output is correct
92 Correct 211 ms 24680 KB Output is correct
93 Correct 256 ms 29928 KB Output is correct
94 Correct 206 ms 24552 KB Output is correct
95 Correct 205 ms 24552 KB Output is correct
96 Correct 295 ms 30056 KB Output is correct
97 Correct 210 ms 24808 KB Output is correct
98 Correct 209 ms 24424 KB Output is correct
99 Correct 207 ms 24808 KB Output is correct
100 Correct 202 ms 24552 KB Output is correct