제출 #439485

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
439485	2021-06-30 05:55:40	Yazan_Alattar	Easter Eggs (info1cup17_eastereggs)	C++14	100 / 100	31 ms	468 KiB

eastereggs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> graph[513], ord;
void dfs(int node = 1, int parent = 0) {
  ord.push_back(node);
  for (int i : graph[node]) if (i != parent) dfs(i, node);
}
int findEgg(int N, vector<pair<int, int>> bridges) {
  for (int i = 1; i <= N; i++) graph[i].clear();
  ord.clear();
  for (pair<int, int> i : bridges) {
    graph[i.first].push_back(i.second);
    graph[i.second].push_back(i.first);
  }
  dfs();
  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];
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 40 / 40
• Subtask 2: 40 / 40
• Subtask 3: 20 / 20