# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71872 | bnahmad15 | One-Way Streets (CEOI17_oneway) | C++17 | 579 ms | 59692 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 forn(i,j,n) for(int i = (int)j;i<=(int)n;i++)
#define nfor(i,j,n) for(int i = (int)j;i>=(int)n;i--)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N = 100001,LOG = 17;
int n,m,p,u,v,x[N],y[N],is[N],cnt = 0,num[N],low[N],det[N],cc = 0,comp[N],vis[N],nxt[N],pr[N][LOG],dep[N];
pair<int,int> st[N];
vector<pair<int,pii> > g[N],g2[N];
map <pii,int> mp;
char res[N];
inline pii rev(pii a){
if(a.second == 1)
a.second = 2;
else if(a.second == 2)
a.second = 1;
return a;
}
void dfs(int uu,int prnt){
low[uu] = num[uu] = ++cnt;
forn(i,0,g[uu].size()-1){
int vv = g[uu][i].first;
if(num[vv] == -1){
dfs(vv,uu);
if(low[vv] > num[uu]){
is[g[uu][i].second.first] = 1;
}
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... |