# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
924572 | adhityamv | Cat Exercise (JOI23_ho_t4) | C++17 | 408 ms | 68544 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;
#define ll long long
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
int INF=1000000000;
const int N=200000;
const int K=400000;
int a[N];
vector<int> edges[N];
int parent[N];
int ind[N];
int m;
vector<int> et;
int focc[N];
int locc[N];
int depth[N];
void euler_tour(int u,int p){
et.push_back(u);
parent[u]=p;
for(int v:edges[u]){
if(v==p) continue;
depth[v]=depth[u]+1;
euler_tour(v,u);
et.push_back(u);
}
}
const int ln=20;
# | 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... |