oj.uz

답안 #1037107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037107 2024-07-28T05:48:50 Z juicy Crossing (JOI21_crossing) C++17
26 / 100
 114 ms 15956 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 2e5 + 5, base = 311;

int n, q;
long long pw[N], pf[N], sum[N], s[4 * N];
int lz[4 * N];
map<long long, bool> mp;
string S;

int conv(char c) {
  return c == 'J' ? 1 : (c == 'O' ? 2 : 3);
}

void bld(int id = 1, int l = 1, int r = n) {
  sum[id] = pf[r - l];
  if (l == r) {
    s[id] = conv(S[l - 1]);
    return;
  }
  int md = (l + r) / 2;
  bld(id * 2, l, md);
  bld(id * 2 + 1, md + 1, r);
  s[id] = s[id * 2] * pw[r - md] + s[id * 2 + 1];
}

void app(int id, int x) {
  s[id] = sum[id] * x;
  lz[id] = x;
}

void psh(int id) {
  if (lz[id]) {
    app(id * 2, lz[id]);
    app(id * 2 + 1, lz[id]);
    lz[id] = 0;
  }
}

void upd(int u, int v, int x, int id = 1, int l = 1, int r = n) {
  if (u <= l && r <= v) {
    app(id, x);
    return;
  }
  psh(id);
  int md = (l + r) / 2;
  if (u <= md) {
    upd(u, v, x, id * 2, l, md);
  } 
  if (md < v) {
    upd(u, v, x, id * 2 + 1, md + 1, r);
  }
  s[id] = s[id * 2] * pw[r - md] + s[id * 2 + 1];
}

string cross(const string &a, const string &b) {
  string res;
  for (int i = 0; i < n; ++i) {
    if (a[i] == b[i]) {
      res += a[i];
    } else {
      for (auto c : {'J', 'O', 'I'}) {
        if (c != a[i] && c != b[i]) {
          res += c;
        }
      }
    }
  }
  return res;
}

long long get(const string &s) {
  long long h = 0;
  for (char c : s) {
    h = h * base + conv(c);
  }
  return h;
}

int main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> n;
  vector<string> st;
  for (int i = 0; i < 3; ++i) {
    string s; cin >> s;
    st.push_back(s);
    mp[get(s)] = 1;
  }  
  for (int i = 0; i < 3; ++i) {
    for (int j = i + 1; j < 3; ++j) {
      auto mix = cross(st[i], st[j]);
      auto h = get(mix);
      if (!mp.count(h)) {
        mp[h] = 1;
        st.push_back(mix);
      }
    }
  }
  bool flg = 1;
  while (flg) {
    flg = 0;
    for (int i = 0; i + 1 < st.size(); ++i) {
      auto mix = cross(st[i], st.back());
      auto h = get(mix);
      if (!mp.count(h)) {
        st.push_back(mix);
        mp[h] = 1;
        flg = 1;
        break;
      }
    }
  }
  pw[0] = pf[0] = 1;
  for (int i = 1; i <= n; ++i) {
    pw[i] = pw[i - 1] * base;
    pf[i] = pf[i - 1] + pw[i];
  }
  cin >> q >> S;
  bld();
  auto qry = [&]() {
    cout << (mp.count(s[1]) ? "Yes" : "No") << "\n";
  };
  qry();
  while (q--) {
    int l, r; char c; cin >> l >> r >> c;
    upd(l, r, conv(c));
    qry();
  }
  return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:111:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |     for (int i = 0; i + 1 < st.size(); ++i) {
      |                     ~~~~~~^~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 7004 KB Output is correct
2 Correct 45 ms 7008 KB Output is correct
3 Correct 43 ms 6992 KB Output is correct
4 Correct 42 ms 6996 KB Output is correct
5 Correct 39 ms 7004 KB Output is correct
6 Correct 38 ms 6996 KB Output is correct
7 Correct 42 ms 7004 KB Output is correct
8 Correct 40 ms 7000 KB Output is correct
9 Correct 40 ms 6996 KB Output is correct
10 Correct 40 ms 6996 KB Output is correct
11 Correct 41 ms 7004 KB Output is correct
12 Correct 42 ms 7116 KB Output is correct
13 Correct 43 ms 6996 KB Output is correct
14 Correct 40 ms 6996 KB Output is correct
15 Correct 42 ms 6992 KB Output is correct
16 Correct 41 ms 6996 KB Output is correct
17 Correct 43 ms 6992 KB Output is correct
18 Correct 41 ms 7000 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 7004 KB Output is correct
2 Correct 45 ms 7008 KB Output is correct
3 Correct 43 ms 6992 KB Output is correct
4 Correct 42 ms 6996 KB Output is correct
5 Correct 39 ms 7004 KB Output is correct
6 Correct 38 ms 6996 KB Output is correct
7 Correct 42 ms 7004 KB Output is correct
8 Correct 40 ms 7000 KB Output is correct
9 Correct 40 ms 6996 KB Output is correct
10 Correct 40 ms 6996 KB Output is correct
11 Correct 41 ms 7004 KB Output is correct
12 Correct 42 ms 7116 KB Output is correct
13 Correct 43 ms 6996 KB Output is correct
14 Correct 40 ms 6996 KB Output is correct
15 Correct 42 ms 6992 KB Output is correct
16 Correct 41 ms 6996 KB Output is correct
17 Correct 43 ms 6992 KB Output is correct
18 Correct 41 ms 7000 KB Output is correct
19 Correct 110 ms 15956 KB Output is correct
20 Correct 114 ms 14420 KB Output is correct
21 Incorrect 86 ms 15880 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 7004 KB Output is correct
2 Correct 45 ms 7008 KB Output is correct
3 Correct 43 ms 6992 KB Output is correct
4 Correct 42 ms 6996 KB Output is correct
5 Correct 39 ms 7004 KB Output is correct
6 Correct 38 ms 6996 KB Output is correct
7 Correct 42 ms 7004 KB Output is correct
8 Correct 40 ms 7000 KB Output is correct
9 Correct 40 ms 6996 KB Output is correct
10 Correct 40 ms 6996 KB Output is correct
11 Correct 41 ms 7004 KB Output is correct
12 Correct 42 ms 7116 KB Output is correct
13 Correct 43 ms 6996 KB Output is correct
14 Correct 40 ms 6996 KB Output is correct
15 Correct 42 ms 6992 KB Output is correct
16 Correct 41 ms 6996 KB Output is correct
17 Correct 43 ms 6992 KB Output is correct
18 Correct 41 ms 7000 KB Output is correct
19 Correct 46 ms 6996 KB Output is correct
20 Correct 52 ms 7132 KB Output is correct
21 Correct 42 ms 7004 KB Output is correct
22 Correct 37 ms 7000 KB Output is correct
23 Correct 43 ms 7164 KB Output is correct
24 Correct 40 ms 6988 KB Output is correct
25 Correct 42 ms 6992 KB Output is correct
26 Correct 42 ms 7004 KB Output is correct
27 Correct 56 ms 7012 KB Output is correct
28 Correct 41 ms 6992 KB Output is correct
29 Correct 48 ms 7180 KB Output is correct
30 Correct 39 ms 6996 KB Output is correct
31 Correct 44 ms 6996 KB Output is correct
32 Correct 43 ms 7052 KB Output is correct
33 Correct 50 ms 6996 KB Output is correct
34 Correct 40 ms 6992 KB Output is correct
35 Correct 45 ms 7008 KB Output is correct
36 Correct 50 ms 6992 KB Output is correct
37 Correct 44 ms 7132 KB Output is correct
38 Correct 44 ms 7000 KB Output is correct
39 Correct 44 ms 6996 KB Output is correct
40 Correct 45 ms 6992 KB Output is correct
41 Correct 44 ms 7076 KB Output is correct
42 Correct 46 ms 6992 KB Output is correct
43 Correct 48 ms 7164 KB Output is correct
44 Correct 44 ms 7160 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 7004 KB Output is correct
2 Correct 45 ms 7008 KB Output is correct
3 Correct 43 ms 6992 KB Output is correct
4 Correct 42 ms 6996 KB Output is correct
5 Correct 39 ms 7004 KB Output is correct
6 Correct 38 ms 6996 KB Output is correct
7 Correct 42 ms 7004 KB Output is correct
8 Correct 40 ms 7000 KB Output is correct
9 Correct 40 ms 6996 KB Output is correct
10 Correct 40 ms 6996 KB Output is correct
11 Correct 41 ms 7004 KB Output is correct
12 Correct 42 ms 7116 KB Output is correct
13 Correct 43 ms 6996 KB Output is correct
14 Correct 40 ms 6996 KB Output is correct
15 Correct 42 ms 6992 KB Output is correct
16 Correct 41 ms 6996 KB Output is correct
17 Correct 43 ms 6992 KB Output is correct
18 Correct 41 ms 7000 KB Output is correct
19 Correct 110 ms 15956 KB Output is correct
20 Correct 114 ms 14420 KB Output is correct
21 Incorrect 86 ms 15880 KB Output isn't correct
22 Halted 0 ms 0 KB -