oj.uz

Submission #978103

# Submission time Handle Problem Language Result Execution time Memory
978103 2024-05-08T19:19:06 Z SeenSiravit Evacuation plan (IZhO18_plan) C++14
54 / 100
 4000 ms 25088 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_npp(){
    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 solve1(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 pa[mxN];

int fp(int x){
    if(x == pa[x]) return x;
    return pa[x] = fp(pa[x]);
}

vector<pair<int,int>> edge;

void solve2(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 ;
        }
    }

    int l=0 , r = min(dis[start_node] , dis[end_node]);
    int ans = 0;

    while(l <= r){
        int mid = (l + r) / 2;

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

        for(auto [u,v] : edge){
            int pa_u = fp(u) , pa_v = fp(v);
            
            if(pa_u == pa_v) continue;
            if(min(dis[u] , dis[v]) < mid) continue;

            pa[pa_v] = pa_u;

            if(fp(start_node) == fp(end_node)){
                break;
            }
        }

        if(fp(start_node) == fp(end_node)){
            ans = max(ans , mid);
            l = mid + 1;
        }else r = mid - 1;
    }

    cout<< ans << "\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});
    
        edge.push_back({u,v});
    }

    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_npp();

    // 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;
        solve2(start_node , end_node);
    }

    return 0;
}

Compilation message

plan.cpp: In function 'void dijkstra_npp()':
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 solve1(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]){
      |                  ^
plan.cpp: In function 'void solve2(int, int)':
plan.cpp:106:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  106 |     for(auto [v , cost] : g[start_node]){
      |              ^
plan.cpp:121:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  121 |         for(auto [u,v] : edge){
      |                  ^

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4184 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 1 ms 3676 KB Output is correct
5 Correct 2 ms 3932 KB Output is correct
6 Correct 2 ms 3932 KB Output is correct
7 Correct 2 ms 3676 KB Output is correct
8 Correct 1 ms 3676 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 2 ms 3932 KB Output is correct
11 Correct 2 ms 3932 KB Output is correct
12 Correct 2 ms 3932 KB Output is correct
13 Correct 2 ms 4184 KB Output is correct
14 Correct 2 ms 3956 KB Output is correct
15 Correct 2 ms 3928 KB Output is correct
16 Correct 68 ms 9168 KB Output is correct
17 Correct 224 ms 24248 KB Output is correct
18 Correct 16 ms 5584 KB Output is correct
19 Correct 888 ms 10072 KB Output is correct
20 Correct 238 ms 24076 KB Output is correct
21 Correct 97 ms 13500 KB Output is correct
22 Correct 61 ms 8536 KB Output is correct
23 Correct 219 ms 24064 KB Output is correct
24 Correct 256 ms 24348 KB Output is correct
25 Correct 213 ms 23992 KB Output is correct
26 Correct 851 ms 10040 KB Output is correct
27 Correct 860 ms 10044 KB Output is correct
28 Correct 871 ms 10044 KB Output is correct
29 Correct 869 ms 10128 KB Output is correct
30 Correct 858 ms 10120 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 12992 KB Output is correct
2 Correct 231 ms 23836 KB Output is correct
3 Correct 250 ms 24036 KB Output is correct
4 Correct 41 ms 7884 KB Output is correct
5 Correct 197 ms 23988 KB Output is correct
6 Correct 256 ms 23912 KB Output is correct
7 Correct 200 ms 23788 KB Output is correct
8 Correct 205 ms 23992 KB Output is correct
9 Correct 234 ms 24016 KB Output is correct
10 Correct 211 ms 23996 KB Output is correct
11 Correct 196 ms 23992 KB Output is correct
12 Correct 217 ms 23892 KB Output is correct
13 Correct 200 ms 23992 KB Output is correct
14 Correct 223 ms 23856 KB Output is correct
15 Correct 229 ms 25088 KB Output is correct
16 Correct 201 ms 23988 KB Output is correct
17 Correct 210 ms 23860 KB Output is correct
18 Correct 211 ms 23936 KB Output is correct
19 Correct 30 ms 7632 KB Output is correct
20 Correct 219 ms 23980 KB Output is correct
21 Correct 183 ms 23468 KB Output is correct
22 Correct 45 ms 10052 KB Output is correct
23 Correct 39 ms 8304 KB Output is correct
24 Correct 41 ms 10052 KB Output is correct
25 Correct 39 ms 10044 KB Output is correct
26 Correct 49 ms 8648 KB Output is correct
27 Correct 41 ms 7876 KB Output is correct
28 Correct 39 ms 10052 KB Output is correct
29 Correct 41 ms 8000 KB Output is correct
30 Correct 39 ms 10052 KB Output is correct
31 Correct 40 ms 7748 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4184 KB Output is correct
2 Correct 2 ms 3932 KB Output is correct
3 Correct 2 ms 3932 KB Output is correct
4 Correct 1 ms 3676 KB Output is correct
5 Correct 2 ms 3932 KB Output is correct
6 Correct 2 ms 3932 KB Output is correct
7 Correct 2 ms 3676 KB Output is correct
8 Correct 1 ms 3676 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 2 ms 3932 KB Output is correct
11 Correct 2 ms 3932 KB Output is correct
12 Correct 2 ms 3932 KB Output is correct
13 Correct 2 ms 4184 KB Output is correct
14 Correct 2 ms 3956 KB Output is correct
15 Correct 2 ms 3928 KB Output is correct
16 Correct 68 ms 9168 KB Output is correct
17 Correct 224 ms 24248 KB Output is correct
18 Correct 16 ms 5584 KB Output is correct
19 Correct 888 ms 10072 KB Output is correct
20 Correct 238 ms 24076 KB Output is correct
21 Correct 97 ms 13500 KB Output is correct
22 Correct 61 ms 8536 KB Output is correct
23 Correct 219 ms 24064 KB Output is correct
24 Correct 256 ms 24348 KB Output is correct
25 Correct 213 ms 23992 KB Output is correct
26 Correct 851 ms 10040 KB Output is correct
27 Correct 860 ms 10044 KB Output is correct
28 Correct 871 ms 10044 KB Output is correct
29 Correct 869 ms 10128 KB Output is correct
30 Correct 858 ms 10120 KB Output is correct
31 Correct 1 ms 3676 KB Output is correct
32 Correct 1 ms 3676 KB Output is correct
33 Correct 1 ms 3676 KB Output is correct
34 Correct 1 ms 3676 KB Output is correct
35 Correct 1 ms 3676 KB Output is correct
36 Correct 1 ms 3672 KB Output is correct
37 Correct 1 ms 3676 KB Output is correct
38 Correct 1 ms 3676 KB Output is correct
39 Correct 1 ms 3676 KB Output is correct
40 Correct 1 ms 3676 KB Output is correct
41 Correct 101 ms 12992 KB Output is correct
42 Correct 231 ms 23836 KB Output is correct
43 Correct 250 ms 24036 KB Output is correct
44 Correct 41 ms 7884 KB Output is correct
45 Correct 197 ms 23988 KB Output is correct
46 Correct 256 ms 23912 KB Output is correct
47 Correct 200 ms 23788 KB Output is correct
48 Correct 205 ms 23992 KB Output is correct
49 Correct 234 ms 24016 KB Output is correct
50 Correct 211 ms 23996 KB Output is correct
51 Correct 196 ms 23992 KB Output is correct
52 Correct 217 ms 23892 KB Output is correct
53 Correct 200 ms 23992 KB Output is correct
54 Correct 223 ms 23856 KB Output is correct
55 Correct 229 ms 25088 KB Output is correct
56 Correct 201 ms 23988 KB Output is correct
57 Correct 210 ms 23860 KB Output is correct
58 Correct 211 ms 23936 KB Output is correct
59 Correct 30 ms 7632 KB Output is correct
60 Correct 219 ms 23980 KB Output is correct
61 Correct 183 ms 23468 KB Output is correct
62 Correct 45 ms 10052 KB Output is correct
63 Correct 39 ms 8304 KB Output is correct
64 Correct 41 ms 10052 KB Output is correct
65 Correct 39 ms 10044 KB Output is correct
66 Correct 49 ms 8648 KB Output is correct
67 Correct 41 ms 7876 KB Output is correct
68 Correct 39 ms 10052 KB Output is correct
69 Correct 41 ms 8000 KB Output is correct
70 Correct 39 ms 10052 KB Output is correct
71 Correct 40 ms 7748 KB Output is correct
72 Execution timed out 4061 ms 12836 KB Time limit exceeded
73 Halted 0 ms 0 KB -