Submission #891884

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
891884	2023-12-24T10:45:30 Z	goodspeed0208	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	24772 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 ans = 0;
	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);
			//cout << t << " ";
			ans = max(ans, t);
		}
		//out << "\n";
	}
	cout << ans << "\n";
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 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	344 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 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	344 KB	Output is correct
12	Correct	1 ms	456 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	600 KB	Output is correct
16	Correct	1 ms	352 KB	Output is correct
17	Correct	1 ms	464 KB	Output is correct
18	Correct	1 ms	352 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	352 KB	Output is correct
22	Correct	1 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	1 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 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	344 KB	Output is correct
12	Correct	1 ms	456 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	600 KB	Output is correct
16	Correct	1 ms	352 KB	Output is correct
17	Correct	1 ms	464 KB	Output is correct
18	Correct	1 ms	352 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	352 KB	Output is correct
22	Correct	1 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	1 ms	348 KB	Output is correct
27	Correct	16 ms	604 KB	Output is correct
28	Correct	14 ms	604 KB	Output is correct
29	Correct	13 ms	604 KB	Output is correct
30	Correct	13 ms	604 KB	Output is correct
31	Correct	13 ms	604 KB	Output is correct
32	Correct	13 ms	604 KB	Output is correct
33	Correct	14 ms	600 KB	Output is correct
34	Correct	14 ms	856 KB	Output is correct
35	Correct	13 ms	604 KB	Output is correct
36	Correct	14 ms	604 KB	Output is correct
37	Correct	13 ms	604 KB	Output is correct
38	Correct	13 ms	604 KB	Output is correct
39	Correct	14 ms	604 KB	Output is correct
40	Correct	13 ms	604 KB	Output is correct
41	Correct	13 ms	652 KB	Output is correct
42	Correct	16 ms	856 KB	Output is correct
43	Correct	17 ms	644 KB	Output is correct
44	Correct	13 ms	604 KB	Output is correct
45	Correct	13 ms	804 KB	Output is correct
46	Correct	13 ms	600 KB	Output is correct
47	Correct	13 ms	604 KB	Output is correct
48	Correct	13 ms	604 KB	Output is correct
49	Correct	13 ms	600 KB	Output is correct
50	Correct	13 ms	604 KB	Output is correct
51	Correct	13 ms	908 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 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	344 KB	Output is correct
12	Correct	1 ms	456 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	600 KB	Output is correct
16	Correct	1 ms	352 KB	Output is correct
17	Correct	1 ms	464 KB	Output is correct
18	Correct	1 ms	352 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	352 KB	Output is correct
22	Correct	1 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	1 ms	348 KB	Output is correct
27	Correct	16 ms	604 KB	Output is correct
28	Correct	14 ms	604 KB	Output is correct
29	Correct	13 ms	604 KB	Output is correct
30	Correct	13 ms	604 KB	Output is correct
31	Correct	13 ms	604 KB	Output is correct
32	Correct	13 ms	604 KB	Output is correct
33	Correct	14 ms	600 KB	Output is correct
34	Correct	14 ms	856 KB	Output is correct
35	Correct	13 ms	604 KB	Output is correct
36	Correct	14 ms	604 KB	Output is correct
37	Correct	13 ms	604 KB	Output is correct
38	Correct	13 ms	604 KB	Output is correct
39	Correct	14 ms	604 KB	Output is correct
40	Correct	13 ms	604 KB	Output is correct
41	Correct	13 ms	652 KB	Output is correct
42	Correct	16 ms	856 KB	Output is correct
43	Correct	17 ms	644 KB	Output is correct
44	Correct	13 ms	604 KB	Output is correct
45	Correct	13 ms	804 KB	Output is correct
46	Correct	13 ms	600 KB	Output is correct
47	Correct	13 ms	604 KB	Output is correct
48	Correct	13 ms	604 KB	Output is correct
49	Correct	13 ms	600 KB	Output is correct
50	Correct	13 ms	604 KB	Output is correct
51	Correct	13 ms	908 KB	Output is correct
52	Execution timed out	1012 ms	24772 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #891884

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0