# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086606 | Icelast | Worst Reporter 4 (JOI21_worst_reporter4) | C++17 | 478 ms | 208392 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 <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;
vector<int> find_cycle(vector<vector<int>> &adj){
int n = adj.size()-1;
vector<int> cyc(n+1, 0);
vector<int> vis(n+1, 0), pa(n+1, -1);
auto dfs = [&](auto dfs, int u) -> void{
vis[u] = 1;
for(int v : adj[u]){
if(vis[v] == 1){
//cycle found
int t = u;
while(t != v){
cyc[t] = v;
t = pa[t];
}
cyc[v] = v;
}
if(!vis[v]){
pa[v] = u;
dfs(dfs, v);
}
}
vis[u] = 2;
};
for(int i = 1; i <= n; i++){
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... |