oj.uz

Submission #133177

# Submission time Handle Problem Language Result Execution time Memory
133177 2019-07-20T08:39:01 Z ekrem Cake 3 (JOI19_cake3) C++
100 / 100
 2805 ms 65988 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)/2)
#define coc g[node][i]
#define SURE 2.0
#define mod 1000000007
#define inf 1000000000000000009
#define N 200005
using namespace std;
 
typedef long long ll;
typedef pair < int , int > ii;
 
int n, m, k, bas = 1, son, amk, a[N], b[N], ne[N], say[4*N];
ll seg[4*N], of, cvp, opt, ans = -inf, ek;
ii xx[N];
map < int , int > h, x;
map < int , int > :: iterator it;
vector < int > g[N];
 
void bitir(){
	printf("%lld\n", ans);
	exit(0);
}

void bu(int k, int bas, int son, int x){
	g[x].pb(k);
	if(bas == son)
		return;
	if(x <= orta)
		bu(sol, bas, orta, x);
	else
		bu(sag, orta + 1, son, x);
}

void up(int x, int y){
	int sz = g[x].size();
	ek = 1ll*y*ne[x];
	for(int i = 0; i < sz; i++){
		seg[g[x][i]] += ek;
		say[g[x][i]] += y;
	}
}
 
ll qu(int k, int bas, int son, int x){
	if(bas == son)
		return 1ll*x*ne[bas];
	if(say[sag] >= x)
		return qu(sag, orta + 1, son, x);
	return seg[sag] + qu(sol, bas, orta, x - say[sag]);
}
 
void getir(int bs, int sn){
	while(bas < bs){
		up(a[bas], -1);
		bas++;
	}
	while(bas > bs){
		bas--;
		up(a[bas], 1);
	}
	while(son > sn){
		up(a[son], -1);
		son--;
	}
	while(son < sn){
		son++;
		up(a[son], 1);
	}
}
 
void f(int bas, int son, int optl, int optr){
	// amk++;if(amk > 50)exit(0);
	if(bas > son or optr - bas + 1 < m)return;
	int optm = optr;
	opt = -inf;
	for(int i = max(m + orta - 1, optl); i <= optr; i++){
		getir(orta + 1, i - 1);
		of = qu(1, 1, k, m - 2);
		cvp = of + 1ll*ne[a[orta]] + 1ll*ne[a[i]] - 2ll*(b[i] - b[orta]);
		// if(cvp == 152)cout << "geldi amk " << orta << " " << i << " " << of << " = " << cvp << endl;
		if(cvp > opt){
			opt = cvp;
			optm = i;
		}
	}
	// cout << bas << " " << son << " " << orta << " " << optl << " " << optr << " = " << opt << " " << optm << endl;
	ans = max(ans, opt);
	f(bas, orta - 1, optl, optm);
	f(orta + 1, son, optm, optr);
}
 
int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%d %d",&n ,&m);
	for(int i = 1; i <= n; i++){
		scanf("%d %d",&xx[i].nd ,&xx[i].st);
		h[xx[i].nd]++;
	}
	for(it = h.begin(); it != h.end(); it++){
		x[it->st] = ++k;
		ne[k] = it->st;
		// cout << k << " " << it->st << endl;
	}
	sort(xx + 1, xx + n + 1);
	for(int i = 1; i <= n; i++){
		a[i] = x[xx[i].nd];
		b[i] = xx[i].st;
		// cout << a[i] << " " << b[i] << endl;;
	}
	for(int i = 1; i <= k; i++)
		bu(1, 1, k, i);
	f(1, n, m, n);
	printf("%lld\n", ans);
	// cout << amk << endl;
	return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:101: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:103:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&xx[i].nd ,&xx[i].st);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5116 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 6 ms 5112 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5116 KB Output is correct
19 Correct 6 ms 4984 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 6 ms 5112 KB Output is correct
24 Correct 6 ms 5112 KB Output is correct
25 Correct 9 ms 5112 KB Output is correct
26 Correct 7 ms 5112 KB Output is correct
27 Correct 6 ms 5116 KB Output is correct
28 Correct 6 ms 5112 KB Output is correct
29 Correct 6 ms 5112 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 6 ms 5116 KB Output is correct
32 Correct 6 ms 4984 KB Output is correct
33 Correct 6 ms 4984 KB Output is correct
34 Correct 7 ms 5112 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 8 ms 5112 KB Output is correct
38 Correct 13 ms 5496 KB Output is correct
39 Correct 11 ms 5496 KB Output is correct
40 Correct 10 ms 5412 KB Output is correct
41 Correct 10 ms 5496 KB Output is correct
42 Correct 10 ms 5496 KB Output is correct
43 Correct 10 ms 5500 KB Output is correct
44 Correct 11 ms 5496 KB Output is correct
45 Correct 11 ms 5496 KB Output is correct
46 Correct 12 ms 5448 KB Output is correct
47 Correct 12 ms 5496 KB Output is correct
48 Correct 11 ms 5368 KB Output is correct
49 Correct 11 ms 5496 KB Output is correct
50 Correct 11 ms 5496 KB Output is correct
51 Correct 11 ms 5496 KB Output is correct
52 Correct 10 ms 5500 KB Output is correct
53 Correct 11 ms 5496 KB Output is correct
54 Correct 10 ms 5496 KB Output is correct
55 Correct 10 ms 5496 KB Output is correct
56 Correct 10 ms 5496 KB Output is correct
57 Correct 10 ms 5496 KB Output is correct
58 Correct 9 ms 5496 KB Output is correct
59 Correct 7 ms 5112 KB Output is correct
60 Correct 8 ms 5112 KB Output is correct
61 Correct 7 ms 5084 KB Output is correct
62 Correct 7 ms 5112 KB Output is correct
63 Correct 7 ms 5112 KB Output is correct
64 Correct 7 ms 5112 KB Output is correct
65 Correct 11 ms 5368 KB Output is correct
66 Correct 11 ms 5368 KB Output is correct
67 Correct 12 ms 5496 KB Output is correct
68 Correct 11 ms 5496 KB Output is correct
69 Correct 12 ms 5496 KB Output is correct
70 Correct 11 ms 5496 KB Output is correct
71 Correct 8 ms 5112 KB Output is correct
72 Correct 7 ms 5108 KB Output is correct
73 Correct 11 ms 5496 KB Output is correct
74 Correct 13 ms 5620 KB Output is correct
75 Correct 2476 ms 60100 KB Output is correct
76 Correct 2805 ms 61108 KB Output is correct
77 Correct 2188 ms 62456 KB Output is correct
78 Correct 2349 ms 63352 KB Output is correct
79 Correct 625 ms 63480 KB Output is correct
80 Correct 678 ms 61944 KB Output is correct
81 Correct 853 ms 16632 KB Output is correct
82 Correct 1410 ms 22392 KB Output is correct
83 Correct 1014 ms 17740 KB Output is correct
84 Correct 1126 ms 19176 KB Output is correct
85 Correct 878 ms 16688 KB Output is correct
86 Correct 496 ms 14712 KB Output is correct
87 Correct 557 ms 15096 KB Output is correct
88 Correct 822 ms 16176 KB Output is correct
89 Correct 753 ms 15580 KB Output is correct
90 Correct 544 ms 14968 KB Output is correct
91 Correct 372 ms 13816 KB Output is correct
92 Correct 379 ms 13832 KB Output is correct
93 Correct 454 ms 14200 KB Output is correct
94 Correct 327 ms 13744 KB Output is correct
95 Correct 502 ms 14840 KB Output is correct
96 Correct 118 ms 10696 KB Output is correct
97 Correct 125 ms 11128 KB Output is correct
98 Correct 128 ms 11000 KB Output is correct
99 Correct 120 ms 11052 KB Output is correct
100 Correct 104 ms 10748 KB Output is correct
101 Correct 109 ms 10744 KB Output is correct
102 Correct 491 ms 11356 KB Output is correct
103 Correct 475 ms 11256 KB Output is correct
104 Correct 566 ms 12024 KB Output is correct
105 Correct 404 ms 11384 KB Output is correct
106 Correct 408 ms 11512 KB Output is correct
107 Correct 342 ms 11268 KB Output is correct
108 Correct 2177 ms 62760 KB Output is correct
109 Correct 1666 ms 65816 KB Output is correct
110 Correct 154 ms 10236 KB Output is correct
111 Correct 203 ms 10236 KB Output is correct
112 Correct 942 ms 59348 KB Output is correct
113 Correct 635 ms 65988 KB Output is correct