Submission #288905

#TimeUsernameProblemLanguageResultExecution timeMemory
288905andreiomdEaster Eggs (info1cup17_eastereggs)C++11
6 / 100
2 ms512 KiB
#include <vector>
#include "grader.h"

using namespace std;

typedef pair < int, int > PII;

int findEgg (int n, vector < PII > edges)
{
    for(int i = 1; i <= n; ++i)
    {
        vector < int > V;
        V.push_back(i);

        if(query(V))
            return i;
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...