oj.uz

Submission #483645

# Submission time Handle Problem Language Result Execution time Memory
483645 2021-10-31T12:42:53 Z alexdumitru Easter Eggs (info1cup17_eastereggs) C++14
0 / 100
 10 ms 7408 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> g[55000];
int p[550000],nrr;
void dfs(int nod=1, int t=0)
{
    p[++nrr]=nod;
    for(auto i:g[nod])if(i!=t)dfs(i,nod);
}
bool qq(int poz)
{
    vector<int> qqq;
    for(int i=1;i<=poz;i++)qqq.push_back(p[i]);
    return query(qqq);
}
int findEgg(int N, vector<pair<int,int> > bridges)
{
    int st=1,dr=N-1,m,poz=N;
    for(auto i:bridges)
    {
        g[i.first].push_back(i.second);
        g[i.second].push_back(i.first);
    }
    dfs();
    while(st<=dr)
    {
        m=st+(dr-st)/2;
        if(qq(m))
        {
            poz=m;
            dr=m-1;
        }
        else st=m+1;
    }
    return p[poz];
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 7408 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 7368 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 7396 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -