# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54571 | khsoo01 | Training (IOI07_training) | C++11 | 70 ms | 8700 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;
const int N = 1005, M = 5005, inf = 1e9;
int n, m, par[N], dfn[N], inv[N], all, cc;
int idx[N][N], sz[N], dt[N][1<<11], val[11][11];
int fir, sec, len;
vector<int> adj[N], edg[N];
struct edge {int a, b, v;} a[M];
void calc (int C, int P) {
par[C] = P;
dfn[C] = ++cc;
inv[cc] = C;
for(auto &T : adj[C]) {
if(T == P) continue;
calc(T, C);
}
}
bool getfns (int C, int P, int O) {
bool F = false;
if(C == O) F = true;
else {
for(auto &T : adj[C]) {
if(T == P) continue;
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... |
# | 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... |