Submission #517070

#TimeUsernameProblemLanguageResultExecution timeMemory
517070Ai7081Stations (IOI20_stations)C++17
0 / 100
3044 ms488 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1005; int p; vector<int> ret; vector<int> label(int n, int k, vector<int> u, vector<int> v) { ret.assign(n, 0); for (int i=0; i<n; i++) ret[i] = i+1; return ret; } int find_next_station(int s, int t, vector<int> c) { //s++, t++; if (t < s) return s/2; while (t != s) { p = t; t = (t>>1); } return p; }
#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...