# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218029 | mieszko11b | Stray Cat (JOI20_stray) | C++14 | 168 ms | 19748 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 <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
#define X first
#define Y second
namespace {
vector<int> res;
vector<ii> G[20007];
vector<ii> ch[20007];
int ord[] = {0, 0, 1, 0, 1, 1};
bool vis[20007];
int top[20007];
bool intree[20007];
void dfs(int w = 0, int p = -1, int o = -1, int c = 0) {
int deg = G[w].size();
if(p != -1) deg--;
for(ii u : G[w]) {
if(u.X != p) {
if(deg > 1) {
res[u.Y] = c ^ 1;
dfs(u.X, w, -1, c ^ 1);
} else {
if(o == -1) {
# | 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... |