# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
36577 | 2017-12-11T02:47:38 Z | minkank | 컴퓨터 네트워크 (BOI14_network) | C++14 | 173 ms | 6004 KB |
#include <bits/stdc++.h> #include "network.h" using namespace std; typedef pair<int, int> ii; #define st first #define nd second void findRoute(int N, int S, int T) { vector<ii> path; vector<int> res; path.push_back(ii(0, S)); for(int i = 1; i <= N; ++i) if(i != S) path.push_back(ii(ping(S, i), i)); sort(path.begin(), path.end()); int last = -1; for(int i = path.size() - 1; i >= 0; --i) { if(path[i].nd == T) { last = i; continue; } if(path[i].nd == S) break; if(last != -1) { int val = ping(path[i].nd, path[last].nd); if(val == -1) continue; if(val + path[i].st + 1 == path[last].st) last = i, res.push_back(path[i].nd); } } for(int i = res.size() - 1; i >= 0; --i) travelTo(res[i]); travelTo(T); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 173 ms | 6004 KB | Travelling to nonadjacent computer |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 116 ms | 6004 KB | Output is correct |
2 | Correct | 26 ms | 6004 KB | Output is correct |
3 | Correct | 133 ms | 6004 KB | Output is correct |
4 | Incorrect | 106 ms | 6004 KB | Travelling to nonadjacent computer |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 113 ms | 6004 KB | Output is correct |
2 | Correct | 26 ms | 6004 KB | Output is correct |
3 | Correct | 129 ms | 6004 KB | Output is correct |
4 | Incorrect | 103 ms | 6004 KB | Travelling to nonadjacent computer |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 126 ms | 6004 KB | Output is correct |
2 | Correct | 39 ms | 6004 KB | Output is correct |
3 | Correct | 126 ms | 6004 KB | Output is correct |
4 | Incorrect | 93 ms | 6004 KB | Travelling to nonadjacent computer |
5 | Halted | 0 ms | 0 KB | - |