oj.uz

답안 #747559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
747559 2023-05-24T10:21:28 Z baluteshih Mizuyokan 2 (JOI23_mizuyokan2) C++14
60 / 100
 4000 ms 524000 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

const int C = 64;

pii operator+(const pii &a, const pii &b) { return pii(a.X + b.X, a.Y + b.Y); }

int arr[250005], lft[250005], tmp[250005];

struct Node {
    int l, r;
    pii mx[C + 1]; // mx[i]: start with (l - i - 1, 0), jump to (i + mx[i].X, mx[i].Y)
    Node() {}
    Node(int v): l(v), r(v) {   
        for (int i = 0; i <= C; ++i) {
            mx[i] = pii(0, 0);
            if (lft[v] - 1 > v - i - 1) mx[i] = pii(i + 1, 2);
        }
    }
    Node operator+(const Node &a) const {
        Node res(*this);
        res.r = a.r;
        for (int i = 0; i <= C; ++i) {
            if (res.l - i - 1 + res.mx[i].X < a.l - C - 1) res.mx[i] = res.mx[i] + a.mx[C];
            else res.mx[i] = res.mx[i] + a.mx[a.l - (res.l - i - 1 + res.mx[i].X) - 1];
        }
        return res;
    }
} seg[1000005];

void build(int l, int r, int rt) {
    if (l == r) return seg[rt] = Node(l), void();
    int mid = (l + r) >> 1;
    build(l, mid, rt << 1), build(mid + 1, r, rt << 1 | 1);
    seg[rt] = seg[rt << 1] + seg[rt << 1 | 1];
}

void modify(int L, int R, int rt) {
    if (seg[rt].l == seg[rt].r) return seg[rt] = Node(seg[rt].l), void();
    int mid = (seg[rt].l + seg[rt].r) >> 1;
    if (L <= mid) modify(L, R, rt << 1);
    if (R > mid) modify(L, R, rt << 1 | 1);
    seg[rt] = seg[rt << 1] + seg[rt << 1 | 1];
}

Node query(int L, int R, int rt) {
    if (L <= seg[rt].l && R >= seg[rt].r) return seg[rt];
    int mid = (seg[rt].l + seg[rt].r) >> 1;
    if (R <= mid) return query(L, R, rt << 1);
    if (L > mid) return query(L, R, rt << 1 | 1);
    return query(L, R, rt << 1) + query(L, R, rt << 1 | 1);
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> arr[i];
    
    auto update = [&](int i) {
        lft[i] = -C - 1;
        ll cur = 0;
        for (int j = i; j > 0 && j > i - C; --j) {
            cur += arr[j];
            if (cur > max(arr[j - 1], arr[i + 1])) {
                lft[i] = j;
                break;
            }
        }
    };

    for (int i = 1; i <= n; ++i)
        update(i);

    build(1, n, 1);

    int q;
    cin >> q;
    for (int i = 1; i <= q; ++i) {
        int x, y, a, b;
        cin >> x >> y >> a >> b;

        if (arr[x] != y) {
            arr[x] = y;
            for (int j = max(1, x - 1); j <= n && j <= x + C; ++j)
                update(j);
            modify(max(1, x - 1), min(n, x + C), 1);
        }

        if (a + 1 == b) {
            cout << "1\n";
            continue;
        }

        ll cur = 0;
        for (int j = a + 1; j < b && j <= a + C; ++j) {
            tmp[j] = lft[j];
            cur += arr[j];
            if (cur > arr[j + 1]) lft[j] = max(lft[j], a + 1);
        }
        modify(a + 1, min(b - 1, a + C), 1);

        int lftb = 0;
        tmp[b] = lft[b], cur = 0;
        for (int j = b; j > a && j > b - C; --j) {
            cur += arr[j];
            if (j == a + 1 || cur > arr[j - 1]) {
                lftb = j;
                break;
            }
        }

        pii one = pll(a - 1, -1);
        pii two = pll(a, 0);
        int rgt = min(b - 1, a + C);
        for (int j = a + 1; j <= rgt; ++j) {
            if (lft[j] - 1 > one.X) one.X = j, one.Y += 2;
            if (lft[j] - 1 > two.X) two.X = j, two.Y += 2;
        }

        if (rgt + 1 <= b - 1) {
            Node res = query(rgt + 1, b - 1, 1);
            if (one.X < rgt + 1 - C - 1) one = one + res.mx[C];
            else one = one + res.mx[rgt + 1 - one.X - 1];
            if (two.X < rgt + 1 - C - 1) two = two + res.mx[C];
            else two = two + res.mx[rgt + 1 - two.X - 1];
        }

        int ans = max(one.Y + 1, two.Y + 1);
        if (lftb - 1 > one.X) one.Y += 2;
        if (lftb - 1 > two.X) two.Y += 2;
        ans = max({ans, one.Y, two.Y});

        for (int j = a + 1; j < b && j <= a + C; ++j)
            lft[j] = tmp[j];
        modify(a + 1, min(b - 1, a + C), 1);

        cout << ans << "\n";
    }
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 261 ms 516900 KB Output is correct
2 Correct 231 ms 516904 KB Output is correct
3 Correct 247 ms 516888 KB Output is correct
4 Correct 240 ms 516892 KB Output is correct
5 Correct 232 ms 516928 KB Output is correct
6 Correct 227 ms 516948 KB Output is correct
7 Correct 229 ms 516912 KB Output is correct
8 Correct 235 ms 516980 KB Output is correct
9 Correct 224 ms 516932 KB Output is correct
10 Correct 228 ms 516976 KB Output is correct
11 Correct 234 ms 517044 KB Output is correct
12 Correct 225 ms 516860 KB Output is correct
13 Correct 228 ms 516936 KB Output is correct
14 Correct 232 ms 516940 KB Output is correct
15 Correct 224 ms 516868 KB Output is correct
16 Correct 232 ms 517016 KB Output is correct
17 Correct 228 ms 516856 KB Output is correct
18 Correct 225 ms 516940 KB Output is correct
19 Correct 228 ms 516928 KB Output is correct
20 Correct 229 ms 516936 KB Output is correct
21 Correct 226 ms 516920 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 261 ms 516900 KB Output is correct
2 Correct 231 ms 516904 KB Output is correct
3 Correct 247 ms 516888 KB Output is correct
4 Correct 240 ms 516892 KB Output is correct
5 Correct 232 ms 516928 KB Output is correct
6 Correct 227 ms 516948 KB Output is correct
7 Correct 229 ms 516912 KB Output is correct
8 Correct 235 ms 516980 KB Output is correct
9 Correct 224 ms 516932 KB Output is correct
10 Correct 228 ms 516976 KB Output is correct
11 Correct 234 ms 517044 KB Output is correct
12 Correct 225 ms 516860 KB Output is correct
13 Correct 228 ms 516936 KB Output is correct
14 Correct 232 ms 516940 KB Output is correct
15 Correct 224 ms 516868 KB Output is correct
16 Correct 232 ms 517016 KB Output is correct
17 Correct 228 ms 516856 KB Output is correct
18 Correct 225 ms 516940 KB Output is correct
19 Correct 228 ms 516928 KB Output is correct
20 Correct 229 ms 516936 KB Output is correct
21 Correct 226 ms 516920 KB Output is correct
22 Correct 247 ms 516872 KB Output is correct
23 Correct 227 ms 516940 KB Output is correct
24 Correct 236 ms 516988 KB Output is correct
25 Correct 233 ms 516888 KB Output is correct
26 Correct 226 ms 516984 KB Output is correct
27 Correct 233 ms 516940 KB Output is correct
28 Correct 237 ms 516992 KB Output is correct
29 Correct 232 ms 516924 KB Output is correct
30 Correct 233 ms 516912 KB Output is correct
31 Correct 227 ms 516944 KB Output is correct
32 Correct 226 ms 516928 KB Output is correct
33 Correct 231 ms 516940 KB Output is correct
34 Correct 229 ms 516956 KB Output is correct
35 Correct 229 ms 516996 KB Output is correct
36 Correct 246 ms 517052 KB Output is correct
37 Correct 227 ms 516980 KB Output is correct
38 Correct 246 ms 516964 KB Output is correct
39 Correct 242 ms 516992 KB Output is correct
40 Correct 242 ms 516924 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 261 ms 516900 KB Output is correct
2 Correct 231 ms 516904 KB Output is correct
3 Correct 247 ms 516888 KB Output is correct
4 Correct 240 ms 516892 KB Output is correct
5 Correct 232 ms 516928 KB Output is correct
6 Correct 227 ms 516948 KB Output is correct
7 Correct 229 ms 516912 KB Output is correct
8 Correct 235 ms 516980 KB Output is correct
9 Correct 224 ms 516932 KB Output is correct
10 Correct 228 ms 516976 KB Output is correct
11 Correct 234 ms 517044 KB Output is correct
12 Correct 225 ms 516860 KB Output is correct
13 Correct 228 ms 516936 KB Output is correct
14 Correct 232 ms 516940 KB Output is correct
15 Correct 224 ms 516868 KB Output is correct
16 Correct 232 ms 517016 KB Output is correct
17 Correct 228 ms 516856 KB Output is correct
18 Correct 225 ms 516940 KB Output is correct
19 Correct 228 ms 516928 KB Output is correct
20 Correct 229 ms 516936 KB Output is correct
21 Correct 226 ms 516920 KB Output is correct
22 Correct 247 ms 516872 KB Output is correct
23 Correct 227 ms 516940 KB Output is correct
24 Correct 236 ms 516988 KB Output is correct
25 Correct 233 ms 516888 KB Output is correct
26 Correct 226 ms 516984 KB Output is correct
27 Correct 233 ms 516940 KB Output is correct
28 Correct 237 ms 516992 KB Output is correct
29 Correct 232 ms 516924 KB Output is correct
30 Correct 233 ms 516912 KB Output is correct
31 Correct 227 ms 516944 KB Output is correct
32 Correct 226 ms 516928 KB Output is correct
33 Correct 231 ms 516940 KB Output is correct
34 Correct 229 ms 516956 KB Output is correct
35 Correct 229 ms 516996 KB Output is correct
36 Correct 246 ms 517052 KB Output is correct
37 Correct 227 ms 516980 KB Output is correct
38 Correct 246 ms 516964 KB Output is correct
39 Correct 242 ms 516992 KB Output is correct
40 Correct 242 ms 516924 KB Output is correct
41 Correct 314 ms 520560 KB Output is correct
42 Correct 325 ms 520972 KB Output is correct
43 Correct 325 ms 520908 KB Output is correct
44 Correct 300 ms 519948 KB Output is correct
45 Correct 320 ms 521200 KB Output is correct
46 Correct 321 ms 520320 KB Output is correct
47 Correct 310 ms 520004 KB Output is correct
48 Correct 319 ms 520620 KB Output is correct
49 Correct 316 ms 520396 KB Output is correct
50 Correct 326 ms 520380 KB Output is correct
51 Correct 334 ms 520416 KB Output is correct
52 Correct 304 ms 520272 KB Output is correct
53 Correct 321 ms 521276 KB Output is correct
54 Correct 316 ms 520284 KB Output is correct
55 Correct 310 ms 520260 KB Output is correct
56 Correct 320 ms 520324 KB Output is correct
57 Correct 316 ms 520264 KB Output is correct
58 Correct 323 ms 520368 KB Output is correct
59 Correct 323 ms 521292 KB Output is correct
60 Correct 321 ms 521304 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 516884 KB Output is correct
2 Correct 2045 ms 521492 KB Output is correct
3 Correct 2859 ms 523556 KB Output is correct
4 Correct 2626 ms 523076 KB Output is correct
5 Correct 2080 ms 523640 KB Output is correct
6 Correct 2750 ms 522876 KB Output is correct
7 Correct 2751 ms 523220 KB Output is correct
8 Correct 2761 ms 522820 KB Output is correct
9 Correct 2962 ms 522768 KB Output is correct
10 Correct 2677 ms 522604 KB Output is correct
11 Correct 2954 ms 524000 KB Output is correct
12 Correct 3087 ms 522860 KB Output is correct
13 Correct 2989 ms 522924 KB Output is correct
14 Correct 3006 ms 522772 KB Output is correct
15 Correct 3202 ms 522752 KB Output is correct
16 Correct 3012 ms 522892 KB Output is correct
17 Correct 1324 ms 523792 KB Output is correct
18 Correct 3068 ms 523604 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 254 ms 516888 KB Output is correct
2 Correct 271 ms 516916 KB Output is correct
3 Correct 3462 ms 521840 KB Output is correct
4 Execution timed out 4091 ms 522368 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 261 ms 516900 KB Output is correct
2 Correct 231 ms 516904 KB Output is correct
3 Correct 247 ms 516888 KB Output is correct
4 Correct 240 ms 516892 KB Output is correct
5 Correct 232 ms 516928 KB Output is correct
6 Correct 227 ms 516948 KB Output is correct
7 Correct 229 ms 516912 KB Output is correct
8 Correct 235 ms 516980 KB Output is correct
9 Correct 224 ms 516932 KB Output is correct
10 Correct 228 ms 516976 KB Output is correct
11 Correct 234 ms 517044 KB Output is correct
12 Correct 225 ms 516860 KB Output is correct
13 Correct 228 ms 516936 KB Output is correct
14 Correct 232 ms 516940 KB Output is correct
15 Correct 224 ms 516868 KB Output is correct
16 Correct 232 ms 517016 KB Output is correct
17 Correct 228 ms 516856 KB Output is correct
18 Correct 225 ms 516940 KB Output is correct
19 Correct 228 ms 516928 KB Output is correct
20 Correct 229 ms 516936 KB Output is correct
21 Correct 226 ms 516920 KB Output is correct
22 Correct 247 ms 516872 KB Output is correct
23 Correct 227 ms 516940 KB Output is correct
24 Correct 236 ms 516988 KB Output is correct
25 Correct 233 ms 516888 KB Output is correct
26 Correct 226 ms 516984 KB Output is correct
27 Correct 233 ms 516940 KB Output is correct
28 Correct 237 ms 516992 KB Output is correct
29 Correct 232 ms 516924 KB Output is correct
30 Correct 233 ms 516912 KB Output is correct
31 Correct 227 ms 516944 KB Output is correct
32 Correct 226 ms 516928 KB Output is correct
33 Correct 231 ms 516940 KB Output is correct
34 Correct 229 ms 516956 KB Output is correct
35 Correct 229 ms 516996 KB Output is correct
36 Correct 246 ms 517052 KB Output is correct
37 Correct 227 ms 516980 KB Output is correct
38 Correct 246 ms 516964 KB Output is correct
39 Correct 242 ms 516992 KB Output is correct
40 Correct 242 ms 516924 KB Output is correct
41 Correct 314 ms 520560 KB Output is correct
42 Correct 325 ms 520972 KB Output is correct
43 Correct 325 ms 520908 KB Output is correct
44 Correct 300 ms 519948 KB Output is correct
45 Correct 320 ms 521200 KB Output is correct
46 Correct 321 ms 520320 KB Output is correct
47 Correct 310 ms 520004 KB Output is correct
48 Correct 319 ms 520620 KB Output is correct
49 Correct 316 ms 520396 KB Output is correct
50 Correct 326 ms 520380 KB Output is correct
51 Correct 334 ms 520416 KB Output is correct
52 Correct 304 ms 520272 KB Output is correct
53 Correct 321 ms 521276 KB Output is correct
54 Correct 316 ms 520284 KB Output is correct
55 Correct 310 ms 520260 KB Output is correct
56 Correct 320 ms 520324 KB Output is correct
57 Correct 316 ms 520264 KB Output is correct
58 Correct 323 ms 520368 KB Output is correct
59 Correct 323 ms 521292 KB Output is correct
60 Correct 321 ms 521304 KB Output is correct
61 Correct 232 ms 516884 KB Output is correct
62 Correct 2045 ms 521492 KB Output is correct
63 Correct 2859 ms 523556 KB Output is correct
64 Correct 2626 ms 523076 KB Output is correct
65 Correct 2080 ms 523640 KB Output is correct
66 Correct 2750 ms 522876 KB Output is correct
67 Correct 2751 ms 523220 KB Output is correct
68 Correct 2761 ms 522820 KB Output is correct
69 Correct 2962 ms 522768 KB Output is correct
70 Correct 2677 ms 522604 KB Output is correct
71 Correct 2954 ms 524000 KB Output is correct
72 Correct 3087 ms 522860 KB Output is correct
73 Correct 2989 ms 522924 KB Output is correct
74 Correct 3006 ms 522772 KB Output is correct
75 Correct 3202 ms 522752 KB Output is correct
76 Correct 3012 ms 522892 KB Output is correct
77 Correct 1324 ms 523792 KB Output is correct
78 Correct 3068 ms 523604 KB Output is correct
79 Correct 254 ms 516888 KB Output is correct
80 Correct 271 ms 516916 KB Output is correct
81 Correct 3462 ms 521840 KB Output is correct
82 Execution timed out 4091 ms 522368 KB Time limit exceeded
83 Halted 0 ms 0 KB -