Submission #972958

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
972958	2024-05-01T10:47:54 Z	oyber	Art Exhibition (JOI18_art)	C++14	100 / 100	149 ms	21228 KB

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

typedef long long ll;

int main() {
    int n;
    scanf("%d", &n);

    vector<pair<ll, ll>> v;
    for (int i = 0; i < n; i++) {
        ll a, b;
        scanf("%lld %lld", &a, &b);
        v.push_back(make_pair(a, b));
    }

    sort(v.begin(), v.end());

    ll score = v[0].second;
    ll best_score = score;
    for (int i = 1; i < n; i++) {
        ll dist = v[i].first - v[i-1].first;
        ll diff = v[i].second - dist;

        if (score+diff > v[i].second) {
            score += diff;
        } else {
            score = v[i].second;
        }
        if (score > best_score) {
            best_score = score;
        }
        //printf("%d\n", score);
    }

    printf("%lld\n", best_score);
}

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("%d", &n);
      |     ~~~~~^~~~~~~~~~
art.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         scanf("%lld %lld", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	432 KB	Output is correct
3	Correct	0 ms	344 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	348 KB	Output is correct
7	Correct	0 ms	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	412 KB	Output is correct
10	Correct	0 ms	344 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	1 ms	348 KB	Output is correct
2	Correct	0 ms	432 KB	Output is correct
3	Correct	0 ms	344 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	348 KB	Output is correct
7	Correct	0 ms	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	412 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	436 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	0 ms	348 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	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	432 KB	Output is correct
3	Correct	0 ms	344 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	348 KB	Output is correct
7	Correct	0 ms	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	412 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	436 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	0 ms	348 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	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	576 KB	Output is correct
32	Correct	2 ms	704 KB	Output is correct
33	Correct	2 ms	856 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	2 ms	600 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	2 ms	608 KB	Output is correct
39	Correct	2 ms	616 KB	Output is correct
40	Correct	2 ms	868 KB	Output is correct
41	Correct	2 ms	616 KB	Output is correct
42	Correct	2 ms	612 KB	Output is correct
43	Correct	2 ms	608 KB	Output is correct
44	Correct	2 ms	616 KB	Output is correct
45	Correct	2 ms	616 KB	Output is correct
46	Correct	2 ms	616 KB	Output is correct
47	Correct	2 ms	616 KB	Output is correct
48	Correct	2 ms	764 KB	Output is correct
49	Correct	2 ms	616 KB	Output is correct
50	Correct	2 ms	616 KB	Output is correct
51	Correct	2 ms	792 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	432 KB	Output is correct
3	Correct	0 ms	344 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	348 KB	Output is correct
7	Correct	0 ms	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	412 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	436 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	0 ms	348 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	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	2 ms	576 KB	Output is correct
32	Correct	2 ms	704 KB	Output is correct
33	Correct	2 ms	856 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	2 ms	600 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	2 ms	608 KB	Output is correct
39	Correct	2 ms	616 KB	Output is correct
40	Correct	2 ms	868 KB	Output is correct
41	Correct	2 ms	616 KB	Output is correct
42	Correct	2 ms	612 KB	Output is correct
43	Correct	2 ms	608 KB	Output is correct
44	Correct	2 ms	616 KB	Output is correct
45	Correct	2 ms	616 KB	Output is correct
46	Correct	2 ms	616 KB	Output is correct
47	Correct	2 ms	616 KB	Output is correct
48	Correct	2 ms	764 KB	Output is correct
49	Correct	2 ms	616 KB	Output is correct
50	Correct	2 ms	616 KB	Output is correct
51	Correct	2 ms	792 KB	Output is correct
52	Correct	139 ms	20924 KB	Output is correct
53	Correct	145 ms	21184 KB	Output is correct
54	Correct	138 ms	20924 KB	Output is correct
55	Correct	138 ms	21172 KB	Output is correct
56	Correct	140 ms	21016 KB	Output is correct
57	Correct	139 ms	20936 KB	Output is correct
58	Correct	149 ms	21008 KB	Output is correct
59	Correct	139 ms	20884 KB	Output is correct
60	Correct	139 ms	21172 KB	Output is correct
61	Correct	140 ms	20656 KB	Output is correct
62	Correct	138 ms	20996 KB	Output is correct
63	Correct	144 ms	21228 KB	Output is correct
64	Correct	140 ms	20952 KB	Output is correct
65	Correct	139 ms	20816 KB	Output is correct
66	Correct	142 ms	20772 KB	Output is correct
67	Correct	140 ms	20908 KB	Output is correct
68	Correct	139 ms	20912 KB	Output is correct

Submission #972958

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