# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
121021 | tinder | Telegraph (JOI16_telegraph) | C++14 | 145 ms | 16376 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;
const int maxn = 1e5 + 5;
using ll = long long;
int n;
ll c[maxn];
int a[maxn];
vector<int> g[maxn];
ll tot = 0;
vector<vector<int>> cycs;
int onstk[maxn];
int vis[maxn];
ll mx1[maxn], mx2[maxn];
void insert(int i, ll val) {
mx2[i] = max(mx2[i], val);
if(mx2[i] > mx1[i]) swap(mx1[i], mx2[i]);
}
int dfs(int u) {
onstk[u] = 1;
vis[u] = 1;
for(int v : g[u]) {
if(onstk[v]) {
cycs.back().push_back(u);
return 1;
} else if(!vis[v]) {
int ret = dfs(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... |