oj.uz

Submission #674100

# Submission time Handle Problem Language Result Execution time Memory
674100 2022-12-23T05:25:03 Z QwertyPi Easter Eggs (info1cup17_eastereggs) C++14
0 / 100
 1 ms 592 KB 
#include <bits/stdc++.h>

using namespace std;

int query(vector<int> islands);

vector<int> G[513];

int c = 0, tot = 512;
int u[513], elim[513];
void dfs(int t, int v, int par = -1){
	if(c == tot) return;
	if(u[v] == 0) c++, u[v] = t;
	for(auto i : G[v]){
		if(i == par || elim[i])
			continue;
		dfs(t, i, v);
	}
}

int findEgg(int N, vector<pair<int, int>> bridges){
	for(int i = 1; i <= N; i++){
		G[i].clear();
	}
	for(int i = 0; i < N - 1; i++){
		G[bridges[i].first].push_back(bridges[i].second);
		G[bridges[i].second].push_back(bridges[i].first);
	}
	for(int i = (N + 1) / 2, t = 1; i != 1; t++){
		c = 0; tot = i; dfs(t, 1);
		vector<int> islands;
		for(int j = 1; j <= N; j++){
			if(u[j]) islands.push_back(j);
		}
		int r = query(islands);
		if(i <= 1){
			if(!r){
				for(int j = 1; j <= N; j++){
					if(u[j] == 0) return j;
				} 
			}else{
				for(int j = 1; j <= N; j++){
					if(u[j] == t) return j;
				} 
			}
		}
		if(!r){
			i = i - (i + 1) / 2;
			continue;
		}else{
			i = (i + 1) / 2;
			for(int j = 1; j <= N; j++){
				if(u[i] == 0) elim[i] = true;
				if(u[i] == t) u[i] = 0;
			}
		}
	}
}

Compilation message

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

Subtask #1
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 #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 592 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -