Submission #481152

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
481152	2021-10-19T15:53:50 Z	aris12345678	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	24504 KB

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

typedef long long ll;
typedef pair<ll, int> pli;
#define X first
#define Y second

const int mxN = 500005;
pli arr[mxN];
ll pref[mxN];

int main() {
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
        scanf("%lld %d", &arr[i].X, &arr[i].Y);
    sort(arr+1, arr+n+1);
    for(int i = 1; i <= n; i++)
        pref[i] = 1LL*arr[i].Y+pref[i-1];
    ll ans = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = i; j <= n; j++) {
            ans = max(ans, (pref[j]-pref[i-1])-(arr[j].X-arr[i].X));
            // cout << i << " " << j << " " << ans << " " << (pref[j]-pref[i-1])-(arr[j].X-arr[i].X) << "\n";
        }
    }
    printf("%lld\n", ans);
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
art.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         scanf("%lld %d", &arr[i].X, &arr[i].Y);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 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	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	268 KB	Output is correct
13	Correct	1 ms	304 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	204 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	296 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	312 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 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	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	268 KB	Output is correct
13	Correct	1 ms	304 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	204 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	296 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	312 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	18 ms	460 KB	Output is correct
28	Correct	18 ms	460 KB	Output is correct
29	Correct	18 ms	548 KB	Output is correct
30	Correct	18 ms	460 KB	Output is correct
31	Correct	19 ms	532 KB	Output is correct
32	Correct	18 ms	552 KB	Output is correct
33	Correct	18 ms	564 KB	Output is correct
34	Correct	18 ms	552 KB	Output is correct
35	Correct	18 ms	548 KB	Output is correct
36	Correct	18 ms	548 KB	Output is correct
37	Correct	22 ms	580 KB	Output is correct
38	Correct	19 ms	548 KB	Output is correct
39	Correct	18 ms	552 KB	Output is correct
40	Correct	22 ms	484 KB	Output is correct
41	Correct	18 ms	544 KB	Output is correct
42	Correct	18 ms	552 KB	Output is correct
43	Correct	18 ms	460 KB	Output is correct
44	Correct	18 ms	552 KB	Output is correct
45	Correct	18 ms	548 KB	Output is correct
46	Correct	19 ms	460 KB	Output is correct
47	Correct	18 ms	460 KB	Output is correct
48	Correct	18 ms	460 KB	Output is correct
49	Correct	18 ms	552 KB	Output is correct
50	Correct	19 ms	552 KB	Output is correct
51	Correct	23 ms	460 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	268 KB	Output is correct
13	Correct	1 ms	304 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	204 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	296 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	312 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	18 ms	460 KB	Output is correct
28	Correct	18 ms	460 KB	Output is correct
29	Correct	18 ms	548 KB	Output is correct
30	Correct	18 ms	460 KB	Output is correct
31	Correct	19 ms	532 KB	Output is correct
32	Correct	18 ms	552 KB	Output is correct
33	Correct	18 ms	564 KB	Output is correct
34	Correct	18 ms	552 KB	Output is correct
35	Correct	18 ms	548 KB	Output is correct
36	Correct	18 ms	548 KB	Output is correct
37	Correct	22 ms	580 KB	Output is correct
38	Correct	19 ms	548 KB	Output is correct
39	Correct	18 ms	552 KB	Output is correct
40	Correct	22 ms	484 KB	Output is correct
41	Correct	18 ms	544 KB	Output is correct
42	Correct	18 ms	552 KB	Output is correct
43	Correct	18 ms	460 KB	Output is correct
44	Correct	18 ms	552 KB	Output is correct
45	Correct	18 ms	548 KB	Output is correct
46	Correct	19 ms	460 KB	Output is correct
47	Correct	18 ms	460 KB	Output is correct
48	Correct	18 ms	460 KB	Output is correct
49	Correct	18 ms	552 KB	Output is correct
50	Correct	19 ms	552 KB	Output is correct
51	Correct	23 ms	460 KB	Output is correct
52	Execution timed out	1097 ms	24504 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #481152

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