# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160584 | Akashi | One-Way Streets (CEOI17_oneway) | C++14 | 350 ms | 43124 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 lim = 100005;
struct edge{
int x, y;
};
edge a[lim];
int n, m, NR;
int low[lim], id[lim], h[lim], T1[lim], T2[lim];
int TT[22][lim];
char ans[lim];
bool viz[lim];
stack <int> st;
vector <pair <int, int> > v[lim];
vector <pair <int, int> > vc[lim];
vector <int> ctc[lim];
map <pair <int, int>, int> f;
void tarjan(int nod = 1, int papa = 0){
viz[nod] = 1;
st.push(nod);
bool ok = 0;
for(auto it : v[nod]){
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... |