Submission #482099

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
482099	2021-10-23T06:54:52 Z	dxz05	Art Exhibition (JOI18_art)	C++14	100 / 100	187 ms	20896 KB

#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 5222;

pair<ll, ll> p[N];
void solve(int TC) {
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++){
        cin >> p[i].first >> p[i].second;
    }

    sort(p + 1, p + n + 1);

    ll ans = 0, mx = 0, pref = 0;
    for (int i = 1; i <= n; i++){
        mx = max(mx, p[i].first - pref);
        pref += p[i].second;
        ans = max(ans, pref - p[i].first + mx);
    }

    cout << ans;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	204 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	2 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	0 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	0 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	2 ms	460 KB	Output is correct
28	Correct	2 ms	460 KB	Output is correct
29	Correct	3 ms	460 KB	Output is correct
30	Correct	2 ms	460 KB	Output is correct
31	Correct	2 ms	460 KB	Output is correct
32	Correct	2 ms	460 KB	Output is correct
33	Correct	2 ms	460 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	2 ms	460 KB	Output is correct
36	Correct	2 ms	460 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	460 KB	Output is correct
40	Correct	2 ms	460 KB	Output is correct
41	Correct	2 ms	460 KB	Output is correct
42	Correct	2 ms	464 KB	Output is correct
43	Correct	2 ms	460 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	2 ms	460 KB	Output is correct
46	Correct	2 ms	468 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	2 ms	460 KB	Output is correct
49	Correct	2 ms	460 KB	Output is correct
50	Correct	3 ms	460 KB	Output is correct
51	Correct	2 ms	460 KB	Output is correct
52	Correct	187 ms	20836 KB	Output is correct
53	Correct	170 ms	20788 KB	Output is correct
54	Correct	163 ms	20688 KB	Output is correct
55	Correct	159 ms	20680 KB	Output is correct
56	Correct	175 ms	20740 KB	Output is correct
57	Correct	164 ms	20676 KB	Output is correct
58	Correct	160 ms	20676 KB	Output is correct
59	Correct	163 ms	20736 KB	Output is correct
60	Correct	164 ms	20808 KB	Output is correct
61	Correct	161 ms	20552 KB	Output is correct
62	Correct	162 ms	20676 KB	Output is correct
63	Correct	186 ms	20676 KB	Output is correct
64	Correct	163 ms	20680 KB	Output is correct
65	Correct	160 ms	20676 KB	Output is correct
66	Correct	172 ms	20896 KB	Output is correct
67	Correct	160 ms	20736 KB	Output is correct
68	Correct	161 ms	20756 KB	Output is correct

Submission #482099

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