제출 #1311237

#제출 시각아이디문제언어결과실행 시간메모리
1311237mo_aladaili기지국 (IOI20_stations)C++20
0 / 100
388 ms432 KiB
#include <bits/stdc++.h> using namespace std; vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector<int> lab(n); for (int i = 0; i < n; i++) lab[i] = i + 1; return lab; } int find_next_station(int s, int t, vector<int> c) { int u = t - 1; int par = (s - 1) / 2; for (int x : c) { int v = x - 1; if (v == par) continue; int cur = u; while (cur > 0) { if (cur == v) return x; cur /= 2; } } for (int x : c) { if ((x - 1) == par) return x; } return c[0]; }
#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...