# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866381 | NeroZein | Spring cleaning (CEOI20_cleaning) | C++17 | 133 ms | 27416 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 "bits/stdc++.h"
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
const int N = 1e5 + 5;
const int LOG = 18;
vector<int> g[N];
vector<int> vg[N];
int ans;
bool isCrit[N];
int leaves[N], ev[N];
int cnt, in[N], out[N];
int pr[LOG][N], dep[N];
void dfs(int v, int p) {
if (g[v].size() == 1) {
leaves[v] = 1;
}
in[v] = cnt++;
for (int u : g[v]) {
if (u == p) {
continue;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |