# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158934 | nikolashami | Valley (BOI19_valley) | C++20 | 123 ms | 45664 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll N=1e5+4,inf=2e18;
vector<array<ll,2>>g[N];
ll f[N],shp[N],dep[N],up[N][17],fm[N][17];
array<ll,2>e[N];
ll tin[N],tout[N],ti,n,s,q,ext;
void dfs(ll u,ll p){
f[u]=((shp[u]^1)*inf+dep[u]);
up[u][0]=p;
tin[u]=++ti;
for(auto[v,w]:g[u]){
if(!(v^p))continue;
dep[v]=dep[u]+w;
dfs(v,u);
f[u]=min(f[u],f[v]);
}
tout[u]=++ti;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n>>s>>q>>ext;
for(int i=1,u,v,w;i<n;++i){
# | 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... |