# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711271 | groshi | One-Way Streets (CEOI17_oneway) | C++17 | 133 ms | 20044 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;
struct wi{
vector<int> Q,Q2;
int pocz=0,kon=0;
int most=0;
int low=0;
bool odw=0;
int pree=0;
bool odw2=0;
int nr_do_ojca=0;
int odw3=0;
}*w;
int t[200000][2];
string wypisz="";
int pre=1;
void reku(int x,int ojc,int jaka)
{
w[x].odw=1;
w[x].pree=pre;
w[x].low=pre;
pre++;
for(int i=0;i<w[x].Q.size();i+=2)
{
int pom=w[x].Q[i];
if(w[x].Q[i+1]==jaka)
continue;
if(w[pom].odw==1)
w[x].low=min(w[x].low,w[pom].pree);
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... |