Submission #958688

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
958688	2024-04-06T10:40:28 Z	KasymK	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	24500 KB

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

#define int long long

signed main(){
    int n;
    scanf("%lld", &n);
    vector<pair<int, int>> v(n);
    for(int i = 0; i < n; ++i)
        scanf("%lld %lld", &v[i].first, &v[i].second);
    sort(v.begin(), v.end());
    vector<int> pref(n + 1);
    for(int i = 1; i <= n; ++i)
        pref[i] = pref[i - 1] + v[i - 1].second;
    int mx = -1e18;
    for(int i = 0; i < n; ++i)
        for(int j = i; j < n; ++j){
            int S = pref[j + 1] - pref[i];
            int diff = v[j].first - v[i].first;
            mx = max(mx, S - diff);
        }
    printf("%lld\n", mx);
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     scanf("%lld", &n);
      |     ~~~~~^~~~~~~~~~~~
art.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         scanf("%lld %lld", &v[i].first, &v[i].second);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	436 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	416 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	424 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 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	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	436 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	416 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	424 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	14 ms	604 KB	Output is correct
28	Correct	13 ms	604 KB	Output is correct
29	Correct	13 ms	604 KB	Output is correct
30	Correct	13 ms	604 KB	Output is correct
31	Correct	13 ms	672 KB	Output is correct
32	Correct	13 ms	672 KB	Output is correct
33	Correct	16 ms	604 KB	Output is correct
34	Correct	14 ms	604 KB	Output is correct
35	Correct	13 ms	444 KB	Output is correct
36	Correct	13 ms	604 KB	Output is correct
37	Correct	13 ms	604 KB	Output is correct
38	Correct	14 ms	680 KB	Output is correct
39	Correct	13 ms	668 KB	Output is correct
40	Correct	13 ms	604 KB	Output is correct
41	Correct	13 ms	604 KB	Output is correct
42	Correct	13 ms	672 KB	Output is correct
43	Correct	14 ms	604 KB	Output is correct
44	Correct	13 ms	604 KB	Output is correct
45	Correct	13 ms	604 KB	Output is correct
46	Correct	14 ms	600 KB	Output is correct
47	Correct	14 ms	604 KB	Output is correct
48	Correct	13 ms	636 KB	Output is correct
49	Correct	13 ms	604 KB	Output is correct
50	Correct	13 ms	604 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	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	436 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	416 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	424 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	14 ms	604 KB	Output is correct
28	Correct	13 ms	604 KB	Output is correct
29	Correct	13 ms	604 KB	Output is correct
30	Correct	13 ms	604 KB	Output is correct
31	Correct	13 ms	672 KB	Output is correct
32	Correct	13 ms	672 KB	Output is correct
33	Correct	16 ms	604 KB	Output is correct
34	Correct	14 ms	604 KB	Output is correct
35	Correct	13 ms	444 KB	Output is correct
36	Correct	13 ms	604 KB	Output is correct
37	Correct	13 ms	604 KB	Output is correct
38	Correct	14 ms	680 KB	Output is correct
39	Correct	13 ms	668 KB	Output is correct
40	Correct	13 ms	604 KB	Output is correct
41	Correct	13 ms	604 KB	Output is correct
42	Correct	13 ms	672 KB	Output is correct
43	Correct	14 ms	604 KB	Output is correct
44	Correct	13 ms	604 KB	Output is correct
45	Correct	13 ms	604 KB	Output is correct
46	Correct	14 ms	600 KB	Output is correct
47	Correct	14 ms	604 KB	Output is correct
48	Correct	13 ms	636 KB	Output is correct
49	Correct	13 ms	604 KB	Output is correct
50	Correct	13 ms	604 KB	Output is correct
51	Correct	13 ms	604 KB	Output is correct
52	Execution timed out	1049 ms	24500 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #958688

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