제출 #1009879

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1009879		Mardonbekhazratov	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	412 ms	66260 KiB

crocodile

#include "crocodile.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;

vector<bool>vis;
vector<vector<pair<int,int>>>v;
vector<priority_queue<int>>dp;

const int INF=1e9;


int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    vis.assign(N,false);
    v.resize(N);
    for(int i=0;i<M;i++){
        v[R[i][0]].push_back({R[i][1],L[i]});
        v[R[i][1]].push_back({R[i][0],L[i]});
    }
    dp.resize(N);
    priority_queue<pair<int,int>>q;
    vector<int>ans(N);
    for(int i=0;i<K;i++){
        q.push({0,P[i]});
        dp[P[i]].push(0);
        ans[P[i]]=0;
    }
    while(!q.empty()){
        auto [d,x]=q.top();
        q.pop();
        if(vis[x]) continue;
        vis[x]=true;
        d=-d;
        ans[x]=d;
        for(auto [z,w]:v[x]){
            if(vis[z]) continue;
            if(dp[z].size()<2){
                dp[z].push(d+w);
            }
            else if(d+w<dp[z].top()){
                dp[z].pop();
                dp[z].push(d+w);
            }
            if(dp[z].size()==2){
                q.push({-dp[z].top(),z});
            }
        }
    }
    return ans[0];
}

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