# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306007 | juggernaut | Dreaming (IOI13_dreaming) | C++14 | 1093 ms | 12024 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"dreaming.h"
//#include"grader.c"
#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
vector<pair<int,int>>g[100005];
bool vis[100005];
int mx[100005],mx2[100005],id[100005],mm,idd;
int dfs(int v,int p){
vis[v]=1;
int i=0,x;
id[v]=-1;
for(;i<g[v].size();i++)
if(g[v][i].fr!=p){
x=dfs(g[v][i].fr,v)+g[v][i].sc;
if(x>mx2[v]){
mx2[v]=x;
id[v]=g[v][i].fr;
}
}
return mx2[v];
}
void go(int v,int p,int val,int depth){
mx[v]=max(val,depth);
int m=0,i=0;
for(;i<g[v].size();i++)
if(g[v][i].fr!=p)
if(g[v][i].fr!=id[v]){
m=max(m,mx2[g[v][i].fr]+g[v][i].sc);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |