| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 155374 | 2019-09-27T16:59:53 Z | arnold518 | 악어의 지하 도시 (IOI11_crocodile) | C++14 | 1226 ms | 92424 KB |
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
const ll INF = 1e15;
int N, M, K;
vector<pii> adj[MAXN+10];
ll dist[MAXN+10];
int vis[MAXN+10];
struct Queue
{
int u; ll w;
bool operator < (const Queue &p) const { return w>p.w; }
};
int travel_plan(int _N, int _M, int R[][2], int L[], int _K, int P[])
{
int i, j;
N=_N; M=_M; K=_K;
for(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]});
}
priority_queue<Queue> PQ;
for(i=0; i<N; i++) dist[i]=INF;
for(i=0; i<K; i++) PQ.push({P[i], 0}), vis[P[i]]=1;
while(!PQ.empty())
{
Queue T=PQ.top(); PQ.pop();
if(vis[T.u]==2) continue;
vis[T.u]++;
if(vis[T.u]<2) continue;
dist[T.u]=T.w;
for(auto nxt : adj[T.u]) PQ.push({nxt.first, T.w+nxt.second});
}
return dist[0];
}
Compilation message
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 4 ms | 2780 KB | Output is correct |
| 2 | Correct | 4 ms | 2680 KB | Output is correct |
| 3 | Correct | 4 ms | 2680 KB | Output is correct |
| 4 | Correct | 5 ms | 2808 KB | Output is correct |
| 5 | Correct | 5 ms | 2808 KB | Output is correct |
| 6 | Correct | 5 ms | 2808 KB | Output is correct |
| 7 | Correct | 5 ms | 2808 KB | Output is correct |
| 8 | Correct | 5 ms | 2680 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 4 ms | 2780 KB | Output is correct |
| 2 | Correct | 4 ms | 2680 KB | Output is correct |
| 3 | Correct | 4 ms | 2680 KB | Output is correct |
| 4 | Correct | 5 ms | 2808 KB | Output is correct |
| 5 | Correct | 5 ms | 2808 KB | Output is correct |
| 6 | Correct | 5 ms | 2808 KB | Output is correct |
| 7 | Correct | 5 ms | 2808 KB | Output is correct |
| 8 | Correct | 5 ms | 2680 KB | Output is correct |
| 9 | Correct | 8 ms | 3320 KB | Output is correct |
| 10 | Correct | 4 ms | 2680 KB | Output is correct |
| 11 | Correct | 6 ms | 2936 KB | Output is correct |
| 12 | Correct | 11 ms | 3832 KB | Output is correct |
| 13 | Correct | 10 ms | 3828 KB | Output is correct |
| 14 | Correct | 4 ms | 2808 KB | Output is correct |
| 15 | Correct | 5 ms | 2808 KB | Output is correct |
| # | 결과 | 실행 시간 | 메모리 | Grader output |
|---|---|---|---|---|
| 1 | Correct | 4 ms | 2780 KB | Output is correct |
| 2 | Correct | 4 ms | 2680 KB | Output is correct |
| 3 | Correct | 4 ms | 2680 KB | Output is correct |
| 4 | Correct | 5 ms | 2808 KB | Output is correct |
| 5 | Correct | 5 ms | 2808 KB | Output is correct |
| 6 | Correct | 5 ms | 2808 KB | Output is correct |
| 7 | Correct | 5 ms | 2808 KB | Output is correct |
| 8 | Correct | 5 ms | 2680 KB | Output is correct |
| 9 | Correct | 8 ms | 3320 KB | Output is correct |
| 10 | Correct | 4 ms | 2680 KB | Output is correct |
| 11 | Correct | 6 ms | 2936 KB | Output is correct |
| 12 | Correct | 11 ms | 3832 KB | Output is correct |
| 13 | Correct | 10 ms | 3828 KB | Output is correct |
| 14 | Correct | 4 ms | 2808 KB | Output is correct |
| 15 | Correct | 5 ms | 2808 KB | Output is correct |
| 16 | Correct | 1148 ms | 89168 KB | Output is correct |
| 17 | Correct | 113 ms | 14200 KB | Output is correct |
| 18 | Correct | 150 ms | 15736 KB | Output is correct |
| 19 | Correct | 1226 ms | 92424 KB | Output is correct |
| 20 | Correct | 748 ms | 82604 KB | Output is correct |
| 21 | Correct | 59 ms | 7800 KB | Output is correct |
| 22 | Correct | 673 ms | 47280 KB | Output is correct |