# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415178 | A_D | One-Way Streets (CEOI17_oneway) | C++14 | 929 ms | 72440 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 int long long
#define ii pair<int,int>
#define F first
#define S second
#define du long double
using namespace std;
const int N=1e5+100;
vector<int> g[N],g2[N];
set<int> st[N];
int u[N];
int v[N];
int a[N];
bool vis[N];
int tin[N];
int low[N];
int timer;
map<ii,char> mp;
map<ii,bool> bridg;
map<int,int> mp2;
int sz;
void dfs2(int v,int p) {
vis[v] = true;
tin[v] = low[v] = timer++;
bool cnt=0;
for (int to : g[v]) {
if (to == p&&cnt==0){
cnt=1;
continue;
}
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... |