# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
517055 | 2022-01-22T12:57:06 Z | Ai7081 | Stations (IOI20_stations) | C++17 | 973 ms | 488 KB |
#include <bits/stdc++.h> using namespace std; const int N = 1005; vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector<int> ret; for (int i=0; i<n; i++) ret.push_back(i); return ret; } int find_next_station(int s, int t, vector<int> c) { s++, t++; if (t < s) return s/2 - 1; int p; while (t > s) { p = t; t /= 2; } return p - 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 460 ms | 480 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 407 ms | 488 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 600 ms | 404 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 973 ms | 400 KB | Output is correct |
2 | Incorrect | 832 ms | 488 KB | Wrong query response. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 553 ms | 488 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |