답안 #1095332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1095332 2024-10-02T00:45:19 Z idiotcomputer Easter Eggs (info1cup17_eastereggs) C++11
0 / 100
1 ms 600 KB
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define sz(x) (int) (x).size()

const int mxN = 520;
vector<int> adj[mxN];
vector<int> ord;


void dfs(int node, int p){
	ord.pb(node);
	//cout << node << "\n";
	for (int c : adj[node]){
		if (c != p) dfs(c,node);
	}
}

int findEgg(int N, vector<pair<int,int>> bridges){
	for (int i = 0; i < N; i++) adj[i].clear();
	ord.clear();
	for (pair<int,int> c : bridges){
		//cout << c.f << " " << c.s << '\n';
		adj[c.f-1].pb(c.s-1);
		adj[c.s-1].pb(c.f-1);
	}/*
	for (int i = 0; i < N-1; i++){
		adj[bridges[i].f-1].pb(bridges[i].s-1);
		adj[bridges[i].s-1].pb(bridges[i].f-1);
	}*/
	dfs(0,-1);
	int l = 0, r = N - 1;
	while (l != r) {
		int mid = (l + r + 1) / 2;
		if (query(vector<int>(ord.begin(), ord.begin() + mid))) r = mid - 1;
		else l = mid;
	}
	return ord[l]+1;
}	


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