# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1156119 | motion | Valley (BOI19_valley) | C++20 | 136 ms | 42072 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
vector<bool> shop;
vector<ll> dep,magic;
vector<int> parents,dist,tin,tout;
vector<vector<pair<int,int>>> graf;
int tim=0;
void dfs(int x,int parent=-1,ll deph=0,int dista=0)
{
tin[x]=++tim;
parents[x]=parent;
dep[x]=deph;
dist[x]=dista;
for(auto [node,l]:graf[x])
{
if(node==parent) continue;
dfs(node,x,deph+l,dista+1);
}
if(shop[x])
{
magic[x]=dep[x];
}
else magic[x]=1e17;
for(auto [node,l]:graf[x])
{
if(node==parent) continue;
magic[x]=min(magic[x],magic[node]);
}
# | 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... |