Submission #1116866

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1116866	2024-11-22T13:42:03 Z	SN0WM4N	Art Exhibition (JOI18_art)	C++17	100 / 100	151 ms	15976 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sort undefined_function // To use stable_sort instead sort 
#define bpc __builtin_popcount
#define ull unsigned long long
#define ld double
#define ll long long
#define mp make_pair
#define F first
#define S second

# pragma GCC optimize("O2")
//pragma GCC optimize("my solution")

using namespace __gnu_pbds;
using namespace std;

typedef tree<long long, null_type, less_equal<long long>,
    rb_tree_tag, tree_order_statistics_node_update> Tree;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;
const ll MOD = 1e9 + 7; //[998244353, 1e9 + 7, 1e9 + 13]

ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
ll ceil(ll a, ll b) {return (a + b - 1) / b;}

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

        int n;
        cin >> n;

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

        for (int i = 1; i <= n; i ++) 
                cin >> v[i].F >> v[i].S;
        stable_sort(v.begin() + 1, v.end());

        vector<ll> ta(n + 1);
        for (int i = 1; i <= n; i ++) 
                ta[i] = ta[i - 1] + v[i].S;

        //ta[j] - v[j].F - (ta[i - 1] - v[i].F)
        //ta[j] - v[j].F -> const
        //(ta[i - 1] - v[i].F) -> Hay que minimizarlo 
        //
        //sum - (v[j].F - v[i].F)
        //sum -v[j].F + v[i].F
        //ta[j] - ta[i - 1] - v[j].F + v[i].F
        //ta[j] - v[j] - ta[i - 1] + v[i].F
        //(ta[j] - v[j]) - (ta[i - 1] - v[i].F) 

        ll ans = 0, mi = v[1].F;
        for (int i = 1; i <= n; i ++) {
                mi = min(mi, ta[i - 1] - v[i].F);
                ans = max(ans, ta[i] - v[i].F - mi);
        } 

        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	504 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	504 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	336 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	504 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	504 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	336 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	336 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	356 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	504 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	504 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	336 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	336 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	356 KB	Output is correct
27	Correct	2 ms	592 KB	Output is correct
28	Correct	2 ms	592 KB	Output is correct
29	Correct	2 ms	592 KB	Output is correct
30	Correct	2 ms	592 KB	Output is correct
31	Correct	2 ms	592 KB	Output is correct
32	Correct	2 ms	592 KB	Output is correct
33	Correct	2 ms	592 KB	Output is correct
34	Correct	2 ms	592 KB	Output is correct
35	Correct	2 ms	592 KB	Output is correct
36	Correct	2 ms	592 KB	Output is correct
37	Correct	2 ms	592 KB	Output is correct
38	Correct	2 ms	760 KB	Output is correct
39	Correct	2 ms	592 KB	Output is correct
40	Correct	2 ms	592 KB	Output is correct
41	Correct	2 ms	592 KB	Output is correct
42	Correct	2 ms	592 KB	Output is correct
43	Correct	2 ms	592 KB	Output is correct
44	Correct	2 ms	592 KB	Output is correct
45	Correct	2 ms	592 KB	Output is correct
46	Correct	2 ms	592 KB	Output is correct
47	Correct	2 ms	760 KB	Output is correct
48	Correct	2 ms	760 KB	Output is correct
49	Correct	2 ms	592 KB	Output is correct
50	Correct	2 ms	592 KB	Output is correct
51	Correct	2 ms	592 KB	Output is correct

Subtask #4
50.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	504 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	504 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	336 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	336 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	356 KB	Output is correct
27	Correct	2 ms	592 KB	Output is correct
28	Correct	2 ms	592 KB	Output is correct
29	Correct	2 ms	592 KB	Output is correct
30	Correct	2 ms	592 KB	Output is correct
31	Correct	2 ms	592 KB	Output is correct
32	Correct	2 ms	592 KB	Output is correct
33	Correct	2 ms	592 KB	Output is correct
34	Correct	2 ms	592 KB	Output is correct
35	Correct	2 ms	592 KB	Output is correct
36	Correct	2 ms	592 KB	Output is correct
37	Correct	2 ms	592 KB	Output is correct
38	Correct	2 ms	760 KB	Output is correct
39	Correct	2 ms	592 KB	Output is correct
40	Correct	2 ms	592 KB	Output is correct
41	Correct	2 ms	592 KB	Output is correct
42	Correct	2 ms	592 KB	Output is correct
43	Correct	2 ms	592 KB	Output is correct
44	Correct	2 ms	592 KB	Output is correct
45	Correct	2 ms	592 KB	Output is correct
46	Correct	2 ms	592 KB	Output is correct
47	Correct	2 ms	760 KB	Output is correct
48	Correct	2 ms	760 KB	Output is correct
49	Correct	2 ms	592 KB	Output is correct
50	Correct	2 ms	592 KB	Output is correct
51	Correct	2 ms	592 KB	Output is correct
52	Correct	133 ms	15960 KB	Output is correct
53	Correct	120 ms	15968 KB	Output is correct
54	Correct	129 ms	15944 KB	Output is correct
55	Correct	119 ms	15952 KB	Output is correct
56	Correct	119 ms	15964 KB	Output is correct
57	Correct	151 ms	15968 KB	Output is correct
58	Correct	151 ms	15944 KB	Output is correct
59	Correct	129 ms	15972 KB	Output is correct
60	Correct	120 ms	15944 KB	Output is correct
61	Correct	147 ms	15956 KB	Output is correct
62	Correct	123 ms	15944 KB	Output is correct
63	Correct	123 ms	15944 KB	Output is correct
64	Correct	125 ms	15976 KB	Output is correct
65	Correct	127 ms	15944 KB	Output is correct
66	Correct	124 ms	15972 KB	Output is correct
67	Correct	133 ms	15940 KB	Output is correct
68	Correct	121 ms	15944 KB	Output is correct

Submission #1116866

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