Submission #972891

#TimeUsernameProblemLanguageResultExecution timeMemory
972891duckindogSelling RNA Strands (JOI16_selling_rna)C++17
60 / 100
1448 ms1048576 KiB
#include <bits/stdc++.h> using namespace std; const int N = 100'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 * 10][4]; bool mk[N * 10]; 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 * 10]; 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())); } namespace sub2 { const int base = 19937; using ull = unsigned long long; ull pw[N]; struct Hash { int n; vector<ull> h; Hash() {} Hash(string s) : n(s.size()), h(s.size() + 1) { pw[0] = 1; for (int i = 1; i <= n; ++i) { h[i] = h[i - 1] * base + s[i - 1]; pw[i] = pw[i - 1] * base; } } ull get(int l, int r) { return h[r] - h[l - 1] * pw[r - l + 1]; } } h[N]; void solve() { for (int i = 1; i <= n; ++i) { string s; cin >> s; h[i] = Hash(s); } while (m--) { string st, ed; cin >> st >> ed; Hash s(st), e(ed); int answer = 0; for (int i = 1; i <= n; ++i) { if (h[i].n < s.n || h[i].n < e.n) continue; answer += (h[i].get(1, s.n) == s.get(1, s.n) && h[i].get(h[i].n - e.n + 1, h[i].n) == e.get(1, e.n)); } cout << answer << "\n"; } } } int32_t main() { cin.tie(0)->sync_with_stdio(0); cin >> n >> m; if (n <= 5000 && m <= 5000) { sub2::solve(); return 0; } 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 (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 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) {
      |                         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...