oj.uz

Submission #120700

# Submission time Handle Problem Language Result Execution time Memory
120700 2019-06-25T09:12:36 Z onjo0127 Cake 3 (JOI19_cake3) C++11
100 / 100
 1117 ms 156464 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
 
struct Node {
	int c; long long s;
	int lc, rc;
};
 
const long long INF = 1LL * 1e18;
const Node emp = {0, 0, -1, -1};
 
struct PST {
	vector<int> root;
	vector<Node> T;
	void init(int idx, int s, int e) {
		T[idx] = emp;
		if(s == e) return;
		T[idx].lc = idx*2;
		T[idx].rc = idx*2+1;
		int m = s+e >> 1;
		init(idx*2, s, m);
		init(idx*2+1, m+1, e);
	}
	long long get(int pid, int nid, int s, int e, int k) {
		//printf("pseg get: pid: %d, nid: %d, s: %d, e: %d, k: %d\n", pid, nid, s, e, k);
		int cnt = T[nid].c - T[pid].c;
		if(cnt == k) return T[nid].s - T[pid].s;
		if(cnt < k) return -INF;
		int plc = T[pid].lc, nlc = T[nid].lc, prc = T[pid].rc, nrc = T[nid].rc, m = s+e >> 1;
		int rcnt = T[nrc].c - T[prc].c;
		if(rcnt >= k) return get(prc, nrc, m+1, e, k);
		return T[nrc].s - T[prc].s + get(plc, nlc, s, m, k - rcnt);
	}
	long long ksum(int l, int r, int s, int e, int k) {
		return get(root[l], root[r], s, e, k);
	}
	void upd(int pid, int nid, int s, int e, int p, int v) {
		//printf("pseg upd: pid: %d nid: %d s: %d e: %d p: %d v: %d\n", pid, nid, s, e, p, v);
		if(s == e) {
			++T[nid].c;
			T[nid].s += v;
			return;
		}
		int m = s+e >> 1;
		if(p <= m) {
			T[nid].lc = T.size();
			T.push_back(T[T[pid].lc]);
			upd(T[pid].lc, T[nid].lc, s, m, p, v);
			T[nid].rc = T[pid].rc;
		}
		else {
			T[nid].lc = T[pid].lc;
			T[nid].rc = T.size();
			T.push_back(T[T[pid].rc]);
			upd(T[pid].rc, T[nid].rc, m+1, e, p, v);
		}
		int LC = T[nid].lc, RC = T[nid].rc;
		T[nid].c = T[LC].c + T[RC].c;
		T[nid].s = T[LC].s + T[RC].s;
	}
	void update(int s, int e, int p, int v) {
		int pid = root.back(), nid = T.size();
		root.push_back(nid);
		T.push_back(T[pid]);
		upd(pid, nid, s, e, p, v);
	}
	void initalization(int sz) {
		root.push_back(1);
		T.resize(4*sz);
		init(1, 1, sz);
	}
};
 
PST pseg;
long long ans = -INF;
int N, M, V[200009], C[200009], ord[200009];
vector<int> S = {0};
 
void dnc(int s, int e, int l, int r) {
	if(e < s || r < l) return;
	int m = s+e >> 1;
	int st = max(m + M - 1, l), en = r, mxi = r;
	int L = S[m];
	long long mx = -INF;
	for(int i=st; i<=en; i++) {
		int R = S[i];
		long long tmp = - 2LL * (C[R] - C[L]) + V[L] + V[R] + pseg.ksum(m, i-1, 1, N, M-2);
		if(mx <= tmp) mxi = i, mx = tmp;
		ans = max(ans, tmp);
	}
	dnc(s, m-1, l, mxi);
	dnc(m+1, e, mxi, r);
}
 
int main() {
	vector<pii> VS;
	scanf("%d%d",&N,&M);
	for(int i=1; i<=N; i++) {
		scanf("%d%d",&V[i],&C[i]);
		VS.push_back({V[i], i});
		S.push_back(i);
	} C[0] = -1e9;
	sort(S.begin(), S.end(), [&](int P, int Q) {return C[P] < C[Q];});
	sort(VS.begin(), VS.end());
	for(int i=1; i<=N; i++) ord[VS[i-1].second] = i;
	pseg.initalization(N);
	for(int i=1; i<=N; i++) {
		int it = S[i];
		pseg.update(1, N, ord[it], V[it]);
	}
	dnc(1, N, 1, N);
	printf("%lld", ans);
	return 0;
}

Compilation message

cake3.cpp: In member function 'void PST::init(int, int, int)':
cake3.cpp:21:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = s+e >> 1;
           ~^~
cake3.cpp: In member function 'long long int PST::get(int, int, int, int, int)':
cake3.cpp:30:80: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int plc = T[pid].lc, nlc = T[nid].lc, prc = T[pid].rc, nrc = T[nid].rc, m = s+e >> 1;
                                                                               ~^~
cake3.cpp: In member function 'void PST::upd(int, int, int, int, int, int)':
cake3.cpp:45:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = s+e >> 1;
           ~^~
cake3.cpp: In function 'void dnc(int, int, int, int)':
cake3.cpp:82:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m = s+e >> 1;
          ~^~
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",&V[i],&C[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

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 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 432 KB Output is correct
12 Correct 2 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 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 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 2 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 432 KB Output is correct
12 Correct 2 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 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 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 5 ms 1140 KB Output is correct
39 Correct 5 ms 1104 KB Output is correct
40 Correct 4 ms 1124 KB Output is correct
41 Correct 5 ms 1140 KB Output is correct
42 Correct 4 ms 1124 KB Output is correct
43 Correct 4 ms 1108 KB Output is correct
44 Correct 5 ms 1148 KB Output is correct
45 Correct 5 ms 1112 KB Output is correct
46 Correct 5 ms 1100 KB Output is correct
47 Correct 5 ms 1124 KB Output is correct
48 Correct 4 ms 1108 KB Output is correct
49 Correct 4 ms 1104 KB Output is correct
50 Correct 5 ms 1112 KB Output is correct
51 Correct 4 ms 1116 KB Output is correct
52 Correct 5 ms 1136 KB Output is correct
53 Correct 4 ms 1116 KB Output is correct
54 Correct 4 ms 1112 KB Output is correct
55 Correct 4 ms 1124 KB Output is correct
56 Correct 4 ms 1128 KB Output is correct
57 Correct 4 ms 1136 KB Output is correct
58 Correct 4 ms 1136 KB Output is correct
59 Correct 4 ms 1140 KB Output is correct
60 Correct 5 ms 1128 KB Output is correct
61 Correct 5 ms 1124 KB Output is correct
62 Correct 4 ms 1232 KB Output is correct
63 Correct 4 ms 1100 KB Output is correct
64 Correct 5 ms 1112 KB Output is correct
65 Correct 5 ms 1124 KB Output is correct
66 Correct 5 ms 1128 KB Output is correct
67 Correct 4 ms 1116 KB Output is correct
68 Correct 4 ms 1100 KB Output is correct
69 Correct 5 ms 1128 KB Output is correct
70 Correct 4 ms 1116 KB Output is correct
71 Correct 4 ms 1124 KB Output is correct
72 Correct 4 ms 1232 KB Output is correct
73 Correct 4 ms 1128 KB Output is correct
74 Correct 4 ms 1100 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 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 432 KB Output is correct
12 Correct 2 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 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 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 5 ms 1140 KB Output is correct
39 Correct 5 ms 1104 KB Output is correct
40 Correct 4 ms 1124 KB Output is correct
41 Correct 5 ms 1140 KB Output is correct
42 Correct 4 ms 1124 KB Output is correct
43 Correct 4 ms 1108 KB Output is correct
44 Correct 5 ms 1148 KB Output is correct
45 Correct 5 ms 1112 KB Output is correct
46 Correct 5 ms 1100 KB Output is correct
47 Correct 5 ms 1124 KB Output is correct
48 Correct 4 ms 1108 KB Output is correct
49 Correct 4 ms 1104 KB Output is correct
50 Correct 5 ms 1112 KB Output is correct
51 Correct 4 ms 1116 KB Output is correct
52 Correct 5 ms 1136 KB Output is correct
53 Correct 4 ms 1116 KB Output is correct
54 Correct 4 ms 1112 KB Output is correct
55 Correct 4 ms 1124 KB Output is correct
56 Correct 4 ms 1128 KB Output is correct
57 Correct 4 ms 1136 KB Output is correct
58 Correct 4 ms 1136 KB Output is correct
59 Correct 4 ms 1140 KB Output is correct
60 Correct 5 ms 1128 KB Output is correct
61 Correct 5 ms 1124 KB Output is correct
62 Correct 4 ms 1232 KB Output is correct
63 Correct 4 ms 1100 KB Output is correct
64 Correct 5 ms 1112 KB Output is correct
65 Correct 5 ms 1124 KB Output is correct
66 Correct 5 ms 1128 KB Output is correct
67 Correct 4 ms 1116 KB Output is correct
68 Correct 4 ms 1100 KB Output is correct
69 Correct 5 ms 1128 KB Output is correct
70 Correct 4 ms 1116 KB Output is correct
71 Correct 4 ms 1124 KB Output is correct
72 Correct 4 ms 1232 KB Output is correct
73 Correct 4 ms 1128 KB Output is correct
74 Correct 4 ms 1100 KB Output is correct
75 Correct 1078 ms 145904 KB Output is correct
76 Correct 1117 ms 141792 KB Output is correct
77 Correct 1004 ms 146084 KB Output is correct
78 Correct 1048 ms 148284 KB Output is correct
79 Correct 464 ms 148780 KB Output is correct
80 Correct 554 ms 144636 KB Output is correct
81 Correct 899 ms 147432 KB Output is correct
82 Correct 1035 ms 149472 KB Output is correct
83 Correct 965 ms 154444 KB Output is correct
84 Correct 1008 ms 153676 KB Output is correct
85 Correct 837 ms 148564 KB Output is correct
86 Correct 613 ms 143768 KB Output is correct
87 Correct 626 ms 141992 KB Output is correct
88 Correct 817 ms 141004 KB Output is correct
89 Correct 817 ms 148864 KB Output is correct
90 Correct 673 ms 155688 KB Output is correct
91 Correct 555 ms 144072 KB Output is correct
92 Correct 522 ms 142872 KB Output is correct
93 Correct 583 ms 149048 KB Output is correct
94 Correct 556 ms 155524 KB Output is correct
95 Correct 657 ms 155812 KB Output is correct
96 Correct 773 ms 144748 KB Output is correct
97 Correct 831 ms 156172 KB Output is correct
98 Correct 840 ms 153896 KB Output is correct
99 Correct 788 ms 154252 KB Output is correct
100 Correct 702 ms 145492 KB Output is correct
101 Correct 727 ms 145456 KB Output is correct
102 Correct 895 ms 145604 KB Output is correct
103 Correct 893 ms 143584 KB Output is correct
104 Correct 1107 ms 151408 KB Output is correct
105 Correct 900 ms 150812 KB Output is correct
106 Correct 888 ms 154788 KB Output is correct
107 Correct 689 ms 149344 KB Output is correct
108 Correct 965 ms 147684 KB Output is correct
109 Correct 885 ms 156384 KB Output is correct
110 Correct 510 ms 146384 KB Output is correct
111 Correct 663 ms 148136 KB Output is correct
112 Correct 936 ms 141476 KB Output is correct
113 Correct 508 ms 156464 KB Output is correct