Submission #1069838

#TimeUsernameProblemLanguageResultExecution timeMemory
1069838Ice_manEaster Eggs (info1cup17_eastereggs)C++14
Compilation error
0 ms0 KiB
/** ____ ____ ____ __________________ ____ ____ ____ ||I || ||c || ||e || || || ||M || ||a || ||n || ||__|| ||__|| ||__|| ||________________|| ||__|| ||__|| ||__|| |/__\| |/__\| |/__\| |/________________\| |/__\| |/__\| |/__\| */ #include <iostream> #include <chrono> #include <vector> ///#include "grader.h" #define maxn 1000005 #define maxlog 20 #define INF 1000000010 #define LINF 1000000000000000005 #define endl '\n' #define pb(x) push_back(x) #define X first #define Y second #define control cout<<"passed"<<endl; #pragma GCC optimize("O3" , "Ofast" , "unroll-loops" , "fast-math") #pragma GCC target("avx2") using namespace std; typedef unsigned long long ull; typedef pair <int, int> pii; typedef long long ll; typedef pair <ll, ll> pll; typedef pair <int, ll> pil; typedef pair <ll, int> pli; typedef long double pd; vector <int> v[maxn]; vector <int> tour; void gen(int node , int par) { tour.pb(node); for(auto& e : v[node]) { if(e == par) continue; gen(e , node); } } bool check(int x) { vector <int> pom; for(int i = 0; i <= x; i++) pom.pb(tour[i]); return query(pom); } int n; int findEgg(int N , vector <pii> bridges) { n = N; for(auto& e : bridges) { v[e.X].pb(e.Y); v[e.Y].pb(e.X); } gen(1 , -1); int l = 0 , r = n - 1; int mid; while(r > l) { mid = (l + r) / 2; if(check(mid) == true) r = mid; else l = mid + 1; } return tour[l]; } /**int main() { #ifdef ONLINE_JUDGE /// promeni freopen("taxi.in", "r", stdin); freopen("taxi.out", "w", stdout); #endif ios_base::sync_with_stdio(false); cin.tie(nullptr); ///startT = std::chrono::high_resolution_clock::now(); return 0; }*/

Compilation message (stderr)

eastereggs.cpp: In function 'bool check(int)':
eastereggs.cpp:59:12: error: 'query' was not declared in this scope
   59 |     return query(pom);
      |            ^~~~~