Submission #680127

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
680127	2023-01-10T01:39:06 Z	ocarima	Art Exhibition (JOI18_art)	C++14	100 / 100	511 ms	24776 KB

#include <iostream>
#include <bits/stdc++.h>

using namespace std;

#define lli long long int
#define rep(i,a,b) for(lli i = (a); i <= (b); ++i)
#define repa(i,a,b) for(lli i = (a); i >= (b); --i)
#define nl "\n"

#define MAX 500000

#define tam first
#define belleza second

lli n, res, s;
pair<lli, lli> arbol[MAX + 2];
lli acu[MAX + 2], maximo;


int main()
{
    cin >> n;
    rep(i, 1, n) cin >> arbol[i].tam >> arbol[i].belleza;
    sort(arbol + 1, arbol + 1 + n);

    rep(i, 1, n) acu[i] = arbol[i].belleza + acu[i - 1];

    rep(i, 1, n){
        maximo = max(maximo, arbol[i].tam - acu[i - 1]);
        res = max(res, acu[i] - arbol[i].tam + maximo);
    }

    cout << res << nl;

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	260 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 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	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	6 ms	340 KB	Output is correct
28	Correct	5 ms	340 KB	Output is correct
29	Correct	7 ms	388 KB	Output is correct
30	Correct	5 ms	340 KB	Output is correct
31	Correct	7 ms	340 KB	Output is correct
32	Correct	5 ms	340 KB	Output is correct
33	Correct	5 ms	340 KB	Output is correct
34	Correct	6 ms	372 KB	Output is correct
35	Correct	5 ms	340 KB	Output is correct
36	Correct	5 ms	340 KB	Output is correct
37	Correct	5 ms	352 KB	Output is correct
38	Correct	5 ms	344 KB	Output is correct
39	Correct	5 ms	340 KB	Output is correct
40	Correct	5 ms	340 KB	Output is correct
41	Correct	5 ms	340 KB	Output is correct
42	Correct	5 ms	340 KB	Output is correct
43	Correct	5 ms	340 KB	Output is correct
44	Correct	7 ms	340 KB	Output is correct
45	Correct	5 ms	340 KB	Output is correct
46	Correct	5 ms	340 KB	Output is correct
47	Correct	5 ms	340 KB	Output is correct
48	Correct	5 ms	340 KB	Output is correct
49	Correct	5 ms	340 KB	Output is correct
50	Correct	7 ms	340 KB	Output is correct
51	Correct	6 ms	340 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	260 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 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	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	6 ms	340 KB	Output is correct
28	Correct	5 ms	340 KB	Output is correct
29	Correct	7 ms	388 KB	Output is correct
30	Correct	5 ms	340 KB	Output is correct
31	Correct	7 ms	340 KB	Output is correct
32	Correct	5 ms	340 KB	Output is correct
33	Correct	5 ms	340 KB	Output is correct
34	Correct	6 ms	372 KB	Output is correct
35	Correct	5 ms	340 KB	Output is correct
36	Correct	5 ms	340 KB	Output is correct
37	Correct	5 ms	352 KB	Output is correct
38	Correct	5 ms	344 KB	Output is correct
39	Correct	5 ms	340 KB	Output is correct
40	Correct	5 ms	340 KB	Output is correct
41	Correct	5 ms	340 KB	Output is correct
42	Correct	5 ms	340 KB	Output is correct
43	Correct	5 ms	340 KB	Output is correct
44	Correct	7 ms	340 KB	Output is correct
45	Correct	5 ms	340 KB	Output is correct
46	Correct	5 ms	340 KB	Output is correct
47	Correct	5 ms	340 KB	Output is correct
48	Correct	5 ms	340 KB	Output is correct
49	Correct	5 ms	340 KB	Output is correct
50	Correct	7 ms	340 KB	Output is correct
51	Correct	6 ms	340 KB	Output is correct
52	Correct	465 ms	12020 KB	Output is correct
53	Correct	479 ms	24596 KB	Output is correct
54	Correct	479 ms	24652 KB	Output is correct
55	Correct	477 ms	24608 KB	Output is correct
56	Correct	483 ms	24652 KB	Output is correct
57	Correct	474 ms	24652 KB	Output is correct
58	Correct	481 ms	24680 KB	Output is correct
59	Correct	511 ms	24672 KB	Output is correct
60	Correct	465 ms	24704 KB	Output is correct
61	Correct	471 ms	24564 KB	Output is correct
62	Correct	474 ms	24656 KB	Output is correct
63	Correct	473 ms	24656 KB	Output is correct
64	Correct	472 ms	24660 KB	Output is correct
65	Correct	466 ms	24604 KB	Output is correct
66	Correct	474 ms	24652 KB	Output is correct
67	Correct	468 ms	24652 KB	Output is correct
68	Correct	475 ms	24776 KB	Output is correct

Submission #680127

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