oj.uz

Submission #861417

# Submission time Handle Problem Language Result Execution time Memory
861417 2023-10-16T06:42:01 Z vjudge1 Crossing (JOI21_crossing) C++17
100 / 100
 218 ms 17844 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define F
#define S second
#define endl '\n'
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mod = 1e9 + 13, base = 23;
const int N =  1e6 + 15;
const ll inf = 1e18;
const int off = (1 << 18);
vector<int> s[3];
int T[N];
char str[N];
int n, Q;
struct Sgt {
#define ls (idx<<1)
#define rs (idx<<1|1)
    struct data {
        int pws, val, tag;
        data() : pws(0), val(0), tag(-1) {}
    } t[off * 2];
    void pull(int idx) {
        t[idx].pws = (t[ls].pws + t[rs].pws) % mod;
        t[idx].val = (t[ls].val + t[rs].val) % mod;
        return;
    }
    void push(int idx) {
        if (~t[idx].tag) {
            t[idx].val = 1ll * t[idx].pws * t[idx].tag % mod;

            if (idx < off)
                t[ls].tag = t[rs].tag = t[idx].tag;

            t[idx].tag = ~0;
        }

        return;
    }
    void build() {
        for (int idx = off, p = 1; idx < off * 2; idx++, p = 1ll * p * base % mod) {
            t[idx].pws = p;
            t[idx].val = 1ll * p * T[idx - off] % mod;
            t[idx].tag = ~0;
        }

        for (int idx = off - 1; idx >= 1; idx--) {
            pull(idx);
        }
    }
    void update(int l, int r, int val, int idx = 1, int lo = 0, int hi = off) {
        push(idx);

        if (r <= lo || hi <= l)
            return;

        if (l <= lo && hi <= r) {
            t[idx].tag = val;
            push(idx);
            return;
        }

        int mi = (lo + hi) >> 1;
        update(l, r, val, ls, lo, mi);
        update(l, r, val, rs, mi, hi);
        pull(idx);
    }
#undef ls
#undef rs
} seg;
int hsh(vector<int> cur) {
    int res = 0;

    for (int i = 0, p = 1; i < n; i++, p = 1ll * p * base % mod) {
        res = (res + 1ll * cur[i] * p) % mod;
    }

    return res;
}
vector<int> cross(vector<int> lhs, vector<int> rhs) {
    vector<int> cur(n);

    for (int i = 0, p = 1; i < n; i++, p = 1ll * p * base % mod) {
        int c = 0;

        if (lhs[i] == rhs[i])
            c = lhs[i];
        else if (lhs[i] != 0 && rhs[i] != 0)
            c = 0;
        else if (lhs[i] != 1 && rhs[i] != 1)
            c = 1;
        else if (lhs[i] != 2 && rhs[i] != 2)
            c = 2;

        cur[i] = c;
    }

    return cur;
}
int32_t main() {
    cin >> n;

    for (int k = 0; k < 3; k++) {
        scanf("%s", str);
        s[k].resize(n);

        for (int i = 0; i < n; i++) {
            if (str[i] == 'J')
                s[k][i] = 0;

            if (str[i] == 'O')
                s[k][i] = 1;

            if (str[i] == 'I')
                s[k][i] = 2;
        }
    }

    set<int> st;
    st.insert(hsh(s[0]));
    st.insert(hsh(s[1]));
    st.insert(hsh(s[2]));
    st.insert(hsh(cross(s[0], s[1])));
    st.insert(hsh(cross(s[1], s[2])));
    st.insert(hsh(cross(s[0], s[2])));
    st.insert(hsh(cross(s[0], cross(s[1], s[2]))));
    st.insert(hsh(cross(s[1], cross(s[0], s[2]))));
    st.insert(hsh(cross(s[2], cross(s[0], s[1]))));
    scanf("%d", &Q);
    scanf("%s", str);

    for (int i = 0; i < n; i++) {
        if (str[i] == 'J')
            T[i] = 0;

        if (str[i] == 'O')
            T[i] = 1;

        if (str[i] == 'I')
            T[i] = 2;
    }

    seg.build();

    if (st.find(seg.t[1].val) != st.end()) {
        puts("Yes");
    } else {
        puts("No");
    }

    while (Q--) {
        int L, R;
        char C;
        scanf("%d %d %c", &L, &R, &C);
        int c = 0;

        if (C == 'J')
            c = 0;

        if (C == 'O')
            c = 1;

        if (C == 'I')
            c = 2;

        seg.update(L - 1, R, c);
        int val = seg.t[1].val;

        if (st.find(val) != st.end()) {
            puts("Yes");
        } else {
            puts("No");
        }
    }
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:107:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |         scanf("%s", str);
      |         ~~~~~^~~~~~~~~~~
Main.cpp:132:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  132 |     scanf("%d", &Q);
      |     ~~~~~^~~~~~~~~~
Main.cpp:133:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  133 |     scanf("%s", str);
      |     ~~~~~^~~~~~~~~~~
Main.cpp:157:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  157 |         scanf("%d %d %c", &L, &R, &C);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 10324 KB Output is correct
2 Correct 99 ms 10592 KB Output is correct
3 Correct 95 ms 10528 KB Output is correct
4 Correct 91 ms 10600 KB Output is correct
5 Correct 87 ms 10320 KB Output is correct
6 Correct 105 ms 10296 KB Output is correct
7 Correct 90 ms 10264 KB Output is correct
8 Correct 95 ms 10540 KB Output is correct
9 Correct 94 ms 10280 KB Output is correct
10 Correct 92 ms 10352 KB Output is correct
11 Correct 93 ms 10272 KB Output is correct
12 Correct 98 ms 10412 KB Output is correct
13 Correct 93 ms 10324 KB Output is correct
14 Correct 92 ms 10324 KB Output is correct
15 Correct 95 ms 10320 KB Output is correct
16 Correct 92 ms 10364 KB Output is correct
17 Correct 92 ms 10356 KB Output is correct
18 Correct 92 ms 10320 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 10324 KB Output is correct
2 Correct 99 ms 10592 KB Output is correct
3 Correct 95 ms 10528 KB Output is correct
4 Correct 91 ms 10600 KB Output is correct
5 Correct 87 ms 10320 KB Output is correct
6 Correct 105 ms 10296 KB Output is correct
7 Correct 90 ms 10264 KB Output is correct
8 Correct 95 ms 10540 KB Output is correct
9 Correct 94 ms 10280 KB Output is correct
10 Correct 92 ms 10352 KB Output is correct
11 Correct 93 ms 10272 KB Output is correct
12 Correct 98 ms 10412 KB Output is correct
13 Correct 93 ms 10324 KB Output is correct
14 Correct 92 ms 10324 KB Output is correct
15 Correct 95 ms 10320 KB Output is correct
16 Correct 92 ms 10364 KB Output is correct
17 Correct 92 ms 10356 KB Output is correct
18 Correct 92 ms 10320 KB Output is correct
19 Correct 184 ms 15800 KB Output is correct
20 Correct 197 ms 15880 KB Output is correct
21 Correct 132 ms 15308 KB Output is correct
22 Correct 133 ms 13856 KB Output is correct
23 Correct 123 ms 11380 KB Output is correct
24 Correct 109 ms 11160 KB Output is correct
25 Correct 140 ms 15796 KB Output is correct
26 Correct 142 ms 15808 KB Output is correct
27 Correct 156 ms 15796 KB Output is correct
28 Correct 156 ms 15808 KB Output is correct
29 Correct 156 ms 15644 KB Output is correct
30 Correct 116 ms 11128 KB Output is correct
31 Correct 155 ms 15832 KB Output is correct
32 Correct 152 ms 15140 KB Output is correct
33 Correct 112 ms 11040 KB Output is correct
34 Correct 152 ms 15800 KB Output is correct
35 Correct 125 ms 13576 KB Output is correct
36 Correct 111 ms 10992 KB Output is correct
37 Correct 112 ms 11052 KB Output is correct
38 Correct 170 ms 15796 KB Output is correct
39 Correct 143 ms 15808 KB Output is correct
40 Correct 132 ms 13388 KB Output is correct
41 Correct 196 ms 15988 KB Output is correct
42 Correct 89 ms 15800 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 10324 KB Output is correct
2 Correct 99 ms 10592 KB Output is correct
3 Correct 95 ms 10528 KB Output is correct
4 Correct 91 ms 10600 KB Output is correct
5 Correct 87 ms 10320 KB Output is correct
6 Correct 105 ms 10296 KB Output is correct
7 Correct 90 ms 10264 KB Output is correct
8 Correct 95 ms 10540 KB Output is correct
9 Correct 94 ms 10280 KB Output is correct
10 Correct 92 ms 10352 KB Output is correct
11 Correct 93 ms 10272 KB Output is correct
12 Correct 98 ms 10412 KB Output is correct
13 Correct 93 ms 10324 KB Output is correct
14 Correct 92 ms 10324 KB Output is correct
15 Correct 95 ms 10320 KB Output is correct
16 Correct 92 ms 10364 KB Output is correct
17 Correct 92 ms 10356 KB Output is correct
18 Correct 92 ms 10320 KB Output is correct
19 Correct 97 ms 10324 KB Output is correct
20 Correct 97 ms 10324 KB Output is correct
21 Correct 95 ms 10184 KB Output is correct
22 Correct 93 ms 10328 KB Output is correct
23 Correct 96 ms 10324 KB Output is correct
24 Correct 90 ms 10320 KB Output is correct
25 Correct 95 ms 10192 KB Output is correct
26 Correct 90 ms 10348 KB Output is correct
27 Correct 93 ms 10324 KB Output is correct
28 Correct 87 ms 10320 KB Output is correct
29 Correct 92 ms 10328 KB Output is correct
30 Correct 85 ms 10352 KB Output is correct
31 Correct 95 ms 10348 KB Output is correct
32 Correct 94 ms 10364 KB Output is correct
33 Correct 95 ms 10320 KB Output is correct
34 Correct 89 ms 10320 KB Output is correct
35 Correct 100 ms 10420 KB Output is correct
36 Correct 95 ms 10324 KB Output is correct
37 Correct 95 ms 10388 KB Output is correct
38 Correct 98 ms 10192 KB Output is correct
39 Correct 95 ms 10320 KB Output is correct
40 Correct 96 ms 10276 KB Output is correct
41 Correct 112 ms 10192 KB Output is correct
42 Correct 96 ms 10324 KB Output is correct
43 Correct 92 ms 10320 KB Output is correct
44 Correct 118 ms 10400 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 10324 KB Output is correct
2 Correct 99 ms 10592 KB Output is correct
3 Correct 95 ms 10528 KB Output is correct
4 Correct 91 ms 10600 KB Output is correct
5 Correct 87 ms 10320 KB Output is correct
6 Correct 105 ms 10296 KB Output is correct
7 Correct 90 ms 10264 KB Output is correct
8 Correct 95 ms 10540 KB Output is correct
9 Correct 94 ms 10280 KB Output is correct
10 Correct 92 ms 10352 KB Output is correct
11 Correct 93 ms 10272 KB Output is correct
12 Correct 98 ms 10412 KB Output is correct
13 Correct 93 ms 10324 KB Output is correct
14 Correct 92 ms 10324 KB Output is correct
15 Correct 95 ms 10320 KB Output is correct
16 Correct 92 ms 10364 KB Output is correct
17 Correct 92 ms 10356 KB Output is correct
18 Correct 92 ms 10320 KB Output is correct
19 Correct 184 ms 15800 KB Output is correct
20 Correct 197 ms 15880 KB Output is correct
21 Correct 132 ms 15308 KB Output is correct
22 Correct 133 ms 13856 KB Output is correct
23 Correct 123 ms 11380 KB Output is correct
24 Correct 109 ms 11160 KB Output is correct
25 Correct 140 ms 15796 KB Output is correct
26 Correct 142 ms 15808 KB Output is correct
27 Correct 156 ms 15796 KB Output is correct
28 Correct 156 ms 15808 KB Output is correct
29 Correct 156 ms 15644 KB Output is correct
30 Correct 116 ms 11128 KB Output is correct
31 Correct 155 ms 15832 KB Output is correct
32 Correct 152 ms 15140 KB Output is correct
33 Correct 112 ms 11040 KB Output is correct
34 Correct 152 ms 15800 KB Output is correct
35 Correct 125 ms 13576 KB Output is correct
36 Correct 111 ms 10992 KB Output is correct
37 Correct 112 ms 11052 KB Output is correct
38 Correct 170 ms 15796 KB Output is correct
39 Correct 143 ms 15808 KB Output is correct
40 Correct 132 ms 13388 KB Output is correct
41 Correct 196 ms 15988 KB Output is correct
42 Correct 89 ms 15800 KB Output is correct
43 Correct 97 ms 10324 KB Output is correct
44 Correct 97 ms 10324 KB Output is correct
45 Correct 95 ms 10184 KB Output is correct
46 Correct 93 ms 10328 KB Output is correct
47 Correct 96 ms 10324 KB Output is correct
48 Correct 90 ms 10320 KB Output is correct
49 Correct 95 ms 10192 KB Output is correct
50 Correct 90 ms 10348 KB Output is correct
51 Correct 93 ms 10324 KB Output is correct
52 Correct 87 ms 10320 KB Output is correct
53 Correct 92 ms 10328 KB Output is correct
54 Correct 85 ms 10352 KB Output is correct
55 Correct 95 ms 10348 KB Output is correct
56 Correct 94 ms 10364 KB Output is correct
57 Correct 95 ms 10320 KB Output is correct
58 Correct 89 ms 10320 KB Output is correct
59 Correct 100 ms 10420 KB Output is correct
60 Correct 95 ms 10324 KB Output is correct
61 Correct 95 ms 10388 KB Output is correct
62 Correct 98 ms 10192 KB Output is correct
63 Correct 95 ms 10320 KB Output is correct
64 Correct 96 ms 10276 KB Output is correct
65 Correct 112 ms 10192 KB Output is correct
66 Correct 96 ms 10324 KB Output is correct
67 Correct 92 ms 10320 KB Output is correct
68 Correct 118 ms 10400 KB Output is correct
69 Correct 179 ms 16228 KB Output is correct
70 Correct 218 ms 17752 KB Output is correct
71 Correct 130 ms 11032 KB Output is correct
72 Correct 112 ms 11076 KB Output is correct
73 Correct 114 ms 11204 KB Output is correct
74 Correct 137 ms 13788 KB Output is correct
75 Correct 110 ms 11076 KB Output is correct
76 Correct 154 ms 15816 KB Output is correct
77 Correct 144 ms 14016 KB Output is correct
78 Correct 113 ms 10992 KB Output is correct
79 Correct 134 ms 11008 KB Output is correct
80 Correct 146 ms 15584 KB Output is correct
81 Correct 122 ms 11168 KB Output is correct
82 Correct 163 ms 17476 KB Output is correct
83 Correct 158 ms 17280 KB Output is correct
84 Correct 115 ms 11172 KB Output is correct
85 Correct 117 ms 11164 KB Output is correct
86 Correct 156 ms 15928 KB Output is correct
87 Correct 179 ms 17640 KB Output is correct
88 Correct 124 ms 11156 KB Output is correct
89 Correct 144 ms 16912 KB Output is correct
90 Correct 155 ms 17536 KB Output is correct
91 Correct 120 ms 11372 KB Output is correct
92 Correct 140 ms 15612 KB Output is correct
93 Correct 113 ms 11064 KB Output is correct
94 Correct 115 ms 11088 KB Output is correct
95 Correct 132 ms 11108 KB Output is correct
96 Correct 170 ms 15880 KB Output is correct
97 Correct 123 ms 17620 KB Output is correct
98 Correct 140 ms 15072 KB Output is correct
99 Correct 217 ms 17844 KB Output is correct
100 Correct 99 ms 15836 KB Output is correct