제출 #1145801

#제출 시각아이디문제언어결과실행 시간메모리
1145801txni128Easter Eggs (info1cup17_eastereggs)C++20
6 / 100
0 ms440 KiB
#include "grader.h" #include <iostream> #include <vector> using namespace std; int findEgg(int N, vector < pair < int, int > > bridges) { int used[1024]; fill(used,used+1000,0); /*for(auto c:bridges) { vector <int> k; k.push_back(c.first); k.push_back(c.second); if(used[k[0]]==0||used[k[1]]==0) { bool l=query(k); if(l==0) { used[c.first]=1; used[c.second]=1; } } }*/ for(auto c:bridges) { vector <int> q; q.push_back(c.first); q.push_back(c.second); bool l=query(q); if(l==1) { vector <int> q1,q2; q1.push_back(c.first); q2.push_back(c.second); l=query(q1); if(l) { return q1[0]; } else return q2[0]; } else { used[c.first]=1; used[c.second]=1; } } for(int i=1;i<=N;i++) { if(used[i]==1)continue; vector <int> k; k.push_back(i); bool l=query(k); if(l) { return i; } } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...