oj.uz

답안 #255721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255721 2020-08-01T17:25:44 Z karma Evacuation plan (IZhO18_plan) C++14
100 / 100
 658 ms 110108 KB 
#include <bits/stdc++.h>
#define pb          emplace_back
#define ll          long long
#define fi          first
#define se          second
#define mp          make_pair
//#define int         int64_t

using namespace std;

const int N = int(5e5) + 7;
const int inf = 1e9 + 1;
typedef pair<ll, ll> pii;

int n, m, k, d[N], q, u, v, w;
vector<pii> adj[N];

struct TEdges {
    int u, v, w;
    TEdges() {u = v = w = 0;}
    TEdges(int u, int v, int w): u(u), v(v), w(w) {}
    bool operator < (const TEdges& x)const& {
        return w > x.w;
    }
};
vector<TEdges> edges;
priority_queue<pii, vector<pii>, greater<pii>> pq;

int lab[N];
int find(int x) {return lab[x] < 0? x: lab[x] = find(lab[x]);}
bool uni(int x, int y) {
    x = find(x), y = find(y);
    if(x == y) return 0;
    if(lab[x] > lab[y]) swap(x, y);
    lab[x] += lab[y], lab[y] = x;
    return 1;
}

const int logN = 20;
int p[N][logN + 1], mn[N][logN + 1], h[N];
void dfs(int u) {
    for(int i = 1; i <= logN; ++i) {
        p[u][i] = p[p[u][i - 1]][i - 1];
        mn[u][i] = min(mn[u][i - 1], mn[p[u][i - 1]][i - 1]);
    }
    for(auto& v: adj[u]) {
        if(v.fi == p[u][0]) continue;
        p[v.fi][0] = u;
        mn[v.fi][0] = v.se;
        h[v.fi] = h[u] + 1;
        dfs(v.fi);
    }
}

int get_min(int u, int v) {
    if(h[u] < h[v]) swap(u, v);
    int res = inf;
    for(int i = logN; i >= 0; --i) {
        if(h[u] - (1 << i) >= h[v]) {
            res = min(res, mn[u][i]);
            u = p[u][i];
        }
    }
    if(u == v) return res;
    for(int i = logN; i >= 0; --i) {
        if(p[u][i] != p[v][i]) {
            res = min({res, mn[u][i], mn[v][i]});
            u = p[u][i], v = p[v][i];
        }
    }
    res = min({res, mn[u][0], mn[v][0]});
    return res;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define Task        "test"
    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }
    cin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        cin >> u >> v >> w;
        adj[u].pb(v, w);
        adj[v].pb(u, w);
        edges.pb(u, v, w);
    }
    fill_n(&mn[0][0], N * (logN + 1), inf);
    fill(lab, lab + n + 1, -1);
    fill(d, d + n + 1, inf);
    cin >> k;
    for(int i = 1; i <= k; ++i) {
        cin >> u;
        d[u] = 0, pq.emplace(d[u], u);
    }
    pii top;
    while(pq.size()) {
        top = pq.top(); pq.pop();
        if(top.fi != d[top.se]) continue;
        for(auto& v: adj[top.se]) {
            if(top.fi + v.se < d[v.fi]) {
                d[v.fi] = top.fi + v.se;
                pq.emplace(d[v.fi], v.fi);
            }
        }
    }
    for(auto& e: edges) e.w = min(d[e.u], d[e.v]);
    sort(edges.begin(), edges.end());
    for(int i = 1; i <= n; ++i) adj[i].clear();
    for(auto &e: edges) {
        if(uni(e.u, e.v)) {
            adj[e.u].pb(e.v, e.w);
            adj[e.v].pb(e.u, e.w);
        }
    }
    dfs(1);
    cin >> q;
    while(q --) {
        cin >> u >> v;
        cout << get_min(u, v) << '\n';
    }
}

Compilation message

plan.cpp: In function 'int32_t main()':
plan.cpp:80:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
plan.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(Task".out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 53240 KB Output is correct
2 Correct 32 ms 53504 KB Output is correct
3 Correct 32 ms 53496 KB Output is correct
4 Correct 30 ms 53240 KB Output is correct
5 Correct 32 ms 53368 KB Output is correct
6 Correct 32 ms 53368 KB Output is correct
7 Correct 34 ms 53240 KB Output is correct
8 Correct 30 ms 53248 KB Output is correct
9 Correct 35 ms 53376 KB Output is correct
10 Correct 33 ms 53376 KB Output is correct
11 Correct 32 ms 53368 KB Output is correct
12 Correct 31 ms 53368 KB Output is correct
13 Correct 31 ms 53368 KB Output is correct
14 Correct 32 ms 53372 KB Output is correct
15 Correct 32 ms 53368 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 53240 KB Output is correct
2 Correct 32 ms 53504 KB Output is correct
3 Correct 32 ms 53496 KB Output is correct
4 Correct 30 ms 53240 KB Output is correct
5 Correct 32 ms 53368 KB Output is correct
6 Correct 32 ms 53368 KB Output is correct
7 Correct 34 ms 53240 KB Output is correct
8 Correct 30 ms 53248 KB Output is correct
9 Correct 35 ms 53376 KB Output is correct
10 Correct 33 ms 53376 KB Output is correct
11 Correct 32 ms 53368 KB Output is correct
12 Correct 31 ms 53368 KB Output is correct
13 Correct 31 ms 53368 KB Output is correct
14 Correct 32 ms 53372 KB Output is correct
15 Correct 32 ms 53368 KB Output is correct
16 Correct 232 ms 71288 KB Output is correct
17 Correct 658 ms 107928 KB Output is correct
18 Correct 65 ms 58288 KB Output is correct
19 Correct 189 ms 73492 KB Output is correct
20 Correct 602 ms 108184 KB Output is correct
21 Correct 337 ms 84092 KB Output is correct
22 Correct 217 ms 76844 KB Output is correct
23 Correct 629 ms 107952 KB Output is correct
24 Correct 596 ms 107940 KB Output is correct
25 Correct 618 ms 108012 KB Output is correct
26 Correct 191 ms 73248 KB Output is correct
27 Correct 189 ms 73360 KB Output is correct
28 Correct 185 ms 73236 KB Output is correct
29 Correct 189 ms 73388 KB Output is correct
30 Correct 195 ms 73620 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 53240 KB Output is correct
2 Correct 30 ms 53248 KB Output is correct
3 Correct 35 ms 53240 KB Output is correct
4 Correct 31 ms 53240 KB Output is correct
5 Correct 30 ms 53240 KB Output is correct
6 Correct 32 ms 53248 KB Output is correct
7 Correct 32 ms 53240 KB Output is correct
8 Correct 39 ms 53240 KB Output is correct
9 Correct 31 ms 53240 KB Output is correct
10 Correct 35 ms 53240 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 298 ms 80928 KB Output is correct
2 Correct 514 ms 106256 KB Output is correct
3 Correct 531 ms 106264 KB Output is correct
4 Correct 172 ms 73000 KB Output is correct
5 Correct 529 ms 106264 KB Output is correct
6 Correct 533 ms 106264 KB Output is correct
7 Correct 517 ms 106392 KB Output is correct
8 Correct 531 ms 106264 KB Output is correct
9 Correct 532 ms 106264 KB Output is correct
10 Correct 522 ms 106264 KB Output is correct
11 Correct 529 ms 106268 KB Output is correct
12 Correct 564 ms 106244 KB Output is correct
13 Correct 554 ms 106264 KB Output is correct
14 Correct 519 ms 106264 KB Output is correct
15 Correct 534 ms 108440 KB Output is correct
16 Correct 524 ms 106264 KB Output is correct
17 Correct 528 ms 106276 KB Output is correct
18 Correct 530 ms 106264 KB Output is correct
19 Correct 167 ms 74540 KB Output is correct
20 Correct 535 ms 106264 KB Output is correct
21 Correct 520 ms 106244 KB Output is correct
22 Correct 142 ms 71820 KB Output is correct
23 Correct 153 ms 70952 KB Output is correct
24 Correct 142 ms 71824 KB Output is correct
25 Correct 143 ms 71828 KB Output is correct
26 Correct 164 ms 71468 KB Output is correct
27 Correct 177 ms 74536 KB Output is correct
28 Correct 141 ms 71956 KB Output is correct
29 Correct 174 ms 73644 KB Output is correct
30 Correct 152 ms 71828 KB Output is correct
31 Correct 171 ms 73768 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 53240 KB Output is correct
2 Correct 32 ms 53504 KB Output is correct
3 Correct 32 ms 53496 KB Output is correct
4 Correct 30 ms 53240 KB Output is correct
5 Correct 32 ms 53368 KB Output is correct
6 Correct 32 ms 53368 KB Output is correct
7 Correct 34 ms 53240 KB Output is correct
8 Correct 30 ms 53248 KB Output is correct
9 Correct 35 ms 53376 KB Output is correct
10 Correct 33 ms 53376 KB Output is correct
11 Correct 32 ms 53368 KB Output is correct
12 Correct 31 ms 53368 KB Output is correct
13 Correct 31 ms 53368 KB Output is correct
14 Correct 32 ms 53372 KB Output is correct
15 Correct 32 ms 53368 KB Output is correct
16 Correct 232 ms 71288 KB Output is correct
17 Correct 658 ms 107928 KB Output is correct
18 Correct 65 ms 58288 KB Output is correct
19 Correct 189 ms 73492 KB Output is correct
20 Correct 602 ms 108184 KB Output is correct
21 Correct 337 ms 84092 KB Output is correct
22 Correct 217 ms 76844 KB Output is correct
23 Correct 629 ms 107952 KB Output is correct
24 Correct 596 ms 107940 KB Output is correct
25 Correct 618 ms 108012 KB Output is correct
26 Correct 191 ms 73248 KB Output is correct
27 Correct 189 ms 73360 KB Output is correct
28 Correct 185 ms 73236 KB Output is correct
29 Correct 189 ms 73388 KB Output is correct
30 Correct 195 ms 73620 KB Output is correct
31 Correct 35 ms 53240 KB Output is correct
32 Correct 30 ms 53248 KB Output is correct
33 Correct 35 ms 53240 KB Output is correct
34 Correct 31 ms 53240 KB Output is correct
35 Correct 30 ms 53240 KB Output is correct
36 Correct 32 ms 53248 KB Output is correct
37 Correct 32 ms 53240 KB Output is correct
38 Correct 39 ms 53240 KB Output is correct
39 Correct 31 ms 53240 KB Output is correct
40 Correct 35 ms 53240 KB Output is correct
41 Correct 298 ms 80928 KB Output is correct
42 Correct 514 ms 106256 KB Output is correct
43 Correct 531 ms 106264 KB Output is correct
44 Correct 172 ms 73000 KB Output is correct
45 Correct 529 ms 106264 KB Output is correct
46 Correct 533 ms 106264 KB Output is correct
47 Correct 517 ms 106392 KB Output is correct
48 Correct 531 ms 106264 KB Output is correct
49 Correct 532 ms 106264 KB Output is correct
50 Correct 522 ms 106264 KB Output is correct
51 Correct 529 ms 106268 KB Output is correct
52 Correct 564 ms 106244 KB Output is correct
53 Correct 554 ms 106264 KB Output is correct
54 Correct 519 ms 106264 KB Output is correct
55 Correct 534 ms 108440 KB Output is correct
56 Correct 524 ms 106264 KB Output is correct
57 Correct 528 ms 106276 KB Output is correct
58 Correct 530 ms 106264 KB Output is correct
59 Correct 167 ms 74540 KB Output is correct
60 Correct 535 ms 106264 KB Output is correct
61 Correct 520 ms 106244 KB Output is correct
62 Correct 142 ms 71820 KB Output is correct
63 Correct 153 ms 70952 KB Output is correct
64 Correct 142 ms 71824 KB Output is correct
65 Correct 143 ms 71828 KB Output is correct
66 Correct 164 ms 71468 KB Output is correct
67 Correct 177 ms 74536 KB Output is correct
68 Correct 141 ms 71956 KB Output is correct
69 Correct 174 ms 73644 KB Output is correct
70 Correct 152 ms 71828 KB Output is correct
71 Correct 171 ms 73768 KB Output is correct
72 Correct 391 ms 82724 KB Output is correct
73 Correct 633 ms 107932 KB Output is correct
74 Correct 590 ms 107928 KB Output is correct
75 Correct 616 ms 107896 KB Output is correct
76 Correct 595 ms 108020 KB Output is correct
77 Correct 587 ms 108060 KB Output is correct
78 Correct 631 ms 108056 KB Output is correct
79 Correct 599 ms 107800 KB Output is correct
80 Correct 606 ms 107928 KB Output is correct
81 Correct 593 ms 108064 KB Output is correct
82 Correct 628 ms 107876 KB Output is correct
83 Correct 643 ms 107928 KB Output is correct
84 Correct 599 ms 108164 KB Output is correct
85 Correct 584 ms 110108 KB Output is correct
86 Correct 594 ms 108056 KB Output is correct
87 Correct 593 ms 107800 KB Output is correct
88 Correct 593 ms 108024 KB Output is correct
89 Correct 293 ms 75944 KB Output is correct
90 Correct 599 ms 107928 KB Output is correct
91 Correct 544 ms 107552 KB Output is correct
92 Correct 200 ms 73352 KB Output is correct
93 Correct 266 ms 73256 KB Output is correct
94 Correct 211 ms 73236 KB Output is correct
95 Correct 207 ms 73460 KB Output is correct
96 Correct 261 ms 73248 KB Output is correct
97 Correct 297 ms 74920 KB Output is correct
98 Correct 209 ms 73360 KB Output is correct
99 Correct 315 ms 76220 KB Output is correct
100 Correct 214 ms 73492 KB Output is correct