# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124531 | TadijaSebez | Bridges (APIO19_bridges) | C++11 | 2748 ms | 49156 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>
using namespace std;
#define pb push_back
const int N=100050;
const int B=1050;
int w[N],u[N],v[N];
bool ban[N];
int t[N],b[N],c[N];
vector<int> use[B];
struct DSU
{
int p[N],sz[N];
void init(){ for(int i=0;i<N;i++) p[i]=i,sz[i]=1;}
void init(int n){ for(int i=1;i<=n;i++) p[i]=i,sz[i]=1;}
DSU(){ init();}
int Find(int u){ return u==p[u]?u:Find(p[u]);}
stack<int> was;
void Union(int u, int v)
{
u=Find(u);
v=Find(v);
if(u==v){ was.push(0);return;}
if(sz[u]>sz[v])
{
p[v]=u;
sz[u]+=sz[v];
was.push(v);
}
else
{
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... |