oj.uz

Submission #114585

# Submission time Handle Problem Language Result Execution time Memory
114585 2019-06-01T22:40:30 Z tincamatei Cake 3 (JOI19_cake3) C++14
100 / 100
 1370 ms 202656 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 200000;
const long long INF = 1LL << 60;

struct PersistentSegtree {
	int cnt;
	long long sum;
	PersistentSegtree *lT, *rT;

	PersistentSegtree() {
		cnt = 0;
		sum = 0LL;
		lT = rT = NULL;
	}
};

PersistentSegtree* build(int l, int r) {
	int mid = (l + r) / 2;
	PersistentSegtree* node = new PersistentSegtree();
	
	if(l < r) {
		node->lT = build(l, mid);
		node->rT = build(mid + 1, r);
	}
	
	return node;
}

PersistentSegtree* update(int poz, long long val, int l, int r, PersistentSegtree* nod) {
	if(poz < l || r < poz) return nod;
	PersistentSegtree* newnode = new PersistentSegtree();
	if(l == r) {
		newnode->cnt = nod->cnt + 1;
		newnode->sum = nod->sum + val;
	} else {
		int mid = (l + r) / 2;
		newnode->lT = update(poz, val, l, mid, nod->lT);
		newnode->rT = update(poz, val, mid + 1, r, nod->rT);
		newnode->cnt = newnode->lT->cnt + newnode->rT->cnt;
		newnode->sum = newnode->lT->sum + newnode->rT->sum;
	}

	return newnode;
}

long long query(int m, int l, int r, PersistentSegtree* minusTree, PersistentSegtree* plusTree) {
	if(l == r) {
		return plusTree->sum - minusTree->sum;
	} else {
		int leftCount = plusTree->lT->cnt - minusTree->lT->cnt, mid = (l + r) / 2;
		if(leftCount < m)
			return plusTree->lT->sum - minusTree->lT->sum +
			       query(m - leftCount, mid + 1, r, minusTree->rT, plusTree->rT);
		else
			return query(m, l, mid, minusTree->lT, plusTree->lT);
	}
}

struct Slice {
	int val, color, norm;
} slices[1+MAX_N];

bool colorSort(Slice a, Slice b) {
	return a.color < b.color;
}

bool valueSort(Slice a, Slice b) {
	return a.val < b.val;
}

long long solve(int l, int r, int cutL, int cutR, const int N, const int M, const vector<PersistentSegtree*> &versions) {
	int mid = (l + r) / 2, cut = cutL;
	long long rez = -INF;

	for(int i = cutL; i <= cutR && i <= mid - M + 1; ++i) {
		long long cost = query(M, 1, N, versions[i - 1], versions[mid]) - 2 * (slices[mid].color - slices[i].color);
		if(cost > rez) {
			rez = cost;
			cut = i;
		}
	}

	if(l < r) {
		rez = max(rez, solve(l, mid - 1, cutL, cut, N, M, versions));
		rez = max(rez, solve(mid + 1, r, cut, cutR, N, M, versions));
	}

	return rez;
}

int main() {
	int N, M;
	vector<PersistentSegtree*> versions;

	scanf("%d%d", &N, &M);
	for(int i = 1; i <= N; ++i)
		scanf("%d%d", &slices[i].val, &slices[i].color);
	
	sort(slices + 1, slices + 1 + N, valueSort);
	
	for(int i = 1; i <= N; ++i)
		slices[i].norm = N - i + 1;

	sort(slices + 1, slices + 1 + N, colorSort);
	
	versions.push_back(build(1, N));
	for(int i = 1; i <= N; ++i)
		versions.push_back(update(slices[i].norm, slices[i].val, 1, N, versions.back()));

	printf("%lld", solve(1, N, 1, N, N, M, versions));
	return 0;
}

Compilation message

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

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 6 ms 1664 KB Output is correct
39 Correct 6 ms 1664 KB Output is correct
40 Correct 5 ms 1664 KB Output is correct
41 Correct 5 ms 1536 KB Output is correct
42 Correct 6 ms 1664 KB Output is correct
43 Correct 6 ms 1664 KB Output is correct
44 Correct 5 ms 1664 KB Output is correct
45 Correct 6 ms 1664 KB Output is correct
46 Correct 6 ms 1664 KB Output is correct
47 Correct 6 ms 1664 KB Output is correct
48 Correct 6 ms 1536 KB Output is correct
49 Correct 6 ms 1664 KB Output is correct
50 Correct 5 ms 1664 KB Output is correct
51 Correct 6 ms 1664 KB Output is correct
52 Correct 6 ms 1664 KB Output is correct
53 Correct 5 ms 1664 KB Output is correct
54 Correct 5 ms 1792 KB Output is correct
55 Correct 5 ms 1664 KB Output is correct
56 Correct 5 ms 1700 KB Output is correct
57 Correct 4 ms 1664 KB Output is correct
58 Correct 5 ms 1664 KB Output is correct
59 Correct 8 ms 1536 KB Output is correct
60 Correct 5 ms 1664 KB Output is correct
61 Correct 5 ms 1664 KB Output is correct
62 Correct 5 ms 1664 KB Output is correct
63 Correct 6 ms 1664 KB Output is correct
64 Correct 6 ms 1664 KB Output is correct
65 Correct 5 ms 1664 KB Output is correct
66 Correct 5 ms 1664 KB Output is correct
67 Correct 5 ms 1664 KB Output is correct
68 Correct 6 ms 1792 KB Output is correct
69 Correct 5 ms 1664 KB Output is correct
70 Correct 5 ms 1792 KB Output is correct
71 Correct 5 ms 1664 KB Output is correct
72 Correct 5 ms 1664 KB Output is correct
73 Correct 5 ms 1664 KB Output is correct
74 Correct 5 ms 1792 KB Output is correct
75 Correct 1323 ms 187748 KB Output is correct
76 Correct 1370 ms 182588 KB Output is correct
77 Correct 1182 ms 188260 KB Output is correct
78 Correct 1338 ms 191404 KB Output is correct
79 Correct 532 ms 192228 KB Output is correct
80 Correct 566 ms 186212 KB Output is correct
81 Correct 1004 ms 189344 KB Output is correct
82 Correct 1175 ms 192044 KB Output is correct
83 Correct 1065 ms 198708 KB Output is correct
84 Correct 1122 ms 198116 KB Output is correct
85 Correct 1092 ms 191048 KB Output is correct
86 Correct 608 ms 184164 KB Output is correct
87 Correct 630 ms 181604 KB Output is correct
88 Correct 841 ms 180412 KB Output is correct
89 Correct 826 ms 191224 KB Output is correct
90 Correct 669 ms 200528 KB Output is correct
91 Correct 553 ms 184548 KB Output is correct
92 Correct 558 ms 182884 KB Output is correct
93 Correct 626 ms 191316 KB Output is correct
94 Correct 602 ms 200172 KB Output is correct
95 Correct 713 ms 200472 KB Output is correct
96 Correct 880 ms 185572 KB Output is correct
97 Correct 990 ms 201056 KB Output is correct
98 Correct 1022 ms 197988 KB Output is correct
99 Correct 873 ms 198504 KB Output is correct
100 Correct 752 ms 186468 KB Output is correct
101 Correct 754 ms 186468 KB Output is correct
102 Correct 1174 ms 186568 KB Output is correct
103 Correct 1025 ms 183652 KB Output is correct
104 Correct 1130 ms 194460 KB Output is correct
105 Correct 810 ms 193768 KB Output is correct
106 Correct 932 ms 198888 KB Output is correct
107 Correct 876 ms 191588 KB Output is correct
108 Correct 1204 ms 190308 KB Output is correct
109 Correct 1018 ms 202376 KB Output is correct
110 Correct 546 ms 187208 KB Output is correct
111 Correct 682 ms 189444 KB Output is correct
112 Correct 1004 ms 180452 KB Output is correct
113 Correct 601 ms 202656 KB Output is correct