# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340075 | lukameladze | One-Way Streets (CEOI17_oneway) | C++14 | 836 ms | 78384 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 f first
#define s second
#define pb push_back
using namespace std;
const int N=2e5+5;
long long u,vv,n,m,t,lc,a[N],out[N],lv[N],b[N],fix[N],in[N],tin,p[N][20],low[N],brd[N];
vector < pair <long long, long long > > v[N];
map < pair < int, int >, int > ind;
long long pa[N];
map < pair <long long, long long > , long long> ans,brdg;
char ch[N];
int get_col(int a)
{
if (a==pa[a]) return a;
return pa[a]=get_col(pa[a]);
}
void dfs(int a, int b)
{
fix[a]=1;
tin++;
in[a]=low[a]=tin;
lv[a]=lv[b]+1;
p[a][0]=b;
for (int i=1; i<=18; i++)
{
p[a][i]=p[p[a][i-1]][i-1];
}
for (int i=0; i<v[a].size(); i++)
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... |