| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1172691 | jadai007 | Crocodile's Underground City (IOI11_crocodile) | C++20 | 0 ms | 0 KiB |
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
/*#define MAX_N 50000
#define MAX_M 10000000
static int N, M;
static int R[MAX_M][2];
static int L[MAX_M];
static int K;
static int P[MAX_N];
static int solution;
inline
void my_assert(int e) {if (!e) abort();}
void read_input()
{
int i;
my_assert(3==scanf("%d %d %d",&N,&M,&K));
for(i=0; i<M; i++)
my_assert(3==scanf("%d %d %d",&R[i][0],&R[i][1],&L[i]));
for(i=0; i<K; i++)
my_assert(1==scanf("%d",&P[i]));
my_assert(1==scanf("%d",&solution));
}
*/
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
vector<int> vc[N];
int dis[N];
for(int i = 0; i < N; ++i) dis[i] = 1e9 + 7;
for(int i = 0; i < M; ++i) vc[R[i][0]].emplace_back(R[i][1], L[i]), vc[R[i][1]].emplace_back(R[i][0], L[i]);
dis[0] = 0;
pq.emplace(0, 0);
while(!pq.empty()){
int u = pq.top().second, cnt = pq.top().first;
pq.pop();
if(dis[u] < cnt) continue;
for(auto x:vc[u]){
int v = x.first, w = x.second;
if(dis[v] > w + cnt){
dis[v] = w + cnt;
pq.emplace(dis[v], v);
}
}
}
int ans = -1;
for(int i = 0; i < K; ++i){
if(dis[i] == 1e9 + 7) continue;
ans = max(ans, dis[i]);
}
return ans;
}
/*
int main()
{
int ans;
read_input();
ans = travel_plan(N,M,R,L,K,P);
if(ans==solution)
printf("Correct.\n");
else
printf("Incorrect. Returned %d, Expected %d.\n",ans,solution);
return 0;
}*/