Submission #801796

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
801796	2023-08-02T07:45:09 Z	jansenkenpegrasio	Art Exhibition (JOI18_art)	C++14	100 / 100	189 ms	12040 KB

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define fi first
#define se second
#define pb push_back
#define pq priority_queue
#define mp make_pair
#define all(x) x.begin(), x.end()
#define Repp(i, l, r, a) for (int i = l; i < r; i += a)
#define Rep(i, l, r) Repp(i, l, r, 1)
#define For(i, n) Rep(i, 0, n)
#define Fori(i, n) Rep(i, 1, n + 1)
#define Each(x, v) for (auto x : v)
#define Repd(i, l, r) for (int i = r - 1; i >= l; i--)
#define Ford(i, n) Repd(i, 0, n)
#define endl "\n"

const ll INF = 1e18;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int N; cin >> N;
	pll data[N + 1];
	Fori (i, N) cin >> data[i].fi >> data[i].se;
	sort(data + 1, data + N + 1);

	ll pref[N + 1];
	pref[0] = 0;
	Fori (i, N) pref[i] = pref[i - 1] + data[i].se;
	
	ll ans = -INF, niki = INF;
	Fori (i, N) {
		niki = min(niki, pref[i - 1] - data[i].fi);
		ans = max(ans, pref[i] - data[i].fi - niki);
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	2 ms	340 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	2 ms	340 KB	Output is correct
30	Correct	2 ms	340 KB	Output is correct
31	Correct	2 ms	340 KB	Output is correct
32	Correct	2 ms	340 KB	Output is correct
33	Correct	2 ms	340 KB	Output is correct
34	Correct	2 ms	340 KB	Output is correct
35	Correct	2 ms	340 KB	Output is correct
36	Correct	3 ms	340 KB	Output is correct
37	Correct	5 ms	416 KB	Output is correct
38	Correct	2 ms	340 KB	Output is correct
39	Correct	2 ms	340 KB	Output is correct
40	Correct	2 ms	340 KB	Output is correct
41	Correct	2 ms	340 KB	Output is correct
42	Correct	3 ms	340 KB	Output is correct
43	Correct	3 ms	340 KB	Output is correct
44	Correct	5 ms	340 KB	Output is correct
45	Correct	2 ms	340 KB	Output is correct
46	Correct	2 ms	340 KB	Output is correct
47	Correct	2 ms	340 KB	Output is correct
48	Correct	2 ms	340 KB	Output is correct
49	Correct	2 ms	340 KB	Output is correct
50	Correct	2 ms	340 KB	Output is correct
51	Correct	2 ms	340 KB	Output is correct
52	Correct	175 ms	12040 KB	Output is correct
53	Correct	180 ms	11964 KB	Output is correct
54	Correct	171 ms	11964 KB	Output is correct
55	Correct	189 ms	11988 KB	Output is correct
56	Correct	177 ms	11964 KB	Output is correct
57	Correct	174 ms	11964 KB	Output is correct
58	Correct	181 ms	11964 KB	Output is correct
59	Correct	167 ms	11972 KB	Output is correct
60	Correct	159 ms	11960 KB	Output is correct
61	Correct	149 ms	11976 KB	Output is correct
62	Correct	179 ms	11964 KB	Output is correct
63	Correct	172 ms	11960 KB	Output is correct
64	Correct	146 ms	11964 KB	Output is correct
65	Correct	168 ms	12028 KB	Output is correct
66	Correct	141 ms	11964 KB	Output is correct
67	Correct	154 ms	11960 KB	Output is correct
68	Correct	173 ms	11964 KB	Output is correct

Submission #801796

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