# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
312876 | two_sides | One-Way Streets (CEOI17_oneway) | C++17 | 335 ms | 22136 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;
#define eb emplace_back
#define fi first
#define se second
struct edge {
int u, v;
};
using ii = pair <int, int>;
const int N = 1e5 + 5;
const int LG = 18;
int col[N], bri[N], pred[N];
int num[N], low[N], tim;
int par[N], p[LG][N], d[N];
vector <ii> adj[N]; edge ed[N];
int find_set(int u) {
return u == par[u] ?
u : par[u] = find_set(par[u]);
}
void dfs(int u) {
int v, i;
num[u] = low[u] = ++tim;
for (ii pp : adj[u]) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |