# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
518619 | prvocislo | Newspapers (CEOI21_newspapers) | C++17 | 1 ms | 460 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
typedef long long ll;
using namespace std;
const int maxn = 1e3 + 5;
vector<vector<int> > g;
vector<int> d, p;
int n, m;
void ready()
{
d.assign(n, -1), p.assign(n, -1);
}
void dfs(int u)
{
for (int v : g[u])
{
if (d[v] == -1)
{
d[v] = d[u] + 1;
p[v] = u;
dfs(v);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |