oj.uz

Submission #17584

# Submission time Handle Problem Language Result Execution time Memory
17584 2015-12-29T03:46:30 Z comet Palembang Bridges (APIO15_bridge) C++
31 / 100
 206 ms 11724 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cstring>
#include <cassert>
#include <cstdlib>
#include <ctime>
using namespace std;
typedef long long ll;

int N,K,n;
struct pp{
	ll x,y;
	bool operator<(const pp& r)const{
		return x+y<r.x+r.y;
	}
}a[100010];

ll lu[200010];
int sz;

ll base;

ll sum[200010],cnt[200010];

ll L[100010],R[100010];

void add(ll tree[],int x,ll c){
	x++;
	while(x<=sz){
		tree[x]+=c;
		x+=x&-x;
	}
}

ll query(ll tree[],int x){
	x++;
	ll ret=0;
	while(x){
		ret+=tree[x];
		x-=x&-x;
	}
	return ret;
}

void compress(){
	for(int i=0;i<n;i++){
		lu[sz++]=a[i].x;
		lu[sz++]=a[i].y;
	}
	sort(lu,lu+sz);
	sz=unique(lu,lu+sz)-lu;
	for(int i=0;i<n;i++){
		a[i].x=lower_bound(lu,lu+sz,a[i].x)-lu;
		a[i].y=lower_bound(lu,lu+sz,a[i].y)-lu;
	}
}

priority_queue<ll> lo;
priority_queue<ll,vector<ll>,greater<ll> > hi;

void init(){
	while(!lo.empty())lo.pop();
	while(!hi.empty())hi.pop();
	memset(sum,0,sizeof(sum));
	memset(cnt,0,sizeof(cnt));
}

void push(ll x,ll& Sum){
	Sum+=lu[x];
	add(sum,x,lu[x]);
	add(cnt,x,1);
	if(lo.empty())lo.push(x);
	else{
		if(lo.top()>=x)lo.push(x);
		else hi.push(x);
		while(hi.size()>lo.size()){
			ll t=hi.top();hi.pop();
			lo.push(t);
		}
		while(lo.size()>hi.size()+1){
			ll t=lo.top();lo.pop();
			hi.push(t);
		}
	}
}

ll getMid(){
	return lo.top();
}

void f(ll d[]){

	init();
	
	ll mid,loSum,loCnt,hiSum,hiCnt,Sum=0;

	for(int i=0;i<n;i++){
		push(a[i].x,Sum);
		push(a[i].y,Sum);
		
		mid = getMid();
		loSum = query(sum,mid);
		loCnt = query(cnt,mid);
		hiSum = Sum-loSum;
		hiCnt = (i+1)*2ll - loCnt;
		d[i] = (lu[mid]*loCnt-loSum) + (hiSum-lu[mid]*hiCnt);

	}
}

int main(){
	scanf("%d%d",&K,&N);
	char t1,t2;
	ll x,y;
	for(int i=0;i<N;i++){
		scanf(" %c %lld %c %lld",&t1,&x,&t2,&y);
		if(t1!=t2){
			a[n].x=min(x,y);
			a[n++].y=max(x,y);
			base++;
		}else{
			base+=abs(x-y);
		}
	}

	if(n==0){
		printf("%lld\n",base);
		return 0;
	}

	compress();

	sort(a,a+n);

	if(K==1){
		f(L);
		printf("%lld\n",L[n-1]+base);

	}else{
		f(L);
		reverse(a,a+n);
		f(R);
		ll ans = min(L[n-1],R[n-1]);
		for(int i=0;i<n-1;i++){
			ans = min(ans,L[i]+R[n-2-i]);
		}
		printf("%lld\n",ans+base);
	}

	return 0;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:114:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&K,&N);
                     ^
bridge.cpp:118:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c %lld %c %lld",&t1,&x,&t2,&y);
                                          ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8992 KB Output is correct
2 Correct 0 ms 8992 KB Output is correct
3 Correct 0 ms 8992 KB Output is correct
4 Correct 0 ms 8992 KB Output is correct
5 Correct 0 ms 8992 KB Output is correct
6 Correct 0 ms 8992 KB Output is correct
7 Correct 0 ms 8992 KB Output is correct
8 Correct 0 ms 8992 KB Output is correct
9 Correct 0 ms 8992 KB Output is correct
10 Correct 0 ms 8992 KB Output is correct
11 Correct 0 ms 8992 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8992 KB Output is correct
2 Correct 0 ms 8992 KB Output is correct
3 Correct 3 ms 8992 KB Output is correct
4 Correct 0 ms 8992 KB Output is correct
5 Correct 3 ms 8992 KB Output is correct
6 Correct 0 ms 8992 KB Output is correct
7 Correct 0 ms 8992 KB Output is correct
8 Correct 0 ms 8992 KB Output is correct
9 Correct 3 ms 8992 KB Output is correct
10 Correct 0 ms 8992 KB Output is correct
11 Correct 3 ms 8992 KB Output is correct
12 Correct 63 ms 11724 KB Output is correct
13 Correct 206 ms 11640 KB Output is correct
14 Correct 99 ms 11640 KB Output is correct
15 Correct 89 ms 10360 KB Output is correct
16 Correct 46 ms 11724 KB Output is correct
17 Correct 96 ms 11724 KB Output is correct
18 Correct 73 ms 11640 KB Output is correct
19 Correct 113 ms 11724 KB Output is correct
20 Correct 66 ms 11724 KB Output is correct
21 Correct 93 ms 11724 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8992 KB Output is correct
2 Correct 0 ms 8992 KB Output is correct
3 Correct 3 ms 8992 KB Output is correct
4 Correct 0 ms 8992 KB Output is correct
5 Correct 0 ms 8992 KB Output is correct
6 Correct 0 ms 8992 KB Output is correct
7 Correct 0 ms 8992 KB Output is correct
8 Correct 0 ms 8992 KB Output is correct
9 Correct 0 ms 8992 KB Output is correct
10 Correct 0 ms 8992 KB Output is correct
11 Correct 0 ms 8992 KB Output is correct
12 Correct 0 ms 8992 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8992 KB Output is correct
2 Correct 0 ms 8992 KB Output is correct
3 Correct 0 ms 8992 KB Output is correct
4 Correct 3 ms 8992 KB Output is correct
5 Correct 0 ms 8992 KB Output is correct
6 Correct 0 ms 8992 KB Output is correct
7 Correct 3 ms 8992 KB Output is correct
8 Correct 0 ms 8992 KB Output is correct
9 Correct 0 ms 8992 KB Output is correct
10 Correct 0 ms 8992 KB Output is correct
11 Correct 0 ms 8992 KB Output is correct
12 Correct 0 ms 8992 KB Output is correct
13 Correct 0 ms 8992 KB Output is correct
14 Correct 0 ms 8992 KB Output is correct
15 Incorrect 3 ms 8992 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8992 KB Output is correct
2 Correct 0 ms 8992 KB Output is correct
3 Correct 0 ms 8992 KB Output is correct
4 Correct 0 ms 8992 KB Output is correct
5 Correct 0 ms 8992 KB Output is correct
6 Correct 0 ms 8992 KB Output is correct
7 Correct 0 ms 8992 KB Output is correct
8 Correct 0 ms 8992 KB Output is correct
9 Correct 0 ms 8992 KB Output is correct
10 Correct 0 ms 8992 KB Output is correct
11 Correct 0 ms 8992 KB Output is correct
12 Correct 0 ms 8992 KB Output is correct
13 Correct 0 ms 8992 KB Output is correct
14 Correct 0 ms 8992 KB Output is correct
15 Incorrect 0 ms 8992 KB Output isn't correct
16 Halted 0 ms 0 KB -