Submission #526085

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
526085	2022-02-13T16:56:00 Z	benjaminkleyn	Art Exhibition (JOI18_art)	C++17	100 / 100	178 ms	20680 KB

    #pragma GCC optimize("O3")
    #pragma GCC optimize("unroll-loops")
    #pragma GCC target("avx,avx2,fma")
    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;

    void solve()
    {
        int n;
        cin >> n;
        vector<pair<ll,ll>> p(n);
        for (int i = 0; i < n; i++)
            cin >> p[i].first >> p[i].second;
        sort(p.begin(), p.end());

        ll S = 0, ans = 0;
        for (int i = 0; i < n; i++)
        {
            S = max(S + p[i].second, p[i].first + p[i].second);
            ans = max(ans, S - p[i].first);
        }

        cout << ans << '\n';
    }

    int main()
    {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);

        solve();

        return 0;
    }

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	308 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	316 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	316 KB	Output is correct
27	Correct	2 ms	460 KB	Output is correct
28	Correct	2 ms	452 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	444 KB	Output is correct
31	Correct	2 ms	452 KB	Output is correct
32	Correct	3 ms	456 KB	Output is correct
33	Correct	2 ms	444 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	2 ms	460 KB	Output is correct
36	Correct	3 ms	452 KB	Output is correct
37	Correct	2 ms	448 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	452 KB	Output is correct
40	Correct	2 ms	464 KB	Output is correct
41	Correct	2 ms	460 KB	Output is correct
42	Correct	2 ms	460 KB	Output is correct
43	Correct	2 ms	460 KB	Output is correct
44	Correct	2 ms	508 KB	Output is correct
45	Correct	2 ms	460 KB	Output is correct
46	Correct	3 ms	512 KB	Output is correct
47	Correct	3 ms	512 KB	Output is correct
48	Correct	3 ms	460 KB	Output is correct
49	Correct	2 ms	452 KB	Output is correct
50	Correct	2 ms	512 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct
52	Correct	170 ms	20664 KB	Output is correct
53	Correct	173 ms	20656 KB	Output is correct
54	Correct	167 ms	20664 KB	Output is correct
55	Correct	170 ms	20668 KB	Output is correct
56	Correct	164 ms	20664 KB	Output is correct
57	Correct	167 ms	20660 KB	Output is correct
58	Correct	168 ms	20680 KB	Output is correct
59	Correct	172 ms	20664 KB	Output is correct
60	Correct	170 ms	20664 KB	Output is correct
61	Correct	162 ms	20548 KB	Output is correct
62	Correct	168 ms	20664 KB	Output is correct
63	Correct	170 ms	20676 KB	Output is correct
64	Correct	178 ms	20676 KB	Output is correct
65	Correct	175 ms	20664 KB	Output is correct
66	Correct	167 ms	20660 KB	Output is correct
67	Correct	174 ms	20668 KB	Output is correct
68	Correct	167 ms	20664 KB	Output is correct

Submission #526085

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