Submission #243035

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
243035	2020-06-30 08:03:32	Joky	Easter Eggs (info1cup17_eastereggs)	C++14	100 / 100	35 ms	432 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
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
 
#define mk 513
 
vector <int> g[mk] ,cur_node, cur_set;
 
int mx_size;
void dfs(int u ,int p=-1){
    if(!mx_size)
        return;
    cur_set.push_back(u);
    if(find(cur_node.begin() ,cur_node.end() ,u) != cur_node.end())
        mx_size--;
    for(int v : g[u]) if(v != p) dfs(v , u);
}
vector <int> findSet(int sz){
    mx_size = sz;
    cur_set.clear();
    dfs(1);
    return cur_set;
}
 
int findEgg (int N, vector < pair < int, int > > bridges){
    cur_node.clear();
    for(int i=0; i<=N; i++)
        g[i].clear();
    for(auto&e : bridges)
        g[e.first].push_back(e.second),
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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