제출 #800538

#제출 시각아이디문제언어결과실행 시간메모리
800538Liudas기지국 (IOI20_stations)C++17
0 / 100
28 ms356 KiB
#include <bits/stdc++.h> #define endl "\n" using namespace std; void dfs(int head, int par, vector<vector<int>> &tree, int &col, vector<int> &labels){ for(int i : tree[head]){ if(i != par){ dfs(i, head, tree, col, labels); } } labels[head] = col ++; } int find_next_station(int s, int t, vector<int> labels){ sort(labels.begin(), labels.end()); for(int i : labels){ } if(t >= labels.back()){ return labels.back(); } for(int i : labels){ if(t <= i){ return i; } } } vector<int> label(int N, int K, vector<int> U, vector<int> V){ vector<vector<int>> tree(N); for(int i = 0; i < N-1; i ++){ tree[U[i]].push_back(V[i]); tree[V[i]].push_back(U[i]); } vector<int> labels(N); int col = 0; for(int i = 0; i < N; i ++)if(tree[i].size() > 2) dfs(i, -1, tree, col, labels); //for(int i : labels)cout << i << endl; return labels; }

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

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:14:13: warning: unused variable 'i' [-Wunused-variable]
   14 |     for(int i : labels){
      |             ^
stations.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
   25 | }
      | ^
#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...