oj.uz

Submission #493563

# Submission time Handle Problem Language Result Execution time Memory
493563 2021-12-12T06:21:20 Z 600Mihnea Crossing (JOI21_crossing) C++17
100 / 100
 2088 ms 41644 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

class Node {
public:
  bool stequal = false;
  bool jequal = false;
  bool oequal = false;
  bool iequal = false;
};

class IsEqual {
private:
  string s;
  string t;
  int n;
  vector<Node> tree;
  vector<char> lazy;

  void build(int v, int tl, int tr) {
    if (tl == tr) {
      tree[v].stequal = (s[tl] == t[tl]);
      tree[v].jequal = (s[tl] == 'J');
      tree[v].oequal = (s[tl] == 'O');
      tree[v].iequal = (s[tl] == 'I');

    } else {
      int tm = (tl + tr) / 2;
      build(2 * v, tl, tm);
      build(2 * v + 1, tm + 1, tr);
      tree[v].stequal = tree[2 * v].stequal & tree[2 * v + 1].stequal;
      tree[v].jequal = tree[2 * v].jequal & tree[2 * v + 1].jequal;
      tree[v].oequal = tree[2 * v].oequal & tree[2 * v + 1].oequal;
      tree[v].iequal = tree[2 * v].iequal & tree[2 * v + 1].iequal;
    }
  }

  void modify(int v, int tl, int tr, int l, int r, char ch) {
    if (lazy[v] != 'X') { 
      if (lazy[v] == 'J') {
        tree[v].stequal = tree[v].jequal;
      } else {
        if (lazy[v] == 'O') {
          tree[v].stequal = tree[v].oequal;
        } else {
          tree[v].stequal = tree[v].iequal;
        }
      }
      if (tl < tr) {
        lazy[2 * v] = lazy[2 * v + 1] = lazy[v];
      }
      lazy[v] = 'X';
    }
    if (tr < l || r < tl) {
      return;
    }
    if (l <= tl && tr <= r) {
      lazy[v] = ch;
      if (lazy[v] == 'J') {
        tree[v].stequal = tree[v].jequal;
      } else {
        if (lazy[v] == 'O') {
          tree[v].stequal = tree[v].oequal;
        } else {
          tree[v].stequal = tree[v].iequal;
        }
      }
      if (tl < tr) {
        lazy[2 * v] = lazy[2 * v + 1] = lazy[v];
      }
      lazy[v] = 'X';
    } else {
      int tm = (tl + tr) / 2;
      modify(2 * v, tl, tm, l, r, ch);
      modify(2 * v + 1, tm + 1, tr, l, r, ch);
      tree[v].stequal = tree[2 * v].stequal & tree[2 * v + 1].stequal;
    }
  }

public:

  IsEqual(string s, string t) : s(s), t(t), n((int) s.size()), tree(4 * ((int) s.size() + 7)), lazy(4 * ((int) s.size()), 'X') {
    build(1, 0, n - 1);
  }

  void modify(int l, int r, char ch) {
    l--;
    r--;
    modify(1, 0, n - 1, l, r, ch);
  }

  bool isEqual() {
    return tree[1].stequal;
  }
};

string operator + (string s, string t) {
  for (int i = 0; i < (int) s.size(); i++) {
    if (s[i] != t[i]) {
      int x = 'J' + 'O' + 'I' - s[i] - t[i];
      s[i] = x;
    }
  }
  return s;
}

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

  int n, q;
  string a, b, c, t;
  vector<IsEqual> all;
  cin >> n >> a >> b >> c >> q >> t;

  all.push_back({a, t});
  all.push_back({b, t});
  all.push_back({c, t});
  all.push_back({a + b, t});
  all.push_back({b + c, t});
  all.push_back({c + a, t});
  all.push_back({a + (b + c), t});
  all.push_back({b + (c + a), t});
  all.push_back({c + (a + b), t});


  function <string()> solve = [&] () {
    bool ok = false;
    for (auto &x : all) {
      ok |= x.isEqual();
    }
    if (ok) {
      return "Yes";
    } else {
      return "No";
    }
  };

  cout << solve() << "\n";

  while (q--) {
    int l, r;
    string ch;
    cin >> l >> r >> ch;
    for (auto& x : all) {
      x.modify(l, r, ch[0]);
    }
    cout << solve() << "\n";
  }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 924 KB Output is correct
2 Correct 385 ms 812 KB Output is correct
3 Correct 450 ms 892 KB Output is correct
4 Correct 276 ms 800 KB Output is correct
5 Correct 275 ms 856 KB Output is correct
6 Correct 274 ms 868 KB Output is correct
7 Correct 280 ms 964 KB Output is correct
8 Correct 297 ms 900 KB Output is correct
9 Correct 298 ms 940 KB Output is correct
10 Correct 301 ms 956 KB Output is correct
11 Correct 308 ms 908 KB Output is correct
12 Correct 307 ms 1224 KB Output is correct
13 Correct 308 ms 848 KB Output is correct
14 Correct 298 ms 964 KB Output is correct
15 Correct 306 ms 872 KB Output is correct
16 Correct 301 ms 860 KB Output is correct
17 Correct 301 ms 848 KB Output is correct
18 Correct 403 ms 976 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 924 KB Output is correct
2 Correct 385 ms 812 KB Output is correct
3 Correct 450 ms 892 KB Output is correct
4 Correct 276 ms 800 KB Output is correct
5 Correct 275 ms 856 KB Output is correct
6 Correct 274 ms 868 KB Output is correct
7 Correct 280 ms 964 KB Output is correct
8 Correct 297 ms 900 KB Output is correct
9 Correct 298 ms 940 KB Output is correct
10 Correct 301 ms 956 KB Output is correct
11 Correct 308 ms 908 KB Output is correct
12 Correct 307 ms 1224 KB Output is correct
13 Correct 308 ms 848 KB Output is correct
14 Correct 298 ms 964 KB Output is correct
15 Correct 306 ms 872 KB Output is correct
16 Correct 301 ms 860 KB Output is correct
17 Correct 301 ms 848 KB Output is correct
18 Correct 403 ms 976 KB Output is correct
19 Correct 1876 ms 41304 KB Output is correct
20 Correct 1724 ms 41276 KB Output is correct
21 Correct 996 ms 38864 KB Output is correct
22 Correct 1025 ms 35140 KB Output is correct
23 Correct 573 ms 3012 KB Output is correct
24 Correct 572 ms 2956 KB Output is correct
25 Correct 1063 ms 41360 KB Output is correct
26 Correct 1110 ms 41388 KB Output is correct
27 Correct 1375 ms 41376 KB Output is correct
28 Correct 1360 ms 41304 KB Output is correct
29 Correct 1335 ms 40168 KB Output is correct
30 Correct 650 ms 3112 KB Output is correct
31 Correct 1339 ms 41220 KB Output is correct
32 Correct 1337 ms 37636 KB Output is correct
33 Correct 574 ms 2916 KB Output is correct
34 Correct 1376 ms 41260 KB Output is correct
35 Correct 897 ms 30892 KB Output is correct
36 Correct 578 ms 2924 KB Output is correct
37 Correct 542 ms 3032 KB Output is correct
38 Correct 1461 ms 41324 KB Output is correct
39 Correct 630 ms 41380 KB Output is correct
40 Correct 946 ms 27396 KB Output is correct
41 Correct 2088 ms 41644 KB Output is correct
42 Correct 119 ms 41420 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 924 KB Output is correct
2 Correct 385 ms 812 KB Output is correct
3 Correct 450 ms 892 KB Output is correct
4 Correct 276 ms 800 KB Output is correct
5 Correct 275 ms 856 KB Output is correct
6 Correct 274 ms 868 KB Output is correct
7 Correct 280 ms 964 KB Output is correct
8 Correct 297 ms 900 KB Output is correct
9 Correct 298 ms 940 KB Output is correct
10 Correct 301 ms 956 KB Output is correct
11 Correct 308 ms 908 KB Output is correct
12 Correct 307 ms 1224 KB Output is correct
13 Correct 308 ms 848 KB Output is correct
14 Correct 298 ms 964 KB Output is correct
15 Correct 306 ms 872 KB Output is correct
16 Correct 301 ms 860 KB Output is correct
17 Correct 301 ms 848 KB Output is correct
18 Correct 403 ms 976 KB Output is correct
19 Correct 367 ms 876 KB Output is correct
20 Correct 460 ms 892 KB Output is correct
21 Correct 295 ms 828 KB Output is correct
22 Correct 264 ms 760 KB Output is correct
23 Correct 304 ms 880 KB Output is correct
24 Correct 282 ms 876 KB Output is correct
25 Correct 305 ms 916 KB Output is correct
26 Correct 272 ms 880 KB Output is correct
27 Correct 294 ms 896 KB Output is correct
28 Correct 270 ms 1004 KB Output is correct
29 Correct 298 ms 804 KB Output is correct
30 Correct 260 ms 848 KB Output is correct
31 Correct 297 ms 836 KB Output is correct
32 Correct 291 ms 836 KB Output is correct
33 Correct 312 ms 896 KB Output is correct
34 Correct 265 ms 868 KB Output is correct
35 Correct 305 ms 924 KB Output is correct
36 Correct 307 ms 972 KB Output is correct
37 Correct 300 ms 884 KB Output is correct
38 Correct 304 ms 980 KB Output is correct
39 Correct 297 ms 836 KB Output is correct
40 Correct 302 ms 860 KB Output is correct
41 Correct 300 ms 908 KB Output is correct
42 Correct 311 ms 892 KB Output is correct
43 Correct 279 ms 892 KB Output is correct
44 Correct 303 ms 1092 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 924 KB Output is correct
2 Correct 385 ms 812 KB Output is correct
3 Correct 450 ms 892 KB Output is correct
4 Correct 276 ms 800 KB Output is correct
5 Correct 275 ms 856 KB Output is correct
6 Correct 274 ms 868 KB Output is correct
7 Correct 280 ms 964 KB Output is correct
8 Correct 297 ms 900 KB Output is correct
9 Correct 298 ms 940 KB Output is correct
10 Correct 301 ms 956 KB Output is correct
11 Correct 308 ms 908 KB Output is correct
12 Correct 307 ms 1224 KB Output is correct
13 Correct 308 ms 848 KB Output is correct
14 Correct 298 ms 964 KB Output is correct
15 Correct 306 ms 872 KB Output is correct
16 Correct 301 ms 860 KB Output is correct
17 Correct 301 ms 848 KB Output is correct
18 Correct 403 ms 976 KB Output is correct
19 Correct 1876 ms 41304 KB Output is correct
20 Correct 1724 ms 41276 KB Output is correct
21 Correct 996 ms 38864 KB Output is correct
22 Correct 1025 ms 35140 KB Output is correct
23 Correct 573 ms 3012 KB Output is correct
24 Correct 572 ms 2956 KB Output is correct
25 Correct 1063 ms 41360 KB Output is correct
26 Correct 1110 ms 41388 KB Output is correct
27 Correct 1375 ms 41376 KB Output is correct
28 Correct 1360 ms 41304 KB Output is correct
29 Correct 1335 ms 40168 KB Output is correct
30 Correct 650 ms 3112 KB Output is correct
31 Correct 1339 ms 41220 KB Output is correct
32 Correct 1337 ms 37636 KB Output is correct
33 Correct 574 ms 2916 KB Output is correct
34 Correct 1376 ms 41260 KB Output is correct
35 Correct 897 ms 30892 KB Output is correct
36 Correct 578 ms 2924 KB Output is correct
37 Correct 542 ms 3032 KB Output is correct
38 Correct 1461 ms 41324 KB Output is correct
39 Correct 630 ms 41380 KB Output is correct
40 Correct 946 ms 27396 KB Output is correct
41 Correct 2088 ms 41644 KB Output is correct
42 Correct 119 ms 41420 KB Output is correct
43 Correct 367 ms 876 KB Output is correct
44 Correct 460 ms 892 KB Output is correct
45 Correct 295 ms 828 KB Output is correct
46 Correct 264 ms 760 KB Output is correct
47 Correct 304 ms 880 KB Output is correct
48 Correct 282 ms 876 KB Output is correct
49 Correct 305 ms 916 KB Output is correct
50 Correct 272 ms 880 KB Output is correct
51 Correct 294 ms 896 KB Output is correct
52 Correct 270 ms 1004 KB Output is correct
53 Correct 298 ms 804 KB Output is correct
54 Correct 260 ms 848 KB Output is correct
55 Correct 297 ms 836 KB Output is correct
56 Correct 291 ms 836 KB Output is correct
57 Correct 312 ms 896 KB Output is correct
58 Correct 265 ms 868 KB Output is correct
59 Correct 305 ms 924 KB Output is correct
60 Correct 307 ms 972 KB Output is correct
61 Correct 300 ms 884 KB Output is correct
62 Correct 304 ms 980 KB Output is correct
63 Correct 297 ms 836 KB Output is correct
64 Correct 302 ms 860 KB Output is correct
65 Correct 300 ms 908 KB Output is correct
66 Correct 311 ms 892 KB Output is correct
67 Correct 279 ms 892 KB Output is correct
68 Correct 303 ms 1092 KB Output is correct
69 Correct 1576 ms 34644 KB Output is correct
70 Correct 1789 ms 41372 KB Output is correct
71 Correct 563 ms 2968 KB Output is correct
72 Correct 566 ms 2948 KB Output is correct
73 Correct 588 ms 3148 KB Output is correct
74 Correct 988 ms 34664 KB Output is correct
75 Correct 544 ms 3056 KB Output is correct
76 Correct 1074 ms 41200 KB Output is correct
77 Correct 1030 ms 34604 KB Output is correct
78 Correct 587 ms 2932 KB Output is correct
79 Correct 557 ms 3056 KB Output is correct
80 Correct 959 ms 29464 KB Output is correct
81 Correct 565 ms 2924 KB Output is correct
82 Correct 1119 ms 41244 KB Output is correct
83 Correct 1129 ms 38764 KB Output is correct
84 Correct 568 ms 2856 KB Output is correct
85 Correct 571 ms 2964 KB Output is correct
86 Correct 1256 ms 31524 KB Output is correct
87 Correct 1334 ms 41388 KB Output is correct
88 Correct 646 ms 2992 KB Output is correct
89 Correct 1168 ms 36624 KB Output is correct
90 Correct 1258 ms 41336 KB Output is correct
91 Correct 642 ms 3060 KB Output is correct
92 Correct 915 ms 31204 KB Output is correct
93 Correct 588 ms 3124 KB Output is correct
94 Correct 554 ms 2904 KB Output is correct
95 Correct 585 ms 2980 KB Output is correct
96 Correct 1486 ms 41448 KB Output is correct
97 Correct 640 ms 41460 KB Output is correct
98 Correct 962 ms 27600 KB Output is correct
99 Correct 2045 ms 41496 KB Output is correct
100 Correct 132 ms 41424 KB Output is correct