| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1145776 | mitko7 | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 472 KiB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int n;
vector<int> g[1000];
int egg = 1;
int used[1000];
int used1[1000];
vector<int> bfs(int x) {
memset(used, 0, n+1);
used[x]=1;
queue<int> q;
q.push(x);
vector<int> ans;
ans.push_back(x);
while(!q.empty()) {
int c = q.front(); q.pop();
for(int nb : g[c]) {
if(!used[nb]) {
used[nb] = 1;
q.push(nb);
ans.push_back(nb);
}
}
}
for(int i = 0; i < 1000; i++) {
used1[i]=0;
}
return ans;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
