oj.uz

Submission #943983

# Submission time Handle Problem Language Result Execution time Memory
943983 2024-03-12T06:13:12 Z pcc Valley (BOI19_valley) C++17
100 / 100
 778 ms 64852 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


const int mxn = 4e5+10;
vector<pii> t1[mxn],t2[mxn];
int w[mxn];
int N,S,Q,E;
pair<pii,int> req[mxn];
bitset<mxn> esc;
ll ans[mxn];
pii eid[mxn];
bitset<mxn> shop;

bool peko(pii r,int p){
	return r.fs<=p&&p<=r.sc;
}

namespace ESC{
	int pt = 0;
	pii eul[mxn];
	void dfs(int now,int par){
		eul[now].fs = ++pt;
		for(auto nxt:t1[now]){
			if(nxt.fs == par)continue;
			dfs(nxt.fs,now);
		}
		eul[now].sc = pt;
	}
	void GO(){
		dfs(E,E);
		esc.set();
		for(int i = 1;i<=Q;i++){
			auto [a,b] = req[i].fs;
			auto c = req[i].sc;
			if(peko(eul[a],eul[c].fs)&&peko(eul[b],eul[c].fs))esc[i] = false;
		}
		return;
	}
}


const ll inf = 1e14;
namespace CD{
	bitset<mxn> del;
	int sz[mxn];
	ll dep[mxn];
	pii eul[mxn];
	int pt;
	vector<array<int,3>> ask[mxn];
	pll seg[mxn*4];
	void modify(int now,int l,int r,int s,int e,ll v){
		if(l>=s&&e>=r){
			seg[now].sc += v;
			return;
		}
		int mid = (l+r)>>1;
		if(mid>=s)modify(now*2+1,l,mid,s,e,v);
		if(mid<e)modify(now*2+2,mid+1,r,s,e,v);
		seg[now].fs = min(seg[now*2+1].fs+seg[now*2+1].sc,seg[now*2+2].fs+seg[now*2+2].sc);
		return;
	}
	int szdfs(int now,int par){
		sz[now] = 1;
		for(auto nxt:t1[now]){
			if(nxt.fs == par||del[nxt.fs])continue;
			sz[now] += szdfs(nxt.fs,now);
		}
		return sz[now];
	}
	int find_centroid(int now,int par,int tar){
		for(auto nxt:t1[now]){
			if(nxt.fs == par||del[nxt.fs])continue;
			if(sz[nxt.fs]>tar)return find_centroid(nxt.fs,now,tar);
		}
		return now;
	}
	void dfs(int now,int par){
		eul[now].fs = ++pt;
		if(shop[now])modify(0,1,N,eul[now].fs,eul[now].fs,dep[now]-inf);
		for(auto nxt:t1[now]){
			if(nxt.fs == par||del[nxt.fs])continue;
			dep[nxt.fs] = dep[now]+nxt.sc;
			dfs(nxt.fs,now);
		}
		eul[now].sc = pt;
		return;
	}
	void dfs1(int now,int par){
		//cerr<<"DFS1:"<<now<<endl;
		for(auto [a,b,id]:ask[now]){
			if(peko(eul[a],eul[now].fs)&&peko(eul[b],eul[now].fs))continue;
			if(peko(eul[b],eul[a].fs))swap(a,b);
			if(eul[a].fs != -1&&eul[b].fs != -1)modify(0,1,N,eul[b].fs,eul[b].sc,inf);
			ans[id] = min(ans[id],dep[now]+seg[0].fs+seg[0].sc);
			if(eul[a].fs != -1&&eul[b].fs != -1)modify(0,1,N,eul[b].fs,eul[b].sc,-inf);
		}
		for(auto nxt:t1[now]){
			if(nxt.fs == par||del[nxt.fs])continue;
			dfs1(nxt.fs,now);
		}
		return;
	}
	void dfs2(int now,int par){
		//cerr<<"DFS2:"<<now<<endl;
		if(shop[now])modify(0,1,N,eul[now].fs,eul[now].fs,-dep[now]+inf);
		eul[now].fs = eul[now].sc = -1;
		for(auto nxt:t1[now]){
			if(nxt.fs == par||del[nxt.fs])continue;
			dfs2(nxt.fs,now);
		}
		return;
	}
	void CD(int now){
		//cerr<<"CD:"<<now<<endl;
		szdfs(now,now);
		now = find_centroid(now,now,(sz[now]-1)/2);
		pt = 0;
		dep[now] = 0;
		dfs(now,now);
		dfs1(now,now);
		dfs2(now,now);
		del[now] = true;
		for(auto nxt:t1[now]){
			if(del[nxt.fs])continue;
			CD(nxt.fs);
		}
		return;
	}
	void GO(){
		for(int i = 1;i<=N;i++)modify(0,1,N,i,i,inf);
		for(int i = 1;i<=Q;i++){
			ans[i] = inf;
			auto [a,b] = req[i].fs;
			auto c = req[i].sc;
			ask[c].push_back(array<int,3>({a,b,i}));
		}
		CD(1);
		return;
	}
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>S>>Q>>E;
	for(int i = 1;i<N;i++){
		int a,b,c;
		cin>>a>>b>>c;
		t1[a].push_back({b,c});
		t1[b].push_back({a,c});
		eid[i] = {a,b};
	}
	for(int i = 1;i<=S;i++){
		int k;
		cin>>k;
		shop[k] = true;
	}
	for(int i = 1;i<=Q;i++){
		int id,p;
		cin>>id>>p;
		req[i] = {eid[id],p};
	}
	ESC::GO();
	CD::GO();
	for(int i = 1;i<=Q;i++){
		if(esc[i])cout<<"escaped\n";
		else if(ans[i]>=inf)cout<<"oo\n";
		else cout<<ans[i]<<'\n';
	}
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 44376 KB Output is correct
2 Correct 13 ms 44636 KB Output is correct
3 Correct 13 ms 44636 KB Output is correct
4 Correct 12 ms 44636 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 44376 KB Output is correct
2 Correct 13 ms 44636 KB Output is correct
3 Correct 13 ms 44636 KB Output is correct
4 Correct 12 ms 44636 KB Output is correct
5 Correct 10 ms 44380 KB Output is correct
6 Correct 10 ms 44232 KB Output is correct
7 Correct 10 ms 44376 KB Output is correct
8 Correct 9 ms 44380 KB Output is correct
9 Correct 10 ms 44380 KB Output is correct
10 Correct 11 ms 44400 KB Output is correct
11 Correct 10 ms 44376 KB Output is correct
12 Correct 10 ms 44380 KB Output is correct
13 Correct 11 ms 44380 KB Output is correct
14 Correct 12 ms 44448 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 57168 KB Output is correct
2 Correct 495 ms 60520 KB Output is correct
3 Correct 638 ms 60672 KB Output is correct
4 Correct 778 ms 62464 KB Output is correct
5 Correct 688 ms 62264 KB Output is correct
6 Correct 733 ms 64852 KB Output is correct

Subtask #4
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 44376 KB Output is correct
2 Correct 13 ms 44636 KB Output is correct
3 Correct 13 ms 44636 KB Output is correct
4 Correct 12 ms 44636 KB Output is correct
5 Correct 10 ms 44380 KB Output is correct
6 Correct 10 ms 44232 KB Output is correct
7 Correct 10 ms 44376 KB Output is correct
8 Correct 9 ms 44380 KB Output is correct
9 Correct 10 ms 44380 KB Output is correct
10 Correct 11 ms 44400 KB Output is correct
11 Correct 10 ms 44376 KB Output is correct
12 Correct 10 ms 44380 KB Output is correct
13 Correct 11 ms 44380 KB Output is correct
14 Correct 12 ms 44448 KB Output is correct
15 Correct 324 ms 57168 KB Output is correct
16 Correct 495 ms 60520 KB Output is correct
17 Correct 638 ms 60672 KB Output is correct
18 Correct 778 ms 62464 KB Output is correct
19 Correct 688 ms 62264 KB Output is correct
20 Correct 733 ms 64852 KB Output is correct
21 Correct 184 ms 60552 KB Output is correct
22 Correct 258 ms 60156 KB Output is correct
23 Correct 306 ms 60240 KB Output is correct
24 Correct 380 ms 61776 KB Output is correct
25 Correct 335 ms 64024 KB Output is correct
26 Correct 160 ms 60500 KB Output is correct
27 Correct 222 ms 60160 KB Output is correct
28 Correct 316 ms 60156 KB Output is correct
29 Correct 345 ms 62036 KB Output is correct
30 Correct 367 ms 64004 KB Output is correct
31 Correct 160 ms 60492 KB Output is correct
32 Correct 271 ms 60368 KB Output is correct
33 Correct 333 ms 60244 KB Output is correct
34 Correct 449 ms 62032 KB Output is correct
35 Correct 388 ms 64084 KB Output is correct
36 Correct 388 ms 62288 KB Output is correct