# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61162 | ainta | City (JOI17_city) | C++17 | 634 ms | 110144 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 "Encoder.h"
#include<cstdio>
#include<algorithm>
#include<vector>
#include<map>
#define N_ 501000
using namespace std;
int TH = 127;
vector<int>E[N_],Ch[N_];
int C[N_], cnt, n, par[N_];
void DFS(int a, int pp) {
C[a] = 1;
par[a] = pp;
for (auto &x : E[a]) {
if (x == pp)continue;
DFS(x, a);
Ch[a].push_back(x);
C[a] += C[x];
}
}
int Num[N_], Num2[N_], Ed[N_], cc, PP[N_], Ed2[N_];
void DFS2(int a) {
Num[a] = ++cc;
for (auto &x : Ch[a]) {
DFS2(x);
}
Ed[a] = cc;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |