제출 #1311245

#제출 시각아이디문제언어결과실행 시간메모리
1311245mo_aladaili기지국 (IOI20_stations)C++20
8 / 100
390 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) { for (int x : c) { if (x == t) { return x; } } int cur = t; while (cur > 0 && cur != s) { cur /= 2; } if (cur == s) { cur = t; while (cur / 2 != s) { cur /= 2; } int child = cur; for (int x : c) { if (x == child) { return x; } } } else { int par = s / 2; for (int x : c) { if (x == par) { return x; } } } }

컴파일 시 표준 에러 (stderr) 메시지

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
   53 | }
      | ^
#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...