제출 #776214

#제출 시각아이디문제언어결과실행 시간메모리
776214rxlfd314Easter Eggs (info1cup17_eastereggs)C++17
100 / 100
16 ms376 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; int findEgg(int N, vector<pair<int, int>> B) { vector<int> adj[N]; for (auto &[a, b] : B) { adj[--a].push_back(--b); adj[b].push_back(a); } int rtin[N], timer = 0; function<void(int, int)> dfs = [&](int f, int pf) { rtin[timer++] = f; for (int nf : adj[f]) { if (nf != pf) { dfs(nf, f); } } }; dfs(0, 0); int lo = 0, hi = N-1; while (lo < hi) { int mid = lo + hi >> 1; vector<int> vec; for (int i = 0; i <= mid; i++) { vec.push_back(rtin[i]+1); } query(vec) ? hi = mid : lo = mid + 1; } return rtin[lo] + 1; }

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

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:25:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |   int mid = lo + hi >> 1;
      |             ~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...