제출 #583199

#제출 시각아이디문제언어결과실행 시간메모리
583199rxlfd314Easter Eggs (info1cup17_eastereggs)C++17
0 / 100
1 ms464 KiB
// https://oj.uz/problem/view/info1cup17_eastereggs #include <bits/stdc++.h> #include <grader.h> using namespace std; vector<int> adj[512], bruh; void dfs(int f = 0, int pf = -1) { bruh.push_back(f); for (int nf : adj[f]) { if (nf != pf) { dfs(nf, f); } } } int findEgg(int n, vector<pair<int, int>> bridges) { for (int i = 0; i < n; adj[i++].clear()); for (pair<int, int> i : bridges) { adj[i.second - 1].push_back(i.first - 1); adj[i.first - 1].push_back(i.second - 1); } bruh.clear(); dfs(); int lo = 0, hi = n - 1; while (lo <= hi) { int mid = lo + hi >> 1; if (query(vector<int>(bruh.begin(), bruh.begin() + mid))) { hi = mid - 1; } else { lo = mid + 1; } } return bruh[hi + 1]; }

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

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