oj.uz

Submission #973186

# Submission time Handle Problem Language Result Execution time Memory
973186 2024-05-01T15:39:14 Z duckindog Selling RNA Strands (JOI16_selling_rna) C++17
100 / 100
 189 ms 439632 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 2'000'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 Node {
  array<Node*, 4> nwt;
  int ma, mi, sz;

  Node() : mi(1e9), ma(0), sz(0) {
    for (int i = 0; i < 4; ++i) nwt[i] = nullptr;
  }

  void update(int value, int pass) {
    ma = max(ma, value);
    mi = min(mi, value);
    sz += pass;
  }
};
 
struct Trie { 
  bool pass;
  Node* root;
 
  Trie() : root(new Node()) {}
 
  void clear() {
    root = new Node();
    pass = true;
  }
 
  void add(const auto& s, int value) {
    auto g = root;
    for (int i = 1; i <= s.size(); ++i) { 
      int path = convert(s[i - 1]);
      if (!g->nwt[path]) g->nwt[path] = new Node();

      g = g->nwt[path];
      g->update(value, pass);
    }
  }
 
  pair<int, int> que(const auto& s) { 
    auto g = root;
    for (int i = 1; i <= s.size(); ++i) { 
      int path = convert(s[i - 1]);
      if (!g->nwt[path]) return {0, 0};
      g = g->nwt[path];
    }
    return {pass ? g->sz : g->mi, g->ma};
  }
 
} 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: In constructor 'Node::Node()':
selling_rna.cpp:14:11: warning: 'Node::mi' will be initialized after [-Wreorder]
   14 |   int ma, mi, sz;
      |           ^~
selling_rna.cpp:14:7: warning:   'int Node::ma' [-Wreorder]
   14 |   int ma, mi, sz;
      |       ^~
selling_rna.cpp:16:3: warning:   when initialized here [-Wreorder]
   16 |   Node() : mi(1e9), ma(0), sz(0) {
      |   ^~~~
selling_rna.cpp: At global scope:
selling_rna.cpp:38:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   38 |   void add(const auto& s, int value) {
      |                  ^~~~
selling_rna.cpp:49:28: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   49 |   pair<int, int> que(const auto& s) {
      |                            ^~~~
selling_rna.cpp: In instantiation of 'void Trie::add(const auto:24&, int) [with auto:24 = std::__cxx11::basic_string<char>]':
selling_rna.cpp:72:47:   required from here
selling_rna.cpp:40:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     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:75:39:   required from here
selling_rna.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for (int i = 1; i <= s.size(); ++i) {
      |                     ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 282160 KB Output is correct
2 Correct 64 ms 282252 KB Output is correct
3 Correct 65 ms 282192 KB Output is correct
4 Correct 64 ms 282192 KB Output is correct
5 Correct 62 ms 282080 KB Output is correct
6 Correct 65 ms 282324 KB Output is correct
7 Correct 65 ms 282252 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 409940 KB Output is correct
2 Correct 173 ms 403280 KB Output is correct
3 Correct 172 ms 408092 KB Output is correct
4 Correct 185 ms 402016 KB Output is correct
5 Correct 186 ms 437340 KB Output is correct
6 Correct 189 ms 439632 KB Output is correct
7 Correct 91 ms 288244 KB Output is correct
8 Correct 158 ms 378020 KB Output is correct
9 Correct 152 ms 363444 KB Output is correct
10 Correct 134 ms 358604 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 283144 KB Output is correct
2 Correct 74 ms 282964 KB Output is correct
3 Correct 84 ms 283104 KB Output is correct
4 Correct 74 ms 282844 KB Output is correct
5 Correct 74 ms 283156 KB Output is correct
6 Correct 79 ms 282964 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 282160 KB Output is correct
2 Correct 64 ms 282252 KB Output is correct
3 Correct 65 ms 282192 KB Output is correct
4 Correct 64 ms 282192 KB Output is correct
5 Correct 62 ms 282080 KB Output is correct
6 Correct 65 ms 282324 KB Output is correct
7 Correct 65 ms 282252 KB Output is correct
8 Correct 168 ms 409940 KB Output is correct
9 Correct 173 ms 403280 KB Output is correct
10 Correct 172 ms 408092 KB Output is correct
11 Correct 185 ms 402016 KB Output is correct
12 Correct 186 ms 437340 KB Output is correct
13 Correct 189 ms 439632 KB Output is correct
14 Correct 91 ms 288244 KB Output is correct
15 Correct 158 ms 378020 KB Output is correct
16 Correct 152 ms 363444 KB Output is correct
17 Correct 134 ms 358604 KB Output is correct
18 Correct 79 ms 283144 KB Output is correct
19 Correct 74 ms 282964 KB Output is correct
20 Correct 84 ms 283104 KB Output is correct
21 Correct 74 ms 282844 KB Output is correct
22 Correct 74 ms 283156 KB Output is correct
23 Correct 79 ms 282964 KB Output is correct
24 Correct 162 ms 387640 KB Output is correct
25 Correct 166 ms 388432 KB Output is correct
26 Correct 177 ms 386128 KB Output is correct
27 Correct 162 ms 386284 KB Output is correct
28 Correct 147 ms 302420 KB Output is correct
29 Correct 123 ms 284032 KB Output is correct