oj.uz

답안 #973089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973089 2024-05-01T13:37:49 Z duckindog Selling RNA Strands (JOI16_selling_rna) C++17
35 / 100
 60 ms 82000 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 100'000 + 10;
int n, m;
string str[N];
string s[N], e[N];
 
int convert(const auto& a) { return a == 'A' ? 0 : a == 'C' ? 1 : a == 'G' ? 2 : 3; }

struct Trie { 
  bool pass;
  int nwt[N << 3][4], ma[N << 3], mi[N << 3], sz[N << 3], it;

  Trie() {
    memset(mi, 63, sizeof mi);
  }

  void clear() { 
    memset(nwt, 0, sizeof nwt);
    memset(ma, 0, sizeof ma);
    memset(mi, 0, sizeof mi);
    it = 0;
    pass = true;
  }

  void add(const auto& s, const int& node) {
    int g = 0;
    for (int i = 1; i <= s.size(); ++i) { 
      int path = convert(s[i - 1]);
      if (!nwt[g][path]) nwt[g][path] = ++it;
      g = nwt[g][path];

      ma[g] = max(ma[g], node);
      mi[g] = min(mi[g], node);
      sz[g] += pass;
    }
  }

  pair<int, int> que(const auto& s) { 
    int g = 0;
    for (int i = 1; i <= s.size(); ++i) { 
      int path = convert(s[i - 1]);
      if (!nwt[g][path]) return {0, 0};
      g = nwt[g][path];
    }
    return {pass ? sz[g] : mi[g], ma[g]};
  }

} T;

vector<int> l[N], r[N];

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 >> s[i] >> e[i];

  sort(str + 1, str + n + 1);
  for (int i = 1; i <= n; ++i) T.add(str[i], i);
  for (int i = 1; i <= m; ++i) {
    reverse(e[i].begin(), e[i].end());
    const auto& [st, ed] = (T.que(s[i]));
    if (st) l[st - 1].push_back(i);
    r[ed].push_back(i);
  }
  
  T.clear();

  vector<int> answer(m + 1);
  for (int i = 1; i <= n; ++i) {
    T.add(string(str[i].rbegin(), str[i].rend()), i);
    for (const auto& j : l[i]) answer[j] -= T.que(e[j]).first;
    for (const auto& j : r[i]) answer[j] += T.que(e[j]).first;
  }

  for (int i = 1; i <= m; ++i) cout << answer[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:28:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   28 |   void add(const auto& s, const int& node) {
      |                  ^~~~
selling_rna.cpp:41:28: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   41 |   pair<int, int> que(const auto& s) {
      |                            ^~~~
selling_rna.cpp: In instantiation of 'void Trie::add(const auto:24&, const int&) [with auto:24 = std::__cxx11::basic_string<char>]':
selling_rna.cpp:64:47:   required from here
selling_rna.cpp:30:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for (int i = 1; i <= s.size(); ++i) {
      |                     ~~^~~~~~~~~~~
selling_rna.cpp: In instantiation of 'std::pair<int, int> Trie::que(const auto:25&) [with auto:25 = std::__cxx11::basic_string<char>]':
selling_rna.cpp:67:39:   required from here
selling_rna.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (int i = 1; i <= s.size(); ++i) {
      |                     ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 36444 KB Output is correct
2 Correct 8 ms 36408 KB Output is correct
3 Correct 7 ms 36444 KB Output is correct
4 Correct 7 ms 36444 KB Output is correct
5 Correct 7 ms 36236 KB Output is correct
6 Correct 9 ms 36444 KB Output is correct
7 Correct 8 ms 36444 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 60 ms 82000 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 37468 KB Output is correct
2 Correct 21 ms 36952 KB Output is correct
3 Correct 23 ms 37720 KB Output is correct
4 Correct 20 ms 37468 KB Output is correct
5 Correct 22 ms 37236 KB Output is correct
6 Correct 24 ms 37584 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 36444 KB Output is correct
2 Correct 8 ms 36408 KB Output is correct
3 Correct 7 ms 36444 KB Output is correct
4 Correct 7 ms 36444 KB Output is correct
5 Correct 7 ms 36236 KB Output is correct
6 Correct 9 ms 36444 KB Output is correct
7 Correct 8 ms 36444 KB Output is correct
8 Runtime error 60 ms 82000 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -