Submission #272199

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
272199	2020-08-18 10:37:14	erray	Easter Eggs (info1cup17_eastereggs)	C++17	100 / 100	24 ms	760 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
28
29
30
// author: erray
#include<bits/stdc++.h>
#include"grader.h"
 
using namespace std;
//int query(vector<int> asd) { return true; }
const int N = 515;
vector<int> g[N], ask;
void dfs(int v, int pr = -1) {
  ask.push_back(v);
  for (auto u : g[v]) {
    if (pr == u) continue;
    dfs(u, v);
  }
}
int findEgg(int n, vector<pair<int, int>> edges) {
  bool ok = true;
  for (int i = 0; i < 512; ++i) ok &= g[i].empty();
  for (auto e : edges) {
    if (ok) {
      g[e.first].push_back(e.second);
      g[e.second].push_back(e.first);
    }
  }
  dfs(1);
  int s = 0, e = n - 1;
  while (s != e) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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