oj.uz

Submission #81528

# Submission time Handle Problem Language Result Execution time Memory
81528 2018-10-25T08:21:49 Z inom Evacuation plan (IZhO18_plan) C++14
23 / 100
 1547 ms 31912 KB 
#include <bits/stdc++.h>
 
#define fi first
#define se second
#define pb push_back
#define int long long
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);

using namespace std;
  
const int N = 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e9;

int TN = 1;

int n, m;
int k, Q;
int d[N];
vector<pair<int, int>> verr[N];

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y, len;
        cin >> x >> y >> len;
        verr[x].push_back({y, len});
        verr[y].push_back({x, len});
    }
    cin >> k;
    for (int i = 1; i <= k; i++) {
        int x;
        cin >> x;
        verr[0].pb({x, 0});
    }
    for (int i = 0; i < N; i++) {
        d[i] = INF;
    }
    d[0] = 0;
    set<pair<int, int>> q;
    q.insert({d[0], 0});
    while (!q.empty()) {
        int x = q.begin()->se;
        q.erase(q.begin());
        for (auto i: verr[x]) {
            int to = i.fi, len = i.se;
            if (d[x] + len < d[to]) {
                q.erase({d[to], to});
                d[to] = d[x] + len;
                q.insert({d[to], to});
            }
        }
    }
    cin >> Q;
    while (Q--) {
        int x, y;
        cin >> x >> y;
        cout << min(d[x], d[y]) << "\n";
    }
    return;
}

signed main() {
    // ios_base::sync_with_stdio(0);
    // in; out; // cin >> TN;
    while (TN--) solve();
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3448 KB Output is correct
2 Correct 9 ms 3576 KB Output is correct
3 Correct 9 ms 3540 KB Output is correct
4 Correct 4 ms 3448 KB Output is correct
5 Correct 9 ms 3576 KB Output is correct
6 Correct 10 ms 3556 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 5 ms 3448 KB Output is correct
9 Correct 9 ms 3448 KB Output is correct
10 Correct 10 ms 3576 KB Output is correct
11 Correct 9 ms 3448 KB Output is correct
12 Correct 10 ms 3548 KB Output is correct
13 Correct 10 ms 3576 KB Output is correct
14 Correct 9 ms 3448 KB Output is correct
15 Correct 9 ms 3588 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3448 KB Output is correct
2 Correct 9 ms 3576 KB Output is correct
3 Correct 9 ms 3540 KB Output is correct
4 Correct 4 ms 3448 KB Output is correct
5 Correct 9 ms 3576 KB Output is correct
6 Correct 10 ms 3556 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 5 ms 3448 KB Output is correct
9 Correct 9 ms 3448 KB Output is correct
10 Correct 10 ms 3576 KB Output is correct
11 Correct 9 ms 3448 KB Output is correct
12 Correct 10 ms 3548 KB Output is correct
13 Correct 10 ms 3576 KB Output is correct
14 Correct 9 ms 3448 KB Output is correct
15 Correct 9 ms 3588 KB Output is correct
16 Correct 598 ms 10676 KB Output is correct
17 Correct 1503 ms 31608 KB Output is correct
18 Correct 115 ms 5960 KB Output is correct
19 Correct 609 ms 14820 KB Output is correct
20 Correct 1496 ms 31776 KB Output is correct
21 Correct 880 ms 18716 KB Output is correct
22 Correct 566 ms 9160 KB Output is correct
23 Correct 1547 ms 31576 KB Output is correct
24 Correct 1530 ms 31704 KB Output is correct
25 Correct 1528 ms 31912 KB Output is correct
26 Correct 605 ms 14620 KB Output is correct
27 Correct 610 ms 14848 KB Output is correct
28 Correct 634 ms 14744 KB Output is correct
29 Correct 611 ms 14868 KB Output is correct
30 Correct 611 ms 14820 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 3448 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 493 ms 16416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3448 KB Output is correct
2 Correct 9 ms 3576 KB Output is correct
3 Correct 9 ms 3540 KB Output is correct
4 Correct 4 ms 3448 KB Output is correct
5 Correct 9 ms 3576 KB Output is correct
6 Correct 10 ms 3556 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 5 ms 3448 KB Output is correct
9 Correct 9 ms 3448 KB Output is correct
10 Correct 10 ms 3576 KB Output is correct
11 Correct 9 ms 3448 KB Output is correct
12 Correct 10 ms 3548 KB Output is correct
13 Correct 10 ms 3576 KB Output is correct
14 Correct 9 ms 3448 KB Output is correct
15 Correct 9 ms 3588 KB Output is correct
16 Correct 598 ms 10676 KB Output is correct
17 Correct 1503 ms 31608 KB Output is correct
18 Correct 115 ms 5960 KB Output is correct
19 Correct 609 ms 14820 KB Output is correct
20 Correct 1496 ms 31776 KB Output is correct
21 Correct 880 ms 18716 KB Output is correct
22 Correct 566 ms 9160 KB Output is correct
23 Correct 1547 ms 31576 KB Output is correct
24 Correct 1530 ms 31704 KB Output is correct
25 Correct 1528 ms 31912 KB Output is correct
26 Correct 605 ms 14620 KB Output is correct
27 Correct 610 ms 14848 KB Output is correct
28 Correct 634 ms 14744 KB Output is correct
29 Correct 611 ms 14868 KB Output is correct
30 Correct 611 ms 14820 KB Output is correct
31 Incorrect 5 ms 3448 KB Output isn't correct
32 Halted 0 ms 0 KB -