제출 #61652

#제출 시각아이디문제언어결과실행 시간메모리
61652EntityITEaster Eggs (info1cup17_eastereggs)C++14
0 / 100
5 ms792 KiB
#include<bits/stdc++.h> #include "grader.h" using namespace std; #define pb push_back #define fi first #define se second typedef pair<int, int> ii; const int N = 600; int a[N], cur; vector<int> gr[N]; void dfs(int u, int p) { a[++cur] = u; for (int v : gr[u]) if(v != p) dfs(v, u); } int findEgg(int n, vector<ii> edge) { for (ii i : edge) { gr[i.fi].pb(i.se); gr[i.se].pb(i.fi); } dfs(1, 1); vector<int> ask; int l = 1, r = n; while(l < r) { int mid = l + r >> 1; ask.clear(); for (int i = 1; i <= mid; ++i) ask.pb(a[i]); if(query(ask)) r = mid; else l = mid + 1; } return a[l]; }

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

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