# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306110 | 2020-09-24T14:20:58 Z | SorahISA | Stations (IOI20_stations) | C++17 | 1047 ms | 1012 KB |
#include "stations.h" #include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; template<typename T> using Prior = priority_queue<T>; template<typename T> using prior = priority_queue<T, vector<T>, greater<T>>; #define X first #define Y second #define ALL(x) (x).begin(), (x).end() #define eb emplace_back #define pb push_back vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector<int> lab(n); iota(ALL(lab), 1); return lab; } int find_next_station(int s, int t, vector<int> c) { if (s > t or s != (t >> __lg(t) - __lg(s))) return s / 2; return c[((t >> __lg(t) - __lg(s) - 1) & 1) + (s != 1)]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 573 ms | 880 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 477 ms | 768 KB | Output is correct |
2 | Correct | 564 ms | 1012 KB | Output is correct |
3 | Correct | 1023 ms | 760 KB | Output is correct |
4 | Correct | 715 ms | 772 KB | Output is correct |
5 | Correct | 643 ms | 640 KB | Output is correct |
6 | Correct | 543 ms | 884 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 551 ms | 760 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1047 ms | 768 KB | Output is correct |
2 | Incorrect | 656 ms | 640 KB | Wrong query response. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 721 ms | 868 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |