oj.uz

Submission #885098

# Submission time Handle Problem Language Result Execution time Memory
885098 2023-12-09T02:17:40 Z Keys Crossing (JOI21_crossing) C++14
49 / 100
 202 ms 16676 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 = 998244353, 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 58 ms 6168 KB Output is correct
2 Correct 65 ms 6196 KB Output is correct
3 Correct 66 ms 6224 KB Output is correct
4 Correct 56 ms 6228 KB Output is correct
5 Correct 55 ms 6224 KB Output is correct
6 Correct 56 ms 6224 KB Output is correct
7 Correct 55 ms 6228 KB Output is correct
8 Correct 57 ms 6224 KB Output is correct
9 Correct 59 ms 6152 KB Output is correct
10 Correct 66 ms 6224 KB Output is correct
11 Correct 58 ms 6260 KB Output is correct
12 Correct 59 ms 6228 KB Output is correct
13 Correct 61 ms 6224 KB Output is correct
14 Correct 59 ms 6112 KB Output is correct
15 Correct 59 ms 6228 KB Output is correct
16 Correct 58 ms 6124 KB Output is correct
17 Correct 59 ms 6228 KB Output is correct
18 Correct 61 ms 6228 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 6168 KB Output is correct
2 Correct 65 ms 6196 KB Output is correct
3 Correct 66 ms 6224 KB Output is correct
4 Correct 56 ms 6228 KB Output is correct
5 Correct 55 ms 6224 KB Output is correct
6 Correct 56 ms 6224 KB Output is correct
7 Correct 55 ms 6228 KB Output is correct
8 Correct 57 ms 6224 KB Output is correct
9 Correct 59 ms 6152 KB Output is correct
10 Correct 66 ms 6224 KB Output is correct
11 Correct 58 ms 6260 KB Output is correct
12 Correct 59 ms 6228 KB Output is correct
13 Correct 61 ms 6224 KB Output is correct
14 Correct 59 ms 6112 KB Output is correct
15 Correct 59 ms 6228 KB Output is correct
16 Correct 58 ms 6124 KB Output is correct
17 Correct 59 ms 6228 KB Output is correct
18 Correct 61 ms 6228 KB Output is correct
19 Correct 180 ms 16536 KB Output is correct
20 Correct 184 ms 14700 KB Output is correct
21 Correct 123 ms 16216 KB Output is correct
22 Correct 133 ms 16124 KB Output is correct
23 Correct 98 ms 10500 KB Output is correct
24 Correct 92 ms 10504 KB Output is correct
25 Correct 133 ms 16432 KB Output is correct
26 Correct 134 ms 16416 KB Output is correct
27 Correct 149 ms 16536 KB Output is correct
28 Correct 150 ms 16360 KB Output is correct
29 Correct 149 ms 16500 KB Output is correct
30 Correct 98 ms 10580 KB Output is correct
31 Correct 155 ms 16324 KB Output is correct
32 Correct 140 ms 16360 KB Output is correct
33 Correct 101 ms 10648 KB Output is correct
34 Correct 145 ms 16416 KB Output is correct
35 Correct 131 ms 15952 KB Output is correct
36 Correct 96 ms 10548 KB Output is correct
37 Correct 108 ms 10576 KB Output is correct
38 Correct 160 ms 16232 KB Output is correct
39 Correct 115 ms 14100 KB Output is correct
40 Correct 122 ms 11608 KB Output is correct
41 Correct 200 ms 16676 KB Output is correct
42 Correct 51 ms 12440 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 6168 KB Output is correct
2 Correct 65 ms 6196 KB Output is correct
3 Correct 66 ms 6224 KB Output is correct
4 Correct 56 ms 6228 KB Output is correct
5 Correct 55 ms 6224 KB Output is correct
6 Correct 56 ms 6224 KB Output is correct
7 Correct 55 ms 6228 KB Output is correct
8 Correct 57 ms 6224 KB Output is correct
9 Correct 59 ms 6152 KB Output is correct
10 Correct 66 ms 6224 KB Output is correct
11 Correct 58 ms 6260 KB Output is correct
12 Correct 59 ms 6228 KB Output is correct
13 Correct 61 ms 6224 KB Output is correct
14 Correct 59 ms 6112 KB Output is correct
15 Correct 59 ms 6228 KB Output is correct
16 Correct 58 ms 6124 KB Output is correct
17 Correct 59 ms 6228 KB Output is correct
18 Correct 61 ms 6228 KB Output is correct
19 Correct 65 ms 6060 KB Output is correct
20 Correct 67 ms 6224 KB Output is correct
21 Correct 59 ms 6224 KB Output is correct
22 Correct 53 ms 6112 KB Output is correct
23 Correct 59 ms 6244 KB Output is correct
24 Correct 58 ms 6228 KB Output is correct
25 Correct 60 ms 6196 KB Output is correct
26 Correct 56 ms 6224 KB Output is correct
27 Correct 59 ms 6228 KB Output is correct
28 Correct 54 ms 6236 KB Output is correct
29 Correct 60 ms 6224 KB Output is correct
30 Correct 53 ms 6228 KB Output is correct
31 Correct 66 ms 6228 KB Output is correct
32 Correct 60 ms 6228 KB Output is correct
33 Correct 70 ms 6228 KB Output is correct
34 Correct 55 ms 6224 KB Output is correct
35 Correct 63 ms 6108 KB Output is correct
36 Correct 65 ms 6260 KB Output is correct
37 Correct 61 ms 6036 KB Output is correct
38 Correct 61 ms 6164 KB Output is correct
39 Correct 61 ms 6224 KB Output is correct
40 Correct 62 ms 6224 KB Output is correct
41 Correct 64 ms 6108 KB Output is correct
42 Correct 62 ms 6228 KB Output is correct
43 Correct 61 ms 6228 KB Output is correct
44 Correct 61 ms 6224 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 6168 KB Output is correct
2 Correct 65 ms 6196 KB Output is correct
3 Correct 66 ms 6224 KB Output is correct
4 Correct 56 ms 6228 KB Output is correct
5 Correct 55 ms 6224 KB Output is correct
6 Correct 56 ms 6224 KB Output is correct
7 Correct 55 ms 6228 KB Output is correct
8 Correct 57 ms 6224 KB Output is correct
9 Correct 59 ms 6152 KB Output is correct
10 Correct 66 ms 6224 KB Output is correct
11 Correct 58 ms 6260 KB Output is correct
12 Correct 59 ms 6228 KB Output is correct
13 Correct 61 ms 6224 KB Output is correct
14 Correct 59 ms 6112 KB Output is correct
15 Correct 59 ms 6228 KB Output is correct
16 Correct 58 ms 6124 KB Output is correct
17 Correct 59 ms 6228 KB Output is correct
18 Correct 61 ms 6228 KB Output is correct
19 Correct 180 ms 16536 KB Output is correct
20 Correct 184 ms 14700 KB Output is correct
21 Correct 123 ms 16216 KB Output is correct
22 Correct 133 ms 16124 KB Output is correct
23 Correct 98 ms 10500 KB Output is correct
24 Correct 92 ms 10504 KB Output is correct
25 Correct 133 ms 16432 KB Output is correct
26 Correct 134 ms 16416 KB Output is correct
27 Correct 149 ms 16536 KB Output is correct
28 Correct 150 ms 16360 KB Output is correct
29 Correct 149 ms 16500 KB Output is correct
30 Correct 98 ms 10580 KB Output is correct
31 Correct 155 ms 16324 KB Output is correct
32 Correct 140 ms 16360 KB Output is correct
33 Correct 101 ms 10648 KB Output is correct
34 Correct 145 ms 16416 KB Output is correct
35 Correct 131 ms 15952 KB Output is correct
36 Correct 96 ms 10548 KB Output is correct
37 Correct 108 ms 10576 KB Output is correct
38 Correct 160 ms 16232 KB Output is correct
39 Correct 115 ms 14100 KB Output is correct
40 Correct 122 ms 11608 KB Output is correct
41 Correct 200 ms 16676 KB Output is correct
42 Correct 51 ms 12440 KB Output is correct
43 Correct 65 ms 6060 KB Output is correct
44 Correct 67 ms 6224 KB Output is correct
45 Correct 59 ms 6224 KB Output is correct
46 Correct 53 ms 6112 KB Output is correct
47 Correct 59 ms 6244 KB Output is correct
48 Correct 58 ms 6228 KB Output is correct
49 Correct 60 ms 6196 KB Output is correct
50 Correct 56 ms 6224 KB Output is correct
51 Correct 59 ms 6228 KB Output is correct
52 Correct 54 ms 6236 KB Output is correct
53 Correct 60 ms 6224 KB Output is correct
54 Correct 53 ms 6228 KB Output is correct
55 Correct 66 ms 6228 KB Output is correct
56 Correct 60 ms 6228 KB Output is correct
57 Correct 70 ms 6228 KB Output is correct
58 Correct 55 ms 6224 KB Output is correct
59 Correct 63 ms 6108 KB Output is correct
60 Correct 65 ms 6260 KB Output is correct
61 Correct 61 ms 6036 KB Output is correct
62 Correct 61 ms 6164 KB Output is correct
63 Correct 61 ms 6224 KB Output is correct
64 Correct 62 ms 6224 KB Output is correct
65 Correct 64 ms 6108 KB Output is correct
66 Correct 62 ms 6228 KB Output is correct
67 Correct 61 ms 6228 KB Output is correct
68 Correct 61 ms 6224 KB Output is correct
69 Correct 174 ms 15908 KB Output is correct
70 Correct 202 ms 14704 KB Output is correct
71 Correct 95 ms 10580 KB Output is correct
72 Correct 108 ms 10580 KB Output is correct
73 Correct 97 ms 10652 KB Output is correct
74 Correct 133 ms 15996 KB Output is correct
75 Correct 99 ms 11088 KB Output is correct
76 Correct 143 ms 16196 KB Output is correct
77 Correct 134 ms 16028 KB Output is correct
78 Correct 97 ms 10580 KB Output is correct
79 Correct 94 ms 10456 KB Output is correct
80 Correct 133 ms 15608 KB Output is correct
81 Correct 97 ms 10580 KB Output is correct
82 Correct 150 ms 16256 KB Output is correct
83 Correct 149 ms 16160 KB Output is correct
84 Correct 94 ms 10688 KB Output is correct
85 Correct 93 ms 10644 KB Output is correct
86 Correct 148 ms 15764 KB Output is correct
87 Correct 153 ms 16236 KB Output is correct
88 Correct 101 ms 10576 KB Output is correct
89 Correct 139 ms 16112 KB Output is correct
90 Correct 158 ms 16300 KB Output is correct
91 Incorrect 102 ms 10580 KB Output isn't correct
92 Halted 0 ms 0 KB -