# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1102513 | daoquanglinh2007 | Travelling Merchant (CCO21_day2problem1) | C++17 | 177 ms | 44132 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 pii pair <int, int>
#define fi first
#define se second
#define mp make_pair
const int NM = 2e5, inf = 1e9+7;
int N, M;
vector <pair <int, pii> > adj[NM+5], par[NM+5];
int timer = 0, num[NM+5], low[NM+5];
int comp = 0, scc[NM+5];
vector <int> arr[NM+5];
stack <int> st;
vector <int> adj_comp[NM+5];
int deg[NM+5];
vector <int> topo;
int ans[NM+5];
void dfs(int u){
num[u] = low[u] = ++timer;
st.push(u);
for (pair <int, pii> _ : adj[u]){
int v = _.fi;
if (scc[v]) continue;
if (num[v]){
low[u] = min(low[u], num[v]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |