# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
216730 | ainta | Stray Cat (JOI20_stray) | C++17 | 74 ms | 18136 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 "Anthony.h"
#include <vector>
#include <algorithm>
#include <cstdio>
#define N_ 20100
using namespace std;
vector<int>E[N_];
int Q[N_], D[N_], w[6] = { 0,0,1,1,0,1 }, T[N_], Dep[N_], Col[N_];
void DFS(int a, int pp) {
int c = E[a].size();
if (a)c--;
if (c >= 2)T[a] = 0;
for (auto &x : E[a]) {
if (x == pp)continue;
T[x] = T[a] + 1;
if (a == 0) {
Col[x] = 1;
}
else {
if (T[a] == 0)Col[x] = !Col[a];
else Col[x] = w[(T[a] - 1) % 6];
}
Dep[x] = Dep[a] + 1;
DFS(x, a);
}
}
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... |
# | 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... |