oj.uz

Submission #593432

# Submission time Handle Problem Language Result Execution time Memory
593432 2022-07-11T07:39:18 Z marvinthang Cake 3 (JOI19_cake3) C++17
100 / 100
 978 ms 203948 KB 
/*************************************
*    author: marvinthang             *
*    created: 11.07.2022 14:10:03    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                 div  ___div
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define             FULL(i)  (MASK(i) - 1)
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#define          file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }

template <class T>             scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class T>            print_op(vector <T>)  { out << '{'; for (size_t i = 0; i + 1 < u.size(); ++i) out << u[i] << ", "; if (!u.empty()) out << u.back(); return out << '}'; }
template <class U, class V>   scan_op(pair <U, V>)  { return in >> u.fi >> u.se; }
template <class U, class V>  print_op(pair <U, V>)  { return out << '(' << u.fi << ", " << u.se << ')'; }
template <class InIter, class OutIter>  void compress(InIter first, InIter last, OutIter result) { vector <__typeof(*first)> v(first, last); sort(v.begin(), v.end()); unique(v.begin(), v.end()); while (first != last) { *result = lower_bound(v.begin(), v.end(), *first) - v.begin() + 1; ++first; ++result; } }
template <class A, class B>   inline bool minimize(A &a, B b)  { A eps = 1e-9; if (a > b + eps) { a = b; return true; } return false; }
template <class A, class B>   inline bool maximize(A &a, B b)  { A eps = 1e-9; if (a + eps < b) { a = b; return true; } return false; }

const double PI = 3.1415926535897932384626433832795; // acos(-1.0); atan(-1.0);
const int dir[] = {1, 0, -1, 0, 1, 1, -1, -1, 1};
const int MAX = 2e5 + 5;
const long long oo = 1e18;

int N, M, B[MAX];
pair <int, int> A[MAX];
long long res = -oo;

struct Node {
	long long sum;
	int cnt;
	Node *left, *right;
	Node(): sum(0), cnt(0), left(nullptr), right(nullptr) {}
	Node(Node *l, Node *r) {
		sum = l->sum + r->sum;
		cnt = l->cnt + r->cnt;
		left = l;
		right = r;
	}
} *versions[MAX];

Node* build(int l, int r) {
	if (l == r) return new Node();
	int m = l + r >> 1;
	return new Node(build(l, m), build(m + 1, r));	
}

Node* upgrade(Node *pre, int l, int r, int p) {
	if (l == r) {
		Node *tmp = new Node();
		tmp->sum = pre->sum + B[p];
		tmp->cnt = pre->cnt + 1;
		return tmp;
	}
	int m = l + r >> 1;
	if (p <= m) return new Node(upgrade(pre->left, l, m, p), pre->right);
	return new Node(pre->left, upgrade(pre->right, m + 1, r, p));
}

long long get(Node *left, Node *right, int l, int r, int cnt) {
	if (l == r) {
		int c = right->cnt - left->cnt;
		if (c < cnt) return -oo;
		return 1LL * cnt * B[l];
	}
	int m = l + r >> 1;
	int c = right->right->cnt - left->right->cnt;
	if (c >= cnt) return get(left->right, right->right, m + 1, r, cnt);
	return right->right->sum - left->right->sum + get(left->left, right->left, l, m, cnt - c);
}

void solve(int l, int r, int from, int to) {
	if (l > r) return;
	int mid = l + r >> 1;
	long long best = -oo, pos = -1;
	for (int i = max(mid, from); i <= to; ++i)
		if (maximize(best, get(versions[mid - 1], versions[i], 1, N, M) - 2 * (A[i].fi - A[mid].fi))) pos = i;
	assert(pos != -1);
	maximize(res, best);
	solve(l, mid - 1, from, pos);
	solve(mid + 1, r, pos, to);
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("cake3");
	cin >> N >> M;
	for (int i = 1; i <= N; ++i) cin >> A[i].se >> A[i].fi;
	sort(A + 1, A + 1 + N);
	for (int i = 1; i <= N; ++i) B[i] = A[i].se;
	sort(B + 1, B + 1 + N);
	versions[0] = build(1, N);
	for (int i = 1; i <= N; ++i) {
		int p = lower_bound(B + 1, B + 1 + N, A[i].se) - B;
		versions[i] = upgrade(versions[i - 1], 1, N, p);
	}
	solve(1, N - M + 1, 1, N);
	cout << res << '\n';
	cerr << "Time elapsed: " << TIME << " s.\n";
	return 0;
}

Compilation message

cake3.cpp: In function 'Node* build(int, int)':
cake3.cpp:56:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |  int m = l + r >> 1;
      |          ~~^~~
cake3.cpp: In function 'Node* upgrade(Node*, int, int, int)':
cake3.cpp:67:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   67 |  int m = l + r >> 1;
      |          ~~^~~
cake3.cpp: In function 'long long int get(Node*, Node*, int, int, int)':
cake3.cpp:78:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   78 |  int m = l + r >> 1;
      |          ~~^~~
cake3.cpp: In function 'void solve(int, int, int, int)':
cake3.cpp:86:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   86 |  int mid = l + r >> 1;
      |            ~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:22:69: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 | #define          file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                             ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:98:2: note: in expansion of macro 'file'
   98 |  file("cake3");
      |  ^~~~
cake3.cpp:22:103: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 | #define          file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                                                               ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:98:2: note: in expansion of macro 'file'
   98 |  file("cake3");
      |  ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 3 ms 1508 KB Output is correct
39 Correct 3 ms 1620 KB Output is correct
40 Correct 3 ms 1660 KB Output is correct
41 Correct 3 ms 1620 KB Output is correct
42 Correct 3 ms 1628 KB Output is correct
43 Correct 3 ms 1492 KB Output is correct
44 Correct 3 ms 1492 KB Output is correct
45 Correct 3 ms 1620 KB Output is correct
46 Correct 3 ms 1628 KB Output is correct
47 Correct 3 ms 1620 KB Output is correct
48 Correct 3 ms 1492 KB Output is correct
49 Correct 3 ms 1620 KB Output is correct
50 Correct 3 ms 1620 KB Output is correct
51 Correct 3 ms 1620 KB Output is correct
52 Correct 3 ms 1620 KB Output is correct
53 Correct 4 ms 1648 KB Output is correct
54 Correct 3 ms 1620 KB Output is correct
55 Correct 3 ms 1620 KB Output is correct
56 Correct 3 ms 1544 KB Output is correct
57 Correct 3 ms 1528 KB Output is correct
58 Correct 3 ms 1620 KB Output is correct
59 Correct 3 ms 1620 KB Output is correct
60 Correct 2 ms 1620 KB Output is correct
61 Correct 3 ms 1620 KB Output is correct
62 Correct 3 ms 1620 KB Output is correct
63 Correct 3 ms 1620 KB Output is correct
64 Correct 3 ms 1628 KB Output is correct
65 Correct 3 ms 1620 KB Output is correct
66 Correct 3 ms 1620 KB Output is correct
67 Correct 3 ms 1620 KB Output is correct
68 Correct 3 ms 1620 KB Output is correct
69 Correct 3 ms 1620 KB Output is correct
70 Correct 4 ms 1624 KB Output is correct
71 Correct 3 ms 1648 KB Output is correct
72 Correct 3 ms 1636 KB Output is correct
73 Correct 3 ms 1620 KB Output is correct
74 Correct 3 ms 1748 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 3 ms 1508 KB Output is correct
39 Correct 3 ms 1620 KB Output is correct
40 Correct 3 ms 1660 KB Output is correct
41 Correct 3 ms 1620 KB Output is correct
42 Correct 3 ms 1628 KB Output is correct
43 Correct 3 ms 1492 KB Output is correct
44 Correct 3 ms 1492 KB Output is correct
45 Correct 3 ms 1620 KB Output is correct
46 Correct 3 ms 1628 KB Output is correct
47 Correct 3 ms 1620 KB Output is correct
48 Correct 3 ms 1492 KB Output is correct
49 Correct 3 ms 1620 KB Output is correct
50 Correct 3 ms 1620 KB Output is correct
51 Correct 3 ms 1620 KB Output is correct
52 Correct 3 ms 1620 KB Output is correct
53 Correct 4 ms 1648 KB Output is correct
54 Correct 3 ms 1620 KB Output is correct
55 Correct 3 ms 1620 KB Output is correct
56 Correct 3 ms 1544 KB Output is correct
57 Correct 3 ms 1528 KB Output is correct
58 Correct 3 ms 1620 KB Output is correct
59 Correct 3 ms 1620 KB Output is correct
60 Correct 2 ms 1620 KB Output is correct
61 Correct 3 ms 1620 KB Output is correct
62 Correct 3 ms 1620 KB Output is correct
63 Correct 3 ms 1620 KB Output is correct
64 Correct 3 ms 1628 KB Output is correct
65 Correct 3 ms 1620 KB Output is correct
66 Correct 3 ms 1620 KB Output is correct
67 Correct 3 ms 1620 KB Output is correct
68 Correct 3 ms 1620 KB Output is correct
69 Correct 3 ms 1620 KB Output is correct
70 Correct 4 ms 1624 KB Output is correct
71 Correct 3 ms 1648 KB Output is correct
72 Correct 3 ms 1636 KB Output is correct
73 Correct 3 ms 1620 KB Output is correct
74 Correct 3 ms 1748 KB Output is correct
75 Correct 974 ms 187756 KB Output is correct
76 Correct 958 ms 182388 KB Output is correct
77 Correct 949 ms 188244 KB Output is correct
78 Correct 959 ms 191192 KB Output is correct
79 Correct 616 ms 191936 KB Output is correct
80 Correct 751 ms 186088 KB Output is correct
81 Correct 781 ms 189244 KB Output is correct
82 Correct 835 ms 192148 KB Output is correct
83 Correct 841 ms 198644 KB Output is correct
84 Correct 850 ms 198052 KB Output is correct
85 Correct 794 ms 190980 KB Output is correct
86 Correct 724 ms 184232 KB Output is correct
87 Correct 721 ms 181400 KB Output is correct
88 Correct 734 ms 180392 KB Output is correct
89 Correct 770 ms 191032 KB Output is correct
90 Correct 784 ms 200200 KB Output is correct
91 Correct 712 ms 184404 KB Output is correct
92 Correct 709 ms 182808 KB Output is correct
93 Correct 746 ms 191148 KB Output is correct
94 Correct 806 ms 200120 KB Output is correct
95 Correct 792 ms 200364 KB Output is correct
96 Correct 730 ms 189052 KB Output is correct
97 Correct 838 ms 203948 KB Output is correct
98 Correct 783 ms 200900 KB Output is correct
99 Correct 819 ms 201332 KB Output is correct
100 Correct 767 ms 189824 KB Output is correct
101 Correct 772 ms 189916 KB Output is correct
102 Correct 583 ms 186320 KB Output is correct
103 Correct 559 ms 183628 KB Output is correct
104 Correct 618 ms 194412 KB Output is correct
105 Correct 611 ms 193588 KB Output is correct
106 Correct 624 ms 198984 KB Output is correct
107 Correct 597 ms 191340 KB Output is correct
108 Correct 938 ms 190088 KB Output is correct
109 Correct 978 ms 202208 KB Output is correct
110 Correct 558 ms 186256 KB Output is correct
111 Correct 529 ms 189152 KB Output is correct
112 Correct 732 ms 180148 KB Output is correct
113 Correct 425 ms 202584 KB Output is correct