# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93470 | Flying_dragon_02 | Telegraph (JOI16_telegraph) | C++14 | 88 ms | 17896 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 fi first
#define se second
#define pb push_back
#define mp make_pair
#define int long long
typedef pair<int, int> ii;
const int N = 1e5 + 5;
const int inf = 1e15;
int c[N], par[N], f[2], ck[N], val[N], ans, dp[N], n, lmao[N];
vector<int> graph[N], cycle, vec;
bool vis[N];
void dfs(int u) {
if(lmao[u]) return ;
vec.pb(u);
if(vis[u] == 1) {
int p = par[u];
cycle.pb(u);
while(p != u) {
cycle.pb(p);
p = par[p];
}
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... |