Submission #1145849

#TimeUsernameProblemLanguageResultExecution timeMemory
1145849boropotoEaster Eggs (info1cup17_eastereggs)C++20
10 / 100
0 ms428 KiB
#include<bits/stdc++.h> #include"grader.h" using namespace std; int parent[20],rang[20]; /*void make_set(int x) { parent[x]=x; rang[x]=1; } int find_set(int x) { if(parent[x]==x) { return x; } return find_set(parent[x]); } void union_set(int x,int y) { if(x!=y) { x=find_set(x); y=find_set(y); if(rang[x]<rang[y]) { swap(x,y); } parent[y]=x; rang[x]+=rang[y]; } }*/ int findEgg(int n, vector < pair < int, int > > bridges) { for(int i=1;i<n;i++) { vector<int> islands; islands.push_back(i); if(query(islands)==1) { return i; } } return n; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...