oj.uz

Submission #668590

# Submission time Handle Problem Language Result Execution time Memory
668590 2022-12-04T08:12:42 Z Shin Selling RNA Strands (JOI16_selling_rna) C++17
35 / 100
 1500 ms 36436 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair

using namespace std;
template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

const char base[] = {'A', 'G', 'C', 'U'};
const int N = 2e6 + 7;
int node[N][4];
int cnt[N];
int ind[26];
int f[N];
string p, q;

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  auto add = [&](string &s) {
    static int num_node = 0;
    int cur = 0;
    for (int i = 0; i < (int) s.size(); i ++) {
      int c = ind[s[i] - 'A'];
      if (node[cur][c] == 0) {
        node[cur][c] = ++ num_node;
      }
      cur = node[cur][c];
    }
    cnt[cur] ++;
  };

  int res = 0;
  function<void(int, int)> bfs = [&](int u, int sz) {
    queue<pair<int, int>> kew({mp(u, f[sz])});
    while (!kew.empty()) {
      auto [u, n_j] = kew.front();
      kew.pop();
      if (n_j >= (int) q.size() - 1) {
        res += cnt[u];
      }
      for (char c: base) if (node[u][ind[c - 'A']]) {
        int j = n_j;
        while (j > 0 && q[j] != c) {
          j = f[j - 1];
        }
        if (q[j] == c) {
          j ++;
        }
        f[sz + 1] = j;
        kew.emplace(node[u][ind[c - 'A']], j);
      }
    }
  };

  for (int i = 0; i < 4; i ++) {
    ind[base[i] - 'A'] = i;
  }
  int n, m; cin >> n >> m;
  for (int i = 1; i <= n; i ++) {
    string s; cin >> s;
    add(s);
  }
  while (m --) {
    cin >> p >> q;
    q += "#";
    res = 0;
    int u = 0, found = true, sz = 0;
    for (int i = 1; i < (int) q.size(); i ++) {
      int j = f[sz];
      while (j > 0 && q[j] != q[i]) {
        j = f[j - 1];
      }
      if (q[j] == q[i]) {
        j ++;
      }
      f[++ sz] = j;
    }
    for (int i = 0; i < (int) p.size(); i ++) {
      if (node[u][ind[p[i] - 'A']] == 0) {
        found = false;
        break;
      }
      int j = f[sz];
      while (j > 0 && q[j] != p[i]) {
        j = f[j - 1];
      }
      if (q[j] == p[i]) {
        j ++;
      }
      f[++ sz] = j;
      u = node[u][ind[p[i] - 'A']];
    }
    if (found) {
      bfs(u, sz);
    }
    cout << res << '\n';
  }
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 344 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 536 KB Output is correct
2 Correct 638 ms 776 KB Output is correct
3 Execution timed out 1538 ms 36436 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 596 KB Output is correct
2 Correct 272 ms 432 KB Output is correct
3 Correct 232 ms 484 KB Output is correct
4 Correct 13 ms 468 KB Output is correct
5 Correct 221 ms 556 KB Output is correct
6 Correct 143 ms 508 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 286 ms 536 KB Output is correct
9 Correct 638 ms 776 KB Output is correct
10 Execution timed out 1538 ms 36436 KB Time limit exceeded
11 Halted 0 ms 0 KB -