# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
778809 | Ahmed57 | Cats or Dogs (JOI18_catdog) | C++17 | 364 ms | 26828 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.
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#include <bits/stdc++.h>
#include "catdog.h"
using namespace std;
vector<int> adj[200001];
int n;
int val[200001];
int sz[200001];
int P[200001];
int arr[200001];
int root[200001];
int down[200001];
void co(int i,int pr){
sz[i] = 1;
for(auto j:adj[i]){
if(j==pr)continue;
co(j,i);
sz[i]+=sz[j];
}
}
int no = 1;
void dfs(int i,int pr,int ro){
val[i] = no++;
root[i] = ro;
down[ro] = i;
P[i] = pr;
int ma = -1 , su = 0;
for(auto j:adj[i]){
if(j==pr)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... |