oj.uz

Submission #288909

# Submission time Handle Problem Language Result Execution time Memory
288909 2020-09-02T06:54:02 Z andreiomd Easter Eggs (info1cup17_eastereggs) C++11
6 / 100
 2 ms 640 KB 
#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;
}

Subtask #1
6.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 256 KB Number of queries: 16
2 Partially correct 2 ms 256 KB Number of queries: 16
3 Partially correct 2 ms 256 KB Number of queries: 16
4 Partially correct 2 ms 256 KB Number of queries: 16

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -