Submission #1116899

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1116899	2024-11-22T14:24:44 Z	vjudge1	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	23760 KB

#include <bits/stdc++.h>
#define sts(v) stable_sort(v.BE, v.E)
#define Rsts(v) stable_sort(v.rBE, v.rE)
#define rev(v) reverse(v.BE, v.E)
#define BE begin()
#define rBE rbegin()
#define E end()
#define rE rend()
#define pb push_back
#define ppb pop_back()
#define pf push_front
#define ppf pop_front()
#define F first
#define S second

using namespace std;
using ll = long long;

struct datos{
    ll ans, maxi, mini, suma; 
};

int main(){
    ios_base::sync_with_stdio(0); 
    cin.tie(0); cout.tie(0);

    int n; cin >> n;
    vector<pair<ll, ll>> v(n + 1);

    for(int i = 1; i <= n; i++){
        ll a, b; cin >> a >> b;

        v[i] = {a, b};
    }
    sts(v);
    vector<datos> ans(n + 1);
    ll ANS = 0;
    for(int i = 1; i <= n; i++){
        // F -> size, S -> val
        ans[i] = {
            v[i].S,
            v[i].F,
            v[i].F,
            v[i].S
        };
        for(int j = 1; j < i; j++){
            ll maxi = max(ans[j].maxi, v[i].F), mini = min(ans[j].mini, v[i].F),
               suma = ans[j].suma + v[i].S, res = suma - (maxi - mini);

            if(res > ans[i].ans)
                ans[i] = {
                    res,
                    maxi,
                    mini,
                    suma
                };
            ANS = max(ANS, ans[i].ans);
            
        }
        // cout << ans[i].ans << '\n';
    }

    cout << ANS << '\n';
	
    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	508 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	504 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	508 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	504 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	504 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	464 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	508 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	504 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	504 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	464 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	18 ms	592 KB	Output is correct
28	Correct	19 ms	848 KB	Output is correct
29	Correct	19 ms	848 KB	Output is correct
30	Correct	19 ms	592 KB	Output is correct
31	Correct	19 ms	848 KB	Output is correct
32	Correct	19 ms	848 KB	Output is correct
33	Correct	19 ms	848 KB	Output is correct
34	Correct	18 ms	592 KB	Output is correct
35	Correct	19 ms	848 KB	Output is correct
36	Correct	20 ms	592 KB	Output is correct
37	Correct	19 ms	616 KB	Output is correct
38	Correct	19 ms	592 KB	Output is correct
39	Correct	26 ms	764 KB	Output is correct
40	Correct	18 ms	848 KB	Output is correct
41	Correct	21 ms	592 KB	Output is correct
42	Correct	19 ms	1100 KB	Output is correct
43	Correct	19 ms	848 KB	Output is correct
44	Correct	19 ms	748 KB	Output is correct
45	Correct	19 ms	748 KB	Output is correct
46	Correct	19 ms	1016 KB	Output is correct
47	Correct	19 ms	592 KB	Output is correct
48	Correct	19 ms	848 KB	Output is correct
49	Correct	19 ms	848 KB	Output is correct
50	Correct	19 ms	848 KB	Output is correct
51	Correct	19 ms	848 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	508 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	504 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	504 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	464 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	18 ms	592 KB	Output is correct
28	Correct	19 ms	848 KB	Output is correct
29	Correct	19 ms	848 KB	Output is correct
30	Correct	19 ms	592 KB	Output is correct
31	Correct	19 ms	848 KB	Output is correct
32	Correct	19 ms	848 KB	Output is correct
33	Correct	19 ms	848 KB	Output is correct
34	Correct	18 ms	592 KB	Output is correct
35	Correct	19 ms	848 KB	Output is correct
36	Correct	20 ms	592 KB	Output is correct
37	Correct	19 ms	616 KB	Output is correct
38	Correct	19 ms	592 KB	Output is correct
39	Correct	26 ms	764 KB	Output is correct
40	Correct	18 ms	848 KB	Output is correct
41	Correct	21 ms	592 KB	Output is correct
42	Correct	19 ms	1100 KB	Output is correct
43	Correct	19 ms	848 KB	Output is correct
44	Correct	19 ms	748 KB	Output is correct
45	Correct	19 ms	748 KB	Output is correct
46	Correct	19 ms	1016 KB	Output is correct
47	Correct	19 ms	592 KB	Output is correct
48	Correct	19 ms	848 KB	Output is correct
49	Correct	19 ms	848 KB	Output is correct
50	Correct	19 ms	848 KB	Output is correct
51	Correct	19 ms	848 KB	Output is correct
52	Execution timed out	1053 ms	23760 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #1116899

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