# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426144 | duality | The short shank; Redemption (BOI21_prison) | C++11 | 671 ms | 223492 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 mp make_pair
#define pb push_back
typedef long long int LLI;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
int t[2000000];
vpii in;
vpii S;
vi adjList[2000000];
vi S2;
int height[2000000];
vi vv;
int doDFS(int u) {
int i;
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i];
doDFS(v),height[u] = max(height[u],height[v]+1);
}
return 0;
}
int doDFS2(int u,int l) {
int i,f = 0;
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i];
if (!f && (height[u] == height[v]+1)) doDFS2(v,l+1),f = 1;
else doDFS2(v,1);
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... |