# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
914320 | Ninedesu | Dreaming (IOI13_dreaming) | C++14 | 37 ms | 15952 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<bits/stdc++.h>
#define ll long long
#define pii pair<ll,int>
using namespace std;
const int N=1e5+1;
int compo;
ll a,adis,b,bdis,c,cdis;
ll dis[N];
bool chk;
bitset<N>vis;
vector<pii>adj[N];
void dfs1(int u,int p,bool boo){
vis[u]=true;
if(!boo&&dis[u]>adis){
a=u;
adis=dis[u];
}
else if(boo&&dis[u]>bdis){
b=u;
bdis=dis[u];
}
for(pii wv:adj[u]){
ll w=wv.first;
int v=wv.second;
if(v==p)continue;
dis[v]=dis[u]+w;
dfs1(v,u,boo);
# | 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... |