oj.uz

Submission #133188

# Submission time Handle Problem Language Result Execution time Memory
133188 2019-07-20T08:54:05 Z hamzqq9 Cake 3 (JOI19_cake3) C++14
100 / 100
 1038 ms 17460 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ii pair<int,int>
#define ll long long
#define orta ((bas+son)>>1)
#define sz(x) ((int)x.size())
//#define all(x) x.begin(),x.end()
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define inf 2000000000000000
#define N 300005
#define MOD 998244353
#define KOK 700		
using namespace std;

int n,m;
int p[2]={1,0};
ii a[N];
ll ans[N];
ll all;
int tut[N];
ll sum[N];
int cnt[N];
int top=0;

void up2(int pos,int val) {

	for(int i=pos;i<=n;i+=i&-i) sum[i]+=val;
	

}

void up1(int pos,int val) {

	for(int i=pos;i<=n;i+=i&-i) cnt[i]+=val;

}

ll get() {

	ll res=0;
	int pos=0;
	int want=top-m;

	for(int i=19;i>=0;i--) {

		if(pos+(1<<i)>n) continue;

		if(cnt[pos+(1<<i)]<=want) {

			pos+=(1<<i);
			res+=sum[pos];
			want-=cnt[pos];

		}

	}

	return all-res;

}

void del(int val) {

	all-=tut[val];
	--top;

	up1(val,-1);
	up2(val,-tut[val]);

}

void add(int val) {

	all+=tut[val];
	++top;

	up1(val,1);
	up2(val,tut[val]);

}

void shift(int w,int to) {

	if(to==0 || to==n+1) return ;

	if(w==0) {

		while(p[0]-1>=to) {

			--p[0];

			add(a[p[0]].st);

		}

		while(p[0]<to) {

			del(a[p[0]].st);

			++p[0];

		}

	}
	else {

		while(p[1]+1<=to) {

			++p[1];

			add(a[p[1]].st);

		}

		while(p[1]>to) {

			del(a[p[1]].st);

			--p[1];

		}

	}

}

void make(int lw,int rw) {

	if(lw<=p[0]) shift(0,lw);

	if(rw>=p[1]) shift(1,rw);

	shift(0,lw);
	shift(1,rw);

}

void f(int bas,int son,int l,int r) {

	if(bas>son) return ;

	int pos=orta;

	int curr=min(r,pos);

	make(curr,pos);

	ans[pos]=-inf;

	int to=-1;

	for(int i=curr;i>=l;i--,shift(0,i)) {

		if(pos-i+1<m) continue;

		ll cur=get()-2*(a[pos].nd-a[i].nd);

		if(cur>=ans[pos]) {

			ans[pos]=cur;
			to=i;

		}

	}

	if(to==-1) {

		for(int i=bas;i<=pos;i++) ans[i]=-inf;

		f(pos+1,son,l,r);

		return ;

	}

	f(bas,pos-1,l,to);
	f(pos+1,son,to,r);

}

int main() {

	map<int,int> mp;

	scanf("%d %d",&n,&m);

	for(int i=1;i<=n;i++) {

		scanf("%d %d",&a[i].st,&a[i].nd);

		mp[a[i].st]++;

	}

	int cnt=0;

	for(auto x:mp) {

		for(int i=0;i<x.nd;i++) {

			tut[++cnt]=x.st;

		}

	}

	for(int i=1;i<=cnt;i++) {

		while(i+1<=cnt && tut[i]==tut[i+1]) i++;

		mp[tut[i]]=i;

	}

	for(int i=1;i<=n;i++) {

		a[i].st=mp[a[i].st]--;

	}

	sort(a+1,a+1+n,[](ii a,ii b) {

		if(a.nd<b.nd) return true;
		if(a.nd>b.nd) return false;

		return a.st>b.st;

	});
 
	f(1,n,1,n);

	printf("%lld",*max_element(ans+1,ans+1+n));
 	
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:190:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
cake3.cpp:194:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&a[i].st,&a[i].nd);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 6 ms 504 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 6 ms 504 KB Output is correct
41 Correct 6 ms 504 KB Output is correct
42 Correct 5 ms 504 KB Output is correct
43 Correct 5 ms 504 KB Output is correct
44 Correct 6 ms 504 KB Output is correct
45 Correct 6 ms 500 KB Output is correct
46 Correct 7 ms 504 KB Output is correct
47 Correct 6 ms 504 KB Output is correct
48 Correct 6 ms 504 KB Output is correct
49 Correct 6 ms 504 KB Output is correct
50 Correct 6 ms 504 KB Output is correct
51 Correct 7 ms 504 KB Output is correct
52 Correct 6 ms 504 KB Output is correct
53 Correct 6 ms 504 KB Output is correct
54 Correct 5 ms 504 KB Output is correct
55 Correct 5 ms 504 KB Output is correct
56 Correct 5 ms 504 KB Output is correct
57 Correct 6 ms 504 KB Output is correct
58 Correct 5 ms 504 KB Output is correct
59 Correct 5 ms 504 KB Output is correct
60 Correct 5 ms 504 KB Output is correct
61 Correct 5 ms 504 KB Output is correct
62 Correct 5 ms 504 KB Output is correct
63 Correct 5 ms 480 KB Output is correct
64 Correct 5 ms 376 KB Output is correct
65 Correct 6 ms 508 KB Output is correct
66 Correct 6 ms 504 KB Output is correct
67 Correct 6 ms 504 KB Output is correct
68 Correct 6 ms 504 KB Output is correct
69 Correct 7 ms 504 KB Output is correct
70 Correct 6 ms 504 KB Output is correct
71 Correct 5 ms 376 KB Output is correct
72 Correct 5 ms 376 KB Output is correct
73 Correct 7 ms 504 KB Output is correct
74 Correct 5 ms 504 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 6 ms 504 KB Output is correct
39 Correct 6 ms 632 KB Output is correct
40 Correct 6 ms 504 KB Output is correct
41 Correct 6 ms 504 KB Output is correct
42 Correct 5 ms 504 KB Output is correct
43 Correct 5 ms 504 KB Output is correct
44 Correct 6 ms 504 KB Output is correct
45 Correct 6 ms 500 KB Output is correct
46 Correct 7 ms 504 KB Output is correct
47 Correct 6 ms 504 KB Output is correct
48 Correct 6 ms 504 KB Output is correct
49 Correct 6 ms 504 KB Output is correct
50 Correct 6 ms 504 KB Output is correct
51 Correct 7 ms 504 KB Output is correct
52 Correct 6 ms 504 KB Output is correct
53 Correct 6 ms 504 KB Output is correct
54 Correct 5 ms 504 KB Output is correct
55 Correct 5 ms 504 KB Output is correct
56 Correct 5 ms 504 KB Output is correct
57 Correct 6 ms 504 KB Output is correct
58 Correct 5 ms 504 KB Output is correct
59 Correct 5 ms 504 KB Output is correct
60 Correct 5 ms 504 KB Output is correct
61 Correct 5 ms 504 KB Output is correct
62 Correct 5 ms 504 KB Output is correct
63 Correct 5 ms 480 KB Output is correct
64 Correct 5 ms 376 KB Output is correct
65 Correct 6 ms 508 KB Output is correct
66 Correct 6 ms 504 KB Output is correct
67 Correct 6 ms 504 KB Output is correct
68 Correct 6 ms 504 KB Output is correct
69 Correct 7 ms 504 KB Output is correct
70 Correct 6 ms 504 KB Output is correct
71 Correct 5 ms 376 KB Output is correct
72 Correct 5 ms 376 KB Output is correct
73 Correct 7 ms 504 KB Output is correct
74 Correct 5 ms 504 KB Output is correct
75 Correct 1031 ms 17460 KB Output is correct
76 Correct 1038 ms 15692 KB Output is correct
77 Correct 960 ms 15964 KB Output is correct
78 Correct 1002 ms 16248 KB Output is correct
79 Correct 766 ms 16120 KB Output is correct
80 Correct 766 ms 15740 KB Output is correct
81 Correct 835 ms 8712 KB Output is correct
82 Correct 945 ms 9484 KB Output is correct
83 Correct 930 ms 8924 KB Output is correct
84 Correct 963 ms 9160 KB Output is correct
85 Correct 831 ms 8600 KB Output is correct
86 Correct 678 ms 8168 KB Output is correct
87 Correct 685 ms 7796 KB Output is correct
88 Correct 772 ms 8184 KB Output is correct
89 Correct 808 ms 8440 KB Output is correct
90 Correct 777 ms 8312 KB Output is correct
91 Correct 660 ms 7672 KB Output is correct
92 Correct 624 ms 7612 KB Output is correct
93 Correct 684 ms 8052 KB Output is correct
94 Correct 663 ms 8184 KB Output is correct
95 Correct 738 ms 8460 KB Output is correct
96 Correct 592 ms 7000 KB Output is correct
97 Correct 649 ms 7648 KB Output is correct
98 Correct 650 ms 7672 KB Output is correct
99 Correct 611 ms 7384 KB Output is correct
100 Correct 541 ms 7160 KB Output is correct
101 Correct 552 ms 7160 KB Output is correct
102 Correct 664 ms 7288 KB Output is correct
103 Correct 652 ms 7296 KB Output is correct
104 Correct 701 ms 7712 KB Output is correct
105 Correct 630 ms 7472 KB Output is correct
106 Correct 663 ms 7672 KB Output is correct
107 Correct 592 ms 7420 KB Output is correct
108 Correct 1016 ms 16076 KB Output is correct
109 Correct 1026 ms 16940 KB Output is correct
110 Correct 512 ms 7112 KB Output is correct
111 Correct 567 ms 7324 KB Output is correct
112 Correct 814 ms 15464 KB Output is correct
113 Correct 903 ms 16848 KB Output is correct