# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
89994 | 2018-12-19T14:26:02 Z | thebes | 페리들 (NOI13_ferries) | C++14 | 377 ms | 33792 KB |
#include <bits/stdc++.h> using namespace std; const int MN = 1e5+5; int N, M, i, x, y, W, dist[MN], idx[MN]; vector<int> adj[MN], w[MN]; typedef pair<int,int> pii; struct pq{bool operator()(const pii&i,const pii&j){return i.second>j.second;}}; priority_queue<pii,vector<pii>,pq> q; int main(){ for(scanf("%d%d",&N,&M),i=1;i<=M;i++){ scanf("%d%d%d",&x,&y,&W); adj[y].push_back(x); w[x].push_back(W); } for(i=1;i<=N;i++) sort(w[i].begin(),w[i].end(),[](int i,int j){return i>j;}); memset(dist,-1,sizeof(dist)); q.push({N,0}); while(q.size()){ auto v=q.top(); q.pop(); if(dist[v.first]!=-1) continue; else dist[v.first]=v.second; for(auto e : adj[v.first]){ if(dist[e]==-1){ int W = w[e][idx[e]]; idx[e]++; q.push({e, W+v.second}); } } } printf("%d\n",dist[1]); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 5628 KB | Output is correct |
2 | Correct | 8 ms | 5764 KB | Output is correct |
3 | Correct | 20 ms | 6880 KB | Output is correct |
4 | Correct | 153 ms | 17556 KB | Output is correct |
5 | Correct | 157 ms | 20564 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 20564 KB | Output is correct |
2 | Correct | 8 ms | 20564 KB | Output is correct |
3 | Correct | 19 ms | 20564 KB | Output is correct |
4 | Correct | 79 ms | 20564 KB | Output is correct |
5 | Correct | 143 ms | 22816 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 22816 KB | Output is correct |
2 | Correct | 27 ms | 22816 KB | Output is correct |
3 | Correct | 346 ms | 28900 KB | Output is correct |
4 | Runtime error | 377 ms | 33792 KB | Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 360 ms | 33792 KB | Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience. |
2 | Halted | 0 ms | 0 KB | - |