Submission #315637

#TimeUsernameProblemLanguageResultExecution timeMemory
315637SortingStations (IOI20_stations)C++17
0 / 100
872 ms1024 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; vector<int> label(int n, int k, vector<int> u, vector<int> v){ vector<int> labels(n); for(int i = 0; i < n; i++) labels[i] = i; return labels; } int find_next_station(int s, int t, vector<int> c){ while(true){ if(t <= s) return c[0]; if(t == 2 * s + 1 || t == 2 * s + 2) break; t >>= 1; } assert(lower_bound(c.begin(), c.end(), t) != c.end()); return t; } /* 1 5 10 0 1 0 2 1 3 1 4 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...