# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
300974 | 2020-09-17T15:35:14 Z | zecookiez | 컴퓨터 네트워크 (BOI14_network) | C++17 | 134 ms | 8184 KB |
#include <bits/stdc++.h> #include <network.h> using namespace std; template<class C>constexpr int len(const C&c){return int(c.size());} const int MAXN = 1001; vector<int> dist[MAXN]; void findRoute(int N, int a, int b){ int c = ping(a, b); dist[c].push_back(b); for(int v, i = 1; i <= N; ++i){ if(i == a) continue; v = i == b ? c : ping(a, i); if(v < c) dist[v].push_back(i); } int prev = a; for(int x = 0; x < c; ++x){ for(int nxt : dist[x]){ if(x + 1 + ping(nxt, b) == c){ travelTo(nxt); prev = nxt; break; } } } travelTo(b); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 134 ms | 8184 KB | Output is correct |
2 | Correct | 131 ms | 7744 KB | Output is correct |
3 | Correct | 119 ms | 7160 KB | Output is correct |
4 | Correct | 117 ms | 7032 KB | Output is correct |
5 | Correct | 118 ms | 6776 KB | Output is correct |
6 | Correct | 118 ms | 6720 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 384 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 1 ms | 512 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 120 ms | 6776 KB | Travelling to nonadjacent computer |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 120 ms | 6776 KB | Travelling to nonadjacent computer |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 121 ms | 6904 KB | Travelling to nonadjacent computer |
2 | Halted | 0 ms | 0 KB | - |