oj.uz

Submission #338450

# Submission time Handle Problem Language Result Execution time Memory
338450 2020-12-23T07:12:38 Z BY_KUTBILIM Evacuation plan (IZhO18_plan) C++14
23 / 100
 637 ms 19428 KB 
/** @BY_KUTBILIM **/
#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).end()

const int inf = (int)1e9+7;

vector<vector<pair<int,int>>> g;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie();

    int n, m;
    cin >> n >> m;
    g.resize(n);
    for(int i = 0; i < m; i++){
        int u, v, w;
        cin >> v >> u >> w;
        v--;
        u--;
        g[v].pb({u, w});
        g[u].pb({v, w});
    }
    int k;
    cin >> k;
    int r[k];
    priority_queue<pair<int,int>> q;
    vector<int> d(n, inf), used(n, 0);
    for(int i = 0; i < k; i++){
        cin >> r[i];
        r[i]--;
        q.push({0, r[i]});
        d[r[i]] = 0;
    }
    while(!q.empty()){
        int a = q.top().second; q.pop();
        if(used[a]) continue;
        for(auto u : g[a]){
            int b = u.first, w = u.second;
            if(d[a] + w < d[b]){
                d[b] = d[a] + w;
                q.push({-d[b], b});
            }
        }
    }
    int Q;
    cin >> Q;
    while(Q--){
        int s, t;
        cin >> s >> t;
        s--;
        t--;
        cout << min(d[t], d[s]) << endl;
    }
    
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 35 ms 364 KB Output is correct
16 Correct 320 ms 7404 KB Output is correct
17 Correct 631 ms 19428 KB Output is correct
18 Correct 46 ms 2540 KB Output is correct
19 Correct 320 ms 9184 KB Output is correct
20 Correct 633 ms 19172 KB Output is correct
21 Correct 408 ms 11628 KB Output is correct
22 Correct 305 ms 7788 KB Output is correct
23 Correct 634 ms 19172 KB Output is correct
24 Correct 637 ms 19176 KB Output is correct
25 Correct 632 ms 19172 KB Output is correct
26 Correct 319 ms 9320 KB Output is correct
27 Correct 327 ms 9184 KB Output is correct
28 Correct 323 ms 9184 KB Output is correct
29 Correct 320 ms 9324 KB Output is correct
30 Correct 321 ms 9184 KB Output is correct

Subtask #3
0 / 12.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 3 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 35 ms 364 KB Output is correct
16 Correct 320 ms 7404 KB Output is correct
17 Correct 631 ms 19428 KB Output is correct
18 Correct 46 ms 2540 KB Output is correct
19 Correct 320 ms 9184 KB Output is correct
20 Correct 633 ms 19172 KB Output is correct
21 Correct 408 ms 11628 KB Output is correct
22 Correct 305 ms 7788 KB Output is correct
23 Correct 634 ms 19172 KB Output is correct
24 Correct 637 ms 19176 KB Output is correct
25 Correct 632 ms 19172 KB Output is correct
26 Correct 319 ms 9320 KB Output is correct
27 Correct 327 ms 9184 KB Output is correct
28 Correct 323 ms 9184 KB Output is correct
29 Correct 320 ms 9324 KB Output is correct
30 Correct 321 ms 9184 KB Output is correct
31 Incorrect 1 ms 364 KB Output isn't correct
32 Halted 0 ms 0 KB -