# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124976 | semiauto | One-Way Streets (CEOI17_oneway) | C++14 | 919 ms | 43256 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;
int n,m,a,b,t,i,who,k,q;
char ch[100001];
vector <int> v[100001];
vector <pair <int,pair <int,int> > > gr[100001];
bool fix[100001],block[100001],isbridge[100001];
int tin[100001],low[100001],parent[100001],in[100001],out[100001],aloup[100001],alodown[100001],A[100001],B[100001],p[100001][17];
map <pair<int,int>,int> mymap;
void dfsjust(int a,int c) {
parent[a]=c;
int i;
for (i=0;i<v[a].size();i++) {
if (parent[v[a][i]] && parent[v[a][i]]!=c && isbridge[mymap[{a,v[a][i]}]]) {
gr[c].push_back({parent[v[a][i]],{a,v[a][i]}});
gr[parent[v[a][i]]].push_back({c,{v[a][i],a}});
}
if (!parent[v[a][i]] && !isbridge[mymap[{a,v[a][i]}]])
dfsjust(v[a][i],c);
}
}
void justdfs(int a) {
fix[a]=1;
int i;
for (i=0;i<v[a].size();i++)
if (!fix[v[a][i]])
justdfs(v[a][i]);
}
void dfs(int a,int b) {
fix[a]=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... |