# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
207992 | dennisstar | Toll (APIO13_toll) | C++17 | 1665 ms | 18796 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 fi first
#define se second
#define eb emplace_back
#define all(V) (V).begin(), (V).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX = 100005;
struct UF {
int pr[MX];
void init(int X) { fill(pr, pr+X+1, 0); }
int gp(int x) { return pr[x]?(pr[x]=gp(pr[x])):x; }
bool Un(int x, int y) {
x=gp(x), y=gp(y);
if (x!=y) pr[y]=x;
return x!=y;
}
}U;
int N, M, K, T, in[MX], chk[50], D[50], P[50], Mn[50];
ll C[MX], sz[50], Pp[50], A;
vector<pair<int, pii> > Ei, Eu, Ep, Eq;
vector<pii> New, adj[50]; vector<int> im[MX];
void dfs1(int n, int m) {
in[n]=m; sz[m]+=C[n];
for (auto &i:im[n]) if (!in[i]) dfs1(i, m);
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... |