oj.uz

Submission #480531

# Submission time Handle Problem Language Result Execution time Memory
480531 2021-10-16T19:37:43 Z Haidara Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 2 ms 480 KB 
#include<bits/stdc++.h>
#include<grader.h>
#define ff first 
#define ss second
#define rep(i,x,n) for(int i=x;i<n;i++)
#define FOR(i,n) rep(i,0,n)
using namespace std;
const int maxn=550;
vector<int>graph[maxn],ord;
void dfs(int st=1,int par=-1)
{
	ord.push_back(st);
    for(auto i:graph[st])
    {
    	if(i==par)
    		continue;
    	dfs(i,st);
    }
}
bool go=1;
int findEgg(int n,vector< pair<int,int> >edges)
{
if(go){
    for(auto i:edges)
    {
        graph[i.ff].push_back(i.ss);
        graph[i.ss].push_back(i.ff);
    }
    dfs();
    go=0;}    
    int l=0,r=n-1,ans=ord[0];
    while(l<=r)
    {
    	int mid=l+(r-l)/2;
    	if(query(vector<int>(ord.begin(),ord.begin()+mid)))
    		r=mid-1,ans=ord[mid];
    	else 
    		l=mid+1;
    }
    return ans;
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 428 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 2 ms 456 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 2 ms 480 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -