Submission #699733

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
699733	2023-02-17T21:33:50 Z	youssef	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	8664 KB

/*
██╗░░░██╗░█████╗░██╗░░░██╗░██████╗░██████╗███████╗███████╗
╚██╗░██╔╝██╔══██╗██║░░░██║██╔════╝██╔════╝██╔════╝██╔════╝
░╚████╔╝░██║░░██║██║░░░██║╚█████╗░╚█████╗░█████╗░░█████╗░░
░░╚██╔╝░░██║░░██║██║░░░██║░╚═══██╗░╚═══██╗██╔══╝░░██╔══╝░░
░░░██║░░░╚█████╔╝╚██████╔╝██████╔╝██████╔╝███████╗██║░░░░░
░░░╚═╝░░░░╚════╝░░╚═════╝░╚═════╝░╚═════╝░╚══════╝╚═╝░░░░░
 */
#include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define ll long long
#define fi first
#define se second
#define fast  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main() {
    fast
    int n;
    cin>>n;
    vector<pair<ll,ll>>art;
    for(int i=0;i<n;i++)
    {ll siz,va;
        cin>>siz>>va;
        art.push_back({siz,va});
    }
    sort(art.begin(),art.end());
    for(int i=1;i<n;i++)
    {
        art[i].se+=art[i-1].se;
    }

    ll  ma=-1;
    for(int i=0;i<n;i++)
    {
        for(int j=i;j<n;j++)
        {
            if(i!=0)
        ma=max(ma,(art[j].se-art[i-1].se)-(art[j].fi-art[i].fi));
            else
                ma=max(ma,(art[j].se)-(art[j].fi-art[i].fi));
        }
    }



    cout<<ma;




    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct
9	Correct	212 KB	Output is correct
10	Correct	212 KB	Output is correct
11	Correct	212 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 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	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 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	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	14 ms	468 KB	Output is correct
28	Correct	15 ms	468 KB	Output is correct
29	Correct	15 ms	468 KB	Output is correct
30	Correct	15 ms	532 KB	Output is correct
31	Correct	14 ms	468 KB	Output is correct
32	Correct	14 ms	468 KB	Output is correct
33	Correct	15 ms	468 KB	Output is correct
34	Correct	15 ms	468 KB	Output is correct
35	Correct	14 ms	468 KB	Output is correct
36	Correct	14 ms	468 KB	Output is correct
37	Correct	16 ms	468 KB	Output is correct
38	Correct	15 ms	468 KB	Output is correct
39	Correct	14 ms	528 KB	Output is correct
40	Correct	14 ms	536 KB	Output is correct
41	Correct	14 ms	468 KB	Output is correct
42	Correct	18 ms	468 KB	Output is correct
43	Correct	15 ms	468 KB	Output is correct
44	Correct	15 ms	468 KB	Output is correct
45	Correct	15 ms	468 KB	Output is correct
46	Correct	14 ms	468 KB	Output is correct
47	Correct	14 ms	532 KB	Output is correct
48	Correct	15 ms	468 KB	Output is correct
49	Correct	15 ms	468 KB	Output is correct
50	Correct	15 ms	468 KB	Output is correct
51	Correct	15 ms	468 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 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	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	14 ms	468 KB	Output is correct
28	Correct	15 ms	468 KB	Output is correct
29	Correct	15 ms	468 KB	Output is correct
30	Correct	15 ms	532 KB	Output is correct
31	Correct	14 ms	468 KB	Output is correct
32	Correct	14 ms	468 KB	Output is correct
33	Correct	15 ms	468 KB	Output is correct
34	Correct	15 ms	468 KB	Output is correct
35	Correct	14 ms	468 KB	Output is correct
36	Correct	14 ms	468 KB	Output is correct
37	Correct	16 ms	468 KB	Output is correct
38	Correct	15 ms	468 KB	Output is correct
39	Correct	14 ms	528 KB	Output is correct
40	Correct	14 ms	536 KB	Output is correct
41	Correct	14 ms	468 KB	Output is correct
42	Correct	18 ms	468 KB	Output is correct
43	Correct	15 ms	468 KB	Output is correct
44	Correct	15 ms	468 KB	Output is correct
45	Correct	15 ms	468 KB	Output is correct
46	Correct	14 ms	468 KB	Output is correct
47	Correct	14 ms	532 KB	Output is correct
48	Correct	15 ms	468 KB	Output is correct
49	Correct	15 ms	468 KB	Output is correct
50	Correct	15 ms	468 KB	Output is correct
51	Correct	15 ms	468 KB	Output is correct
52	Execution timed out	1090 ms	8664 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #699733

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