oj.uz

Submission #796821

# Submission time Handle Problem Language Result Execution time Memory
796821 2023-07-28T19:17:47 Z RushB Bitaro, who Leaps through Time (JOI19_timeleap) C++17
100 / 100
 669 ms 104268 KB 
//besmellah
//mage mikhad chi beshe?
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i) 
#define int long long
const int64_t INF = 1ll << 60;
const int N = 3e5 + 50;
int n, q, A[N], B[N], C[N], D[N], P[N], t[N], L[N], R[N], query_ans[N];

struct node {
        int mxl, mnr, fil, fir, ansl, ansr, locl, locr;
};
int dist(int l, int r) {
        return max(r - l, 0ll);
}
void calc(node x, int l, int &rel, int &reans) {
        if (x.mxl <= x.mnr) {
                rel = min(max(l, x.mxl), x.mnr);
                reans += dist(rel, l);
        }
        else {
                int dl = dist(x.fil, l) + x.ansl;
                int dr = dist(x.fir, l) + x.ansr;
                if (dl < dr) {
                        reans += dl;
                        rel = x.locl;
                }
                else {
                        reans += dr; 
                        rel = x.locr;
                }
        }
}

node operator +(node l, node r) {
        node R;
        R.mxl = max(l.mxl, r.mxl);
        R.mnr = min(l.mnr, r.mnr);
        if (R.mxl <= R.mnr) {
                R.ansl = R.ansr = 0;
                R.locl = R.mxl;
                R.locr = R.mnr;
                R.fil = R.mxl;
                R.fir = R.mnr;
                return R;
        }
        R.fil = max(l.fil, r.fil);
        R.fir = min(l.fir, r.fir);
        if (l.mxl > l.mnr || R.fil > R.fir) {
                R.fil = l.fil;
                R.fir = l.fir;
        }
        R.ansl = R.ansr = 0;
        int tl, tr;
        calc(l, R.fil, tl, R.ansl);
        calc(r, tl, R.locl, R.ansl);

        calc(l, R.fir, tr, R.ansr);
        calc(r, tr, R.locr, R.ansr);
        return R;
}
node seg[N << 2];

//int mxl, mnr, fil, fir, ansl, ansr, locl, locr;
void build(int v, int l, int r) {
        if (l + 1 == r) {
                seg[v] = {L[l], R[l], L[l], R[l], 0, 0, L[l], R[l]};
                return;
        }
        int m = l + r >> 1;
        build(v << 1, l, m);
        build(v << 1 | 1, m, r);
        seg[v] = seg[v << 1] + seg[v << 1 | 1];
}
void update(int v, int l, int r, int ind, int L, int R) {
        if (l + 1 == r) {
                seg[v] = {L, R, L, R, 0, 0, L, R};
                return;
        }
        int m = l + r >> 1;
        if (ind < m)
                update(v << 1, l, m, ind, L, R);
        else
                update(v << 1 | 1, m, r, ind, L, R);
        seg[v] = seg[v << 1] + seg[v << 1 | 1];
}
//void calc(node x, int l, int &rel, int &reans) {
void get(int v, int l, int r, int L, int R, int &time, int &re) {
        if (L <= l && r <= R) {
                calc(seg[v], time, time, re);
                return;
        }
        int m = l + r >> 1;
        if (R <= m)
                get(v << 1, l, m, L, R, time, re);
        else if (L >= m)
                get(v << 1 | 1, m, r, L, R, time, re);
        else {
                get(v << 1, l, m, L, R, time, re);
                get(v << 1 | 1, m, r, L, R, time, re);
        }
}

void solve() {
        FOR(i, 1, n) {
                L[i] -= i;
                R[i] -= i + 1;
        }
        build(1, 1, n);
        FOR(i, 0, q) {
                B[i] -= (t[i] == 1 ? P[i] : A[i]);
                D[i] -= (t[i] == 1 ? P[i] + 1 : C[i]);
                if (t[i] == 1) {
                       update(1, 1, n, P[i], B[i], D[i]); 
                }
                else if (C[i] > A[i]) {
                        int time = B[i];
                        get(1, 1, n, A[i], C[i], time, query_ans[i]);
                        query_ans[i] += dist(D[i], time);
                }
                else if (C[i] == A[i])
                        query_ans[i] = dist(D[i], B[i]);
        }
        FOR(i, 1, n) {
                L[i] += i;
                R[i] += i + 1;
        }
        FOR(i, 0, q) {
                B[i] += (t[i] == 1 ? P[i] : A[i]);
                D[i] += (t[i] == 1 ? P[i] + 1 : C[i]);
        }
}

signed main() {
        ios::sync_with_stdio(0), cin.tie(0);
        cin >> n >> q;
        if (n == 1) {
                while (q--) {
                        int t, a, b, c, d;
                        cin >> t >> a >> b >> c >> d;
                        cout << dist(d, b) << '\n';
                }
                return 0;
        }
        FOR(i, 1, n)
                cin >> L[i] >> R[i];
        FOR(i, 0, q) {
                cin >> t[i];
                if (t[i] == 1) {
                        cin >> P[i] >> B[i] >> D[i];
                }
                else {
                        cin >> A[i] >> B[i] >> C[i] >> D[i];
                }
        }
        solve();
        reverse(L + 1, L + n);
        reverse(R + 1, R + n);
        
        FOR(i, 0, q) {
                if (t[i] == 1) {
                        P[i] = n - P[i];
                }
                else {
                        A[i] = n + 1 - A[i];
                        C[i] = n + 1 - C[i];
                }
        }
        solve();

        FOR(i, 0, q)
                if (t[i] == 2) {
                        cout << query_ans[i] << '\n';
                }

        return 0;
}
//19:33:34

Compilation message

timeleap.cpp: In function 'void build(long long int, long long int, long long int)':
timeleap.cpp:71:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |         int m = l + r >> 1;
      |                 ~~^~~
timeleap.cpp: In function 'void update(long long int, long long int, long long int, long long int, long long int, long long int)':
timeleap.cpp:81:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   81 |         int m = l + r >> 1;
      |                 ~~^~~
timeleap.cpp: In function 'void get(long long int, long long int, long long int, long long int, long long int, long long int&, long long int&)':
timeleap.cpp:94:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   94 |         int m = l + r >> 1;
      |                 ~~^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 0 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 400 ms 88572 KB Output is correct
2 Correct 363 ms 55484 KB Output is correct
3 Correct 383 ms 55548 KB Output is correct
4 Correct 358 ms 55308 KB Output is correct
5 Correct 395 ms 88504 KB Output is correct
6 Correct 377 ms 81056 KB Output is correct
7 Correct 392 ms 88852 KB Output is correct
8 Correct 389 ms 88956 KB Output is correct
9 Correct 363 ms 55552 KB Output is correct
10 Correct 392 ms 88660 KB Output is correct
11 Correct 378 ms 88552 KB Output is correct
12 Correct 408 ms 89016 KB Output is correct
13 Correct 393 ms 88996 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #3
66.0 / 66.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 2 ms 596 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 596 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 400 ms 88572 KB Output is correct
43 Correct 363 ms 55484 KB Output is correct
44 Correct 383 ms 55548 KB Output is correct
45 Correct 358 ms 55308 KB Output is correct
46 Correct 395 ms 88504 KB Output is correct
47 Correct 377 ms 81056 KB Output is correct
48 Correct 392 ms 88852 KB Output is correct
49 Correct 389 ms 88956 KB Output is correct
50 Correct 363 ms 55552 KB Output is correct
51 Correct 392 ms 88660 KB Output is correct
52 Correct 378 ms 88552 KB Output is correct
53 Correct 408 ms 89016 KB Output is correct
54 Correct 393 ms 88996 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 574 ms 103284 KB Output is correct
57 Correct 550 ms 69736 KB Output is correct
58 Correct 604 ms 103548 KB Output is correct
59 Correct 595 ms 103720 KB Output is correct
60 Correct 559 ms 70036 KB Output is correct
61 Correct 599 ms 103952 KB Output is correct
62 Correct 603 ms 103900 KB Output is correct
63 Correct 641 ms 104044 KB Output is correct
64 Correct 644 ms 104096 KB Output is correct
65 Correct 600 ms 103500 KB Output is correct
66 Correct 669 ms 103476 KB Output is correct
67 Correct 629 ms 103916 KB Output is correct
68 Correct 590 ms 79504 KB Output is correct
69 Correct 650 ms 104144 KB Output is correct
70 Correct 616 ms 70124 KB Output is correct
71 Correct 550 ms 69168 KB Output is correct
72 Correct 544 ms 75200 KB Output is correct
73 Correct 608 ms 103572 KB Output is correct
74 Correct 609 ms 103488 KB Output is correct
75 Correct 619 ms 103744 KB Output is correct
76 Correct 638 ms 104268 KB Output is correct
77 Correct 1 ms 340 KB Output is correct