제출 #1145963

#제출 시각아이디문제언어결과실행 시간메모리
1145963bozhoEaster Eggs (info1cup17_eastereggs)C++20
6 / 100
1 ms488 KiB
#include <bits/stdc++.h> #include "grader.h" #define endl '\n' using namespace std; const int MAX = 550; vector<int> v[MAX], order; bool used[MAX]; int Binary() { vector<int> c; for (int i = 0; i < order.size(); i++) { c.push_back(order[i]); if (query(c)) return order[i]; } } void Dfs(int g) { used[g] = 1; order.push_back(g); for (int i = 0; i < v[g].size(); i++) { if (!used[v[g][i]]) Dfs(v[g][i]); } } int findEgg(int n, vector<pair<int, int>> p) { for (int i = 0; i < p.size(); i++) { v[p[i].first].push_back(p[i].second); v[p[i].second].push_back(p[i].first); } Dfs(1); int ans = Binary(); for (int i = 0; i <= n; i++) { v[i].clear(); used[i] = 0; } order.clear(); return ans; }

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

eastereggs.cpp: In function 'int Binary()':
eastereggs.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...