# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
222013 | MKopchev | One-Way Streets (CEOI17_oneway) | C++14 | 163 ms | 35296 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;
const int nmax=1e5+42;
int n,m;
vector< pair<int/*to*/,int/*id*/> > adj[nmax];
char output[nmax];
vector<int> forced[nmax];
int t,in[nmax],low[nmax];
vector<int> component;
bool cut[nmax];
void dfs(int node,int parent_edge)
{
if(in[node])return;
component.push_back(node);
t++;
in[node]=t;
low[node]=t;
for(auto k:adj[node])
if(abs(parent_edge)!=abs(k.second))
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... |