oj.uz

Submission #61565

# Submission time Handle Problem Language Result Execution time Memory
61565 2018-07-26T07:37:08 Z IOrtroiii Easter Eggs (info1cup17_eastereggs) C++14
0 / 100
 11 ms 668 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

const int N = 515;

int n;
vector<int> G[N];
bool can[N], chosen[N];
int cur, need, cnt;
vector<int> ask;

void dfs(int u,int p) {
	if (cnt == need) return;
	if (can[u]) cnt++;
	ask.push_back(u); chosen[u] = 1;
	for (int v : G[u]) if (v != p) {
		dfs(v, u);
	} 
}

int findEgg(int n,vector<pair<int,int>> bridges) {
	for (int i = 1; i <= n; ++i) can[i] = 1;
	
	for (auto ed : bridges) {
		int u = ed.first, v = ed.second;
		G[u].push_back(v), G[v].push_back(u);
	}
	
	cur = n;
	
	while (cur != 1) {
		ask.clear(); 
		need = (cur + 1) / 2;
		for (int i = 1; i <= n; ++i) chosen[i] = 0; 
		dfs(1, 1);
		if (query(ask)) {
			for (int i = 1; i <= n; ++i) if (!chosen[i]) {
				can[i] = 0;
				cur = need;
			}
		}
		
		else {
			for (int v : ask) can[v] = 0;
			cur -= need;
		}
	}
	
	for (int i = 1; i <= n; ++i) if (can[i]) {
		return i;
	}
}

Compilation message

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 420 KB Execution killed with signal 11 (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 6 ms 636 KB Execution killed with signal 11 (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 11 ms 668 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -