oj.uz

Submission #885093

# Submission time Handle Problem Language Result Execution time Memory
885093 2023-12-09T02:09:24 Z Keys Crossing (JOI21_crossing) C++14
49 / 100
 213 ms 20444 KB 
#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl '\n'
#define dbg(x) cerr << #x << " = " << x << endl;

typedef vector<int> vi;
typedef vector<string> vs;

const int base = 9973, mod = 1e9 + 7, N = 2e5 + 5;

int n, q, p[N], psum[N], st[N * 4], rset[N * 4];
string a[3], t;
set<int> se;
string joi = "#JOI";

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

int hash_s(string s) {
  int ret = 0;
  for (int i = 0; i < int(s.size()); i++) (ret += p[i] * hash_c(s[i]) % mod) %= mod;
  return ret;
}

void pull(int v, int l, int r) {
  int m = (l + r) / 2;
  st[v] = (st[2 * v] + st[2 * v + 1] * p[m - l + 1] % mod) % mod;
}

void push(int v, int l, int r) {
  if (rset[v] == 0) return;
  int m = (l + r) / 2;
  rset[2 * v + 1] = rset[2 * v] = rset[v];
  st[2 * v] = rset[v] * psum[m - l + 1] % mod;
  st[2 * v + 1] = rset[v] * psum[r - m] % mod;
  rset[v] = 0;
}

void build(int v = 1, int l = 0, int r = n - 1) {
  if (l == r) {
    st[v] = hash_c(t[l]);
  } else {
    int m = (l + r) / 2;
    build(v * 2, l, m);
    build(v * 2 + 1, m + 1, r);
    pull(v, l, r);
  }
}

void upd(int ql, int qr, int x, int v = 1, int l = 0, int r = n - 1) {
  if (qr < l or ql > r) return;
  if (l >= ql and r <= qr) {
    rset[v] = x;
    st[v] = rset[v] * psum[r - l + 1] % mod;
    return;
  }
  push(v, l, r);
  int m = (l + r) / 2;
  upd(ql, qr, x, v * 2, l, m);
  upd(ql, qr, x, v * 2 + 1, m + 1, r);
  pull(v, l, r);
}

void comb(vs a) {
  string s = a[0];
  for (int i = 1; i < int(a.size()); i++) {
    string ns = "";
    for (int j = 0; j < n; j++) {
      if (s[j] == a[i][j]) ns += s[j];
      else ns += joi[6 - hash_c(s[j]) - hash_c(a[i][j])];
    }
    s = ns;
  }
  se.insert(hash_s(s));
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  p[0] = 1; for (int i = 1; i < N; i++) p[i] = p[i - 1] * base % mod;
  for (int i = 1; i < N; i++) psum[i] = (psum[i - 1] + p[i - 1]) % mod;
  cin >> n >> a[0] >> a[1] >> a[2] >> q >> t;
  build();
  comb({a[0]}); comb({a[1]}); comb({a[2]}); comb({a[0], a[1]}); comb({a[0], a[2]}); comb({a[1], a[2]});
  comb({a[0], a[1], a[2]}); comb({a[0], a[2], a[1]}); comb({a[1], a[2], a[0]});
  if (se.count(st[1])) cout << "Yes" << endl;
  else cout << "No" << endl;
  while (q--) {
    int l, r; char c; cin >> l >> r >> c; int o = hash_c(c); l--; r--;
    upd(l, r, o);
    if (se.count(st[1])) cout << "Yes" << endl;
    else cout << "No" << endl;
  }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 6228 KB Output is correct
2 Correct 63 ms 6256 KB Output is correct
3 Correct 65 ms 6228 KB Output is correct
4 Correct 54 ms 6228 KB Output is correct
5 Correct 55 ms 6080 KB Output is correct
6 Correct 54 ms 6016 KB Output is correct
7 Correct 56 ms 6024 KB Output is correct
8 Correct 59 ms 6236 KB Output is correct
9 Correct 58 ms 6224 KB Output is correct
10 Correct 59 ms 6480 KB Output is correct
11 Correct 59 ms 6224 KB Output is correct
12 Correct 57 ms 6160 KB Output is correct
13 Correct 61 ms 6116 KB Output is correct
14 Correct 57 ms 6228 KB Output is correct
15 Correct 58 ms 6224 KB Output is correct
16 Correct 58 ms 6144 KB Output is correct
17 Correct 59 ms 6236 KB Output is correct
18 Correct 66 ms 6076 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 6228 KB Output is correct
2 Correct 63 ms 6256 KB Output is correct
3 Correct 65 ms 6228 KB Output is correct
4 Correct 54 ms 6228 KB Output is correct
5 Correct 55 ms 6080 KB Output is correct
6 Correct 54 ms 6016 KB Output is correct
7 Correct 56 ms 6024 KB Output is correct
8 Correct 59 ms 6236 KB Output is correct
9 Correct 58 ms 6224 KB Output is correct
10 Correct 59 ms 6480 KB Output is correct
11 Correct 59 ms 6224 KB Output is correct
12 Correct 57 ms 6160 KB Output is correct
13 Correct 61 ms 6116 KB Output is correct
14 Correct 57 ms 6228 KB Output is correct
15 Correct 58 ms 6224 KB Output is correct
16 Correct 58 ms 6144 KB Output is correct
17 Correct 59 ms 6236 KB Output is correct
18 Correct 66 ms 6076 KB Output is correct
19 Correct 178 ms 16492 KB Output is correct
20 Correct 186 ms 14872 KB Output is correct
21 Correct 128 ms 16280 KB Output is correct
22 Correct 125 ms 19368 KB Output is correct
23 Correct 93 ms 12880 KB Output is correct
24 Correct 92 ms 12880 KB Output is correct
25 Correct 132 ms 20004 KB Output is correct
26 Correct 137 ms 19988 KB Output is correct
27 Correct 151 ms 20000 KB Output is correct
28 Correct 156 ms 20444 KB Output is correct
29 Correct 146 ms 20088 KB Output is correct
30 Correct 99 ms 12880 KB Output is correct
31 Correct 159 ms 20256 KB Output is correct
32 Correct 145 ms 19704 KB Output is correct
33 Correct 93 ms 12884 KB Output is correct
34 Correct 149 ms 20196 KB Output is correct
35 Correct 123 ms 19284 KB Output is correct
36 Correct 101 ms 12880 KB Output is correct
37 Correct 92 ms 12884 KB Output is correct
38 Correct 163 ms 19688 KB Output is correct
39 Correct 115 ms 17960 KB Output is correct
40 Correct 122 ms 15108 KB Output is correct
41 Correct 193 ms 20252 KB Output is correct
42 Correct 51 ms 15380 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 6228 KB Output is correct
2 Correct 63 ms 6256 KB Output is correct
3 Correct 65 ms 6228 KB Output is correct
4 Correct 54 ms 6228 KB Output is correct
5 Correct 55 ms 6080 KB Output is correct
6 Correct 54 ms 6016 KB Output is correct
7 Correct 56 ms 6024 KB Output is correct
8 Correct 59 ms 6236 KB Output is correct
9 Correct 58 ms 6224 KB Output is correct
10 Correct 59 ms 6480 KB Output is correct
11 Correct 59 ms 6224 KB Output is correct
12 Correct 57 ms 6160 KB Output is correct
13 Correct 61 ms 6116 KB Output is correct
14 Correct 57 ms 6228 KB Output is correct
15 Correct 58 ms 6224 KB Output is correct
16 Correct 58 ms 6144 KB Output is correct
17 Correct 59 ms 6236 KB Output is correct
18 Correct 66 ms 6076 KB Output is correct
19 Correct 67 ms 6228 KB Output is correct
20 Correct 68 ms 6204 KB Output is correct
21 Correct 59 ms 6260 KB Output is correct
22 Correct 53 ms 6116 KB Output is correct
23 Correct 58 ms 6124 KB Output is correct
24 Correct 60 ms 6224 KB Output is correct
25 Correct 59 ms 6136 KB Output is correct
26 Correct 60 ms 6224 KB Output is correct
27 Correct 60 ms 6228 KB Output is correct
28 Correct 53 ms 6224 KB Output is correct
29 Correct 60 ms 6144 KB Output is correct
30 Correct 54 ms 6228 KB Output is correct
31 Correct 62 ms 6228 KB Output is correct
32 Correct 60 ms 6080 KB Output is correct
33 Correct 61 ms 6224 KB Output is correct
34 Correct 56 ms 6228 KB Output is correct
35 Correct 66 ms 6324 KB Output is correct
36 Correct 62 ms 6228 KB Output is correct
37 Correct 61 ms 6056 KB Output is correct
38 Correct 64 ms 6232 KB Output is correct
39 Correct 62 ms 6208 KB Output is correct
40 Correct 62 ms 6152 KB Output is correct
41 Correct 63 ms 6120 KB Output is correct
42 Correct 62 ms 6256 KB Output is correct
43 Correct 59 ms 6224 KB Output is correct
44 Correct 62 ms 6148 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 6228 KB Output is correct
2 Correct 63 ms 6256 KB Output is correct
3 Correct 65 ms 6228 KB Output is correct
4 Correct 54 ms 6228 KB Output is correct
5 Correct 55 ms 6080 KB Output is correct
6 Correct 54 ms 6016 KB Output is correct
7 Correct 56 ms 6024 KB Output is correct
8 Correct 59 ms 6236 KB Output is correct
9 Correct 58 ms 6224 KB Output is correct
10 Correct 59 ms 6480 KB Output is correct
11 Correct 59 ms 6224 KB Output is correct
12 Correct 57 ms 6160 KB Output is correct
13 Correct 61 ms 6116 KB Output is correct
14 Correct 57 ms 6228 KB Output is correct
15 Correct 58 ms 6224 KB Output is correct
16 Correct 58 ms 6144 KB Output is correct
17 Correct 59 ms 6236 KB Output is correct
18 Correct 66 ms 6076 KB Output is correct
19 Correct 178 ms 16492 KB Output is correct
20 Correct 186 ms 14872 KB Output is correct
21 Correct 128 ms 16280 KB Output is correct
22 Correct 125 ms 19368 KB Output is correct
23 Correct 93 ms 12880 KB Output is correct
24 Correct 92 ms 12880 KB Output is correct
25 Correct 132 ms 20004 KB Output is correct
26 Correct 137 ms 19988 KB Output is correct
27 Correct 151 ms 20000 KB Output is correct
28 Correct 156 ms 20444 KB Output is correct
29 Correct 146 ms 20088 KB Output is correct
30 Correct 99 ms 12880 KB Output is correct
31 Correct 159 ms 20256 KB Output is correct
32 Correct 145 ms 19704 KB Output is correct
33 Correct 93 ms 12884 KB Output is correct
34 Correct 149 ms 20196 KB Output is correct
35 Correct 123 ms 19284 KB Output is correct
36 Correct 101 ms 12880 KB Output is correct
37 Correct 92 ms 12884 KB Output is correct
38 Correct 163 ms 19688 KB Output is correct
39 Correct 115 ms 17960 KB Output is correct
40 Correct 122 ms 15108 KB Output is correct
41 Correct 193 ms 20252 KB Output is correct
42 Correct 51 ms 15380 KB Output is correct
43 Correct 67 ms 6228 KB Output is correct
44 Correct 68 ms 6204 KB Output is correct
45 Correct 59 ms 6260 KB Output is correct
46 Correct 53 ms 6116 KB Output is correct
47 Correct 58 ms 6124 KB Output is correct
48 Correct 60 ms 6224 KB Output is correct
49 Correct 59 ms 6136 KB Output is correct
50 Correct 60 ms 6224 KB Output is correct
51 Correct 60 ms 6228 KB Output is correct
52 Correct 53 ms 6224 KB Output is correct
53 Correct 60 ms 6144 KB Output is correct
54 Correct 54 ms 6228 KB Output is correct
55 Correct 62 ms 6228 KB Output is correct
56 Correct 60 ms 6080 KB Output is correct
57 Correct 61 ms 6224 KB Output is correct
58 Correct 56 ms 6228 KB Output is correct
59 Correct 66 ms 6324 KB Output is correct
60 Correct 62 ms 6228 KB Output is correct
61 Correct 61 ms 6056 KB Output is correct
62 Correct 64 ms 6232 KB Output is correct
63 Correct 62 ms 6208 KB Output is correct
64 Correct 62 ms 6152 KB Output is correct
65 Correct 63 ms 6120 KB Output is correct
66 Correct 62 ms 6256 KB Output is correct
67 Correct 59 ms 6224 KB Output is correct
68 Correct 62 ms 6148 KB Output is correct
69 Correct 176 ms 19216 KB Output is correct
70 Correct 213 ms 18340 KB Output is correct
71 Correct 94 ms 12884 KB Output is correct
72 Correct 102 ms 12968 KB Output is correct
73 Correct 95 ms 12880 KB Output is correct
74 Correct 128 ms 19308 KB Output is correct
75 Correct 94 ms 12848 KB Output is correct
76 Correct 149 ms 19800 KB Output is correct
77 Correct 136 ms 19272 KB Output is correct
78 Correct 93 ms 12780 KB Output is correct
79 Correct 94 ms 12884 KB Output is correct
80 Correct 131 ms 19076 KB Output is correct
81 Correct 95 ms 12936 KB Output is correct
82 Incorrect 152 ms 19876 KB Output isn't correct
83 Halted 0 ms 0 KB -