oj.uz

Submission #102532

# Submission time Handle Problem Language Result Execution time Memory
102532 2019-03-25T18:37:46 Z Bruteforceman Cake 3 (JOI19_cake3) C++11
100 / 100
 2341 ms 209516 KB 
#include "bits/stdc++.h"
using namespace std;
typedef pair <int, int> pii;

pii a[200010];
int opt[200010];
const long long inf = 1e18;
long long rev[200010];
int cmp[200010];

struct node {
	node *l, *r;
	int cnt;
	long long sum;
	node () {
		l = r = NULL;
		cnt = 0;
		sum = 0;
	}
	void merge() {
		cnt = 0;
		sum = 0;
		if(l) {
			cnt += l -> cnt;
			sum += l -> sum;
		}
		if(r) {
			cnt += r -> cnt;
			sum += r -> sum;
		}
	}
} *t[200010];
typedef node* pnode;
int idx;

void insert(pnode &prev, pnode &cur, int val, int b = 1, int e = idx) {
	cur = new node();
	if(b == e) {
		cur -> cnt = prev -> cnt + 1;
		cur -> sum = prev -> sum + rev[b];
		return ;
	}
	int m = (b + e) >> 1;
	if(val <= m) {
		cur -> r = prev -> r;
		insert(prev -> l, cur -> l, val, b, m);
	} else {
		cur -> l = prev -> l;
		insert(prev -> r, cur -> r, val, m + 1, e);
	}
	cur -> merge();
}

typedef pair <int, long long> data;

long long Query(pnode prev, pnode cur, int k, int b = 1, int e = idx) {
	if(b == e) {
		return 1LL * rev[b] * k;
	}
	int m = (b + e) >> 1;
	int rt = (cur -> r -> cnt) - (prev -> r -> cnt);
	if(rt >= k) {
		return Query(prev -> r, cur -> r, k, m + 1, e);
	} else {
		return (cur -> r -> sum) - (prev -> r -> sum) + Query(prev -> l, cur -> l, k - rt, b, m);
	}
}

void build(pnode &cur, int b = 1, int e = idx) {
	cur = new node();
	if(b == e) {
		return ;
	}
	int m = (b + e) >> 1;
	build(cur -> l, b, m);
	build(cur -> r, m + 1, e);
}

int n, m;

long long query(int i, int j) {
	vector <int> v;
	long long ans = -2 * (a[j].first - a[i].first);
	ans += Query(t[i - 1], t[j], m);
	return ans;
}

int search(int b, int e, int p, int q) {
	if(b > e) return n+1;
	if(b == e) {
		return query(p, b) <= query(q, b) ? b : n+1;
	}
	int mid = (b + e) >> 1;
	if(query(p, mid) <= query(q, mid)) {
		return search(b, mid, p, q);
	} else {
		return search(mid + 1, e, p, q);
	}
}
int main(int argc, char const *argv[])
{
	scanf("%d %d", &n, &m);
	for(int i = 1; i <= n; i++) {
		int p, q;
		scanf("%d %d", &p, &q);
		a[i] = pii(q, p);
	}
	sort(a + 1, a + n + 1);

	map <int, int> mp;
	for(int i = 1; i <= n; i++) {
		mp[a[i].second];
	}
	for(auto &i : mp) {
		i.second = ++idx;
		rev[idx] = i.first;
	}
	for(int i = 0; i <= n; i++) {
		t[i] = NULL;
	}
	build(t[0]);
	for(int i = 1; i <= n; i++) {
		insert(t[i - 1], t[i], mp[a[i].second]);
	}

	long long ans = LLONG_MIN;
	vector <pii> v;
	v.emplace_back(m, 1);
	int l = 0;
	for(int i = 2; i <= n; i++) {
		while(l + 1 < v.size() && v[l + 1].first <= i) {
			++l;
		}
		opt[i] = v[l].second;
		while(!v.empty() && i + m - 1 <= v.back().first && query(i, v.back().first) >= query(v.back().second, v.back().first)) {
			v.pop_back();
		} 
		int change = search(max(i + m - 1, v.back().first), n, v.back().second, i);
		if(change <= n) {
			v.emplace_back(change, i);
		}
	}
	for(int i = m; i <= n; i++) {
		ans = max(ans, query(opt[i], i));
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

cake3.cpp: In function 'int main(int, const char**)':
cake3.cpp:131:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(l + 1 < v.size() && v[l + 1].first <= i) {
         ~~~~~~^~~~~~~~~~
cake3.cpp:102: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:105:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &p, &q);
   ~~~~~^~~~~~~~~~~~~~~~~

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 2 ms 384 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 424 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 18 ms 384 KB Output is correct
10 Correct 3 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 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 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 512 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 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 3 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 2 ms 384 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 424 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 18 ms 384 KB Output is correct
10 Correct 3 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 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 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 512 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 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 3 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 7 ms 1664 KB Output is correct
39 Correct 7 ms 1816 KB Output is correct
40 Correct 6 ms 1664 KB Output is correct
41 Correct 6 ms 1664 KB Output is correct
42 Correct 7 ms 1792 KB Output is correct
43 Correct 6 ms 1664 KB Output is correct
44 Correct 7 ms 1664 KB Output is correct
45 Correct 9 ms 1764 KB Output is correct
46 Correct 8 ms 1792 KB Output is correct
47 Correct 8 ms 1664 KB Output is correct
48 Correct 9 ms 1664 KB Output is correct
49 Correct 7 ms 1792 KB Output is correct
50 Correct 9 ms 1792 KB Output is correct
51 Correct 7 ms 1792 KB Output is correct
52 Correct 6 ms 1792 KB Output is correct
53 Correct 8 ms 1792 KB Output is correct
54 Correct 6 ms 1792 KB Output is correct
55 Correct 6 ms 1792 KB Output is correct
56 Correct 6 ms 1792 KB Output is correct
57 Correct 6 ms 1664 KB Output is correct
58 Correct 6 ms 1664 KB Output is correct
59 Correct 3 ms 512 KB Output is correct
60 Correct 3 ms 768 KB Output is correct
61 Correct 3 ms 512 KB Output is correct
62 Correct 4 ms 512 KB Output is correct
63 Correct 3 ms 512 KB Output is correct
64 Correct 4 ms 512 KB Output is correct
65 Correct 6 ms 1664 KB Output is correct
66 Correct 8 ms 1636 KB Output is correct
67 Correct 9 ms 1664 KB Output is correct
68 Correct 7 ms 1792 KB Output is correct
69 Correct 6 ms 1664 KB Output is correct
70 Correct 6 ms 1664 KB Output is correct
71 Correct 3 ms 768 KB Output is correct
72 Correct 3 ms 768 KB Output is correct
73 Correct 6 ms 1792 KB Output is correct
74 Correct 7 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 2 ms 384 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 424 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 18 ms 384 KB Output is correct
10 Correct 3 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 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 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 512 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 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 3 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 7 ms 1664 KB Output is correct
39 Correct 7 ms 1816 KB Output is correct
40 Correct 6 ms 1664 KB Output is correct
41 Correct 6 ms 1664 KB Output is correct
42 Correct 7 ms 1792 KB Output is correct
43 Correct 6 ms 1664 KB Output is correct
44 Correct 7 ms 1664 KB Output is correct
45 Correct 9 ms 1764 KB Output is correct
46 Correct 8 ms 1792 KB Output is correct
47 Correct 8 ms 1664 KB Output is correct
48 Correct 9 ms 1664 KB Output is correct
49 Correct 7 ms 1792 KB Output is correct
50 Correct 9 ms 1792 KB Output is correct
51 Correct 7 ms 1792 KB Output is correct
52 Correct 6 ms 1792 KB Output is correct
53 Correct 8 ms 1792 KB Output is correct
54 Correct 6 ms 1792 KB Output is correct
55 Correct 6 ms 1792 KB Output is correct
56 Correct 6 ms 1792 KB Output is correct
57 Correct 6 ms 1664 KB Output is correct
58 Correct 6 ms 1664 KB Output is correct
59 Correct 3 ms 512 KB Output is correct
60 Correct 3 ms 768 KB Output is correct
61 Correct 3 ms 512 KB Output is correct
62 Correct 4 ms 512 KB Output is correct
63 Correct 3 ms 512 KB Output is correct
64 Correct 4 ms 512 KB Output is correct
65 Correct 6 ms 1664 KB Output is correct
66 Correct 8 ms 1636 KB Output is correct
67 Correct 9 ms 1664 KB Output is correct
68 Correct 7 ms 1792 KB Output is correct
69 Correct 6 ms 1664 KB Output is correct
70 Correct 6 ms 1664 KB Output is correct
71 Correct 3 ms 768 KB Output is correct
72 Correct 3 ms 768 KB Output is correct
73 Correct 6 ms 1792 KB Output is correct
74 Correct 7 ms 1792 KB Output is correct
75 Correct 1708 ms 194492 KB Output is correct
76 Correct 1595 ms 188920 KB Output is correct
77 Correct 1555 ms 194808 KB Output is correct
78 Correct 1631 ms 198236 KB Output is correct
79 Correct 1010 ms 198800 KB Output is correct
80 Correct 981 ms 192760 KB Output is correct
81 Correct 1535 ms 148172 KB Output is correct
82 Correct 2341 ms 159880 KB Output is correct
83 Correct 1952 ms 157020 KB Output is correct
84 Correct 2024 ms 158592 KB Output is correct
85 Correct 1695 ms 149768 KB Output is correct
86 Correct 1164 ms 138496 KB Output is correct
87 Correct 1300 ms 138200 KB Output is correct
88 Correct 1651 ms 141412 KB Output is correct
89 Correct 1443 ms 145924 KB Output is correct
90 Correct 990 ms 148064 KB Output is correct
91 Correct 714 ms 135332 KB Output is correct
92 Correct 760 ms 134648 KB Output is correct
93 Correct 1008 ms 140732 KB Output is correct
94 Correct 682 ms 143492 KB Output is correct
95 Correct 1061 ms 147476 KB Output is correct
96 Correct 118 ms 13760 KB Output is correct
97 Correct 142 ms 14760 KB Output is correct
98 Correct 101 ms 15464 KB Output is correct
99 Correct 113 ms 14456 KB Output is correct
100 Correct 97 ms 13612 KB Output is correct
101 Correct 85 ms 13548 KB Output is correct
102 Correct 534 ms 117076 KB Output is correct
103 Correct 468 ms 115052 KB Output is correct
104 Correct 523 ms 124540 KB Output is correct
105 Correct 434 ms 115484 KB Output is correct
106 Correct 470 ms 118008 KB Output is correct
107 Correct 398 ms 111984 KB Output is correct
108 Correct 1631 ms 197008 KB Output is correct
109 Correct 1486 ms 209464 KB Output is correct
110 Correct 192 ms 43420 KB Output is correct
111 Correct 226 ms 45104 KB Output is correct
112 Correct 1163 ms 189136 KB Output is correct
113 Correct 1110 ms 209516 KB Output is correct