oj.uz

답안 #1012169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1012169 2024-07-01T18:39:02 Z ttamx Truck Driver (IOI23_deliveries) C++17
8 / 100
 97 ms 17508 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];
int timer;
ll tot,ans;
ll val[N];
set<pair<ll,int>> ch[N];

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);
	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;
	}
}

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

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]);
	// for(int i=1;i<=n;i++){
	// 	cerr << i << " : ";
	// 	for(auto [w,v]:ch[i])cerr << "(" << w << "," << v << ") ";
	// 	cerr << "\n";
	// }
	// cerr << "-----\n";
}

ll max_time(int s,int x){
	s++;
	update(s,-w[s]);
	w[s]=x;
	if(s==1)w[s]++;
	update(s,w[s]);
	// for(int i=1;i<=n;i++){
	// 	cerr << i << " : ";
	// 	for(auto [w,v]:ch[i])cerr << "(" << w << "," << v << ") ";
	// 	cerr << "\n";
	// }
	// cerr << "-----\n";
	return calc()*2;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 17488 KB Output is correct
2 Correct 89 ms 17228 KB Output is correct
3 Correct 97 ms 17488 KB Output is correct
4 Correct 88 ms 17492 KB Output is correct
5 Correct 92 ms 17508 KB Output is correct

Subtask #2
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 7516 KB 3rd lines differ - on the 1st token, expected: '1627540', found: '2971348'
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 17488 KB Output is correct
2 Correct 89 ms 17228 KB Output is correct
3 Correct 97 ms 17488 KB Output is correct
4 Correct 88 ms 17492 KB Output is correct
5 Correct 92 ms 17508 KB Output is correct
6 Incorrect 3 ms 7516 KB 3rd lines differ - on the 1st token, expected: '45306', found: '46398'
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 17488 KB Output is correct
2 Correct 89 ms 17228 KB Output is correct
3 Correct 97 ms 17488 KB Output is correct
4 Correct 88 ms 17492 KB Output is correct
5 Correct 92 ms 17508 KB Output is correct
6 Incorrect 3 ms 7512 KB 3rd lines differ - on the 1st token, expected: '129238', found: '221794'
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 17488 KB Output is correct
2 Correct 89 ms 17228 KB Output is correct
3 Correct 97 ms 17488 KB Output is correct
4 Correct 88 ms 17492 KB Output is correct
5 Correct 92 ms 17508 KB Output is correct
6 Incorrect 4 ms 7516 KB 3rd lines differ - on the 1st token, expected: '1627540', found: '2971348'
7 Halted 0 ms 0 KB -