oj.uz

답안 #978101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978101 2024-05-08T19:15:57 Z SeenSiravit Evacuation plan (IZhO18_plan) C++14
41 / 100
 4000 ms 24824 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){
    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:107:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  107 |         for(auto [u,v] : edge){
      |                  ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3676 KB Output is correct
2 Correct 17 ms 3968 KB Output is correct
3 Correct 11 ms 3932 KB Output is correct
4 Correct 1 ms 3676 KB Output is correct
5 Correct 7 ms 3932 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 1 ms 3676 KB Output is correct
8 Correct 1 ms 3676 KB Output is correct
9 Correct 28 ms 3960 KB Output is correct
10 Correct 4 ms 3932 KB Output is correct
11 Correct 26 ms 3964 KB Output is correct
12 Correct 14 ms 3932 KB Output is correct
13 Correct 20 ms 3932 KB Output is correct
14 Correct 30 ms 3932 KB Output is correct
15 Correct 28 ms 3932 KB Output is correct

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3676 KB Output is correct
2 Correct 17 ms 3968 KB Output is correct
3 Correct 11 ms 3932 KB Output is correct
4 Correct 1 ms 3676 KB Output is correct
5 Correct 7 ms 3932 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 1 ms 3676 KB Output is correct
8 Correct 1 ms 3676 KB Output is correct
9 Correct 28 ms 3960 KB Output is correct
10 Correct 4 ms 3932 KB Output is correct
11 Correct 26 ms 3964 KB Output is correct
12 Correct 14 ms 3932 KB Output is correct
13 Correct 20 ms 3932 KB Output is correct
14 Correct 30 ms 3932 KB Output is correct
15 Correct 28 ms 3932 KB Output is correct
16 Execution timed out 4035 ms 9036 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 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 2 ms 3676 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

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 12932 KB Output is correct
2 Correct 201 ms 23992 KB Output is correct
3 Correct 235 ms 23988 KB Output is correct
4 Correct 41 ms 7880 KB Output is correct
5 Correct 207 ms 23992 KB Output is correct
6 Correct 275 ms 23924 KB Output is correct
7 Correct 218 ms 23880 KB Output is correct
8 Correct 210 ms 23872 KB Output is correct
9 Correct 208 ms 23964 KB Output is correct
10 Correct 216 ms 23992 KB Output is correct
11 Correct 200 ms 23936 KB Output is correct
12 Correct 217 ms 23928 KB Output is correct
13 Correct 210 ms 23772 KB Output is correct
14 Correct 221 ms 23852 KB Output is correct
15 Correct 233 ms 24824 KB Output is correct
16 Correct 202 ms 23988 KB Output is correct
17 Correct 239 ms 24060 KB Output is correct
18 Correct 277 ms 23800 KB Output is correct
19 Correct 31 ms 7888 KB Output is correct
20 Correct 208 ms 23860 KB Output is correct
21 Correct 175 ms 23504 KB Output is correct
22 Correct 41 ms 10044 KB Output is correct
23 Correct 41 ms 8392 KB Output is correct
24 Correct 42 ms 10048 KB Output is correct
25 Correct 67 ms 10052 KB Output is correct
26 Correct 52 ms 8648 KB Output is correct
27 Correct 43 ms 7876 KB Output is correct
28 Correct 40 ms 10048 KB Output is correct
29 Correct 45 ms 7888 KB Output is correct
30 Correct 44 ms 10044 KB Output is correct
31 Correct 44 ms 7936 KB Output is correct

Subtask #5
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3676 KB Output is correct
2 Correct 17 ms 3968 KB Output is correct
3 Correct 11 ms 3932 KB Output is correct
4 Correct 1 ms 3676 KB Output is correct
5 Correct 7 ms 3932 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 1 ms 3676 KB Output is correct
8 Correct 1 ms 3676 KB Output is correct
9 Correct 28 ms 3960 KB Output is correct
10 Correct 4 ms 3932 KB Output is correct
11 Correct 26 ms 3964 KB Output is correct
12 Correct 14 ms 3932 KB Output is correct
13 Correct 20 ms 3932 KB Output is correct
14 Correct 30 ms 3932 KB Output is correct
15 Correct 28 ms 3932 KB Output is correct
16 Execution timed out 4035 ms 9036 KB Time limit exceeded
17 Halted 0 ms 0 KB -