# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92322 | Bodo171 | One-Way Streets (CEOI17_oneway) | C++14 | 160 ms | 25220 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 <fstream>
#include <vector>
using namespace std;
const int nmax=100005;
char ans[nmax];
vector<int> v[nmax],ag[nmax];
int tt[nmax],rg[nmax],dad[nmax],bc[nmax],st[nmax],lnod[nmax],rnod[nmax],l[nmax],r[nmax],low[nmax],lev[nmax],a[nmax],b[nmax],to_dad[nmax],sus[nmax],edg[nmax],marked[nmax];
int n,m,q,bcc,u,nr,i,x,y,mu;
int finds(int x)
{
int y=x,aux;
while(x!=tt[x])
x=tt[x];
while(y!=x)
{
aux=tt[y];
tt[y]=x;
y=aux;
}
return x;
}
void unite(int A,int B)
{
if(rg[A]<rg[B]) swap(A,B);
tt[B]=A;
rg[A]+=rg[B];
}
void mark_bcc(int 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... |