oj.uz

답안 #1012173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1012173 2024-07-01T18:49:21 Z ttamx Truck Driver (IOI23_deliveries) C++17
100 / 100
 1087 ms 45684 KB 
#include "deliveries.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N=1e5+5;
const int K=1<<18;

int n;
vector<pair<int,int>> adj[N];
int sz[N],hv[N],head[N],tail[N],par[N],tin[N],tout[N],ord[N];
ll w[N],dist[N],val[N];
set<pair<ll,int>> ch[N];
int timer;
ll tot,ans;

struct Fenwick{
	ll t[N];
	void update(int i,ll v){
		if(i>0)for(;i<N;i+=i&-i)t[i]+=v;
	}
	ll query(int i){
		ll res=0;
		for(;i>0;i-=i&-i)res+=t[i];
		return res;
	}
	ll query(int l,int r){
		return query(r)-query(l-1);
	}
}f,fw;

struct SegTree{
	ll t[K],lz[K];
	void apply(int i,ll v){
		t[i]+=v;
		lz[i]+=v;
	}
	void push(int i){
		apply(i*2,lz[i]);
		apply(i*2+1,lz[i]);
		lz[i]=0;
	}
	void update(int l,int r,int i,int x,int y,ll v){
		if(y<l||r<x)return;
		if(x<=l&&r<=y)return apply(i,v);
		push(i);
		int m=(l+r)/2;
		update(l,m,i*2,x,y,v);
		update(m+1,r,i*2+1,x,y,v);
		t[i]=max(t[i*2],t[i*2+1]);
	}
	void update(int x,int y,ll v){
		update(1,n,1,x,y,v);
	}
	ll findlast(int l,int r,int i,int x,int y,ll v){
		if(y<l||r<x||t[i]<v)return 0;
		if(l==r)return l;
		push(i);
		int m=(l+r)/2;
		ll res=findlast(m+1,r,i*2+1,x,y,v);
		if(res==0)res=findlast(l,m,i*2,x,y,v);
		return res;
	}
	ll findlast(int x,int y,ll v){
		return findlast(1,n,1,x,y,v);
	}
}s;

void dfs(int u){
	sz[u]=1;
	for(auto [v,w]:adj[u])if(v!=par[u]){
		par[v]=u;
		dist[v]=dist[u]+w;
		dfs(v);
		sz[u]+=sz[v];
		if(sz[v]>sz[hv[u]])hv[u]=v;
	}
}

void hld(int u){
	tin[u]=++timer;
	ord[timer]=u;
	if(!head[u])head[u]=u;
	tail[head[u]]=u;
	if(hv[u])head[hv[u]]=head[u],hld(hv[u]);
	for(auto [v,w]:adj[u])if(v!=par[u]&&v!=hv[u])hld(v);
	tout[u]=timer;
}

void update(int u,ll v){
	tot+=v;
	ans+=v*dist[u];
	f.update(tin[u],v);
	fw.update(tin[u],v*dist[u]);
	while(u){
		s.update(tin[head[u]],tin[u],v);
		u=head[u];
		int p=par[u];
		fw.update(tin[p],v*dist[p]);
		ch[p].erase({val[u],u});
		val[u]+=v;
		ch[p].emplace(val[u],u);
		u=p;
	}
}

void init(int _n,vector<int> _u,vector<int> _v,vector<int> _t,vector<int> _w){
	n=_n;
	for(int i=0;i<n-1;i++){
		int u=_u[i]+1,v=_v[i]+1,w=_t[i];
		adj[u].emplace_back(v,w);
		adj[v].emplace_back(u,w);
	}
	for(int i=0;i<n;i++)w[i+1]=_w[i];
	w[1]++;
	dfs(1);
	hld(1);
	for(int i=1;i<=n;i++)update(i,w[i]);
}

ll max_time(int i,int x){
	i++;
	if(i==1)x++;
	update(i,x-w[i]);
	w[i]=x;
	int u=1;
	ll half=tot/2,res=0;
	while(true){
		int x=u;
		u=ord[s.findlast(tin[u],tin[tail[u]],half+1)];
		res+=fw.query(tin[x],tin[u]-1);
		if(ch[u].empty())break;
		auto [w,v]=*ch[u].rbegin();
		if(w<=half)break;
		res+=(f.query(tin[u],tout[u])-f.query(tin[v],tout[v]))*dist[u];
		u=v;
	}
	return (ans+dist[u]*(tot-2*f.query(tin[u],tout[u]))-2*res)*2;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 17236 KB Output is correct
2 Correct 83 ms 16980 KB Output is correct
3 Correct 81 ms 17108 KB Output is correct
4 Correct 75 ms 17236 KB Output is correct
5 Correct 80 ms 17232 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7516 KB Output is correct
2 Correct 4 ms 7804 KB Output is correct
3 Correct 4 ms 7768 KB Output is correct
4 Correct 4 ms 7772 KB Output is correct
5 Correct 7 ms 7772 KB Output is correct
6 Correct 4 ms 7772 KB Output is correct
7 Correct 4 ms 7768 KB Output is correct
8 Correct 4 ms 7656 KB Output is correct
9 Correct 4 ms 8028 KB Output is correct
10 Correct 4 ms 7768 KB Output is correct
11 Correct 5 ms 7772 KB Output is correct
12 Correct 4 ms 7772 KB Output is correct
13 Correct 4 ms 7772 KB Output is correct
14 Correct 4 ms 7636 KB Output is correct
15 Correct 4 ms 7772 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 17236 KB Output is correct
2 Correct 83 ms 16980 KB Output is correct
3 Correct 81 ms 17108 KB Output is correct
4 Correct 75 ms 17236 KB Output is correct
5 Correct 80 ms 17232 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 7 ms 7860 KB Output is correct
8 Correct 70 ms 10960 KB Output is correct
9 Correct 1087 ms 38648 KB Output is correct
10 Correct 1060 ms 38612 KB Output is correct
11 Correct 1030 ms 38708 KB Output is correct
12 Correct 864 ms 41536 KB Output is correct
13 Correct 824 ms 41444 KB Output is correct
14 Correct 857 ms 41520 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 17236 KB Output is correct
2 Correct 83 ms 16980 KB Output is correct
3 Correct 81 ms 17108 KB Output is correct
4 Correct 75 ms 17236 KB Output is correct
5 Correct 80 ms 17232 KB Output is correct
6 Correct 3 ms 7512 KB Output is correct
7 Correct 5 ms 7856 KB Output is correct
8 Correct 23 ms 11100 KB Output is correct
9 Correct 223 ms 42908 KB Output is correct
10 Correct 230 ms 42800 KB Output is correct
11 Correct 224 ms 42796 KB Output is correct
12 Correct 212 ms 45668 KB Output is correct
13 Correct 216 ms 45684 KB Output is correct
14 Correct 200 ms 42288 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 17236 KB Output is correct
2 Correct 83 ms 16980 KB Output is correct
3 Correct 81 ms 17108 KB Output is correct
4 Correct 75 ms 17236 KB Output is correct
5 Correct 80 ms 17232 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 4 ms 7804 KB Output is correct
8 Correct 4 ms 7768 KB Output is correct
9 Correct 4 ms 7772 KB Output is correct
10 Correct 7 ms 7772 KB Output is correct
11 Correct 4 ms 7772 KB Output is correct
12 Correct 4 ms 7768 KB Output is correct
13 Correct 4 ms 7656 KB Output is correct
14 Correct 4 ms 8028 KB Output is correct
15 Correct 4 ms 7768 KB Output is correct
16 Correct 5 ms 7772 KB Output is correct
17 Correct 4 ms 7772 KB Output is correct
18 Correct 4 ms 7772 KB Output is correct
19 Correct 4 ms 7636 KB Output is correct
20 Correct 4 ms 7772 KB Output is correct
21 Correct 3 ms 7516 KB Output is correct
22 Correct 7 ms 7860 KB Output is correct
23 Correct 70 ms 10960 KB Output is correct
24 Correct 1087 ms 38648 KB Output is correct
25 Correct 1060 ms 38612 KB Output is correct
26 Correct 1030 ms 38708 KB Output is correct
27 Correct 864 ms 41536 KB Output is correct
28 Correct 824 ms 41444 KB Output is correct
29 Correct 857 ms 41520 KB Output is correct
30 Correct 3 ms 7512 KB Output is correct
31 Correct 5 ms 7856 KB Output is correct
32 Correct 23 ms 11100 KB Output is correct
33 Correct 223 ms 42908 KB Output is correct
34 Correct 230 ms 42800 KB Output is correct
35 Correct 224 ms 42796 KB Output is correct
36 Correct 212 ms 45668 KB Output is correct
37 Correct 216 ms 45684 KB Output is correct
38 Correct 200 ms 42288 KB Output is correct
39 Correct 3 ms 7512 KB Output is correct
40 Correct 4 ms 7772 KB Output is correct
41 Correct 30 ms 11348 KB Output is correct
42 Correct 333 ms 42576 KB Output is correct
43 Correct 312 ms 42540 KB Output is correct
44 Correct 291 ms 43052 KB Output is correct
45 Correct 272 ms 43056 KB Output is correct
46 Correct 267 ms 43304 KB Output is correct
47 Correct 298 ms 44624 KB Output is correct
48 Correct 284 ms 45104 KB Output is correct
49 Correct 251 ms 45100 KB Output is correct
50 Correct 245 ms 45356 KB Output is correct
51 Correct 234 ms 45616 KB Output is correct
52 Correct 700 ms 42176 KB Output is correct
53 Correct 716 ms 41932 KB Output is correct
54 Correct 690 ms 42012 KB Output is correct
55 Correct 230 ms 41264 KB Output is correct
56 Correct 212 ms 43052 KB Output is correct
57 Correct 229 ms 43172 KB Output is correct