oj.uz

답안 #951672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951672 2024-03-22T09:33:37 Z arbuzick Crossing (JOI21_crossing) C++17
100 / 100
 434 ms 15948 KB 
#include <bits/stdc++.h>

using namespace std;

constexpr int mod = 1e9 + 7, base = 5;

constexpr int R = 1 << 18;

int pw[R * 2], pr_sum[R * 2 + 1];

int val[R * 2], psh[R * 2];

void build() {
    pw[0] = 1;
    for (int i = 1; i < R * 2; ++i) {
        pw[i] = pw[i - 1] * 1LL * base % mod;
    }
    pr_sum[0] = 0;
    for (int i = 0; i < R * 2; ++i) {
        pr_sum[i + 1] = (pr_sum[i] + pw[i]) % mod;
    }
    for (int i = 1; i < R * 2; ++i) {
        psh[i] = -1;
    }
}

void push(int node, int nl, int nm, int nr) {
    if (psh[node] != -1) {
        val[node * 2] = pr_sum[nm - nl] * 1LL * psh[node] % mod;
        psh[node * 2] = psh[node];
        val[node * 2 + 1] = pr_sum[nr - nm] * 1LL * psh[node] % mod;
        psh[node * 2 + 1] = psh[node];
    }
    psh[node] = -1;
}

void assign(int ql, int qr, int vl, int node = 1, int nl = 0, int nr = R) {
    if (ql <= nl && nr <= qr) {
        val[node] = pr_sum[nr - nl] * 1LL * vl % mod;
        psh[node] = vl;
        return;
    }
    if (qr <= nl || nr <= ql) {
        return;
    }
    int nm = (nl + nr) / 2;
    push(node, nl, nm, nr);
    assign(ql, qr, vl, node * 2, nl, nm);
    assign(ql, qr, vl, node * 2 + 1, nm, nr);
    val[node] = (val[node * 2] * 1LL * pw[nr - nm] + val[node * 2 + 1]) % mod;
}

int get(int ql, int qr, int node = 1, int nl = 0, int nr = R) {
    if (ql <= nl && nr <= qr) {
        return val[node];
    }
    if (qr <= nl || nr <= ql) {
        return 0;
    }
    int nm = (nl + nr) / 2;
    push(node, nl, nm, nr);
    int hash1 = get(ql, qr, node * 2, nl, nm), hash2 = get(ql, qr, node * 2 + 1, nm, nr);
    val[node] = (val[node * 2] * 1LL * pw[nr - nm] + val[node * 2 + 1]) % mod;
    int len2 = max(0, min(nr, qr) - max(nm, ql));
    return (hash1 * 1LL * pw[len2] + hash2) % mod;
}

void solve() {
    build();
    int n;
    cin >> n;
    string a, b, c;
    cin >> a >> b >> c;
    map<char, int> vl;
    vl['J'] = 1;
    vl['O'] = 2;
    vl['I'] = 3;
    auto cross = [&](string a, string b) {
        string c = "";
        for (int i = 0; i < n; ++i) {
            if (a[i] == b[i]) {
                c += a[i];
            } else {
                if (a[i] != 'J' && b[i] != 'J') {
                    c += 'J';
                } else if (a[i] != 'O' && b[i] != 'O') {
                    c += 'O';
                } else {
                    c += 'I';
                }
            }
        }
        return c;
    };
    auto get_hash = [&](string a) {
        int ans = 0;
        for (int i = 0; i < n; ++i) {
            ans = (ans * 1LL * base + vl[a[i]]) % mod;
        }
        return ans;
    };
    vector<string> nw = {a, b, c};
    set<int> used;
    used.insert(get_hash(a));
    used.insert(get_hash(b));
    used.insert(get_hash(c));
    for (int i = 0; i < (int)nw.size(); ++i) {
        for (int j = 0; j < i; ++j) {
            string add = cross(nw[i], nw[j]);
            int hash_nw = get_hash(add);
            if (!used.count(hash_nw)) {
                used.insert(hash_nw);
                nw.push_back(add);
            }
        }
    }
    int q;
    cin >> q;
    string t;
    cin >> t;
    for (int i = 0; i < n; ++i) {
        assign(i, i + 1, vl[t[i]]);
    }
    if (used.count(get(0, n))) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }
    while (q--) {
        int l, r;
        char ch;
        cin >> l >> r >> ch;
        l--;
        assign(l, r, vl[ch]);
        if (used.count(get(0, n))) {
            cout << "Yes\n";
        } else {
            cout << "No\n";
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 9056 KB Output is correct
2 Correct 158 ms 9268 KB Output is correct
3 Correct 141 ms 9044 KB Output is correct
4 Correct 136 ms 9224 KB Output is correct
5 Correct 135 ms 9044 KB Output is correct
6 Correct 141 ms 9192 KB Output is correct
7 Correct 142 ms 9168 KB Output is correct
8 Correct 132 ms 9040 KB Output is correct
9 Correct 133 ms 9244 KB Output is correct
10 Correct 131 ms 9040 KB Output is correct
11 Correct 137 ms 10576 KB Output is correct
12 Correct 149 ms 10632 KB Output is correct
13 Correct 139 ms 10644 KB Output is correct
14 Correct 135 ms 10704 KB Output is correct
15 Correct 135 ms 10748 KB Output is correct
16 Correct 134 ms 10576 KB Output is correct
17 Correct 136 ms 10712 KB Output is correct
18 Correct 142 ms 10572 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 9056 KB Output is correct
2 Correct 158 ms 9268 KB Output is correct
3 Correct 141 ms 9044 KB Output is correct
4 Correct 136 ms 9224 KB Output is correct
5 Correct 135 ms 9044 KB Output is correct
6 Correct 141 ms 9192 KB Output is correct
7 Correct 142 ms 9168 KB Output is correct
8 Correct 132 ms 9040 KB Output is correct
9 Correct 133 ms 9244 KB Output is correct
10 Correct 131 ms 9040 KB Output is correct
11 Correct 137 ms 10576 KB Output is correct
12 Correct 149 ms 10632 KB Output is correct
13 Correct 139 ms 10644 KB Output is correct
14 Correct 135 ms 10704 KB Output is correct
15 Correct 135 ms 10748 KB Output is correct
16 Correct 134 ms 10576 KB Output is correct
17 Correct 136 ms 10712 KB Output is correct
18 Correct 142 ms 10572 KB Output is correct
19 Correct 275 ms 14504 KB Output is correct
20 Correct 277 ms 14400 KB Output is correct
21 Correct 233 ms 14244 KB Output is correct
22 Correct 215 ms 14176 KB Output is correct
23 Correct 158 ms 11636 KB Output is correct
24 Correct 157 ms 11676 KB Output is correct
25 Correct 216 ms 14568 KB Output is correct
26 Correct 222 ms 14716 KB Output is correct
27 Correct 230 ms 14716 KB Output is correct
28 Correct 231 ms 14772 KB Output is correct
29 Correct 257 ms 14608 KB Output is correct
30 Correct 163 ms 11652 KB Output is correct
31 Correct 229 ms 14512 KB Output is correct
32 Correct 230 ms 14272 KB Output is correct
33 Correct 159 ms 11600 KB Output is correct
34 Correct 232 ms 14608 KB Output is correct
35 Correct 199 ms 13560 KB Output is correct
36 Correct 185 ms 11496 KB Output is correct
37 Correct 145 ms 11604 KB Output is correct
38 Correct 254 ms 14264 KB Output is correct
39 Correct 210 ms 14588 KB Output is correct
40 Correct 167 ms 13780 KB Output is correct
41 Correct 297 ms 14904 KB Output is correct
42 Correct 164 ms 14248 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 9056 KB Output is correct
2 Correct 158 ms 9268 KB Output is correct
3 Correct 141 ms 9044 KB Output is correct
4 Correct 136 ms 9224 KB Output is correct
5 Correct 135 ms 9044 KB Output is correct
6 Correct 141 ms 9192 KB Output is correct
7 Correct 142 ms 9168 KB Output is correct
8 Correct 132 ms 9040 KB Output is correct
9 Correct 133 ms 9244 KB Output is correct
10 Correct 131 ms 9040 KB Output is correct
11 Correct 137 ms 10576 KB Output is correct
12 Correct 149 ms 10632 KB Output is correct
13 Correct 139 ms 10644 KB Output is correct
14 Correct 135 ms 10704 KB Output is correct
15 Correct 135 ms 10748 KB Output is correct
16 Correct 134 ms 10576 KB Output is correct
17 Correct 136 ms 10712 KB Output is correct
18 Correct 142 ms 10572 KB Output is correct
19 Correct 137 ms 10576 KB Output is correct
20 Correct 146 ms 10576 KB Output is correct
21 Correct 151 ms 10756 KB Output is correct
22 Correct 129 ms 10544 KB Output is correct
23 Correct 133 ms 10684 KB Output is correct
24 Correct 143 ms 10716 KB Output is correct
25 Correct 136 ms 10716 KB Output is correct
26 Correct 137 ms 10620 KB Output is correct
27 Correct 133 ms 10580 KB Output is correct
28 Correct 141 ms 10544 KB Output is correct
29 Correct 137 ms 10576 KB Output is correct
30 Correct 139 ms 10580 KB Output is correct
31 Correct 141 ms 10668 KB Output is correct
32 Correct 139 ms 10736 KB Output is correct
33 Correct 136 ms 10576 KB Output is correct
34 Correct 127 ms 10504 KB Output is correct
35 Correct 150 ms 10732 KB Output is correct
36 Correct 153 ms 10572 KB Output is correct
37 Correct 141 ms 10764 KB Output is correct
38 Correct 138 ms 10580 KB Output is correct
39 Correct 135 ms 10580 KB Output is correct
40 Correct 138 ms 10568 KB Output is correct
41 Correct 137 ms 10628 KB Output is correct
42 Correct 138 ms 10580 KB Output is correct
43 Correct 142 ms 10540 KB Output is correct
44 Correct 141 ms 10708 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 9056 KB Output is correct
2 Correct 158 ms 9268 KB Output is correct
3 Correct 141 ms 9044 KB Output is correct
4 Correct 136 ms 9224 KB Output is correct
5 Correct 135 ms 9044 KB Output is correct
6 Correct 141 ms 9192 KB Output is correct
7 Correct 142 ms 9168 KB Output is correct
8 Correct 132 ms 9040 KB Output is correct
9 Correct 133 ms 9244 KB Output is correct
10 Correct 131 ms 9040 KB Output is correct
11 Correct 137 ms 10576 KB Output is correct
12 Correct 149 ms 10632 KB Output is correct
13 Correct 139 ms 10644 KB Output is correct
14 Correct 135 ms 10704 KB Output is correct
15 Correct 135 ms 10748 KB Output is correct
16 Correct 134 ms 10576 KB Output is correct
17 Correct 136 ms 10712 KB Output is correct
18 Correct 142 ms 10572 KB Output is correct
19 Correct 275 ms 14504 KB Output is correct
20 Correct 277 ms 14400 KB Output is correct
21 Correct 233 ms 14244 KB Output is correct
22 Correct 215 ms 14176 KB Output is correct
23 Correct 158 ms 11636 KB Output is correct
24 Correct 157 ms 11676 KB Output is correct
25 Correct 216 ms 14568 KB Output is correct
26 Correct 222 ms 14716 KB Output is correct
27 Correct 230 ms 14716 KB Output is correct
28 Correct 231 ms 14772 KB Output is correct
29 Correct 257 ms 14608 KB Output is correct
30 Correct 163 ms 11652 KB Output is correct
31 Correct 229 ms 14512 KB Output is correct
32 Correct 230 ms 14272 KB Output is correct
33 Correct 159 ms 11600 KB Output is correct
34 Correct 232 ms 14608 KB Output is correct
35 Correct 199 ms 13560 KB Output is correct
36 Correct 185 ms 11496 KB Output is correct
37 Correct 145 ms 11604 KB Output is correct
38 Correct 254 ms 14264 KB Output is correct
39 Correct 210 ms 14588 KB Output is correct
40 Correct 167 ms 13780 KB Output is correct
41 Correct 297 ms 14904 KB Output is correct
42 Correct 164 ms 14248 KB Output is correct
43 Correct 137 ms 10576 KB Output is correct
44 Correct 146 ms 10576 KB Output is correct
45 Correct 151 ms 10756 KB Output is correct
46 Correct 129 ms 10544 KB Output is correct
47 Correct 133 ms 10684 KB Output is correct
48 Correct 143 ms 10716 KB Output is correct
49 Correct 136 ms 10716 KB Output is correct
50 Correct 137 ms 10620 KB Output is correct
51 Correct 133 ms 10580 KB Output is correct
52 Correct 141 ms 10544 KB Output is correct
53 Correct 137 ms 10576 KB Output is correct
54 Correct 139 ms 10580 KB Output is correct
55 Correct 141 ms 10668 KB Output is correct
56 Correct 139 ms 10736 KB Output is correct
57 Correct 136 ms 10576 KB Output is correct
58 Correct 127 ms 10504 KB Output is correct
59 Correct 150 ms 10732 KB Output is correct
60 Correct 153 ms 10572 KB Output is correct
61 Correct 141 ms 10764 KB Output is correct
62 Correct 138 ms 10580 KB Output is correct
63 Correct 135 ms 10580 KB Output is correct
64 Correct 138 ms 10568 KB Output is correct
65 Correct 137 ms 10628 KB Output is correct
66 Correct 138 ms 10580 KB Output is correct
67 Correct 142 ms 10540 KB Output is correct
68 Correct 141 ms 10708 KB Output is correct
69 Correct 364 ms 14736 KB Output is correct
70 Correct 434 ms 15648 KB Output is correct
71 Correct 157 ms 11600 KB Output is correct
72 Correct 149 ms 11588 KB Output is correct
73 Correct 157 ms 11604 KB Output is correct
74 Correct 211 ms 14072 KB Output is correct
75 Correct 171 ms 11456 KB Output is correct
76 Correct 220 ms 14684 KB Output is correct
77 Correct 241 ms 14016 KB Output is correct
78 Correct 147 ms 11692 KB Output is correct
79 Correct 194 ms 11604 KB Output is correct
80 Correct 297 ms 14388 KB Output is correct
81 Correct 198 ms 11524 KB Output is correct
82 Correct 349 ms 15632 KB Output is correct
83 Correct 359 ms 15468 KB Output is correct
84 Correct 165 ms 11608 KB Output is correct
85 Correct 162 ms 11748 KB Output is correct
86 Correct 288 ms 14532 KB Output is correct
87 Correct 313 ms 15588 KB Output is correct
88 Correct 172 ms 11852 KB Output is correct
89 Correct 279 ms 15148 KB Output is correct
90 Correct 313 ms 15620 KB Output is correct
91 Correct 160 ms 11600 KB Output is correct
92 Correct 300 ms 14556 KB Output is correct
93 Correct 164 ms 11724 KB Output is correct
94 Correct 175 ms 11640 KB Output is correct
95 Correct 159 ms 11604 KB Output is correct
96 Correct 250 ms 14288 KB Output is correct
97 Correct 289 ms 15612 KB Output is correct
98 Correct 247 ms 14420 KB Output is correct
99 Correct 390 ms 15948 KB Output is correct
100 Correct 290 ms 15208 KB Output is correct