oj.uz

Submission #282955

# Submission time Handle Problem Language Result Execution time Memory
282955 2020-08-25T07:45:48 Z dsjong Easter Eggs (info1cup17_eastereggs) C++14
0 / 100
 391 ms 131076 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

vector<int>adj[600];
vector<int>tour, cur;
void dfs(int x, int p){
	tour.push_back(x);
	for(int y:adj[x]){
		if(y==p) continue;
		dfs(y, x);
	}
}

bool ask(int x){
	cur.clear();
	for(int i=0;i<=x;i++){
		cur.push_back(tour[i]);
	}
	return query(cur);
}
int findEgg (int N, vector<pair<int, int>> bridges){
	for(auto p: bridges){
		int x=p.first, y=p.second;
		adj[x].push_back(y);
		adj[y].push_back(x);
	}
	dfs(1, 0);
	int L=0, R=N-1;
	while(L<R){
		int M=(L+R)/2;
		if(ask(M)) R=M;
		else L=M+1;
	}
	return tour[L];
}

Subtask #1
0 / 40.0

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

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 288 ms 131076 KB Execution killed with signal 9 (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 280 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -