Submission #891893

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
891893	2023-12-24T11:38:16 Z	goodspeed0208	Art Exhibition (JOI18_art)	C++14	100 / 100	291 ms	56372 KB

#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<utility>
#define int long long
#define INF 1000000000000000000
#define pii pair<long long, long long>
using namespace std;

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	vector<pii>v(n);
	for(int i = 0 ; i < n ; i++) cin >> v[i].first >> v[i].second;
	sort(v.begin(), v.end());
	vector<int>psum(n);
	psum[0] = v[0].second;
	for (int i = 1 ; i < n ; i++) psum[i] = psum[i-1] + v[i].second;
	
	int start = 0, end = n-1;
	set<pii>st;
	st.insert({0, n-1});
	for (int i = n-2 ; i >= 0 ; i--) {
		int t = (v[n-1].first - v[i].first) - (psum[n-1] - psum[i]);
		st.insert({t, i});
		/*if (v[n-1].first - v[i].first > psum[n-1] - psum[i]) end = i;
		cout << v[n-1].first - v[i].first << " " << psum[n-1] - psum[i] << " ";
		cout << end << "\n";*/
	}
	
	int df = psum[n-1] - (v[n-1].first - v[0].first);
	int ans = 0;
	for (int i = 0 ; i < n ; i++) {
		pii p = *st.rbegin();
		ans = max(ans, df + p.first);
		//cout << df << " " << p.first<< "\n";
		int t = (v[n-1].first - v[i].first) - (psum[n-1] - psum[i]);
		st.erase({t, i});
		if (i < n-1) df = df - v[i].second + v[i+1].first - v[i].first;
		//if (v[i].first - v[0].first > psum[i]) start = i;
	}
	cout << ans << "\n";
	/*cout << "\n";
	if (end <= start) start = end = n-1;
	cout << start << " " << end << "\n";
	if (start == 0) cout << psum[end] - (v[end].first - v[start].first) << "\n";
	else cout << psum[end] - psum[start-1] - (v[end].first - v[start].first) << "\n";
	*/
	/*int ans = 0, start, end;
	for (int i = 0 ; i < n ; i++) {
		//cout << psum[i] << " ";
		for (int j = i ; j < n ; j++) {
			int t;
			if (i == 0) t = psum[j] - (v[j].first - v[i].first);
			else t = (psum[j] - psum[i-1]) - (v[j].first - v[i].first);
			if (t > ans) start = i, end = j;
			ans = max(ans, t);
		}
	}
	cout << start <<" " << end << "\n";
	cout << ans << "\n";*/
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:24:6: warning: unused variable 'start' [-Wunused-variable]
   24 |  int start = 0, end = n-1;
      |      ^~~~~
art.cpp:24:17: warning: unused variable 'end' [-Wunused-variable]
   24 |  int start = 0, end = n-1;
      |                 ^~~

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	344 KB	Output is correct
6	Correct	344 KB	Output is correct
7	Correct	504 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	504 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	504 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	856 KB	Output is correct
28	Correct	2 ms	860 KB	Output is correct
29	Correct	2 ms	860 KB	Output is correct
30	Correct	2 ms	860 KB	Output is correct
31	Correct	2 ms	856 KB	Output is correct
32	Correct	2 ms	860 KB	Output is correct
33	Correct	2 ms	860 KB	Output is correct
34	Correct	2 ms	1112 KB	Output is correct
35	Correct	2 ms	860 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	2 ms	860 KB	Output is correct
38	Correct	3 ms	860 KB	Output is correct
39	Correct	2 ms	872 KB	Output is correct
40	Correct	3 ms	860 KB	Output is correct
41	Correct	3 ms	860 KB	Output is correct
42	Correct	3 ms	860 KB	Output is correct
43	Correct	3 ms	856 KB	Output is correct
44	Correct	2 ms	884 KB	Output is correct
45	Correct	2 ms	860 KB	Output is correct
46	Correct	2 ms	856 KB	Output is correct
47	Correct	2 ms	860 KB	Output is correct
48	Correct	2 ms	860 KB	Output is correct
49	Correct	2 ms	816 KB	Output is correct
50	Correct	2 ms	860 KB	Output is correct
51	Correct	3 ms	860 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	504 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	856 KB	Output is correct
28	Correct	2 ms	860 KB	Output is correct
29	Correct	2 ms	860 KB	Output is correct
30	Correct	2 ms	860 KB	Output is correct
31	Correct	2 ms	856 KB	Output is correct
32	Correct	2 ms	860 KB	Output is correct
33	Correct	2 ms	860 KB	Output is correct
34	Correct	2 ms	1112 KB	Output is correct
35	Correct	2 ms	860 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	2 ms	860 KB	Output is correct
38	Correct	3 ms	860 KB	Output is correct
39	Correct	2 ms	872 KB	Output is correct
40	Correct	3 ms	860 KB	Output is correct
41	Correct	3 ms	860 KB	Output is correct
42	Correct	3 ms	860 KB	Output is correct
43	Correct	3 ms	856 KB	Output is correct
44	Correct	2 ms	884 KB	Output is correct
45	Correct	2 ms	860 KB	Output is correct
46	Correct	2 ms	856 KB	Output is correct
47	Correct	2 ms	860 KB	Output is correct
48	Correct	2 ms	860 KB	Output is correct
49	Correct	2 ms	816 KB	Output is correct
50	Correct	2 ms	860 KB	Output is correct
51	Correct	3 ms	860 KB	Output is correct
52	Correct	210 ms	43348 KB	Output is correct
53	Correct	224 ms	56148 KB	Output is correct
54	Correct	249 ms	56148 KB	Output is correct
55	Correct	254 ms	55936 KB	Output is correct
56	Correct	291 ms	56152 KB	Output is correct
57	Correct	283 ms	56144 KB	Output is correct
58	Correct	273 ms	56132 KB	Output is correct
59	Correct	254 ms	56144 KB	Output is correct
60	Correct	260 ms	56372 KB	Output is correct
61	Correct	248 ms	55888 KB	Output is correct
62	Correct	244 ms	55992 KB	Output is correct
63	Correct	239 ms	56160 KB	Output is correct
64	Correct	238 ms	56020 KB	Output is correct
65	Correct	227 ms	56128 KB	Output is correct
66	Correct	212 ms	56148 KB	Output is correct
67	Correct	222 ms	56128 KB	Output is correct
68	Correct	273 ms	56144 KB	Output is correct

Submission #891893

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0