답안 #710291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710291 2023-03-15T06:43:50 Z LittleCube Cake 3 (JOI19_cake3) C++14
100 / 100
3171 ms 211484 KB
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define F first
#define S second
using namespace std;

int N, M;
ll ans = -1e18, dp[200005], v[200005], c[200005];
pii p[200005];

struct Mset
{
	vector<pair<int, ll>> op;
	priority_queue<ll, vector<ll>, greater<ll>> lms, rms;
	ll sum = 0;
	void init(int sz)
	{
		for(int i = 0; i < sz; i++)
			lms.push(-10'000'000'000'000LL);
		sum = sz * -10'000'000'000'000LL;
	}	
	void insert(ll k)
	{
		while(!rms.empty() && rms.top() == lms.top())
		{
			rms.pop();
			lms.pop();
		}
		lms.push(k);
		op.emplace_back(pll(0, k));
		sum += k;
		sum -= lms.top();
		op.emplace_back(pll(1, lms.top()));
		lms.pop();
	}
	void undo(int t)
	{
		while((int)op.size() > t)
		{
			auto [i, k] = op.back();
			op.pop_back();
			if(i == 0)
			{	
				rms.push(k);
				sum -= k;
			}
			else
			{
				lms.push(k);
				sum += k;
			}
		}
		while(!rms.empty() && rms.top() == lms.top())
		{
			rms.pop();
			lms.pop();
		}
	}
}st;



// Assume (qR, L) is already in the set
void solve(int L, int R, int qL, int qR)
{
	int mid = (L + R) / 2;
	if(R < L)
		return;
	
	//cerr << L << ' ' << R << " -> " << qL << ' ' << qR << '\n'; 
	int initT = st.op.size();
	
	for (int i = mid - 1; i > qR && i >= L; i--)
		st.insert(v[i]);
	
	for (int i = min(mid - 1, qR); i >= qL; i--)
	{
		dp[i] = st.sum + v[mid] + v[i] - 2 * (c[mid] - c[i]);
		st.insert(v[i]);
	}

	st.undo(initT);

	int qMid = qL;
	for (int i = min(mid - 1, qR); i >= qL; i--)
		if(dp[i] >= dp[qMid])
			qMid = i;

	ans = max(dp[qMid], ans);
	
	// cerr << "calc " << mid << ' ' << st.rms.size() << '\n';
	// cerr << mid << ' ' << qMid << ' ' << dp[qMid] << '\n';
	
	
	if (L <= mid - 1)
	{

		for (int i = min(L - 1, qR); i > qMid; i--)
			st.insert(v[i]);

		solve(L, mid - 1, qL, qMid);

		st.undo(initT);
	}

	if (mid + 1 <= R)
	{
		for (int i = max(qR + 1, L); i <= mid; i++)
			st.insert(v[i]);

		solve(mid + 1, R, qMid, qR);

		st.undo(initT);
	}
}	


signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> N >> M;
	M -= 2;
	st.init(M);
	for(int i = 1; i <= N; i++)
		cin >> p[i].S >> p[i].F;
	sort(p + 1, p + 1 + N);
	for(int i = 1; i <= N; i++)
		c[i] = p[i].F, v[i] = p[i].S;
	solve(1, N, 1, N);
	cout << ans << '\n';
}

Compilation message

cake3.cpp: In member function 'void Mset::undo(int)':
cake3.cpp:43:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   43 |    auto [i, k] = op.back();
      |         ^
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 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 1 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 1 ms 340 KB Output is correct
26 Correct 1 ms 360 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 1 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
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 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 1 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 1 ms 340 KB Output is correct
26 Correct 1 ms 360 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 1 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 15 ms 860 KB Output is correct
39 Correct 14 ms 1160 KB Output is correct
40 Correct 11 ms 1236 KB Output is correct
41 Correct 11 ms 948 KB Output is correct
42 Correct 11 ms 1596 KB Output is correct
43 Correct 10 ms 1236 KB Output is correct
44 Correct 10 ms 1036 KB Output is correct
45 Correct 10 ms 1100 KB Output is correct
46 Correct 10 ms 1052 KB Output is correct
47 Correct 11 ms 1008 KB Output is correct
48 Correct 10 ms 1108 KB Output is correct
49 Correct 9 ms 1308 KB Output is correct
50 Correct 10 ms 1308 KB Output is correct
51 Correct 9 ms 1316 KB Output is correct
52 Correct 8 ms 1312 KB Output is correct
53 Correct 10 ms 1396 KB Output is correct
54 Correct 8 ms 1492 KB Output is correct
55 Correct 8 ms 1524 KB Output is correct
56 Correct 8 ms 1544 KB Output is correct
57 Correct 7 ms 1492 KB Output is correct
58 Correct 7 ms 1492 KB Output is correct
59 Correct 5 ms 596 KB Output is correct
60 Correct 5 ms 596 KB Output is correct
61 Correct 5 ms 736 KB Output is correct
62 Correct 5 ms 724 KB Output is correct
63 Correct 9 ms 772 KB Output is correct
64 Correct 6 ms 768 KB Output is correct
65 Correct 9 ms 932 KB Output is correct
66 Correct 8 ms 988 KB Output is correct
67 Correct 9 ms 980 KB Output is correct
68 Correct 10 ms 1084 KB Output is correct
69 Correct 8 ms 1308 KB Output is correct
70 Correct 9 ms 1352 KB Output is correct
71 Correct 8 ms 928 KB Output is correct
72 Correct 9 ms 1536 KB Output is correct
73 Correct 10 ms 752 KB Output is correct
74 Correct 7 ms 1616 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 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 1 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 1 ms 340 KB Output is correct
26 Correct 1 ms 360 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 1 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 15 ms 860 KB Output is correct
39 Correct 14 ms 1160 KB Output is correct
40 Correct 11 ms 1236 KB Output is correct
41 Correct 11 ms 948 KB Output is correct
42 Correct 11 ms 1596 KB Output is correct
43 Correct 10 ms 1236 KB Output is correct
44 Correct 10 ms 1036 KB Output is correct
45 Correct 10 ms 1100 KB Output is correct
46 Correct 10 ms 1052 KB Output is correct
47 Correct 11 ms 1008 KB Output is correct
48 Correct 10 ms 1108 KB Output is correct
49 Correct 9 ms 1308 KB Output is correct
50 Correct 10 ms 1308 KB Output is correct
51 Correct 9 ms 1316 KB Output is correct
52 Correct 8 ms 1312 KB Output is correct
53 Correct 10 ms 1396 KB Output is correct
54 Correct 8 ms 1492 KB Output is correct
55 Correct 8 ms 1524 KB Output is correct
56 Correct 8 ms 1544 KB Output is correct
57 Correct 7 ms 1492 KB Output is correct
58 Correct 7 ms 1492 KB Output is correct
59 Correct 5 ms 596 KB Output is correct
60 Correct 5 ms 596 KB Output is correct
61 Correct 5 ms 736 KB Output is correct
62 Correct 5 ms 724 KB Output is correct
63 Correct 9 ms 772 KB Output is correct
64 Correct 6 ms 768 KB Output is correct
65 Correct 9 ms 932 KB Output is correct
66 Correct 8 ms 988 KB Output is correct
67 Correct 9 ms 980 KB Output is correct
68 Correct 10 ms 1084 KB Output is correct
69 Correct 8 ms 1308 KB Output is correct
70 Correct 9 ms 1352 KB Output is correct
71 Correct 8 ms 928 KB Output is correct
72 Correct 9 ms 1536 KB Output is correct
73 Correct 10 ms 752 KB Output is correct
74 Correct 7 ms 1616 KB Output is correct
75 Correct 2903 ms 63676 KB Output is correct
76 Correct 3048 ms 51068 KB Output is correct
77 Correct 2676 ms 74716 KB Output is correct
78 Correct 2841 ms 70988 KB Output is correct
79 Correct 1113 ms 210908 KB Output is correct
80 Correct 1301 ms 136556 KB Output is correct
81 Correct 1862 ms 109820 KB Output is correct
82 Correct 2148 ms 80744 KB Output is correct
83 Correct 1994 ms 116864 KB Output is correct
84 Correct 2101 ms 116676 KB Output is correct
85 Correct 1841 ms 109648 KB Output is correct
86 Correct 1376 ms 122064 KB Output is correct
87 Correct 1386 ms 116080 KB Output is correct
88 Correct 1645 ms 109100 KB Output is correct
89 Correct 1599 ms 116008 KB Output is correct
90 Correct 1471 ms 134916 KB Output is correct
91 Correct 1239 ms 130248 KB Output is correct
92 Correct 1331 ms 128448 KB Output is correct
93 Correct 1433 ms 131536 KB Output is correct
94 Correct 1403 ms 210308 KB Output is correct
95 Correct 1723 ms 136496 KB Output is correct
96 Correct 1202 ms 23276 KB Output is correct
97 Correct 1248 ms 25256 KB Output is correct
98 Correct 1034 ms 31748 KB Output is correct
99 Correct 1221 ms 35036 KB Output is correct
100 Correct 1201 ms 39148 KB Output is correct
101 Correct 1196 ms 36972 KB Output is correct
102 Correct 1872 ms 77732 KB Output is correct
103 Correct 1688 ms 115492 KB Output is correct
104 Correct 1716 ms 80256 KB Output is correct
105 Correct 1405 ms 117280 KB Output is correct
106 Correct 1648 ms 112424 KB Output is correct
107 Correct 1587 ms 109988 KB Output is correct
108 Correct 3171 ms 111268 KB Output is correct
109 Correct 2685 ms 112276 KB Output is correct
110 Correct 1242 ms 110884 KB Output is correct
111 Correct 1424 ms 115456 KB Output is correct
112 Correct 1813 ms 66384 KB Output is correct
113 Correct 1169 ms 211484 KB Output is correct