oj.uz

답안 #413808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
413808 2021-05-29T14:16:30 Z keta_tsimakuridze Road Construction (JOI21_road_construction) C++14
100 / 100
 3851 ms 505356 KB 
#include<bits/stdc++.h>
#define f first
#define int long long
#define s second
#define pii pair<int,int> 
using namespace std;
const int N=3e5+5,mod=1e9+7,Inf=7e9+16;
int t,n,k,le_[50*N],ri_[50*N],pos[N][2],K,cur,root[N],ind[N],I[N];
pair<int,int> tree[50*N][2];
pair<int,int>p[N];
set<pair<int,int> > s;
vector<pair<int,int> > v;
vector<pair<int,pair<int,int> > > c;
 
void build(int u,int l,int r){
tree[u][0] = tree[u][1] = {Inf,l}; 
	if(l==r) return;
	le_[u]=++cur;
	ri_[u]=++cur;
	int mid=(l+r)/2;
	build(le_[u],l,mid);
	build(ri_[u],mid+1,r);
	
}
void update(int u,int ind,int l,int r,int val1,int val2){
	if(l>ind || r<ind) return;
	if(l==r) {
		tree[cur][0]={val1,l};
		tree[cur][1]={val2,l};
		return;
	}
	int mid = (l+r)/2,x = cur;
	le_[x]= le_[u];
	ri_[x] = ri_[u];
	if(ind<=mid) le_[x]=++cur;
	else ri_[x]=++cur;
	update(le_[u],ind,l,mid,val1,val2);
	update(ri_[u],ind,mid+1,r,val1,val2);
	tree[x][0]=min(tree[le_[x]][0],tree[ri_[x]][0]);
	tree[x][1]=min(tree[le_[x]][1],tree[ri_[x]][1]);
//	cout<<x<<"++"<<endl;
}
pair<int,int> getans(int u,int start,int end,int l,int r,int type){
	if(l>end|| r<start) return {Inf,0};
	if(start<=l && r<=end) { 
return tree[u][type];}
	int mid=(l+r)/2;
	
	return min(getans(le_[u],start,end,l,mid,type) , getans(ri_[u],start,end,mid+1,r,type)); 
}
main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++) {
		cin >> p[i].f>>p[i].s;
	}
	sort(p+1,p+n+1);
	for(int i=1;i<=n;i++) {
		int diff = p[i].s;
		v.push_back({diff,i});
	}
	v.push_back({-5e9,0});
	sort(v.begin(),v.end());
	for(int i=1;i<=n;i++) {
		ind[v[i].s] = i; //cout<<v[i].s<<" ++ "<<i<<endl;
//		pos[i] = v[i].s;
	}
	cur=1;
	root[1] = cur;
	build(1,1,n);
	for(int i=1;i<=n;i++) {
 
		
		int l = 1,r=n,id = n+1;
		while(l<=r){
			int mid=(l+r)/2;
			if(v[mid].f>=p[i].s) {
				id = mid;
				r=mid-1;
			}else l=mid+1;
		}
		
		if(i-1)root[i] = ++cur;
		I[i] = id-1;
	//	cout<<id<<endl; // - y[i] +y[j] < -y[j] + y[i] y[j] < y[i]
		if(i-1)update(root[i-1],ind[i-1],1,n,-p[i-1].f-p[i-1].s,-p[i-1].f+p[i-1].s); 
		s.insert({min(getans(root[i],1,id-1,1,n,0).f +p[i].f+p[i].s,getans(root[i],id,n,1,n,1).f +p[i].f - p[i].s),i} );
//	cout<<"++"<<getans(root[i],id,n,1,n,1).f +p[i].f - p[i].s<<" "<<getans(root[i],id,n,1,n,1).s<<endl;
	} 
	while(k--){
		pii c = *s.begin();
		int i = c.s; 
	//	int g1 = getans(root[c.s],1,I[c.s],1,n,0).f+p[i].f+p[i].s, g2  = getans(root[c.s],I[c.s]+1,n,1,n,1);
		cout<<c.f<<endl;
		s.erase(c);
		int ind = 0; 
		if(getans(root[c.s],1,I[c.s],1,n,0).f+p[i].f+p[i].s < getans(root[c.s],I[c.s]+1,n,1,n,1).f  +p[i].f-p[i].s ) ind =getans(root[c.s],1,I[c.s],1,n,0).s;
		else  ind = getans(root[c.s],I[c.s]+1,n,1,n,1).s;
		int bef = root[c.s];
		root[c.s] = ++cur;
		update(bef,ind,1,n,Inf,Inf);
		s.insert({min(getans(root[i],1,I[i],1,n,0).f +p[i].f+p[i].s,getans(root[i],I[i]+1,n,1,n,1).f +p[i].f - p[i].s),c.s});
		//cout<<getans(root[i],1,I[i],1,n,0).f+p[i].f+p[i].s<<"++"<<getans(root[i],1,I[i],1,n,0).s<<endl;
	}
	
}

Compilation message

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1098 ms 132564 KB Output is correct
2 Correct 1131 ms 132648 KB Output is correct
3 Correct 1085 ms 127256 KB Output is correct
4 Correct 1050 ms 127148 KB Output is correct
5 Correct 1032 ms 131556 KB Output is correct
6 Correct 9 ms 2124 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2097 ms 499564 KB Output is correct
2 Correct 2103 ms 499528 KB Output is correct
3 Correct 649 ms 127220 KB Output is correct
4 Correct 1356 ms 499388 KB Output is correct
5 Correct 1349 ms 499412 KB Output is correct
6 Correct 1365 ms 499444 KB Output is correct
7 Correct 1447 ms 498720 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1311 ms 275720 KB Output is correct
2 Correct 1338 ms 275680 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 544 ms 278588 KB Output is correct
5 Correct 950 ms 280956 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1311 ms 275720 KB Output is correct
2 Correct 1338 ms 275680 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 544 ms 278588 KB Output is correct
5 Correct 950 ms 280956 KB Output is correct
6 Correct 1396 ms 280820 KB Output is correct
7 Correct 1383 ms 280812 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1370 ms 280800 KB Output is correct
11 Correct 543 ms 278628 KB Output is correct
12 Correct 981 ms 280920 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1098 ms 132564 KB Output is correct
2 Correct 1131 ms 132648 KB Output is correct
3 Correct 1085 ms 127256 KB Output is correct
4 Correct 1050 ms 127148 KB Output is correct
5 Correct 1032 ms 131556 KB Output is correct
6 Correct 9 ms 2124 KB Output is correct
7 Correct 2686 ms 314164 KB Output is correct
8 Correct 2609 ms 316292 KB Output is correct
9 Correct 938 ms 127580 KB Output is correct
10 Correct 1945 ms 315876 KB Output is correct
11 Correct 2107 ms 315548 KB Output is correct
12 Correct 1460 ms 316184 KB Output is correct
13 Correct 1684 ms 314900 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1098 ms 132564 KB Output is correct
2 Correct 1131 ms 132648 KB Output is correct
3 Correct 1085 ms 127256 KB Output is correct
4 Correct 1050 ms 127148 KB Output is correct
5 Correct 1032 ms 131556 KB Output is correct
6 Correct 9 ms 2124 KB Output is correct
7 Correct 2097 ms 499564 KB Output is correct
8 Correct 2103 ms 499528 KB Output is correct
9 Correct 649 ms 127220 KB Output is correct
10 Correct 1356 ms 499388 KB Output is correct
11 Correct 1349 ms 499412 KB Output is correct
12 Correct 1365 ms 499444 KB Output is correct
13 Correct 1447 ms 498720 KB Output is correct
14 Correct 1311 ms 275720 KB Output is correct
15 Correct 1338 ms 275680 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 544 ms 278588 KB Output is correct
18 Correct 950 ms 280956 KB Output is correct
19 Correct 1396 ms 280820 KB Output is correct
20 Correct 1383 ms 280812 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1370 ms 280800 KB Output is correct
24 Correct 543 ms 278628 KB Output is correct
25 Correct 981 ms 280920 KB Output is correct
26 Correct 2686 ms 314164 KB Output is correct
27 Correct 2609 ms 316292 KB Output is correct
28 Correct 938 ms 127580 KB Output is correct
29 Correct 1945 ms 315876 KB Output is correct
30 Correct 2107 ms 315548 KB Output is correct
31 Correct 1460 ms 316184 KB Output is correct
32 Correct 1684 ms 314900 KB Output is correct
33 Correct 3714 ms 505216 KB Output is correct
34 Correct 3851 ms 505356 KB Output is correct
35 Correct 2917 ms 504528 KB Output is correct
36 Correct 2165 ms 505348 KB Output is correct
37 Correct 2252 ms 505260 KB Output is correct
38 Correct 2513 ms 504052 KB Output is correct