# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64940 | gnoor | Dreaming (IOI13_dreaming) | C++17 | 134 ms | 14072 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 <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int cen;
int ans=0;
struct ei {
int vec,wgt;
};
vector<ei> pth[100100];
bool visit[100100];
int mx[100100];
int smx[100100];
int survey(int x,int p) {
visit[x]=true;
int cur;
for (auto &i:pth[x]) {
if (i.vec==p) continue;
cur=i.wgt+survey(i.vec,x);
if (cur>=mx[x]) {
smx[x]=mx[x];
mx[x]=cur;
# | 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... |