# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
752571 | 2023-06-03T08:38:13 Z | penguin133 | Computer Network (BOI14_network) | C++17 | 84 ms | 4496 KB |
#include <bits/stdc++.h> using namespace std; //#define int long long #include "network.h" #define pi pair<int, int> #define pii pair<int, pi> #define fi first #define se second #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #endif mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); vector <int> tmp[10005]; void findRoute (int N, int a, int b) { int hi; for(int i=1;i<=N;i++){ if(i == b)continue; int x = ping(i, b); x++; if(i == a)hi = x; else tmp[x].push_back(i); } int cur = a; while(hi){ for(auto i : tmp[hi-1]){ if(ping(cur, i) == 1){ travelTo(i); cur = i; hi--; break; } } } travelTo(b); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 74 ms | 4496 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 74 ms | 4380 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 71 ms | 4476 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 84 ms | 4440 KB | Too many calls to ping |
2 | Halted | 0 ms | 0 KB | - |