# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100902 | autumn_eel | Telegraph (JOI16_telegraph) | C++14 | 211 ms | 23032 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 rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
vector<int>E[200000],G[200000];
int deg[200000];
int a[200000],c[200000];
bool loop[200000];
int id[200000];
int loopMax[200000],loopcnt[200000],loopsz[200000];
void dfs(int v,int k){
id[v]=k;
for(int u:E[v]){
if(id[u]==-1){
dfs(u,k);
}
}
}
ll ans=0;
void dfs2(int v){
int Max=0;
int Max2=0;
for(int u:E[v]){
if(loop[u]){
Max2=c[u];
}
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... |