oj.uz

Submission #545538

# Submission time Handle Problem Language Result Execution time Memory
545538 2022-04-04T19:37:23 Z MilosMilutinovic Valley (BOI19_valley) C++14
100 / 100
 274 ms 118836 KB 
#include<bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}

const ll inf=1e18;
int n,s,q,e,x[100005],y[100005],w[100005],id[100005],is[100005];
int root[100005],tsz,ls[5000005],rs[5000005],dfn[100005],dfo[100005],T;
ll dep[100005],st[5000005],lzy[5000005];
vector<pii> adj[100005];

void build(int&c,int l,int r){
	c=++tsz;
	if(l==r)return (void)(st[c]=(is[id[l]]?dep[id[l]]:inf));
	int m=(l+r)/2;
	build(ls[c],l,m);
	build(rs[c],m+1,r);
	st[c]=min(st[ls[c]],st[rs[c]]);
}

void modify(int p,int&c,int l,int r,int tl,int tr,int v){
	if(tl>tr||l>tr||r<tl) return;
	c=++tsz; ls[c]=ls[p]; rs[c]=rs[p]; st[c]=st[p]; lzy[c]=lzy[p];
	if(tl<=l&&r<=tr){st[c]+=v; lzy[c]+=v; return;}
	int m=(l+r)/2;
	modify(ls[p],ls[c],l,m,tl,tr,v);
	modify(rs[p],rs[c],m+1,r,tl,tr,v);
	st[c]=min(st[ls[c]],st[rs[c]])+lzy[c];
}

ll query(int c,int l,int r,int tl,int tr){
	if(tl>tr||l>tr||r<tl) return inf;
	if(tl<=l&&r<=tr) return st[c];
	int m=(l+r)/2;
	return min(query(ls[c],l,m,tl,tr),query(rs[c],m+1,r,tl,tr))+lzy[c];
}

void dfs0(int u,int p){
	dfn[u]=++T,id[T]=u;
	for(auto e:adj[u]) if(e.fi!=p) dep[e.fi]=dep[u]+e.se,dfs0(e.fi,u);
	dfo[u]=T;
}
void dfs1(int u,int p,int wu){
	if(p!=0) modify(root[p],root[u],1,T,dfn[u],dfo[u],-2*wu);
	for(auto e:adj[u]) if(e.fi!=p) dfs1(e.fi,u,e.se);
}

bool anc(int u,int v){return dfn[u]<=dfn[v]&&dfo[v]<=dfo[u];}

void deb(int c,int l,int r){
	printf("st:%d %d %d %d %d\n",c,l,r,ls[c],rs[c]);
	if(l==r){printf("%lld ",st[c]); return;}
	int m=(l+r)/2;
	deb(ls[c],l,m);
	deb(rs[c],m+1,r);
}

int main(){
	scanf("%d%d%d%d",&n,&s,&q,&e);
	for(int i=1;i<n;i++){
		scanf("%d%d%d",&x[i],&y[i],&w[i]);
		adj[x[i]].pb(mp(y[i],w[i]));
		adj[y[i]].pb(mp(x[i],w[i]));
	}
	for(int i=1,r;i<=s;i++) scanf("%d",&r),is[r]=1;
	dfs0(1,0); build(root[1],1,T); dfs1(1,0,0);
	//deb(root[1],1,T);
	while(q--){
		int i,r;scanf("%d%d",&i,&r);
		int u=x[i],v=y[i];
		if(dep[u]>dep[v]) swap(u,v);
		if(anc(v,e)==anc(v,r)){printf("escaped\n"); continue;}
		ll ans=dep[r];
		if(anc(v,r)) ans+=query(root[r],1,T,dfn[v],dfo[v]);
		else ans+=min(query(root[r],1,T,1,dfn[v]-1),query(root[r],1,T,dfo[v]+1,T));
		if(ans>=1e17) printf("oo\n");
		else printf("%lld\n",ans);
	}
	return 0;
}

Compilation message

valley.cpp: In function 'int main()':
valley.cpp:71:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |  scanf("%d%d%d%d",&n,&s,&q,&e);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
valley.cpp:73:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   scanf("%d%d%d",&x[i],&y[i],&w[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
valley.cpp:77:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |  for(int i=1,r;i<=s;i++) scanf("%d",&r),is[r]=1;
      |                          ~~~~~^~~~~~~~~
valley.cpp:81:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |   int i,r;scanf("%d%d",&i,&r);
      |           ~~~~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2772 KB Output is correct
2 Correct 4 ms 2772 KB Output is correct
3 Correct 4 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2772 KB Output is correct
2 Correct 4 ms 2772 KB Output is correct
3 Correct 4 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 3 ms 3028 KB Output is correct
6 Correct 3 ms 3028 KB Output is correct
7 Correct 3 ms 3156 KB Output is correct
8 Correct 3 ms 3028 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 3 ms 3156 KB Output is correct
11 Correct 3 ms 3028 KB Output is correct
12 Correct 3 ms 3028 KB Output is correct
13 Correct 3 ms 3156 KB Output is correct
14 Correct 3 ms 3156 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 57132 KB Output is correct
2 Correct 226 ms 63268 KB Output is correct
3 Correct 270 ms 67536 KB Output is correct
4 Correct 246 ms 82512 KB Output is correct
5 Correct 224 ms 80332 KB Output is correct
6 Correct 258 ms 118836 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2772 KB Output is correct
2 Correct 4 ms 2772 KB Output is correct
3 Correct 4 ms 2772 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 3 ms 3028 KB Output is correct
6 Correct 3 ms 3028 KB Output is correct
7 Correct 3 ms 3156 KB Output is correct
8 Correct 3 ms 3028 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 3 ms 3156 KB Output is correct
11 Correct 3 ms 3028 KB Output is correct
12 Correct 3 ms 3028 KB Output is correct
13 Correct 3 ms 3156 KB Output is correct
14 Correct 3 ms 3156 KB Output is correct
15 Correct 182 ms 57132 KB Output is correct
16 Correct 226 ms 63268 KB Output is correct
17 Correct 270 ms 67536 KB Output is correct
18 Correct 246 ms 82512 KB Output is correct
19 Correct 224 ms 80332 KB Output is correct
20 Correct 258 ms 118836 KB Output is correct
21 Correct 170 ms 60080 KB Output is correct
22 Correct 179 ms 62284 KB Output is correct
23 Correct 274 ms 66728 KB Output is correct
24 Correct 231 ms 79844 KB Output is correct
25 Correct 265 ms 103488 KB Output is correct
26 Correct 187 ms 60356 KB Output is correct
27 Correct 180 ms 62668 KB Output is correct
28 Correct 202 ms 66852 KB Output is correct
29 Correct 261 ms 79764 KB Output is correct
30 Correct 232 ms 102928 KB Output is correct
31 Correct 197 ms 60564 KB Output is correct
32 Correct 186 ms 62780 KB Output is correct
33 Correct 223 ms 67148 KB Output is correct
34 Correct 241 ms 80244 KB Output is correct
35 Correct 227 ms 104928 KB Output is correct
36 Correct 216 ms 77440 KB Output is correct