Submission #477457

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
477457	2021-10-02T08:23:49 Z	FireGhost1301	Art Exhibition (JOI18_art)	C++11	100 / 100	216 ms	28624 KB

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;

const int N = 5e5 + 3;
int n;
ll dp[N], pref[N];
pll a[N];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i].fi >> a[i].se;
    sort(a + 1, a + n + 1);
    ll ans = 0;
    for (int i = 1; i <= n; ++i) {
        dp[i] = max(a[i].se, pref[i - 1] + a[i].se - a[i].fi);
        ans = max(ans, dp[i]);
        dp[i] += a[i].fi;
        pref[i] = max(pref[i - 1], dp[i]);
    }
    cout << ans;
}

int main() {
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    solve();
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	336 KB	Output is correct
2	Correct	0 ms	336 KB	Output is correct
3	Correct	0 ms	336 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	336 KB	Output is correct
6	Correct	0 ms	336 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	336 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	3 ms	592 KB	Output is correct
28	Correct	2 ms	568 KB	Output is correct
29	Correct	3 ms	592 KB	Output is correct
30	Correct	2 ms	592 KB	Output is correct
31	Correct	2 ms	592 KB	Output is correct
32	Correct	2 ms	592 KB	Output is correct
33	Correct	2 ms	592 KB	Output is correct
34	Correct	2 ms	592 KB	Output is correct
35	Correct	2 ms	592 KB	Output is correct
36	Correct	3 ms	568 KB	Output is correct
37	Correct	2 ms	592 KB	Output is correct
38	Correct	2 ms	592 KB	Output is correct
39	Correct	3 ms	592 KB	Output is correct
40	Correct	2 ms	592 KB	Output is correct
41	Correct	2 ms	592 KB	Output is correct
42	Correct	3 ms	592 KB	Output is correct
43	Correct	2 ms	592 KB	Output is correct
44	Correct	3 ms	592 KB	Output is correct
45	Correct	3 ms	592 KB	Output is correct
46	Correct	2 ms	592 KB	Output is correct
47	Correct	2 ms	592 KB	Output is correct
48	Correct	3 ms	592 KB	Output is correct
49	Correct	3 ms	592 KB	Output is correct
50	Correct	2 ms	592 KB	Output is correct
51	Correct	2 ms	592 KB	Output is correct
52	Correct	204 ms	28512 KB	Output is correct
53	Correct	190 ms	28616 KB	Output is correct
54	Correct	196 ms	28624 KB	Output is correct
55	Correct	207 ms	28616 KB	Output is correct
56	Correct	208 ms	28608 KB	Output is correct
57	Correct	191 ms	28616 KB	Output is correct
58	Correct	191 ms	28604 KB	Output is correct
59	Correct	198 ms	28616 KB	Output is correct
60	Correct	197 ms	28580 KB	Output is correct
61	Correct	201 ms	28480 KB	Output is correct
62	Correct	189 ms	28612 KB	Output is correct
63	Correct	204 ms	28612 KB	Output is correct
64	Correct	213 ms	28616 KB	Output is correct
65	Correct	202 ms	28540 KB	Output is correct
66	Correct	196 ms	28512 KB	Output is correct
67	Correct	216 ms	28612 KB	Output is correct
68	Correct	209 ms	28528 KB	Output is correct

Submission #477457

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