oj.uz

답안 #389796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
389796 2021-04-14T14:26:22 Z rk42745417 Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 111 ms 131076 KB 
#include <bits/stdc++.h>
#include "grader.h"
//#include "grader.cpp"
using namespace std;

#define EMT ios::sync_with_stdio(0); cin.tie(0);
using ll = int64_t;
using ull = uint64_t;
using uint = uint32_t;
using ld = long double;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double EPS = 1e-9;

vector<vector<int>> edge;
vector<bool> can;
vector<bool> is;
int w;
vector<int> que;
void init(int n) {
	edge.clear();
	edge.resize(n + 1);
	can.clear();
	can.resize(n + 1, 1);
	is.clear();
	is.resize(n + 1);
}

void dfs(int u, int p) {
	if(!w)
		return;
	if(can[u])
		que.push_back(u), is[u] = 1;
	for(int v : edge[u])
		dfs(v, u);
}

int findEgg(int n, vector<pair<int, int>> edges) {
	init(n);

	for(const auto &[a, b] : edges)
		edge[a].push_back(b), edge[b].push_back(a);
	
	int has = n;
	while(has > 1) {
		int c = has / 2;
		w = has / 2;
		dfs(w, w);
		if(!query(que)) {
			for(int a : que)
				can[a] = 0;
			has -= c;
		}
		else {
			has = c;
			for(int i = 1; i <= n; i++)
				if(!is[i])
					can[i] = 0;
		}
		for(int a : que)
			is[a] = 0;
		que.clear();

		for(int i = 1; i <= n; i++)
			if(!can[i])
				que.push_back(i), is[i] = 1;
	}

	for(int i = 1; i <= n; i++)
		if(can[i])
			return i;
	assert(0);
	return 0;
}

Subtask #1
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 111 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 96 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 98 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -