# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
446618 | renzo1805 | One-Way Streets (CEOI17_oneway) | C++14 | 189 ms | 33252 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<cstdio>
#include<vector>
using namespace std;
const int MAXN = 100005;
const int LOG = 19;
typedef pair<int, int> edge;
int N, M, Q;
edge E[MAXN];
char res[MAXN];
vector<int> G[MAXN];
vector<int> T[MAXN];
int P[MAXN][LOG];
int L[MAXN];
int up[MAXN];
int X[MAXN], Y[MAXN];
int f[MAXN]; // for merging edges
int dfsnum[MAXN];
int low[MAXN];
int num;
inline int find_set( const int &u ){
return u == f[u]? u:( f[u] = find_set( f[u] ) );
}
inline int nxt( const int &e, const int &u ){
return E[e].first == u? E[e].second:E[e].first;
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... |