oj.uz

Submission #580897

# Submission time Handle Problem Language Result Execution time Memory
580897 2022-06-22T05:34:02 Z Jarif_Rahman Selling RNA Strands (JOI16_selling_rna) C++17
100 / 100
 810 ms 326532 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

const ll A = 11;
const ll B = 988144425;

int id(char c){
    if(c == 'A') return 0;
    if(c == 'C') return 1;
    if(c == 'G') return 2;
    return 3;
}

unordered_set<ll> st;

struct Trie{
    vector<vector<int>> trie;
    vector<unordered_map<ll, int>> sth;
    vector<vector<pair<ll, int>>>  queries;
    vector<int> ans;

    Trie(){
        trie.pb(vector<int>(4, -1));
        sth.pb(unordered_map<ll, int>());
        queries.pb(vector<pair<ll, int>>());
    }

    void add(str s){
        int nd = 0;
        for(int i = 0; i < s.size(); i++){
            if(trie[nd][id(s[i])] == -1){
                trie[nd][id(s[i])] = trie.size();
                sth.pb(unordered_map<ll, int>());
                queries.pb(vector<pair<ll, int>>());
                trie.pb(vector<int>(4, -1));
            }
            nd = trie[nd][id(s[i])];
        }
        ll h = 0;
        for(int i = int(s.size())-1; i >= 0; i--){
            h*=A, h%=B;
            h+=id(s[i])+1, h%=B;
            if(st.find(h) != st.end()) sth[nd][h]++;
        }
    }

    void add_query(int in, str p, ll h){
        int nd = 0;
        for(int i = 0; i < p.size(); i++){
            nd = trie[nd][id(p[i])];
            if(nd == -1) return;
        }
        queries[nd].pb({h, in});
    }

    void small_to_large(unordered_map<ll, int> &mp1, unordered_map<ll, int> &mp2){
        if(mp1.size() < mp2.size()) swap(mp1, mp2);
        for(auto [a, b]: mp2) mp1[a]+=b;
        mp2.clear();
    }

    void dfs(int nd = 0){
        for(int i = 0; i < 4; i++) if(trie[nd][i] != -1) dfs(trie[nd][i]);
        for(int i = 0; i < 4; i++) if(trie[nd][i] != -1) small_to_large(sth[nd], sth[trie[nd][i]]);
        for(auto [h, in]: queries[nd]) ans[in] = sth[nd][h];
    }

};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m; cin >> n >> m;

    Trie trie;
    trie.ans.resize(m, 0);

    vector<str> v;
    vector<pair<str, ll>> qq;

    for(int i = 0; i < n; i++){
        str s; cin >> s;
        v.pb(s);
    }

    for(int i = 0; i < m; i++){
        str p, q; cin >> p >> q;
        ll h = 0;
        for(int i = int(q.size())-1; i >= 0; i--){
            h*=A, h%=B;
            h+=id(q[i])+1, h%=B;
        }
        st.insert(h);
        qq.pb({p, h});
    }

    for(str s: v) trie.add(s);
    for(int i = 0; i < m; i++) trie.add_query(i, qq[i].f, qq[i].sc);

    trie.dfs();

    for(int x: trie.ans) cout << x << "\n";
}

Compilation message

selling_rna.cpp: In member function 'void Trie::add(str)':
selling_rna.cpp:35:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for(int i = 0; i < s.size(); i++){
      |                        ~~^~~~~~~~~~
selling_rna.cpp: In member function 'void Trie::add_query(int, str, ll)':
selling_rna.cpp:54:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for(int i = 0; i < p.size(); i++){
      |                        ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 9132 KB Output is correct
2 Correct 96 ms 11000 KB Output is correct
3 Correct 682 ms 326532 KB Output is correct
4 Correct 810 ms 323276 KB Output is correct
5 Correct 406 ms 218996 KB Output is correct
6 Correct 420 ms 218872 KB Output is correct
7 Correct 338 ms 61488 KB Output is correct
8 Correct 293 ms 132940 KB Output is correct
9 Correct 261 ms 120584 KB Output is correct
10 Correct 300 ms 118616 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5964 KB Output is correct
2 Correct 19 ms 4096 KB Output is correct
3 Correct 24 ms 5668 KB Output is correct
4 Correct 18 ms 5384 KB Output is correct
5 Correct 24 ms 4416 KB Output is correct
6 Correct 22 ms 5676 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 83 ms 9132 KB Output is correct
9 Correct 96 ms 11000 KB Output is correct
10 Correct 682 ms 326532 KB Output is correct
11 Correct 810 ms 323276 KB Output is correct
12 Correct 406 ms 218996 KB Output is correct
13 Correct 420 ms 218872 KB Output is correct
14 Correct 338 ms 61488 KB Output is correct
15 Correct 293 ms 132940 KB Output is correct
16 Correct 261 ms 120584 KB Output is correct
17 Correct 300 ms 118616 KB Output is correct
18 Correct 24 ms 5964 KB Output is correct
19 Correct 19 ms 4096 KB Output is correct
20 Correct 24 ms 5668 KB Output is correct
21 Correct 18 ms 5384 KB Output is correct
22 Correct 24 ms 4416 KB Output is correct
23 Correct 22 ms 5676 KB Output is correct
24 Correct 99 ms 13280 KB Output is correct
25 Correct 114 ms 15872 KB Output is correct
26 Correct 107 ms 12160 KB Output is correct
27 Correct 607 ms 279252 KB Output is correct
28 Correct 174 ms 21816 KB Output is correct
29 Correct 76 ms 14160 KB Output is correct