# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
577043 | training4usaco | 다리 (APIO19_bridges) | C++11 | 3086 ms | 181920 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 <iostream>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
#define int long long
#define MAXN 50005
#define MAXM 100005
#define BLOCK 320
int n, m, q;
int u[MAXM], v[MAXM], w[MAXM];
int type[MAXM], x[MAXM], y[MAXM];
int par[MAXN], sizes[MAXN];
stack<int> history;
int ans[MAXN];
vector<int> addon[MAXM];
int getRoot(int x){
if(par[x] == x) {
return x;
}
return getRoot(par[x]);
}
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... |