제출 #1296075

#제출 시각아이디문제언어결과실행 시간메모리
1296075lukaye_19기지국 (IOI20_stations)C++20
0 / 100
3078 ms1052 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); unordered_set<int>cv2; for (int i = 0; i < c.size(); i++) { cv2.insert(c[i]); } while (!q.empty()) { int e = q.front(); q.erase(q.begin()); vector<int>cs; int i1 = (e - 1); int c1 = i1 / 2; cs.push_back(c1); int irange1 = e * 2; int irange2 = (e + 1) * 2 - 1; for (int i = irange1; i < irange2; i++) { cs.push_back(i); } for (int i = 0; i < cs.size(); i++) { auto it = cv2.find(cs[i]); if (it != cv2.end()) { return cs[i]; } } for (int i = 0; i < cs.size(); i++) { if (cs[i] <= t * 2 && cs[i] >= s / 2) { q.push_back(cs[i]); } } } }

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

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