# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979806 | VMaksimoski008 | One-Way Streets (CEOI17_oneway) | C++17 | 4 ms | 14428 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>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 5;
const double eps = 1e-9;
vector<int> graph[maxn], in(maxn), low(maxn), vis(maxn), cmp(maxn), tree[maxn], dp(maxn), dist(maxn);
int timer = 1, n, m, curr;
set<pii> bridges;
vector<vector<int> > G;
void dfs(int u, int p) {
vis[u] = 1;
low[u] = in[u] = timer++;
bool ok = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |