oj.uz

Submission #978092

# Submission time Handle Problem Language Result Execution time Memory
978092 2024-05-08T19:01:03 Z SeenSiravit Evacuation plan (IZhO18_plan) C++14
54 / 100
 4000 ms 27524 KB 
#include<bits/stdc++.h>

using namespace std;

const int mxN = 1e5 + 5;

int n,m,k;
vector<pair<int,int>> g[mxN];
bool npp[mxN];

int dis[mxN];

void dijkstra(){
    for(int i=1;i<=n;i++) dis[i] = INT_MAX;

    priority_queue<pair<int,int> , vector<pair<int,int>> , greater<pair<int,int>>> pq;

    for(int node=1;node<=n;node++){
        if(npp[node]){
            dis[node] = 0;
            pq.push({dis[node] , node});
        }
    }

    while(!pq.empty()){
        int u = pq.top().second;
        int w = pq.top().first;
        pq.pop();

        if(dis[u] < w) continue;

        for(auto [v , cost] : g[u] ){
            if(dis[v] > w + cost){
                dis[v] = w + cost;
                pq.push({dis[v] , v});
            }
        }
    }
}

int dis2[mxN];

void solve(int start_node , int end_node){
    
    // start_node or end_node is npp
    if(npp[start_node] || npp[end_node]){
        cout<< 0 << "\n";
        return ;
    }

    // direct road
    for(auto [v , cost] : g[start_node]){
        if(v == end_node){
            cout<< min(dis[start_node] , dis[end_node]) << "\n";
            return ;
        }
    }

    for(int i=1;i<=n;i++) dis2[i] = 0;
    
    dis2[start_node] = dis[start_node];

    priority_queue<pair<int,int>> pq;
    pq.push({dis2[start_node] , start_node});

    while(!pq.empty()){
        int u = pq.top().second;
        int w = pq.top().first;
        pq.pop();

        if(dis2[u] > w) continue;
        
        if(u == end_node){
            cout<< dis2[u] << "\n";
            return ;
        }

        for(auto [v , cost] : g[u]){
            if(dis2[v] < min(w , dis[v])){
                dis2[v] = min(w , dis[v]);
                pq.push({dis2[v] , v});
            }
        }
    }

    cout<< 0 << "\n";
}

int main(){
    ios::sync_with_stdio(0),cin.tie(0);

    cin>> n >> m;

    for(int i=0;i<m;i++){
        int u,v,w;
        cin>> u >> v >> w;

        g[u].push_back({v,w});
        g[v].push_back({u,w});
    }

    cin>> k;

    for(int i=1;i<=n;i++) npp[i] = false;

    for(int i=0;i<k;i++){
        int node;
        cin>> node;
        npp[node] = true;
    }

    dijkstra();

    // for(int i=1;i<=n;i++) cout<< dis[i] << " ";
    // cout<< "\n";

    int q;
    cin>> q;

    while(q--){
        int start_node , end_node;
        cin>> start_node >> end_node;
        solve(start_node , end_node);
    }

    return 0;
}

Compilation message

plan.cpp: In function 'void dijkstra()':
plan.cpp:32:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |         for(auto [v , cost] : g[u] ){
      |                  ^
plan.cpp: In function 'void solve(int, int)':
plan.cpp:52:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   52 |     for(auto [v , cost] : g[start_node]){
      |              ^
plan.cpp:78:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   78 |         for(auto [v , cost] : g[u]){
      |                  ^

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 2 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 2 ms 3672 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 2 ms 3420 KB Output is correct
11 Correct 2 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 2 ms 3420 KB Output is correct
14 Correct 2 ms 3416 KB Output is correct
15 Correct 1 ms 3416 KB Output is correct
16 Correct 58 ms 8484 KB Output is correct
17 Correct 213 ms 27316 KB Output is correct
18 Correct 16 ms 5632 KB Output is correct
19 Correct 906 ms 10980 KB Output is correct
20 Correct 233 ms 27524 KB Output is correct
21 Correct 95 ms 14896 KB Output is correct
22 Correct 49 ms 10292 KB Output is correct
23 Correct 223 ms 27392 KB Output is correct
24 Correct 206 ms 27356 KB Output is correct
25 Correct 203 ms 27172 KB Output is correct
26 Correct 917 ms 10704 KB Output is correct
27 Correct 844 ms 10692 KB Output is correct
28 Correct 841 ms 10692 KB Output is correct
29 Correct 847 ms 10716 KB Output is correct
30 Correct 978 ms 10704 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 10452 KB Output is correct
2 Correct 242 ms 18912 KB Output is correct
3 Correct 207 ms 18728 KB Output is correct
4 Correct 30 ms 6736 KB Output is correct
5 Correct 244 ms 18628 KB Output is correct
6 Correct 221 ms 18568 KB Output is correct
7 Correct 214 ms 18868 KB Output is correct
8 Correct 187 ms 18504 KB Output is correct
9 Correct 226 ms 18504 KB Output is correct
10 Correct 263 ms 18816 KB Output is correct
11 Correct 214 ms 18672 KB Output is correct
12 Correct 205 ms 18680 KB Output is correct
13 Correct 262 ms 18468 KB Output is correct
14 Correct 220 ms 18508 KB Output is correct
15 Correct 244 ms 19576 KB Output is correct
16 Correct 238 ms 18704 KB Output is correct
17 Correct 228 ms 18612 KB Output is correct
18 Correct 193 ms 18656 KB Output is correct
19 Correct 29 ms 6492 KB Output is correct
20 Correct 207 ms 18676 KB Output is correct
21 Correct 184 ms 18488 KB Output is correct
22 Correct 47 ms 9364 KB Output is correct
23 Correct 42 ms 7260 KB Output is correct
24 Correct 56 ms 9240 KB Output is correct
25 Correct 54 ms 9276 KB Output is correct
26 Correct 36 ms 7444 KB Output is correct
27 Correct 27 ms 6816 KB Output is correct
28 Correct 46 ms 9292 KB Output is correct
29 Correct 27 ms 6740 KB Output is correct
30 Correct 46 ms 9276 KB Output is correct
31 Correct 28 ms 6744 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 2 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 2 ms 3672 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 2 ms 3420 KB Output is correct
11 Correct 2 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 2 ms 3420 KB Output is correct
14 Correct 2 ms 3416 KB Output is correct
15 Correct 1 ms 3416 KB Output is correct
16 Correct 58 ms 8484 KB Output is correct
17 Correct 213 ms 27316 KB Output is correct
18 Correct 16 ms 5632 KB Output is correct
19 Correct 906 ms 10980 KB Output is correct
20 Correct 233 ms 27524 KB Output is correct
21 Correct 95 ms 14896 KB Output is correct
22 Correct 49 ms 10292 KB Output is correct
23 Correct 223 ms 27392 KB Output is correct
24 Correct 206 ms 27356 KB Output is correct
25 Correct 203 ms 27172 KB Output is correct
26 Correct 917 ms 10704 KB Output is correct
27 Correct 844 ms 10692 KB Output is correct
28 Correct 841 ms 10692 KB Output is correct
29 Correct 847 ms 10716 KB Output is correct
30 Correct 978 ms 10704 KB Output is correct
31 Correct 2 ms 3420 KB Output is correct
32 Correct 1 ms 3420 KB Output is correct
33 Correct 1 ms 3420 KB Output is correct
34 Correct 1 ms 3420 KB Output is correct
35 Correct 1 ms 3420 KB Output is correct
36 Correct 1 ms 3420 KB Output is correct
37 Correct 1 ms 3420 KB Output is correct
38 Correct 1 ms 3420 KB Output is correct
39 Correct 1 ms 3420 KB Output is correct
40 Correct 1 ms 3420 KB Output is correct
41 Correct 78 ms 10452 KB Output is correct
42 Correct 242 ms 18912 KB Output is correct
43 Correct 207 ms 18728 KB Output is correct
44 Correct 30 ms 6736 KB Output is correct
45 Correct 244 ms 18628 KB Output is correct
46 Correct 221 ms 18568 KB Output is correct
47 Correct 214 ms 18868 KB Output is correct
48 Correct 187 ms 18504 KB Output is correct
49 Correct 226 ms 18504 KB Output is correct
50 Correct 263 ms 18816 KB Output is correct
51 Correct 214 ms 18672 KB Output is correct
52 Correct 205 ms 18680 KB Output is correct
53 Correct 262 ms 18468 KB Output is correct
54 Correct 220 ms 18508 KB Output is correct
55 Correct 244 ms 19576 KB Output is correct
56 Correct 238 ms 18704 KB Output is correct
57 Correct 228 ms 18612 KB Output is correct
58 Correct 193 ms 18656 KB Output is correct
59 Correct 29 ms 6492 KB Output is correct
60 Correct 207 ms 18676 KB Output is correct
61 Correct 184 ms 18488 KB Output is correct
62 Correct 47 ms 9364 KB Output is correct
63 Correct 42 ms 7260 KB Output is correct
64 Correct 56 ms 9240 KB Output is correct
65 Correct 54 ms 9276 KB Output is correct
66 Correct 36 ms 7444 KB Output is correct
67 Correct 27 ms 6816 KB Output is correct
68 Correct 46 ms 9292 KB Output is correct
69 Correct 27 ms 6740 KB Output is correct
70 Correct 46 ms 9276 KB Output is correct
71 Correct 28 ms 6744 KB Output is correct
72 Execution timed out 4050 ms 14740 KB Time limit exceeded
73 Halted 0 ms 0 KB -