# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260913 | karma | Duathlon (APIO18_duathlon) | C++14 | 160 ms | 27168 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 pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
//#define int int64_t
using namespace std;
const int N = 2e5 + 7;
const int inf = 1e9 + 1;
typedef pair<int, int> pii;
int num[N], low[N];
pii e[N];
bool del[N];
vector<int> adj[N], st, g[N];
int n, m, Time, cnt, overall, sz[N];
void dfs(int u) {
num[u] = low[u] = ++Time;
st.pb(u);
for(int& i: adj[u]) {
if(del[i]) continue;
int v = e[i].fi ^ e[i].se ^ u;
del[i] = 1;
if(num[v] == 0) {
dfs(v);
low[u] = min(low[u], low[v]);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |