# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154960 | karma | Mergers (JOI19_mergers) | C++14 | 3045 ms | 73272 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>
#define Task "test"
#define ll long long
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
const int N = int(5e5) + 5;
typedef pair<int, int> pii;
vector<int> a[N], g;
int sz[N], n, k, u, v, nstate, full, res = 0;
int cnt[N], s[N], orgcnt[N], deg[N];
int in[N], out[N], Time;
bool big[N], choose[N];
vector<pii> vertex;
void DFS(int u, int par) {
sz[u] = 1; in[u] = ++Time;
for(int i = 0; i < int(a[u].size()); ++i) {
if(a[u][i] == par) swap(a[u][i], a[u].back());
if(a[u][i] != par) DFS(a[u][i], u), sz[u] += a[u][i];
}
if(u != 1) a[u].pop_back();
out[u] = Time;
}
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... |