oj.uz

답안 #931558

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931558 2024-02-22T04:13:15 Z pcc Cat Exercise (JOI23_ho_t4) C++14
100 / 100
 572 ms 97404 KB 
#include <bits/stdc++.h>
using namespace std;


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

const int mxn = 2e5+10;
vector<int> tree[mxn];
vector<pii> ctree[mxn];
int N;
int arr[mxn];
const int SS = 5e5;
int SSS;

vector<int> dfn;
pii eul[mxn];

struct SEG{
	struct node{
		pii mx;
		int tag;
		node(){
			mx.fs = mx.sc = tag = 0;
		}
	};
	node seg[mxn*4];
	SEG(){
		for(auto &i:seg)i.mx.fs = i.mx.sc = i.tag = 0;
	}
	void push(int now){
		seg[now].mx.fs += seg[now].tag;
		if(now*2+2>=mxn*4)exit(0);
		seg[now*2+1].tag += seg[now].tag;
		seg[now*2+2].tag += seg[now].tag;
		return;
	}
	node pull(node ls,node rs){
		node re;
		ls.mx.fs += ls.tag,rs.mx.fs += rs.tag;
		re.mx = max(ls.mx,rs.mx);
		return re;
	}
	void modify(int now,int l,int r,int s,int e,int v){
		if(e<s)exit(0);
		if(l>=s&&e>=r){
			if(l == r)seg[now].mx.sc = l;
			seg[now].tag += v;
			return;
		}
		push(now);
		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] = pull(seg[now*2+1],seg[now*2+2]);
		return;
	}
	pll getbig(int now,int l,int r,int s,int e){
		if(l>=s&&e>=r)return make_pair(seg[now].mx.fs+seg[now].tag,seg[now].mx.sc);
		if(l==r)exit(0);
		push(now);
		int mid = (l+r)>>1;
		if(mid>=e)return getbig(now*2+1,l,mid,s,e);
		else if(mid<s)return getbig(now*2+2,mid+1,r,s,e);
		else{
			return max(getbig(now*2+1,l,mid,s,e),getbig(now*2+2,mid+1,r,s,e));
		}
	}
};
SEG seg;

namespace DB{
	int par[mxn][20];
	int dep[mxn];
	void dfs(int now){
		for(int i = 1;i<20;i++)par[now][i] = par[par[now][i-1]][i-1];
		for(auto nxt:tree[now]){
			if(nxt == par[now][0])continue;
			dep[nxt] = dep[now]+1;
			par[nxt][0] = now;
			dfs(nxt);
		}
		return;
	}
	void GO(int rt){
		par[rt][0] = rt;
		dfs(rt);
	}
	int lca(int a,int b){
		if(dep[a]<dep[b])swap(a,b);
		int d = dep[a]-dep[b];
		for(int i = 19;i>=0;i--){
			if(d&(1<<i))a = par[a][i];
		}
		for(int i = 19;i>=0;i--){
			if(par[a][i] != par[b][i])a = par[a][i],b = par[b][i];
		}
		return a==b?a:par[a][0];
	}
	int up(int a,int d){
		for(int i = 19;i>=0;i--){
			if(d&(1<<i))a = par[a][i];
		}
		return a;
	}
	int dist(int a,int b){
		return dep[a]+dep[b]-dep[lca(a,b)]*2;
	}
}

namespace CTREE{
	void add_edge(int a,int b,int c){
		ctree[a].push_back(make_pair(b,c));
		//cerr<<"edge:"<<a<<','<<b<<":"<<c<<endl;
	}
	void GO(int rt,int par){
		if(rt == par)exit(0);
		//cerr<<rt<<','<<par<<endl;
		for(auto nxt:tree[rt]){
			if(nxt == DB::par[rt][0])continue;
			//cerr<<rt<<":"<<nxt<<":";
			auto nx = seg.getbig(0,1,N,eul[nxt].fs,eul[nxt].sc);
			if(nx.fs<0)continue;
			nx.sc = dfn[nx.sc];
			//cerr<<rt<<":"<<nxt<<endl;assert(rt != nxt);
			add_edge(rt,nx.sc,DB::dist(rt,nx.sc));
			GO(nx.sc,rt);
		}
		seg.modify(0,1,N,eul[rt].fs,eul[rt].sc,-mxn);
		int u = DB::up(rt,DB::dep[rt]-DB::dep[par]-1);
		auto nx = seg.getbig(0,1,N,eul[u].fs,eul[u].sc);
		if(nx.fs<=0)return;
		nx.sc = dfn[nx.sc];
		//cerr<<"UP:"<<rt<<":"<<nx.fs<<','<<nx.sc<<endl;
		//assert(nx.sc != rt);
		add_edge(rt,nx.sc,DB::dist(rt,nx.sc));
		GO(nx.sc,par);
		return;
	}
}


void edfs(int now,int par){
	SSS++;
	if(SSS>=SS)exit(0);
	dfn.push_back(now);
	eul[now].fs = dfn.size()-1;
	for(auto nxt:tree[now]){
		if(nxt == par)continue;
		edfs(nxt,now);
	}
	eul[now].sc = dfn.size()-1;
	SSS--;
	return;
}
namespace DP{
	int dp[mxn];
	void dfs(int now,int par){
		dp[now] = 0;
		for(auto nxt:ctree[now]){
			if(nxt.fs == par)continue;
			dfs(nxt.fs,now);
			dp[now] = max(dp[now],dp[nxt.fs]+nxt.sc);
		}
		return;
	}
	void GO(int rt){
		dfs(rt,rt);
	}
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N;
	for(int i = 1;i<=N;i++)cin>>arr[i];
	for(int i = 1;i<N;i++){
		int a,b;
		cin>>a>>b;
		tree[a].push_back(b);
		tree[b].push_back(a);
	}
	dfn.push_back(0);
	int rt = max_element(arr+1,arr+N+1)-arr;
	DB::GO(rt);
	edfs(rt,rt);//get euler
	//for(int i = 1;i<=N;i++)cerr<<dfn[i]<<',';cerr<<endl;
	//for(int i = 1;i<=N;i++)cerr<<i<<"::"<<eul[i].fs<<','<<eul[i].sc<<endl;
	for(int i = 1;i<=N;i++)seg.modify(0,1,N,i,i,arr[dfn[i]]);
	CTREE::GO(rt,0);
	DP::GO(rt);
	cout<<DP::dp[rt];
}

Compilation message

Main.cpp:176:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  176 | main(){
      | ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 34648 KB Output is correct
2 Correct 8 ms 34652 KB Output is correct
3 Correct 7 ms 34652 KB Output is correct
4 Correct 7 ms 34652 KB Output is correct
5 Correct 7 ms 34708 KB Output is correct
6 Correct 8 ms 34708 KB Output is correct
7 Correct 8 ms 34736 KB Output is correct
8 Correct 7 ms 34652 KB Output is correct
9 Correct 7 ms 34652 KB Output is correct
10 Correct 8 ms 34804 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 34648 KB Output is correct
2 Correct 8 ms 34652 KB Output is correct
3 Correct 7 ms 34652 KB Output is correct
4 Correct 7 ms 34652 KB Output is correct
5 Correct 7 ms 34708 KB Output is correct
6 Correct 8 ms 34708 KB Output is correct
7 Correct 8 ms 34736 KB Output is correct
8 Correct 7 ms 34652 KB Output is correct
9 Correct 7 ms 34652 KB Output is correct
10 Correct 8 ms 34804 KB Output is correct
11 Correct 8 ms 34712 KB Output is correct
12 Correct 8 ms 34736 KB Output is correct
13 Correct 8 ms 34652 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 8 ms 34712 KB Output is correct
16 Correct 9 ms 34648 KB Output is correct
17 Correct 8 ms 34652 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 34648 KB Output is correct
2 Correct 8 ms 34652 KB Output is correct
3 Correct 7 ms 34652 KB Output is correct
4 Correct 7 ms 34652 KB Output is correct
5 Correct 7 ms 34708 KB Output is correct
6 Correct 8 ms 34708 KB Output is correct
7 Correct 8 ms 34736 KB Output is correct
8 Correct 7 ms 34652 KB Output is correct
9 Correct 7 ms 34652 KB Output is correct
10 Correct 8 ms 34804 KB Output is correct
11 Correct 8 ms 34712 KB Output is correct
12 Correct 8 ms 34736 KB Output is correct
13 Correct 8 ms 34652 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 8 ms 34712 KB Output is correct
16 Correct 9 ms 34648 KB Output is correct
17 Correct 8 ms 34652 KB Output is correct
18 Correct 12 ms 35416 KB Output is correct
19 Correct 13 ms 35328 KB Output is correct
20 Correct 13 ms 35420 KB Output is correct
21 Correct 13 ms 35416 KB Output is correct
22 Correct 16 ms 35220 KB Output is correct
23 Correct 13 ms 35248 KB Output is correct
24 Correct 12 ms 35164 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 34648 KB Output is correct
2 Correct 8 ms 34652 KB Output is correct
3 Correct 7 ms 34652 KB Output is correct
4 Correct 7 ms 34652 KB Output is correct
5 Correct 7 ms 34708 KB Output is correct
6 Correct 8 ms 34708 KB Output is correct
7 Correct 8 ms 34736 KB Output is correct
8 Correct 7 ms 34652 KB Output is correct
9 Correct 7 ms 34652 KB Output is correct
10 Correct 8 ms 34804 KB Output is correct
11 Correct 8 ms 34712 KB Output is correct
12 Correct 8 ms 34736 KB Output is correct
13 Correct 8 ms 34652 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 8 ms 34712 KB Output is correct
16 Correct 9 ms 34648 KB Output is correct
17 Correct 8 ms 34652 KB Output is correct
18 Correct 12 ms 35416 KB Output is correct
19 Correct 13 ms 35328 KB Output is correct
20 Correct 13 ms 35420 KB Output is correct
21 Correct 13 ms 35416 KB Output is correct
22 Correct 16 ms 35220 KB Output is correct
23 Correct 13 ms 35248 KB Output is correct
24 Correct 12 ms 35164 KB Output is correct
25 Correct 8 ms 34908 KB Output is correct
26 Correct 15 ms 35420 KB Output is correct
27 Correct 14 ms 35420 KB Output is correct
28 Correct 15 ms 35420 KB Output is correct
29 Correct 14 ms 35420 KB Output is correct
30 Correct 14 ms 35164 KB Output is correct
31 Correct 14 ms 34992 KB Output is correct
32 Correct 15 ms 35256 KB Output is correct
33 Correct 13 ms 35112 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 34648 KB Output is correct
2 Correct 8 ms 34652 KB Output is correct
3 Correct 7 ms 34652 KB Output is correct
4 Correct 7 ms 34652 KB Output is correct
5 Correct 7 ms 34708 KB Output is correct
6 Correct 8 ms 34708 KB Output is correct
7 Correct 8 ms 34736 KB Output is correct
8 Correct 7 ms 34652 KB Output is correct
9 Correct 7 ms 34652 KB Output is correct
10 Correct 8 ms 34804 KB Output is correct
11 Correct 8 ms 34712 KB Output is correct
12 Correct 8 ms 34736 KB Output is correct
13 Correct 8 ms 34652 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 8 ms 34712 KB Output is correct
16 Correct 9 ms 34648 KB Output is correct
17 Correct 8 ms 34652 KB Output is correct
18 Correct 12 ms 35416 KB Output is correct
19 Correct 13 ms 35328 KB Output is correct
20 Correct 13 ms 35420 KB Output is correct
21 Correct 13 ms 35416 KB Output is correct
22 Correct 16 ms 35220 KB Output is correct
23 Correct 13 ms 35248 KB Output is correct
24 Correct 12 ms 35164 KB Output is correct
25 Correct 299 ms 97404 KB Output is correct
26 Correct 288 ms 95992 KB Output is correct
27 Correct 280 ms 95932 KB Output is correct
28 Correct 287 ms 90100 KB Output is correct
29 Correct 282 ms 91840 KB Output is correct
30 Correct 289 ms 91512 KB Output is correct
31 Correct 284 ms 92044 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 34652 KB Output is correct
2 Correct 8 ms 34652 KB Output is correct
3 Correct 313 ms 83784 KB Output is correct
4 Correct 308 ms 83908 KB Output is correct
5 Correct 298 ms 83652 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 34648 KB Output is correct
2 Correct 8 ms 34652 KB Output is correct
3 Correct 7 ms 34652 KB Output is correct
4 Correct 7 ms 34652 KB Output is correct
5 Correct 7 ms 34708 KB Output is correct
6 Correct 8 ms 34708 KB Output is correct
7 Correct 8 ms 34736 KB Output is correct
8 Correct 7 ms 34652 KB Output is correct
9 Correct 7 ms 34652 KB Output is correct
10 Correct 8 ms 34804 KB Output is correct
11 Correct 8 ms 34712 KB Output is correct
12 Correct 8 ms 34736 KB Output is correct
13 Correct 8 ms 34652 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 8 ms 34712 KB Output is correct
16 Correct 9 ms 34648 KB Output is correct
17 Correct 8 ms 34652 KB Output is correct
18 Correct 12 ms 35416 KB Output is correct
19 Correct 13 ms 35328 KB Output is correct
20 Correct 13 ms 35420 KB Output is correct
21 Correct 13 ms 35416 KB Output is correct
22 Correct 16 ms 35220 KB Output is correct
23 Correct 13 ms 35248 KB Output is correct
24 Correct 12 ms 35164 KB Output is correct
25 Correct 8 ms 34908 KB Output is correct
26 Correct 15 ms 35420 KB Output is correct
27 Correct 14 ms 35420 KB Output is correct
28 Correct 15 ms 35420 KB Output is correct
29 Correct 14 ms 35420 KB Output is correct
30 Correct 14 ms 35164 KB Output is correct
31 Correct 14 ms 34992 KB Output is correct
32 Correct 15 ms 35256 KB Output is correct
33 Correct 13 ms 35112 KB Output is correct
34 Correct 299 ms 97404 KB Output is correct
35 Correct 288 ms 95992 KB Output is correct
36 Correct 280 ms 95932 KB Output is correct
37 Correct 287 ms 90100 KB Output is correct
38 Correct 282 ms 91840 KB Output is correct
39 Correct 289 ms 91512 KB Output is correct
40 Correct 284 ms 92044 KB Output is correct
41 Correct 7 ms 34652 KB Output is correct
42 Correct 8 ms 34652 KB Output is correct
43 Correct 313 ms 83784 KB Output is correct
44 Correct 308 ms 83908 KB Output is correct
45 Correct 298 ms 83652 KB Output is correct
46 Correct 563 ms 92684 KB Output is correct
47 Correct 572 ms 92760 KB Output is correct
48 Correct 567 ms 93184 KB Output is correct
49 Correct 551 ms 92872 KB Output is correct
50 Correct 479 ms 82116 KB Output is correct
51 Correct 447 ms 82112 KB Output is correct
52 Correct 451 ms 82012 KB Output is correct
53 Correct 488 ms 82328 KB Output is correct