oj.uz

Submission #972582

# Submission time Handle Problem Language Result Execution time Memory
972582 2024-04-30T16:32:13 Z duckindog Selling RNA Strands (JOI16_selling_rna) C++17
35 / 100
 898 ms 1048576 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1'000'000 + 10;
int n, m;
string str[N];
string st[N], ed[N];

int convert(const auto& a) { return a == 'A' ? 0 : a == 'C' ? 1 : a == 'G' ? 2 : 3; }
int nwt[N << 2][4];
bool mk[N << 2];

struct Trie {
  int it;
  vector<array<int, 4>> nwt;
  vector<int> sz;
 
  Trie() : nwt(1), sz(1) {}

  void add(string s) {
    int g = 0;
    for (int i = 1; i <= (int)s.size(); ++i) {
      while (nwt.size() <= g) nwt.push_back(array<int, 4>());

      int path = convert(s[i - 1]);
      if (!nwt[g][path]) nwt[g][path] = ++it;
      g = nwt[g][path];

      while (sz.size() <= it) sz.push_back(0);
      sz[g] += 1;
    }
  }

  int get(string s) { 
    int g = 0;
    for (int i = 1; i <= (int)s.size(); ++i) {
      int path = convert(s[i - 1]);
      if (!nwt[g][path]) return 0;
      g = nwt[g][path];
    }
    return sz[g];
  }
} T[N << 2];

int it;
void mark(string s) { 
  int g = 0;
  for (int i = 1; i <= (int)s.size(); ++i) { 
    int path = convert(s[i - 1]);
    if (!nwt[g][path]) nwt[g][path] = ++it;
    g = nwt[g][path];
  }
  mk[g] = true;
}
void add(string s) { 
  string rs = string(s.rbegin(), s.rend());
  int g = 0;
  for (int i = 1; i <= (int)s.size(); ++i) { 
    int path = convert(s[i - 1]);
    if (!nwt[g][path]) nwt[g][path] = ++it;
    g = nwt[g][path];
    if (mk[g]) T[g].add(rs);
  }
}

int get(string s, const auto& e) { 
  int g = 0;
  for (int i = 1; i <= (int)s.size(); ++i) { 
    int path = convert(s[i - 1]);
    g = nwt[g][path];
  }
  return T[g].get(string(e.rbegin(), e.rend()));
}

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> m;

  for (int i = 1; i <= n; ++i) cin >> str[i];
  for (int i = 1; i <= m; ++i) cin >> st[i] >> ed[i];

  for (int i = 1; i <= m; ++i) mark(st[i]);
  for (int i = 1; i <= n; ++i) add(str[i]);
  
  for (int i = 1; i <= m; ++i) cout << get(st[i], ed[i]) << "\n";
}

Compilation message

selling_rna.cpp:10:19: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   10 | int convert(const auto& a) { return a == 'A' ? 0 : a == 'C' ? 1 : a == 'G' ? 2 : 3; }
      |                   ^~~~
selling_rna.cpp: In member function 'void Trie::add(std::string)':
selling_rna.cpp:24:25: warning: comparison of integer expressions of different signedness: 'std::vector<std::array<int, 4> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |       while (nwt.size() <= g) nwt.push_back(array<int, 4>());
      |              ~~~~~~~~~~~^~~~
selling_rna.cpp:30:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |       while (sz.size() <= it) sz.push_back(0);
      |              ~~~~~~~~~~^~~~~
selling_rna.cpp: At global scope:
selling_rna.cpp:67:25: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   67 | int get(string s, const auto& e) {
      |                         ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 484 ms 564652 KB Output is correct
2 Correct 354 ms 564308 KB Output is correct
3 Correct 419 ms 564412 KB Output is correct
4 Correct 376 ms 564152 KB Output is correct
5 Correct 351 ms 564484 KB Output is correct
6 Correct 348 ms 564308 KB Output is correct
7 Correct 345 ms 564308 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 898 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 565108 KB Output is correct
2 Correct 433 ms 565752 KB Output is correct
3 Correct 433 ms 565584 KB Output is correct
4 Correct 355 ms 564816 KB Output is correct
5 Correct 426 ms 565492 KB Output is correct
6 Correct 434 ms 565124 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 484 ms 564652 KB Output is correct
2 Correct 354 ms 564308 KB Output is correct
3 Correct 419 ms 564412 KB Output is correct
4 Correct 376 ms 564152 KB Output is correct
5 Correct 351 ms 564484 KB Output is correct
6 Correct 348 ms 564308 KB Output is correct
7 Correct 345 ms 564308 KB Output is correct
8 Runtime error 898 ms 1048576 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -