oj.uz

Submission #950528

# Submission time Handle Problem Language Result Execution time Memory
950528 2024-03-20T11:43:13 Z glebustim Crossing (JOI21_crossing) C++17
26 / 100
 248 ms 20956 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 = 7;
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 14588 KB Output is correct
2 Correct 128 ms 14276 KB Output is correct
3 Correct 140 ms 14328 KB Output is correct
4 Correct 115 ms 14164 KB Output is correct
5 Correct 116 ms 14288 KB Output is correct
6 Correct 111 ms 14256 KB Output is correct
7 Correct 116 ms 14164 KB Output is correct
8 Correct 116 ms 14164 KB Output is correct
9 Correct 128 ms 14288 KB Output is correct
10 Correct 119 ms 14444 KB Output is correct
11 Correct 117 ms 14240 KB Output is correct
12 Correct 118 ms 14340 KB Output is correct
13 Correct 120 ms 14212 KB Output is correct
14 Correct 117 ms 14272 KB Output is correct
15 Correct 120 ms 14416 KB Output is correct
16 Correct 118 ms 14224 KB Output is correct
17 Correct 130 ms 14280 KB Output is correct
18 Correct 138 ms 14284 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 14588 KB Output is correct
2 Correct 128 ms 14276 KB Output is correct
3 Correct 140 ms 14328 KB Output is correct
4 Correct 115 ms 14164 KB Output is correct
5 Correct 116 ms 14288 KB Output is correct
6 Correct 111 ms 14256 KB Output is correct
7 Correct 116 ms 14164 KB Output is correct
8 Correct 116 ms 14164 KB Output is correct
9 Correct 128 ms 14288 KB Output is correct
10 Correct 119 ms 14444 KB Output is correct
11 Correct 117 ms 14240 KB Output is correct
12 Correct 118 ms 14340 KB Output is correct
13 Correct 120 ms 14212 KB Output is correct
14 Correct 117 ms 14272 KB Output is correct
15 Correct 120 ms 14416 KB Output is correct
16 Correct 118 ms 14224 KB Output is correct
17 Correct 130 ms 14280 KB Output is correct
18 Correct 138 ms 14284 KB Output is correct
19 Correct 228 ms 17712 KB Output is correct
20 Correct 248 ms 20476 KB Output is correct
21 Correct 151 ms 20212 KB Output is correct
22 Correct 152 ms 19740 KB Output is correct
23 Correct 135 ms 16684 KB Output is correct
24 Correct 134 ms 16820 KB Output is correct
25 Correct 171 ms 20956 KB Output is correct
26 Correct 217 ms 20704 KB Output is correct
27 Correct 187 ms 20700 KB Output is correct
28 Correct 198 ms 20656 KB Output is correct
29 Correct 183 ms 20516 KB Output is correct
30 Correct 148 ms 16788 KB Output is correct
31 Correct 192 ms 20588 KB Output is correct
32 Correct 173 ms 20188 KB Output is correct
33 Correct 136 ms 16724 KB Output is correct
34 Correct 211 ms 20700 KB Output is correct
35 Correct 143 ms 19424 KB Output is correct
36 Correct 134 ms 16720 KB Output is correct
37 Correct 143 ms 16976 KB Output is correct
38 Correct 219 ms 20444 KB Output is correct
39 Correct 134 ms 20616 KB Output is correct
40 Incorrect 151 ms 19424 KB Output isn't correct
41 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 14588 KB Output is correct
2 Correct 128 ms 14276 KB Output is correct
3 Correct 140 ms 14328 KB Output is correct
4 Correct 115 ms 14164 KB Output is correct
5 Correct 116 ms 14288 KB Output is correct
6 Correct 111 ms 14256 KB Output is correct
7 Correct 116 ms 14164 KB Output is correct
8 Correct 116 ms 14164 KB Output is correct
9 Correct 128 ms 14288 KB Output is correct
10 Correct 119 ms 14444 KB Output is correct
11 Correct 117 ms 14240 KB Output is correct
12 Correct 118 ms 14340 KB Output is correct
13 Correct 120 ms 14212 KB Output is correct
14 Correct 117 ms 14272 KB Output is correct
15 Correct 120 ms 14416 KB Output is correct
16 Correct 118 ms 14224 KB Output is correct
17 Correct 130 ms 14280 KB Output is correct
18 Correct 138 ms 14284 KB Output is correct
19 Correct 123 ms 14164 KB Output is correct
20 Correct 135 ms 14272 KB Output is correct
21 Correct 138 ms 14288 KB Output is correct
22 Correct 108 ms 14108 KB Output is correct
23 Correct 120 ms 14168 KB Output is correct
24 Correct 116 ms 14164 KB Output is correct
25 Correct 121 ms 14340 KB Output is correct
26 Correct 114 ms 14332 KB Output is correct
27 Correct 119 ms 14164 KB Output is correct
28 Correct 109 ms 14188 KB Output is correct
29 Correct 119 ms 14164 KB Output is correct
30 Correct 111 ms 14192 KB Output is correct
31 Correct 122 ms 14268 KB Output is correct
32 Correct 121 ms 14192 KB Output is correct
33 Correct 123 ms 14164 KB Output is correct
34 Correct 123 ms 14268 KB Output is correct
35 Correct 125 ms 14436 KB Output is correct
36 Correct 121 ms 14168 KB Output is correct
37 Correct 122 ms 14404 KB Output is correct
38 Correct 128 ms 14400 KB Output is correct
39 Correct 122 ms 14168 KB Output is correct
40 Correct 124 ms 14168 KB Output is correct
41 Correct 123 ms 14160 KB Output is correct
42 Correct 128 ms 14544 KB Output is correct
43 Correct 121 ms 14292 KB Output is correct
44 Correct 125 ms 14160 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 14588 KB Output is correct
2 Correct 128 ms 14276 KB Output is correct
3 Correct 140 ms 14328 KB Output is correct
4 Correct 115 ms 14164 KB Output is correct
5 Correct 116 ms 14288 KB Output is correct
6 Correct 111 ms 14256 KB Output is correct
7 Correct 116 ms 14164 KB Output is correct
8 Correct 116 ms 14164 KB Output is correct
9 Correct 128 ms 14288 KB Output is correct
10 Correct 119 ms 14444 KB Output is correct
11 Correct 117 ms 14240 KB Output is correct
12 Correct 118 ms 14340 KB Output is correct
13 Correct 120 ms 14212 KB Output is correct
14 Correct 117 ms 14272 KB Output is correct
15 Correct 120 ms 14416 KB Output is correct
16 Correct 118 ms 14224 KB Output is correct
17 Correct 130 ms 14280 KB Output is correct
18 Correct 138 ms 14284 KB Output is correct
19 Correct 228 ms 17712 KB Output is correct
20 Correct 248 ms 20476 KB Output is correct
21 Correct 151 ms 20212 KB Output is correct
22 Correct 152 ms 19740 KB Output is correct
23 Correct 135 ms 16684 KB Output is correct
24 Correct 134 ms 16820 KB Output is correct
25 Correct 171 ms 20956 KB Output is correct
26 Correct 217 ms 20704 KB Output is correct
27 Correct 187 ms 20700 KB Output is correct
28 Correct 198 ms 20656 KB Output is correct
29 Correct 183 ms 20516 KB Output is correct
30 Correct 148 ms 16788 KB Output is correct
31 Correct 192 ms 20588 KB Output is correct
32 Correct 173 ms 20188 KB Output is correct
33 Correct 136 ms 16724 KB Output is correct
34 Correct 211 ms 20700 KB Output is correct
35 Correct 143 ms 19424 KB Output is correct
36 Correct 134 ms 16720 KB Output is correct
37 Correct 143 ms 16976 KB Output is correct
38 Correct 219 ms 20444 KB Output is correct
39 Correct 134 ms 20616 KB Output is correct
40 Incorrect 151 ms 19424 KB Output isn't correct
41 Halted 0 ms 0 KB -