oj.uz

Submission #737684

# Submission time Handle Problem Language Result Execution time Memory
737684 2023-05-07T14:36:51 Z veehz Crossing (JOI21_crossing) C++17
49 / 100
 7000 ms 84844 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back

/* Segment Tree */
template <class S, S (*op)(S, S), S (*e)()>
struct segtree {
  /* S op(S a, S b) {} -> Combine values */
  /* S e() {} -> Initial value (0) */
  int _n;
  vector<S> d;
  segtree() : segtree(0) {}
  explicit segtree(int n) : segtree(vector<S>(n, e())) {}
  explicit segtree(vector<S> v) : _n(int(v.size())) {
    d.assign(4 * _n, e());
    if (_n) build(v);
  }
  void build(vector<S>& a, int v = 1, int tl = 0, int tr = -1) {
    if (tr == -1) tr = _n - 1;
    if (tl == tr) {
      d[v] = a[tl];
    } else {
      int tm = (tl + tr) / 2;
      build(a, v * 2, tl, tm);
      build(a, v * 2 + 1, tm + 1, tr);
      d[v] = op(d[v * 2], d[v * 2 + 1]);
    }
  }
  void set(int pos, S new_val, int tl = 0, int tr = -1, int v = 1) {
    assert(0 <= pos && pos < _n);
    if (tr == -1) tr = _n - 1;
    if (tl == tr) {
      d[v] = new_val;
    } else {
      int tm = (tl + tr) / 2;
      if (pos <= tm)
        set(pos, new_val, tl, tm, v * 2);
      else
        set(pos, new_val, tm + 1, tr, v * 2 + 1);
      d[v] = op(d[2 * v], d[2 * v + 1]);
    }
  }
  S prod(int l, int r, int tl = 0, int tr = -1, int v = 1) {
    if (tr == -1) tr = _n - 1;
    if (r < l) return e();
    if (l == tl && r == tr) return d[v];
    int tm = (tl + tr) / 2;
    return op(prod(l, min(r, tm), tl, tm, 2 * v),
              prod(max(l, tm + 1), r, tm + 1, tr, 2 * v + 1));
  }
  // new - might have bugs
  size_t prod_lower_bound(S x, int tl = 0, int tr = -1, int v = 1,
                          S acc = e()) {
    if (tr == -1) {
      if (prod(0, _n - 1) < x) return _n;
      tr = _n - 1;
    }
    if (tl == tr) return tl;
    int tm = (tl + tr) / 2;
    if (op(acc, d[2 * v]) < x)
      return prod_lower_bound(x, tm + 1, tr, 2 * v + 1, op(acc, d[2 * v]));
    else
      return prod_lower_bound(x, tl, tm, 2 * v, acc);
  }
  size_t prod_upper_bound(S x, int tl = 0, int tr = -1, int v = 1,
                          S acc = e()) {
    if (tr == -1) {
      if (prod(0, _n - 1) <= x) return _n;
      tr = _n - 1;
    }
    if (tl == tr) return tl;
    int tm = (tl + tr) / 2;
    if (op(acc, d[2 * v]) <= x)
      return prod_upper_bound(x, tm + 1, tr, 2 * v + 1, op(acc, d[2 * v]));
    else
      return prod_upper_bound(x, tl, tm, 2 * v, acc);
  }
};
/* End: Segment Tree */

template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),
          F (*composition)(F, F), F (*id)()>
struct lazySegtree {
  int _n;
  vector<S> d;
  vector<F> lz;
  lazySegtree() : lazySegtree(0) {}
  lazySegtree(int n) : lazySegtree(vector<S>(n, e())) {}
  lazySegtree(vector<S> a)
      : _n((int)a.size()), d(4 * (int)a.size()), lz(4 * (int)a.size(), id()) {
    build(a);
  }

  void build(const vector<S>& a, int v = 1, int tl = 0, int tr = -1) {
    if (tr == -1) tr = _n - 1;
    if (tl == tr) {
      d[v] = a[tl];
    } else {
      int tm = (tl + tr) / 2;
      build(a, 2 * v, tl, tm);
      build(a, 2 * v + 1, tm + 1, tr);
      d[v] = op(d[2 * v], d[2 * v + 1]);
    }
  }

  void apply(int v, F f) {
    d[v] = mapping(f, d[v]);
    lz[v] = composition(f, lz[v]);
  }

  void push(int v) {
    apply(2 * v, lz[v]);
    apply(2 * v + 1, lz[v]);
    lz[v] = id();
  }

  void update(int v) { d[v] = op(d[2 * v], d[2 * v + 1]); }

  void set(int pos, S val, int v = 1, int tl = 0, int tr = -1) {
    if (tr == -1) tr = _n - 1;

    if (tl == tr) {
      d[v] = val;
    } else {
      int tm = (tl + tr) / 2;
      push(v);
      if (pos <= tm) {
        set(pos, val, 2 * v, tl, tm);
      } else {
        set(pos, val, 2 * v + 1, tm + 1, tr);
      }
      update(v);
    }
  }

  /** Apply to [l,r] */
  void apply(int l, int r, F f, int v = 1, int tl = 0, int tr = -1) {
    if (tr == -1) tr = _n - 1;
    if (r < l) return;

    if (l == tl && r == tr) {
      apply(v, f);
    } else {
      push(v);
      int tm = (tl + tr) / 2;
      apply(l, min(r, tm), f, 2 * v, tl, tm);
      apply(max(l, tm + 1), r, f, 2 * v + 1, tm + 1, tr);
      update(v);
    }
  }

  /** a[l] x a[l+1] x ... x a[r] */
  S prod(int l, int r, int v = 1, int tl = 0, int tr = -1) {
    if (tr == -1) tr = _n - 1;
    if (r < l) return e();

    if (l == tl && r == tr) return d[v];

    push(v);
    int tm = (tl + tr) / 2;
    return op(prod(l, min(r, tm), 2 * v, tl, tm),
              prod(max(l, tm + 1), r, 2 * v + 1, tm + 1, tr));
  }
};

// for comparing sa (= sb = sc)
typedef char sk;

sk skop(sk a, sk b) {
  if (b == ' ') return a;
  if (a == ' ') return b;
  if (a == 'X' || b == 'X' || a != b) return 'X';
  return a;
}
sk ske() { return ' '; }

inline segtree<sk, skop, ske> generateSegtree(string s) {
  vector<sk> skvec(s.begin(), s.end());
  return segtree<sk, skop, ske>(skvec);
}

vector<segtree<sk, skop, ske>> segtrees;

struct S {
  vector<bool> val;
  int l, r;
  bool compress() {
    for (int i = 0; i < (int)val.size(); i++)
      if (val[i]) return true;
    return false;
  }
};
S op(S a, S b) {
  vector<bool> v(segtrees.size());
  for (int i = 0; i < (int)segtrees.size(); i++) v[i] = (a.val[i] && b.val[i]);
  return {v, min(a.l, b.l), max(a.r, b.r)};
}
S e() { return {vector<bool>(segtrees.size(), true), INT_MAX, INT_MIN}; }

typedef char F;
// 0 = none
// 1 = J, 2 = O, 3 = I
S mapping(F f, S x) {
  if (f == ' ') return x;
  vector<bool> v(segtrees.size());
  for (int i = 0; i < (int)segtrees.size(); i++) {
    v[i] = (f == segtrees[i].prod(x.l, x.r));
  }
  return {v, x.l, x.r};
}

F composition(F f, F g) { return f == ' ' ? g : f; }

F id() { return ' '; }

string cross(string a, string b) {
  string c;
  for (int i = 0; i < (int)a.size(); i++) {
    if (a[i] == b[i])
      c.pb(a[i]);
    else if (a[i] == 'J' && b[i] == 'O')
      c.pb('I');
    else if (a[i] == 'J' && b[i] == 'I')
      c.pb('O');
    else if (a[i] == 'O' && b[i] == 'J')
      c.pb('I');
    else if (a[i] == 'O' && b[i] == 'I')
      c.pb('J');
    else if (a[i] == 'I' && b[i] == 'J')
      c.pb('O');
    else if (a[i] == 'I' && b[i] == 'O')
      c.pb('J');
  }
  return c;
}

int main() {
  int n;
  cin >> n;

  set<string> s;
  for (int i = 0; i < 3; i++) {
    string t;
    cin >> t;
    s.insert(t);
  }

  while (true) {
    vector<string> v;
    for (auto& t : s) v.pb(t);
    bool hasNew = false;
    for (int i = 0; i < (int)v.size(); i++) {
      for (int j = i + 1; j < (int)v.size(); j++) {
        string t = cross(v[i], v[j]);
        if (s.find(t) == s.end()) {
          s.insert(t);
          hasNew = true;
        }
      }
    }
    if (!hasNew) break;
  }
  vector<string> v;
  for (auto& t : s) v.pb(t);
  for (auto& t : v) segtrees.pb(generateSegtree(t));

  int q;
  cin >> q;
  string t;
  cin >> t;
  vector<S> svec(n);
  for (int i = 0; i < n; i++) {
    vector<bool> tmp(v.size());
    for (int j = 0; j < (int)v.size(); j++) {
      tmp[j] = v[j][i] == t[i];
    }
    svec[i] = {tmp, i, i};
  }

  lazySegtree<S, op, e, F, mapping, composition, id> seg(svec);

  cout << (seg.prod(0, n - 1).compress() ? "Yes" : "No") << endl;
  while (q--) {
    int l, r;
    char c;
    cin >> l >> r >> c;

    seg.apply(l - 1, r - 1, c);
    cout << (seg.prod(0, n - 1).compress() ? "Yes" : "No") << endl;
  }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 806 ms 2472 KB Output is correct
2 Correct 923 ms 2428 KB Output is correct
3 Correct 1012 ms 2440 KB Output is correct
4 Correct 763 ms 2464 KB Output is correct
5 Correct 721 ms 2400 KB Output is correct
6 Correct 738 ms 2392 KB Output is correct
7 Correct 741 ms 2428 KB Output is correct
8 Correct 832 ms 2444 KB Output is correct
9 Correct 809 ms 2584 KB Output is correct
10 Correct 779 ms 2500 KB Output is correct
11 Correct 800 ms 2644 KB Output is correct
12 Correct 777 ms 2508 KB Output is correct
13 Correct 783 ms 2512 KB Output is correct
14 Correct 765 ms 2504 KB Output is correct
15 Correct 793 ms 2500 KB Output is correct
16 Correct 763 ms 2384 KB Output is correct
17 Correct 772 ms 2464 KB Output is correct
18 Correct 961 ms 2428 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 806 ms 2472 KB Output is correct
2 Correct 923 ms 2428 KB Output is correct
3 Correct 1012 ms 2440 KB Output is correct
4 Correct 763 ms 2464 KB Output is correct
5 Correct 721 ms 2400 KB Output is correct
6 Correct 738 ms 2392 KB Output is correct
7 Correct 741 ms 2428 KB Output is correct
8 Correct 832 ms 2444 KB Output is correct
9 Correct 809 ms 2584 KB Output is correct
10 Correct 779 ms 2500 KB Output is correct
11 Correct 800 ms 2644 KB Output is correct
12 Correct 777 ms 2508 KB Output is correct
13 Correct 783 ms 2512 KB Output is correct
14 Correct 765 ms 2504 KB Output is correct
15 Correct 793 ms 2500 KB Output is correct
16 Correct 763 ms 2384 KB Output is correct
17 Correct 772 ms 2464 KB Output is correct
18 Correct 961 ms 2428 KB Output is correct
19 Correct 3867 ms 84784 KB Output is correct
20 Correct 3776 ms 84768 KB Output is correct
21 Correct 2051 ms 79824 KB Output is correct
22 Correct 2133 ms 71704 KB Output is correct
23 Correct 1317 ms 7048 KB Output is correct
24 Correct 1332 ms 6968 KB Output is correct
25 Correct 2211 ms 84796 KB Output is correct
26 Correct 2348 ms 84772 KB Output is correct
27 Correct 2769 ms 84832 KB Output is correct
28 Correct 2844 ms 84748 KB Output is correct
29 Correct 2604 ms 82436 KB Output is correct
30 Correct 1497 ms 7160 KB Output is correct
31 Correct 2695 ms 84764 KB Output is correct
32 Correct 2672 ms 77408 KB Output is correct
33 Correct 1339 ms 7124 KB Output is correct
34 Correct 2773 ms 84780 KB Output is correct
35 Correct 1875 ms 63188 KB Output is correct
36 Correct 1299 ms 7228 KB Output is correct
37 Correct 1284 ms 7156 KB Output is correct
38 Correct 3257 ms 84756 KB Output is correct
39 Correct 1463 ms 84844 KB Output is correct
40 Correct 2102 ms 55820 KB Output is correct
41 Correct 4371 ms 84796 KB Output is correct
42 Correct 488 ms 84772 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 806 ms 2472 KB Output is correct
2 Correct 923 ms 2428 KB Output is correct
3 Correct 1012 ms 2440 KB Output is correct
4 Correct 763 ms 2464 KB Output is correct
5 Correct 721 ms 2400 KB Output is correct
6 Correct 738 ms 2392 KB Output is correct
7 Correct 741 ms 2428 KB Output is correct
8 Correct 832 ms 2444 KB Output is correct
9 Correct 809 ms 2584 KB Output is correct
10 Correct 779 ms 2500 KB Output is correct
11 Correct 800 ms 2644 KB Output is correct
12 Correct 777 ms 2508 KB Output is correct
13 Correct 783 ms 2512 KB Output is correct
14 Correct 765 ms 2504 KB Output is correct
15 Correct 793 ms 2500 KB Output is correct
16 Correct 763 ms 2384 KB Output is correct
17 Correct 772 ms 2464 KB Output is correct
18 Correct 961 ms 2428 KB Output is correct
19 Correct 1504 ms 2372 KB Output is correct
20 Correct 1729 ms 2472 KB Output is correct
21 Correct 873 ms 2488 KB Output is correct
22 Correct 765 ms 2432 KB Output is correct
23 Correct 896 ms 2592 KB Output is correct
24 Correct 850 ms 2428 KB Output is correct
25 Correct 923 ms 2720 KB Output is correct
26 Correct 808 ms 2496 KB Output is correct
27 Correct 883 ms 2516 KB Output is correct
28 Correct 781 ms 2184 KB Output is correct
29 Correct 911 ms 2796 KB Output is correct
30 Correct 777 ms 2216 KB Output is correct
31 Correct 1206 ms 2504 KB Output is correct
32 Correct 1175 ms 2508 KB Output is correct
33 Correct 1212 ms 2492 KB Output is correct
34 Correct 1034 ms 2368 KB Output is correct
35 Correct 1189 ms 2424 KB Output is correct
36 Correct 1216 ms 2424 KB Output is correct
37 Correct 1193 ms 2500 KB Output is correct
38 Correct 1211 ms 2452 KB Output is correct
39 Correct 1195 ms 2524 KB Output is correct
40 Correct 1238 ms 2572 KB Output is correct
41 Correct 1184 ms 2544 KB Output is correct
42 Correct 1263 ms 2476 KB Output is correct
43 Correct 1132 ms 2568 KB Output is correct
44 Correct 1227 ms 2636 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 806 ms 2472 KB Output is correct
2 Correct 923 ms 2428 KB Output is correct
3 Correct 1012 ms 2440 KB Output is correct
4 Correct 763 ms 2464 KB Output is correct
5 Correct 721 ms 2400 KB Output is correct
6 Correct 738 ms 2392 KB Output is correct
7 Correct 741 ms 2428 KB Output is correct
8 Correct 832 ms 2444 KB Output is correct
9 Correct 809 ms 2584 KB Output is correct
10 Correct 779 ms 2500 KB Output is correct
11 Correct 800 ms 2644 KB Output is correct
12 Correct 777 ms 2508 KB Output is correct
13 Correct 783 ms 2512 KB Output is correct
14 Correct 765 ms 2504 KB Output is correct
15 Correct 793 ms 2500 KB Output is correct
16 Correct 763 ms 2384 KB Output is correct
17 Correct 772 ms 2464 KB Output is correct
18 Correct 961 ms 2428 KB Output is correct
19 Correct 3867 ms 84784 KB Output is correct
20 Correct 3776 ms 84768 KB Output is correct
21 Correct 2051 ms 79824 KB Output is correct
22 Correct 2133 ms 71704 KB Output is correct
23 Correct 1317 ms 7048 KB Output is correct
24 Correct 1332 ms 6968 KB Output is correct
25 Correct 2211 ms 84796 KB Output is correct
26 Correct 2348 ms 84772 KB Output is correct
27 Correct 2769 ms 84832 KB Output is correct
28 Correct 2844 ms 84748 KB Output is correct
29 Correct 2604 ms 82436 KB Output is correct
30 Correct 1497 ms 7160 KB Output is correct
31 Correct 2695 ms 84764 KB Output is correct
32 Correct 2672 ms 77408 KB Output is correct
33 Correct 1339 ms 7124 KB Output is correct
34 Correct 2773 ms 84780 KB Output is correct
35 Correct 1875 ms 63188 KB Output is correct
36 Correct 1299 ms 7228 KB Output is correct
37 Correct 1284 ms 7156 KB Output is correct
38 Correct 3257 ms 84756 KB Output is correct
39 Correct 1463 ms 84844 KB Output is correct
40 Correct 2102 ms 55820 KB Output is correct
41 Correct 4371 ms 84796 KB Output is correct
42 Correct 488 ms 84772 KB Output is correct
43 Correct 1504 ms 2372 KB Output is correct
44 Correct 1729 ms 2472 KB Output is correct
45 Correct 873 ms 2488 KB Output is correct
46 Correct 765 ms 2432 KB Output is correct
47 Correct 896 ms 2592 KB Output is correct
48 Correct 850 ms 2428 KB Output is correct
49 Correct 923 ms 2720 KB Output is correct
50 Correct 808 ms 2496 KB Output is correct
51 Correct 883 ms 2516 KB Output is correct
52 Correct 781 ms 2184 KB Output is correct
53 Correct 911 ms 2796 KB Output is correct
54 Correct 777 ms 2216 KB Output is correct
55 Correct 1206 ms 2504 KB Output is correct
56 Correct 1175 ms 2508 KB Output is correct
57 Correct 1212 ms 2492 KB Output is correct
58 Correct 1034 ms 2368 KB Output is correct
59 Correct 1189 ms 2424 KB Output is correct
60 Correct 1216 ms 2424 KB Output is correct
61 Correct 1193 ms 2500 KB Output is correct
62 Correct 1211 ms 2452 KB Output is correct
63 Correct 1195 ms 2524 KB Output is correct
64 Correct 1238 ms 2572 KB Output is correct
65 Correct 1184 ms 2544 KB Output is correct
66 Correct 1263 ms 2476 KB Output is correct
67 Correct 1132 ms 2568 KB Output is correct
68 Correct 1227 ms 2636 KB Output is correct
69 Execution timed out 7022 ms 78936 KB Time limit exceeded
70 Halted 0 ms 0 KB -