# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
281715 | groeneprof | Bridges (APIO19_bridges) | C++14 | 686 ms | 24072 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 P(a) do{if(debug) cout<<a<<endl;} while(false)
#define H(a) P(#a<<": "<<a)
#define FR(i,a,b) for(int i = (a); i<(b); i++)
#define F(i,n) FR(i,0,n)
const bool debug = 0;
const int inf = 2e9;
using namespace std;
vector<vector<int> > ts, par, siz;
vector<pair<int,int> > edges;
vector<int> weights;
int n, m, q;
int root(int a,int t){
if(par[a].back() == a){
return a;
}
if(ts[a].back() > t){
ts[a].push_back(t);
par[a].push_back(par[a].back());
siz[a].push_back(siz[a].back());
}
return par[a].back() = root(par[a].back(),t);
}
void merge(int a, int b, int t){
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... |