oj.uz

Submission #1115443

# Submission time Handle Problem Language Result Execution time Memory
1115443 2024-11-20T13:09:29 Z elush Bitaro, who Leaps through Time (JOI19_timeleap) C++14
34 / 100
 3000 ms 36412 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmax(a, b) a = max(a, b)
#define chkmin(a, b) a = min(a, b)
//#define int ll
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pii;
typedef vector<pii> vii;

const int block = 700;
const int MAX_N = 3e5 + 5;

int nx[MAX_N][2];
pii dp[MAX_N][2];
pii dq[MAX_N];
int rangesl[MAX_N / block + 1][block];
int rangesr[MAX_N / block + 1][block];
int ran[MAX_N][2];
int sz[MAX_N / block + 1];

void Update(int a, int b) {
    int dl = MAX_N / 2, dr = MAX_N / 2;
    for (int i = a; i < b; i++) {
        while (dl < dr) {
            if (ran[dq[dl].x][dq[dl].y] < ran[i][0]) {
                nx[dq[dl].x][dq[dl].y] = i;
                dl++;
            } else if (ran[dq[dr - 1].x][dq[dr - 1].y] > ran[i][1]) {
                nx[dq[dr - 1].x][dq[dr - 1].y] = i;
                dr--;
            } else break;
        }
        dq[--dl] = {i, 0}, dq[dr++] = {i, 1};
    }
    while (dl < dr) {
        nx[dq[dl].x][dq[dl].y] = b;
        dl++;
    }
    for (int i = b - 1; i >= a; i--) {
        for (int j = 0; j < 2; j++) {
            int x = nx[i][j];
            if (x == b) {
                dp[i][j] = {0, ran[i][j]};
            } else {
                if (ran[i][j] > ran[x][1]) {
                    dp[i][j] = {dp[x][1].x + ran[i][j] - ran[x][1], dp[x][1].y};
                } else {
                    dp[i][j] = {dp[x][0].x, dp[x][0].y};
                }
            }
        }
    }
    int bl = a / block;
    sz[bl] = b - a;
    rangesl[bl][0] = ran[a][0];
    rangesr[bl][0] = ran[a][1];
    for (int i = a + 1; i < b; i++) {
        rangesl[bl][i - a] = max(rangesl[bl][i - a - 1], ran[i][0]);
        rangesr[bl][i - a] = min(rangesr[bl][i - a - 1], ran[i][1]);
    }
}

ll Query(int a, int b, int c, int d) {
    ll ans = 0;
    while (a < c && a % block) {
        if (b < ran[a][0]) b = ran[a][0];
        else if (b > ran[a][1]) ans += b - ran[a][1], b = ran[a][1];
        a++;
    }
    while (a + block < c) {
        int bl = a / block;
        int i = min(lower_bound(rangesl[bl], rangesl[bl] + sz[bl], b) - rangesl[bl],
             lower_bound(rangesr[bl], rangesr[bl] + sz[bl], b, greater<int>()) - rangesr[bl]) + a;
        if (i < a + block) {
            if (b <= ran[i][0]) {
                ans += dp[i][0].x;
                b = dp[i][0].y;
            } else if (b >= ran[i][1]) {
                ans += dp[i][1].x;
                ans += b - ran[i][1];
                b = dp[i][1].y;
            }
        }
        a += block;
    }
    while (a < c) {
        if (b < ran[a][0]) b = ran[a][0];
        else if (b > ran[a][1]) ans += b - ran[a][1], b = ran[a][1];
        a++;
    }
    return ans + max<ll>(0, b - d);
}

int L[MAX_N], R[MAX_N], t[MAX_N], a[MAX_N], b[MAX_N], c[MAX_N], d[MAX_N];

ll ans[MAX_N];

int32_t main() {
    int n, q;
    cin >> n >> q;
    for (int i = 0; i + 1 < n; i++) cin >> L[i] >> R[i];
    for (int i = 0; i < q; i++) {
        cin >> t[i] >> a[i] >> b[i] >> c[i];
        if (t[i] == 2) cin >> d[i];
    }
    for (int i = 0; i < q; i++) a[i]--, c[i]--;
    for (int i = 0; i + 1 < n; i++) R[i]--;
    for (int ti = 0; ti < 2; ti++) {
        for (int i = 0; i + 1 < n; i++) {
            ran[i][0] = L[i] - i, ran[i][1] = R[i] - i;
        }
        for (int i = 0; i + 1 < n; i += block) {
            Update(i, min(i + block, n - 1));
        }
        for (int i = 0; i < q; i++) {
            if (t[i] == 1) {
                ran[a[i]][0] = b[i] - a[i], ran[a[i]][1] = c[i] - a[i];
                Update(a[i] / block * block, min(n - 1, a[i] / block * block + block));
            } else {
                if (a[i] <= c[i]) ans[i] = Query(a[i], b[i] - a[i], c[i], d[i] - c[i]);
            }
        }
        reverse(L, L + n - 1), reverse(R, R + n - 1);
        for (int i = 0; i < q; i++) {
            if (t[i] == 1) a[i] = n - 2 - a[i];
            else a[i] = n - 1 - a[i], c[i] = n - 1 - c[i];
        }
    }
    for (int i = 0; i < q; i++) {
        if (t[i] == 2) cout << ans[i] << '\n';
    }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2481 ms 36028 KB Output is correct
2 Correct 2508 ms 35908 KB Output is correct
3 Correct 2408 ms 35912 KB Output is correct
4 Correct 2470 ms 28860 KB Output is correct
5 Correct 2568 ms 36024 KB Output is correct
6 Correct 2636 ms 29892 KB Output is correct
7 Correct 2338 ms 36148 KB Output is correct
8 Correct 2268 ms 36412 KB Output is correct
9 Correct 2179 ms 35912 KB Output is correct
10 Correct 2611 ms 36056 KB Output is correct
11 Correct 2469 ms 36032 KB Output is correct
12 Correct 2598 ms 36192 KB Output is correct
13 Correct 2544 ms 36224 KB Output is correct
14 Correct 1 ms 6480 KB Output is correct

Subtask #3
0 / 66.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 18768 KB Output is correct
2 Correct 2 ms 18768 KB Output is correct
3 Correct 3 ms 18768 KB Output is correct
4 Correct 3 ms 18768 KB Output is correct
5 Correct 2 ms 18908 KB Output is correct
6 Correct 2 ms 18768 KB Output is correct
7 Correct 2 ms 18768 KB Output is correct
8 Correct 2 ms 18768 KB Output is correct
9 Correct 2 ms 18768 KB Output is correct
10 Correct 2 ms 18768 KB Output is correct
11 Correct 10 ms 18768 KB Output is correct
12 Correct 10 ms 18900 KB Output is correct
13 Correct 10 ms 18768 KB Output is correct
14 Correct 10 ms 18928 KB Output is correct
15 Correct 10 ms 18920 KB Output is correct
16 Correct 9 ms 18768 KB Output is correct
17 Correct 10 ms 18768 KB Output is correct
18 Correct 10 ms 18920 KB Output is correct
19 Correct 10 ms 18768 KB Output is correct
20 Correct 10 ms 18768 KB Output is correct
21 Correct 9 ms 18768 KB Output is correct
22 Correct 10 ms 18768 KB Output is correct
23 Correct 9 ms 18768 KB Output is correct
24 Correct 14 ms 18768 KB Output is correct
25 Correct 10 ms 18768 KB Output is correct
26 Correct 9 ms 18912 KB Output is correct
27 Correct 9 ms 18768 KB Output is correct
28 Correct 10 ms 18936 KB Output is correct
29 Correct 9 ms 18768 KB Output is correct
30 Correct 9 ms 18768 KB Output is correct
31 Correct 11 ms 18768 KB Output is correct
32 Correct 10 ms 18768 KB Output is correct
33 Correct 10 ms 18780 KB Output is correct
34 Correct 10 ms 18768 KB Output is correct
35 Correct 9 ms 18768 KB Output is correct
36 Correct 10 ms 18768 KB Output is correct
37 Correct 10 ms 18768 KB Output is correct
38 Correct 13 ms 18768 KB Output is correct
39 Correct 9 ms 18768 KB Output is correct
40 Correct 9 ms 18768 KB Output is correct
41 Correct 2 ms 6480 KB Output is correct
42 Correct 2481 ms 36028 KB Output is correct
43 Correct 2508 ms 35908 KB Output is correct
44 Correct 2408 ms 35912 KB Output is correct
45 Correct 2470 ms 28860 KB Output is correct
46 Correct 2568 ms 36024 KB Output is correct
47 Correct 2636 ms 29892 KB Output is correct
48 Correct 2338 ms 36148 KB Output is correct
49 Correct 2268 ms 36412 KB Output is correct
50 Correct 2179 ms 35912 KB Output is correct
51 Correct 2611 ms 36056 KB Output is correct
52 Correct 2469 ms 36032 KB Output is correct
53 Correct 2598 ms 36192 KB Output is correct
54 Correct 2544 ms 36224 KB Output is correct
55 Correct 1 ms 6480 KB Output is correct
56 Execution timed out 3056 ms 31824 KB Time limit exceeded
57 Halted 0 ms 0 KB -