oj.uz

Submission #524225

# Submission time Handle Problem Language Result Execution time Memory
524225 2022-02-08T20:20:50 Z CSQ31 Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 245 ms 131076 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

vector<int>adj[1000],a;
void dfs(int v,int u){
	a.push_back(v);
	for(int x:adj[v]){
		if(x==u)continue;
		dfs(x,v);
	}
}
int findEgg (int n, vector < pair < int, int > > bridges)
{
	for(auto x:bridges){
		adj[x.first].push_back(x.second);
		adj[x.second].push_back(x.first);
	}
	dfs(1,0);
	int l = 0,r = n-1;
	while(r>=l){
		int mid = (l+r)/2;
		vector<int>b;
		for(int i=0;i<=mid;i++)b.push_back(a[i]);
		if(query(b))r=mid-1;
		else l=mid+1;
	}
	assert(l<n);
	return a[l];
}

Subtask #1
0 / 40.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 20.0

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