Submission #973184

#	Time	Username	Problem	Language	Result	Execution time	Memory
973184		duckindog	Selling RNA Strands (JOI16_selling_rna)	C++17	10 / 100	413 ms	585556 KiB

selling_rna

#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) {}

  void update(int value, int pass) {
    ma = max(ma, value);
    mi = min(mi, value);
    sz += pass;
  }
};
 
struct Trie { 
  bool pass;
  // int nwt[N][4], ma[N], mi[N], sz[N], it;
  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 (stderr)

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:37:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   37 |   void add(const auto& s, int value) {
      |                  ^~~~
selling_rna.cpp:48:28: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   48 |   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:71:47:   required from here
selling_rna.cpp:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     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:74:39:   required from here
selling_rna.cpp:50:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for (int i = 1; i <= s.size(); ++i) {
      |                     ~~^~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 40