제출 #1296081

#제출 시각아이디문제언어결과실행 시간메모리
1296081lukaye_19기지국 (IOI20_stations)C++20
0 / 100
390 ms436 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 ischild(int parent,int targetchild) { while (parent > targetchild) { parent /= 2; } if (parent == targetchild) { return true; } return false; } int find_next_station(int s, int t, vector <int> c) { if (c.size() == 1) return c[0]; else if(s == 0){ if (ischild(c[0],t)) return c[0]; return c[1]; } else { if (ischild(c[1],t)) return c[1]; if (c.size() == 3 && ischild(c[2],t)) return c[2]; } }

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

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