제출 #128627

#제출 시각아이디문제언어결과실행 시간메모리
128627sheyasutakaEaster Eggs (info1cup17_eastereggs)C++14
100 / 100
21 ms436 KiB
#include "grader.h" #include <vector> using std::vector; using std::pair; typedef pair<int, int> P; vector<int> g[600]; vector<int> euler; void dfs (int v, int p) { euler.push_back(v); for (int u : g[v]) { if (u == p) continue; dfs(u, v); } } int findEgg (int N, vector<P> bridges) { int i, j; for (i = 0; i < 600; i++) { g[i].clear(); } euler.clear(); for (i = 0; i < N - 1; i++) { g[bridges[i].first - 1].push_back(bridges[i].second - 1); g[bridges[i].second - 1].push_back(bridges[i].first - 1); } dfs(0, N); int l = 0, r = N; while (l + 1 < r) { int med = (l + r) / 2; vector<int> v; for (i = 0; i < med; i++) { v.push_back(euler[i] + 1); } if (query(v)) { r = med; } else { l = med; } } return euler[l] + 1; }

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

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:23:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...