oj.uz

Submission #950531

# Submission time Handle Problem Language Result Execution time Memory
950531 2024-03-20T11:44:13 Z glebustim Crossing (JOI21_crossing) C++17
100 / 100
 268 ms 21212 KB 
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;

#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
using oset = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;

struct node {
    ll h = 0;
    int push = -1;
};

const ll MOD = 1e18 + 3, P = 13;
const int R = (1 << 18);
const vector<array<int, 3>> o = {{0, 0, 1}, {0, 1, 0}, {1, 0, 0}, {0, 2, 2}, {2, 0, 2}, {2, 2, 0}, {1, 1, 2}, {1, 2, 1}, {2, 1, 1}};
vector<ll> pw(R + 1), pr(R + 1);
vector<node> t(R * 2);
int n;
vi A, B, C;
unordered_set<ll> ps;

void all_combs() {
    for (auto x: o) {
        ll h = 0;
        for (int i = 0; i < n; ++i) {
            int y = (A[i] * x[0] + B[i] * x[1] + C[i] * x[2]) % 3;
            h = ((__int128)h * P + y + 1) % MOD;
        }
        ps.insert((__int128)h * pw[R - n] % MOD);
    }
}

void push(int v, int len) {
    if (t[v].push != -1) {
        t[v << 1].h = (__int128)pr[len - 1] * (t[v].push + 1) % MOD;
        t[v << 1].push = t[v].push;
        t[(v << 1) ^ 1].h = (__int128)pr[len - 1] * (t[v].push + 1) % MOD;
        t[(v << 1) ^ 1].push = t[v].push;
        t[v].push = -1;
    }
}

void update(int ql, int qr, int x, int v = 1, int l = 0, int r = R) {
    if (ql >= r || l >= qr)
        return;
    if (ql <= l && r <= qr) {
        t[v].h = (__int128)pr[r - l - 1] * (x + 1) % MOD;
        t[v].push = x;
        return;
    }
    int m = (l + r) / 2;
    push(v, m - l);
    update(ql, qr, x, (v << 1), l, m);
    update(ql, qr, x, ((v << 1) ^ 1), m, r);
    t[v].h = ((__int128)t[v << 1].h * pw[m - l] + t[(v << 1) ^ 1].h) % MOD;
}

int get_num(char c) {
    if (c == 'J')
        return 0;
    else if (c == 'O')
        return 1;
    else
        return 2;
}

void check_string() {
    if (ps.find(t[1].h) != ps.end())
        cout << "Yes\n";
    else
        cout << "No\n";
}

int main() {
    fast;
    pw[0] = 1;
    pr[0] = 1;
    for (int i = 1; i <= R; ++i) {
        pw[i] = (__int128)pw[i - 1] * P % MOD;
        pr[i] = (pr[i - 1] + pw[i]) % MOD;
    }
    cin >> n;
    A.resize(n);
    B.resize(n);
    C.resize(n);
    string s;
    cin >> s;
    for (int i = 0; i < n; ++i)
        A[i] = get_num(s[i]);
    cin >> s;
    for (int i = 0; i < n; ++i)
        B[i] = get_num(s[i]);
    cin >> s;
    for (int i = 0; i < n; ++i)
        C[i] = get_num(s[i]);
    all_combs();
    int q;
    cin >> q >> s;
    for (int i = 0; i < n; ++i)
        t[R + i].h = get_num(s[i]) + 1;
    vi len(R);
    len[0] = R;
    for (int i = 1; i < R; ++i)
        len[i] = len[i >> 1] / 2;
    for (int i = R - 1; i > 0; --i)
        t[i].h = ((__int128)t[i << 1].h * pw[len[i]] + t[(i << 1) ^ 1].h) % MOD;
    check_string();
    while (q--) {
        int l, r;
        char c;
        cin >> l >> r >> c;
        --l;
        update(l, r, get_num(c));
        check_string();
    }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 14212 KB Output is correct
2 Correct 132 ms 14408 KB Output is correct
3 Correct 136 ms 14196 KB Output is correct
4 Correct 116 ms 14164 KB Output is correct
5 Correct 117 ms 14176 KB Output is correct
6 Correct 121 ms 14164 KB Output is correct
7 Correct 125 ms 14328 KB Output is correct
8 Correct 118 ms 14336 KB Output is correct
9 Correct 126 ms 14268 KB Output is correct
10 Correct 124 ms 14176 KB Output is correct
11 Correct 127 ms 14372 KB Output is correct
12 Correct 117 ms 14408 KB Output is correct
13 Correct 133 ms 14352 KB Output is correct
14 Correct 117 ms 14388 KB Output is correct
15 Correct 132 ms 14160 KB Output is correct
16 Correct 124 ms 14232 KB Output is correct
17 Correct 125 ms 14372 KB Output is correct
18 Correct 126 ms 14420 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 14212 KB Output is correct
2 Correct 132 ms 14408 KB Output is correct
3 Correct 136 ms 14196 KB Output is correct
4 Correct 116 ms 14164 KB Output is correct
5 Correct 117 ms 14176 KB Output is correct
6 Correct 121 ms 14164 KB Output is correct
7 Correct 125 ms 14328 KB Output is correct
8 Correct 118 ms 14336 KB Output is correct
9 Correct 126 ms 14268 KB Output is correct
10 Correct 124 ms 14176 KB Output is correct
11 Correct 127 ms 14372 KB Output is correct
12 Correct 117 ms 14408 KB Output is correct
13 Correct 133 ms 14352 KB Output is correct
14 Correct 117 ms 14388 KB Output is correct
15 Correct 132 ms 14160 KB Output is correct
16 Correct 124 ms 14232 KB Output is correct
17 Correct 125 ms 14372 KB Output is correct
18 Correct 126 ms 14420 KB Output is correct
19 Correct 230 ms 16920 KB Output is correct
20 Correct 254 ms 16848 KB Output is correct
21 Correct 168 ms 16856 KB Output is correct
22 Correct 167 ms 16508 KB Output is correct
23 Correct 153 ms 14460 KB Output is correct
24 Correct 137 ms 14512 KB Output is correct
25 Correct 161 ms 16864 KB Output is correct
26 Correct 178 ms 17132 KB Output is correct
27 Correct 186 ms 16860 KB Output is correct
28 Correct 184 ms 17068 KB Output is correct
29 Correct 185 ms 16972 KB Output is correct
30 Correct 144 ms 14340 KB Output is correct
31 Correct 184 ms 16864 KB Output is correct
32 Correct 183 ms 16952 KB Output is correct
33 Correct 136 ms 14508 KB Output is correct
34 Correct 180 ms 17028 KB Output is correct
35 Correct 160 ms 16608 KB Output is correct
36 Correct 135 ms 14420 KB Output is correct
37 Correct 136 ms 14344 KB Output is correct
38 Correct 228 ms 17252 KB Output is correct
39 Correct 132 ms 16964 KB Output is correct
40 Correct 171 ms 16112 KB Output is correct
41 Correct 254 ms 21212 KB Output is correct
42 Correct 107 ms 20188 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 14212 KB Output is correct
2 Correct 132 ms 14408 KB Output is correct
3 Correct 136 ms 14196 KB Output is correct
4 Correct 116 ms 14164 KB Output is correct
5 Correct 117 ms 14176 KB Output is correct
6 Correct 121 ms 14164 KB Output is correct
7 Correct 125 ms 14328 KB Output is correct
8 Correct 118 ms 14336 KB Output is correct
9 Correct 126 ms 14268 KB Output is correct
10 Correct 124 ms 14176 KB Output is correct
11 Correct 127 ms 14372 KB Output is correct
12 Correct 117 ms 14408 KB Output is correct
13 Correct 133 ms 14352 KB Output is correct
14 Correct 117 ms 14388 KB Output is correct
15 Correct 132 ms 14160 KB Output is correct
16 Correct 124 ms 14232 KB Output is correct
17 Correct 125 ms 14372 KB Output is correct
18 Correct 126 ms 14420 KB Output is correct
19 Correct 123 ms 14284 KB Output is correct
20 Correct 132 ms 14352 KB Output is correct
21 Correct 131 ms 14160 KB Output is correct
22 Correct 111 ms 14164 KB Output is correct
23 Correct 119 ms 14160 KB Output is correct
24 Correct 117 ms 14636 KB Output is correct
25 Correct 120 ms 14160 KB Output is correct
26 Correct 116 ms 14256 KB Output is correct
27 Correct 120 ms 14312 KB Output is correct
28 Correct 109 ms 14156 KB Output is correct
29 Correct 119 ms 14164 KB Output is correct
30 Correct 110 ms 14160 KB Output is correct
31 Correct 140 ms 14252 KB Output is correct
32 Correct 122 ms 14320 KB Output is correct
33 Correct 127 ms 14356 KB Output is correct
34 Correct 114 ms 14148 KB Output is correct
35 Correct 125 ms 14308 KB Output is correct
36 Correct 123 ms 14392 KB Output is correct
37 Correct 136 ms 14336 KB Output is correct
38 Correct 129 ms 14344 KB Output is correct
39 Correct 123 ms 14184 KB Output is correct
40 Correct 123 ms 14412 KB Output is correct
41 Correct 123 ms 14432 KB Output is correct
42 Correct 124 ms 14392 KB Output is correct
43 Correct 121 ms 14152 KB Output is correct
44 Correct 122 ms 14164 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 14212 KB Output is correct
2 Correct 132 ms 14408 KB Output is correct
3 Correct 136 ms 14196 KB Output is correct
4 Correct 116 ms 14164 KB Output is correct
5 Correct 117 ms 14176 KB Output is correct
6 Correct 121 ms 14164 KB Output is correct
7 Correct 125 ms 14328 KB Output is correct
8 Correct 118 ms 14336 KB Output is correct
9 Correct 126 ms 14268 KB Output is correct
10 Correct 124 ms 14176 KB Output is correct
11 Correct 127 ms 14372 KB Output is correct
12 Correct 117 ms 14408 KB Output is correct
13 Correct 133 ms 14352 KB Output is correct
14 Correct 117 ms 14388 KB Output is correct
15 Correct 132 ms 14160 KB Output is correct
16 Correct 124 ms 14232 KB Output is correct
17 Correct 125 ms 14372 KB Output is correct
18 Correct 126 ms 14420 KB Output is correct
19 Correct 230 ms 16920 KB Output is correct
20 Correct 254 ms 16848 KB Output is correct
21 Correct 168 ms 16856 KB Output is correct
22 Correct 167 ms 16508 KB Output is correct
23 Correct 153 ms 14460 KB Output is correct
24 Correct 137 ms 14512 KB Output is correct
25 Correct 161 ms 16864 KB Output is correct
26 Correct 178 ms 17132 KB Output is correct
27 Correct 186 ms 16860 KB Output is correct
28 Correct 184 ms 17068 KB Output is correct
29 Correct 185 ms 16972 KB Output is correct
30 Correct 144 ms 14340 KB Output is correct
31 Correct 184 ms 16864 KB Output is correct
32 Correct 183 ms 16952 KB Output is correct
33 Correct 136 ms 14508 KB Output is correct
34 Correct 180 ms 17028 KB Output is correct
35 Correct 160 ms 16608 KB Output is correct
36 Correct 135 ms 14420 KB Output is correct
37 Correct 136 ms 14344 KB Output is correct
38 Correct 228 ms 17252 KB Output is correct
39 Correct 132 ms 16964 KB Output is correct
40 Correct 171 ms 16112 KB Output is correct
41 Correct 254 ms 21212 KB Output is correct
42 Correct 107 ms 20188 KB Output is correct
43 Correct 123 ms 14284 KB Output is correct
44 Correct 132 ms 14352 KB Output is correct
45 Correct 131 ms 14160 KB Output is correct
46 Correct 111 ms 14164 KB Output is correct
47 Correct 119 ms 14160 KB Output is correct
48 Correct 117 ms 14636 KB Output is correct
49 Correct 120 ms 14160 KB Output is correct
50 Correct 116 ms 14256 KB Output is correct
51 Correct 120 ms 14312 KB Output is correct
52 Correct 109 ms 14156 KB Output is correct
53 Correct 119 ms 14164 KB Output is correct
54 Correct 110 ms 14160 KB Output is correct
55 Correct 140 ms 14252 KB Output is correct
56 Correct 122 ms 14320 KB Output is correct
57 Correct 127 ms 14356 KB Output is correct
58 Correct 114 ms 14148 KB Output is correct
59 Correct 125 ms 14308 KB Output is correct
60 Correct 123 ms 14392 KB Output is correct
61 Correct 136 ms 14336 KB Output is correct
62 Correct 129 ms 14344 KB Output is correct
63 Correct 123 ms 14184 KB Output is correct
64 Correct 123 ms 14412 KB Output is correct
65 Correct 123 ms 14432 KB Output is correct
66 Correct 124 ms 14392 KB Output is correct
67 Correct 121 ms 14152 KB Output is correct
68 Correct 122 ms 14164 KB Output is correct
69 Correct 203 ms 19960 KB Output is correct
70 Correct 268 ms 20444 KB Output is correct
71 Correct 136 ms 16720 KB Output is correct
72 Correct 139 ms 17184 KB Output is correct
73 Correct 158 ms 16748 KB Output is correct
74 Correct 149 ms 19680 KB Output is correct
75 Correct 138 ms 16880 KB Output is correct
76 Correct 161 ms 20624 KB Output is correct
77 Correct 161 ms 19936 KB Output is correct
78 Correct 137 ms 16724 KB Output is correct
79 Correct 135 ms 16720 KB Output is correct
80 Correct 163 ms 19424 KB Output is correct
81 Correct 139 ms 16724 KB Output is correct
82 Correct 163 ms 20696 KB Output is correct
83 Correct 175 ms 20396 KB Output is correct
84 Correct 143 ms 16868 KB Output is correct
85 Correct 143 ms 16888 KB Output is correct
86 Correct 209 ms 19692 KB Output is correct
87 Correct 190 ms 20600 KB Output is correct
88 Correct 150 ms 16808 KB Output is correct
89 Correct 185 ms 20040 KB Output is correct
90 Correct 186 ms 20672 KB Output is correct
91 Correct 146 ms 16720 KB Output is correct
92 Correct 154 ms 19736 KB Output is correct
93 Correct 145 ms 16716 KB Output is correct
94 Correct 143 ms 16884 KB Output is correct
95 Correct 140 ms 16884 KB Output is correct
96 Correct 222 ms 20704 KB Output is correct
97 Correct 151 ms 20700 KB Output is correct
98 Correct 157 ms 19424 KB Output is correct
99 Correct 263 ms 20988 KB Output is correct
100 Correct 116 ms 19972 KB Output is correct