Submission #288909

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

using namespace std;

typedef pair < int, int > PII;

int findEgg (int n, vector < PII > edges)
{
    map < int, bool > mp;

    for(auto it : edges)
        mp[it.first] = 1, mp[it.second] = 1;

    for(auto it : mp)
    {
        int X = it.first;

        vector < int > V;
        V.push_back(X);

        if(query(V))
            return X;
    }

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