# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1166103 | irmuun | Easter Eggs (info1cup17_eastereggs) | C++20 | 1 ms | 412 KiB |
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int findEgg(int n,vector<pair<int,int>>g){
vector<int>f[n];
for(auto [a,b]:g){
f[a].pb(b);
f[b].pb(a);
}
queue<int>q;
q.push(0);
vector<int>v;
vector<bool>used(n,false);
used[0]=true;
while(!q.empty()){
int x=q.front();
q.pop();
v.pb(x);
for(int y:f[x]){
if(!used[y]){
used[y]=true;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |