제출 #1296067

#제출 시각아이디문제언어결과실행 시간메모리
1296067lukaye_19기지국 (IOI20_stations)C++20
0 / 100
3086 ms1056 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) { vector<int>q; q.push_back(s); while (!q.empty()) { int t = q.front(); q.erase(q.begin()); int i1 = (t - 1); int c1 = i1 / 2; int i2 = (t * 2); int c2 = i2 + 1; for (int i = 0; i < c.size(); i++) { if (c[i] == c1 || c[i] == c2) { return c[i]; } } q.push_back(c1); q.push_back(c2); } }

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

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