Submission #753574

#	Time	Username	Problem	Language	Result	Execution time	Memory
753574		nonono	Crocodile's Underground City (IOI11_crocodile)	C++17	0 / 100	1 ms	212 KiB

crocodile

#include "crocodile.h"
#include "bits/stdc++.h"
using namespace std;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    vector<pair<int, int>> adj[N];
    
    for(int i = 0; i < M; i ++){
        adj[R[i][0]].push_back({R[i][1], L[i]});
        adj[R[i][1]].push_back({R[i][0], L[i]});
    }
    
    int T[N];
    for(int i = 0; i < N; i ++) T[i] = 0;
    
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    
    for(int i = 0; i < K; i ++){
        pq.push({0, P[i]});
        T[P[i]] = 2;
    }
    
    while(!pq.empty()){
        int u = pq.top().second;
        int du = pq.top().first;
        pq.pop();
        
        T[u] ++ ;
        if(T[u] == 2){
            if(!u) return du;
            
            for(auto [v, w] : adj[u]){
                if(T[v] >= 2) continue ;
                pq.push({du + w, v});
            }
        }
    }
    
    return -1;
}

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11