Submission #1158560

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
11585602025-02-27 08:13:08AlgorithmWarriorValley (BOI19_valley)C++20
100 / 100
113 ms37128 KiB
#include <bits/stdc++.h>
using namespace std;
int const MAX=1e5+5;
int const LOG=20;
long long const INF=1e18;
int n,nrs,q,root;
struct edge{
int nod,len;
};
struct muchie{
int a,b;
}much[MAX];
vector<edge>tree[MAX];
int ancestor[MAX][LOG];
long long dist_shop[MAX][LOG];
bool shop[MAX];
long long nearest_sub[MAX];
long long dist_rt[MAX];
int niv[MAX];
void read(){
cin>>n>>nrs>>q>>root;
int i;
for(i=1;i<n;++i){
int a,b,w;
cin>>a>>b>>w;
tree[a].push_back({b,w});
tree[b].push_back({a,w});
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...