# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1046654 | _8_8_ | Jail (JOI22_jail) | C++17 | 1542 ms | 401228 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;
typedef long long ll;
const int N = 24e4 + 2, MOD = (int)1e9+7;
int n,x[N],y[N],m,it = 1,it1 = 1,s[N],f[N];
vector<int> g[N],G[N * 20];
int up[N][20],t[N][20],t1[N][20],tin[N],tout[N],timer = 0;
const int b = 18;
void dfs(int v,int pr) {
tin[v] = ++timer;
up[v][0] = pr;
if(!x[v]) {
t[v][0] = ++it;
} else {
t[v][0] = x[v];
}
if(!y[v]) {
t1[v][0] = ++it;
} else {
t1[v][0] = y[v];
}
for(int i = 1;i <= b;i++) {
up[v][i] = up[up[v][i-1]][i-1];
t[v][i] = ++it;
t1[v][i] = ++it;
// cout << t[v][i] << ' ' << t[v][i - 1] << "\n" ;
# | 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... |