Submission #694018

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
694018	2023-02-03T14:45:22 Z	Nahian9696	Art Exhibition (JOI18_art)	C++17	100 / 100	189 ms	44264 KB

#include <bits/stdc++.h>

using namespace std;


#define int                 int64_t
#define f0(i, n)            for(int32_t i = 0; i <  (n); i++)
#define f1(i, n)            for(int32_t i = 1; i <= (n); i++)

#define inp(x)              int x; cin >> x
#define inp2(a, b)          int a, b; cin >> a >> b

#define ff                  first
#define ss                  second





void solve1() {
    inp(n);
    int A[n], B[n];
    pair<int, int> ab[n];

    f0(i,n) {
        cin >> ab[i].ff >> ab[i].ss;
    }

    sort(ab, ab+n);

    f0(i, n) A[i] = ab[i].ff, B[i] = ab[i].ss;

    int pref[n+1] = {0};
    f1(i, n) pref[i] = pref[i-1] + B[i-1];
    int indi[n];

    f0(i,n) {
        indi[i] = pref[i+1] - A[i];
    }

    pair<int, int> sufmx[n+1];
    sufmx[n] = {0, -1};

    for(int i = n-1; i >= 0; i--) {
        if(indi[i] > sufmx[i+1].ff) {
            sufmx[i] = {indi[i], i};
        } else {
            sufmx[i] = sufmx[i+1];
        }
    }

    int ans = 0;

    f0(i, n) {
        int j = sufmx[i].ss;
        ans = max(ans, pref[j+1] - pref[i] - A[j] + A[i]);
    }
    cout << ans << endl;
}

void solve2() {
    inp(n);
    int A[n], B[n];
    pair<int, int> ab[n];

    f0(i,n) {
        cin >> ab[i].ff >> ab[i].ss;
    }

    sort(ab, ab+n);

    f0(i, n) A[i] = ab[i].ff, B[i] = ab[i].ss;

    int pref[n+1] = {0};
    f1(i, n) pref[i] = pref[i-1] + B[i-1];
    int indi[n];

    f0(i,n) {
        indi[i] = pref[i+1] - A[i];
    }

    pair<int, int> sufmx[n+1];
    sufmx[n] = {-1e18, -1};

    for(int i = n-1; i >= 0; i--) {
        if(indi[i] > sufmx[i+1].ff) {
            sufmx[i] = {indi[i], i};
        } else {
            sufmx[i] = sufmx[i+1];
        }
    }

    int ans = 0;

    f0(i, n) {
        int j = sufmx[i].ss;
        ans = max(ans, int64_t(pref[j+1] - pref[i] - A[j] + A[i]));
        // cout << j;
    }
    cout << ans << endl;
}


int32_t main() {

    #if __has_include("LOCAL.hh")
        #include "LOCAL.hh"
    #endif

    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
        ios_base::sync_with_stdio(0);
        cin.tie(0);
    #endif

    solve2();

    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	312 KB	Output is correct
18	Correct	1 ms	328 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	0 ms	324 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	324 KB	Output is correct
25	Correct	1 ms	320 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	312 KB	Output is correct
18	Correct	1 ms	328 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	0 ms	324 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	324 KB	Output is correct
25	Correct	1 ms	320 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	2 ms	724 KB	Output is correct
28	Correct	2 ms	712 KB	Output is correct
29	Correct	2 ms	724 KB	Output is correct
30	Correct	2 ms	724 KB	Output is correct
31	Correct	3 ms	716 KB	Output is correct
32	Correct	2 ms	724 KB	Output is correct
33	Correct	2 ms	712 KB	Output is correct
34	Correct	2 ms	724 KB	Output is correct
35	Correct	2 ms	712 KB	Output is correct
36	Correct	2 ms	716 KB	Output is correct
37	Correct	3 ms	724 KB	Output is correct
38	Correct	2 ms	716 KB	Output is correct
39	Correct	2 ms	640 KB	Output is correct
40	Correct	2 ms	724 KB	Output is correct
41	Correct	2 ms	712 KB	Output is correct
42	Correct	2 ms	724 KB	Output is correct
43	Correct	2 ms	720 KB	Output is correct
44	Correct	2 ms	716 KB	Output is correct
45	Correct	2 ms	724 KB	Output is correct
46	Correct	3 ms	716 KB	Output is correct
47	Correct	2 ms	724 KB	Output is correct
48	Correct	3 ms	724 KB	Output is correct
49	Correct	2 ms	724 KB	Output is correct
50	Correct	2 ms	712 KB	Output is correct
51	Correct	2 ms	724 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	312 KB	Output is correct
18	Correct	1 ms	328 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	0 ms	324 KB	Output is correct
22	Correct	0 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	324 KB	Output is correct
25	Correct	1 ms	320 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	2 ms	724 KB	Output is correct
28	Correct	2 ms	712 KB	Output is correct
29	Correct	2 ms	724 KB	Output is correct
30	Correct	2 ms	724 KB	Output is correct
31	Correct	3 ms	716 KB	Output is correct
32	Correct	2 ms	724 KB	Output is correct
33	Correct	2 ms	712 KB	Output is correct
34	Correct	2 ms	724 KB	Output is correct
35	Correct	2 ms	712 KB	Output is correct
36	Correct	2 ms	716 KB	Output is correct
37	Correct	3 ms	724 KB	Output is correct
38	Correct	2 ms	716 KB	Output is correct
39	Correct	2 ms	640 KB	Output is correct
40	Correct	2 ms	724 KB	Output is correct
41	Correct	2 ms	712 KB	Output is correct
42	Correct	2 ms	724 KB	Output is correct
43	Correct	2 ms	720 KB	Output is correct
44	Correct	2 ms	716 KB	Output is correct
45	Correct	2 ms	724 KB	Output is correct
46	Correct	3 ms	716 KB	Output is correct
47	Correct	2 ms	724 KB	Output is correct
48	Correct	3 ms	724 KB	Output is correct
49	Correct	2 ms	724 KB	Output is correct
50	Correct	2 ms	712 KB	Output is correct
51	Correct	2 ms	724 KB	Output is correct
52	Correct	188 ms	44220 KB	Output is correct
53	Correct	184 ms	44240 KB	Output is correct
54	Correct	179 ms	44212 KB	Output is correct
55	Correct	185 ms	44224 KB	Output is correct
56	Correct	183 ms	44224 KB	Output is correct
57	Correct	175 ms	44236 KB	Output is correct
58	Correct	175 ms	44152 KB	Output is correct
59	Correct	178 ms	44264 KB	Output is correct
60	Correct	176 ms	44232 KB	Output is correct
61	Correct	177 ms	44096 KB	Output is correct
62	Correct	179 ms	44212 KB	Output is correct
63	Correct	189 ms	44220 KB	Output is correct
64	Correct	179 ms	44220 KB	Output is correct
65	Correct	182 ms	44228 KB	Output is correct
66	Correct	182 ms	44256 KB	Output is correct
67	Correct	180 ms	44216 KB	Output is correct
68	Correct	184 ms	44256 KB	Output is correct

Submission #694018

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