oj.uz

Submission #743593

# Submission time Handle Problem Language Result Execution time Memory
743593 2023-05-17T14:16:23 Z AndrijaM Easter Eggs (info1cup17_eastereggs) C++14
0 / 100
 1 ms 464 KB 
#include <bits/stdc++.h>
#include "grader.h"
 
using namespace std;
 
vector<int>g[513];
vector<int>a;
 
void dfs(int node,int par)
{
    a.push_back(node);
    for(auto idx:g[node])
    {
        if(idx!=par)
        dfs(idx,node);
    }
}
 
int findEgg (int n, vector < pair < int, int > > b)
{
    for (int i = 1; i <= n; i++) g[i].clear();
	a.clear();
    for(auto idx:b)
    {
        g[idx.first].push_back(idx.second);
        g[idx.second].push_back(idx.first);
    }
    dfs(1,-1);
    int l=1;
    int r=n;
    while(l<r)
    {
        int mid=l+(r-l)/2;
        if(query(vector<int>(a.begin(),a.begin()+mid)))r=mid;
        else
        {
            l=mid+1;
        }
    }
    return a[l];
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 436 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -