# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
959454 | ramalzaher | Easter Eggs (info1cup17_eastereggs) | C++14 | 1 ms | 456 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "grader.h"
#define pb push_back
#define FOR(i , n ) for(int i = 0 ; i < n ;i ++ )
using namespace std;
int findEgg (int N, vector < pair < int, int > > bridges)
{
vector<int> V[N] ;
map<int,bool> mp ;
FOR(i ,N ) {
auto [a , b ] = bridges[i];
if(query( { a , b } ) == 1 && (mp[a]==0 || mp[b]==0) ) {
if(query( { a } ))return a ; else return b ;}
mp[a] =1 ; mp[b] =1 ;
}
return N;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |