Submission #971225

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
971225	2024-04-28T08:04:22 Z	vyshniak_n	Art Exhibition (JOI18_art)	C++17	100 / 100	421 ms	36952 KB

//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma target("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef long double ld;

using namespace std;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define popb pop_back
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

const ll N = 5e5 + 10;
const ll INF = 2e18 + 10;
const ll inf = 2e9 + 10;

ll t[4 * N], lazy[4 * N];
void push(ll v) {
    t[v << 1] += lazy[v];
    t[v << 1 | 1] += lazy[v];

    lazy[v << 1] += lazy[v];
    lazy[v << 1 | 1] += lazy[v];

    lazy[v] = 0;
}
void upd(ll v, ll tl, ll tr, ll l, ll r, ll val) {
    if (l > tr || r < tl)
        return;
    if (l <= tl && r >= tr) {
        t[v] += val;
        lazy[v] += val;
        return;
    } 

    push(v);
    ll tm = (tl + tr) >> 1;

    upd(v << 1, tl, tm, l, r, val);
    upd(v << 1 | 1, tm + 1, tr, l, r, val);

    t[v] = max(t[v << 1], t[v << 1 | 1]);
}
ll get(ll v, ll tl, ll tr, ll l, ll r) {
    if (l > tr || r < tl)
        return -INF;
    if (l <= tl && r >= tr)
        return t[v];

    push(v);
    ll tm = (tl + tr) >> 1;

    return max(get(v << 1, tl, tm, l, r),
               get(v << 1 | 1, tm + 1, tr, l, r));
}

void solve() {
    ll n;
    cin >> n;

    vector <point> events(n);
    for (ll i = 0; i < n; i++)
        cin >> events[i].ff >> events[i].ss;

    sort(all(events));

    ll ans = -INF;
    for (ll i = 0; i < n; i++) {
        upd(1, 1, n, i + 1, i + 1, events[i].ff);
        upd(1, 1, n, 1, i + 1, events[i].ss);

        ans = max(ans, get(1, 1, n, 1, i + 1) - events[i].ff);
    }

    cout << ans << el;
    return;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--)
        solve();
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2508 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	2 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2508 KB	Output is correct
22	Correct	1 ms	2512 KB	Output is correct
23	Correct	1 ms	2648 KB	Output is correct
24	Correct	1 ms	2508 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	3 ms	2652 KB	Output is correct
28	Correct	4 ms	2652 KB	Output is correct
29	Correct	3 ms	2652 KB	Output is correct
30	Correct	4 ms	2652 KB	Output is correct
31	Correct	4 ms	2652 KB	Output is correct
32	Correct	4 ms	2716 KB	Output is correct
33	Correct	4 ms	2652 KB	Output is correct
34	Correct	5 ms	2700 KB	Output is correct
35	Correct	5 ms	2652 KB	Output is correct
36	Correct	5 ms	2652 KB	Output is correct
37	Correct	4 ms	2848 KB	Output is correct
38	Correct	4 ms	2652 KB	Output is correct
39	Correct	4 ms	2652 KB	Output is correct
40	Correct	4 ms	2652 KB	Output is correct
41	Correct	4 ms	2648 KB	Output is correct
42	Correct	4 ms	2904 KB	Output is correct
43	Correct	4 ms	2652 KB	Output is correct
44	Correct	4 ms	2720 KB	Output is correct
45	Correct	4 ms	2648 KB	Output is correct
46	Correct	4 ms	2652 KB	Output is correct
47	Correct	4 ms	2652 KB	Output is correct
48	Correct	4 ms	2652 KB	Output is correct
49	Correct	4 ms	2652 KB	Output is correct
50	Correct	4 ms	2648 KB	Output is correct
51	Correct	3 ms	2652 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2508 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	2 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2508 KB	Output is correct
22	Correct	1 ms	2512 KB	Output is correct
23	Correct	1 ms	2648 KB	Output is correct
24	Correct	1 ms	2508 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	3 ms	2652 KB	Output is correct
28	Correct	4 ms	2652 KB	Output is correct
29	Correct	3 ms	2652 KB	Output is correct
30	Correct	4 ms	2652 KB	Output is correct
31	Correct	4 ms	2652 KB	Output is correct
32	Correct	4 ms	2716 KB	Output is correct
33	Correct	4 ms	2652 KB	Output is correct
34	Correct	5 ms	2700 KB	Output is correct
35	Correct	5 ms	2652 KB	Output is correct
36	Correct	5 ms	2652 KB	Output is correct
37	Correct	4 ms	2848 KB	Output is correct
38	Correct	4 ms	2652 KB	Output is correct
39	Correct	4 ms	2652 KB	Output is correct
40	Correct	4 ms	2652 KB	Output is correct
41	Correct	4 ms	2648 KB	Output is correct
42	Correct	4 ms	2904 KB	Output is correct
43	Correct	4 ms	2652 KB	Output is correct
44	Correct	4 ms	2720 KB	Output is correct
45	Correct	4 ms	2648 KB	Output is correct
46	Correct	4 ms	2652 KB	Output is correct
47	Correct	4 ms	2652 KB	Output is correct
48	Correct	4 ms	2652 KB	Output is correct
49	Correct	4 ms	2652 KB	Output is correct
50	Correct	4 ms	2648 KB	Output is correct
51	Correct	3 ms	2652 KB	Output is correct
52	Correct	411 ms	36696 KB	Output is correct
53	Correct	383 ms	36836 KB	Output is correct
54	Correct	378 ms	36692 KB	Output is correct
55	Correct	421 ms	36772 KB	Output is correct
56	Correct	393 ms	36712 KB	Output is correct
57	Correct	377 ms	36692 KB	Output is correct
58	Correct	386 ms	36864 KB	Output is correct
59	Correct	387 ms	36692 KB	Output is correct
60	Correct	392 ms	36924 KB	Output is correct
61	Correct	388 ms	36896 KB	Output is correct
62	Correct	379 ms	36852 KB	Output is correct
63	Correct	400 ms	36952 KB	Output is correct
64	Correct	379 ms	36892 KB	Output is correct
65	Correct	381 ms	36900 KB	Output is correct
66	Correct	381 ms	36756 KB	Output is correct
67	Correct	381 ms	36692 KB	Output is correct
68	Correct	380 ms	36688 KB	Output is correct

Submission #971225

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