Submission #970976

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
970976	2024-04-27T16:29:46 Z	shezitt	Art Exhibition (JOI18_art)	C++14	50 / 100	16 ms	1116 KB

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <queue>

using namespace std;

using ll = long long;

#define int ll
#define fore(a, b, c) for(int a=b; a<c; ++a)
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define ii pair<int,int>
#define F first
#define S second

const int MAXN = 5050;

int n;
ii arr[MAXN];
int sum[MAXN];
int as[MAXN];

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n;

    fore(i, 0, n){
        cin >> arr[i].F >> arr[i].S;
    }

    sort(arr, arr+n, [](ii u, ii v) -> bool {
        if(u.F == v.F){
            return u.S < v.S;
        }
        return u.F < v.F;
    });

    fore(i, 0, n){
        as[i] = arr[i].F;
    }

    fore(i, 0, n){
        sum[i+1] = sum[i] + arr[i].S;
    }

    int ans = 0;

    fore(i, 0, n){
        fore(j, i, n){
            int res = sum[j+1] - sum[i];
            res -= as[j] - as[i];
            ans = max(ans, res);
        }
    }

    cout << ans;

}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	464 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	344 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	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	396 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	464 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	464 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	344 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	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	396 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	464 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	13 ms	604 KB	Output is correct
28	Correct	13 ms	600 KB	Output is correct
29	Correct	13 ms	604 KB	Output is correct
30	Correct	13 ms	856 KB	Output is correct
31	Correct	14 ms	604 KB	Output is correct
32	Correct	14 ms	604 KB	Output is correct
33	Correct	13 ms	604 KB	Output is correct
34	Correct	13 ms	588 KB	Output is correct
35	Correct	13 ms	604 KB	Output is correct
36	Correct	13 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	13 ms	616 KB	Output is correct
40	Correct	16 ms	612 KB	Output is correct
41	Correct	13 ms	744 KB	Output is correct
42	Correct	13 ms	608 KB	Output is correct
43	Correct	13 ms	668 KB	Output is correct
44	Correct	13 ms	616 KB	Output is correct
45	Correct	13 ms	604 KB	Output is correct
46	Correct	14 ms	608 KB	Output is correct
47	Correct	13 ms	612 KB	Output is correct
48	Correct	13 ms	752 KB	Output is correct
49	Correct	13 ms	736 KB	Output is correct
50	Correct	14 ms	584 KB	Output is correct
51	Correct	13 ms	604 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	464 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	344 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	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	396 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	464 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	13 ms	604 KB	Output is correct
28	Correct	13 ms	600 KB	Output is correct
29	Correct	13 ms	604 KB	Output is correct
30	Correct	13 ms	856 KB	Output is correct
31	Correct	14 ms	604 KB	Output is correct
32	Correct	14 ms	604 KB	Output is correct
33	Correct	13 ms	604 KB	Output is correct
34	Correct	13 ms	588 KB	Output is correct
35	Correct	13 ms	604 KB	Output is correct
36	Correct	13 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	13 ms	616 KB	Output is correct
40	Correct	16 ms	612 KB	Output is correct
41	Correct	13 ms	744 KB	Output is correct
42	Correct	13 ms	608 KB	Output is correct
43	Correct	13 ms	668 KB	Output is correct
44	Correct	13 ms	616 KB	Output is correct
45	Correct	13 ms	604 KB	Output is correct
46	Correct	14 ms	608 KB	Output is correct
47	Correct	13 ms	612 KB	Output is correct
48	Correct	13 ms	752 KB	Output is correct
49	Correct	13 ms	736 KB	Output is correct
50	Correct	14 ms	584 KB	Output is correct
51	Correct	13 ms	604 KB	Output is correct
52	Runtime error	2 ms	1116 KB	Execution killed with signal 11
53	Halted	0 ms	0 KB	-

Submission #970976

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