oj.uz

Submission #982680

# Submission time Handle Problem Language Result Execution time Memory
982680 2024-05-14T15:57:55 Z kh0i Selling RNA Strands (JOI16_selling_rna) C++17
0 / 100
 167 ms 148216 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif

using ll = long long;
using pii = pair<int, int>;

#define F first
#define S second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll get_rand(ll l, ll r) {
    assert(l <= r);
    return uniform_int_distribution<ll> (l, r)(rng);
}

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

struct Trie{
    struct Node{
        int nxt[4];
        int l, r;
        Node(){
            memset(nxt, -1, sizeof(nxt));
            l = 1e9, r = -1;
        }
    };

    vector<Node> tr;
    int cur = 0;

    Trie(){
        tr.push_back(Node());
    }

    int new_node(){
        tr.push_back(Node());
        ++cur;
        return cur;
    }

    void add_string(string &s, int id){
        int p = 0;
        for(int i = 0; i < sz(s); ++i){
            tr[p].l = min(tr[p].l, id);
            tr[p].r = max(tr[p].r, id);

            int c = get(s[i]);
            if(tr[p].nxt[c] == -1)
                tr[p].nxt[c] = new_node();
            p = tr[p].nxt[c];
        }

        tr[p].l = min(tr[p].l, id);
        tr[p].r = max(tr[p].r, id);
    }

    pii get_range(string &s){
        int p = 0;
        for(int i = 0; i < sz(s); ++i){
            int c = get(s[i]);
            if(tr[p].nxt[c] == -1)
                return {-1, -1};
            p = tr[p].nxt[c];
        }
        return {tr[p].l, tr[p].r};
    }
};

struct ReversedTrie{
    struct Node{
        int nxt[4];
        vector<int> ids;
        Node(){
            memset(nxt, -1, sizeof(nxt));
        }
    };

    vector<Node> tr;
    int cur = 0;

    ReversedTrie(){
        tr.push_back(Node());
    }

    int new_node(){
        tr.push_back(Node());
        ++cur;
        return cur;
    }

    void add_string(string &s, int id){
        int p = 0;
        for(int i = 0; i < sz(s); ++i){
            tr[p].ids.push_back(id);
            int c = get(s[i]);
            if(tr[p].nxt[c] == -1)
                tr[p].nxt[c] = new_node();
            p = tr[p].nxt[c];
        }
        tr[p].ids.push_back(id);
    }

    void init(){
        for(int i = 0; i <= cur; ++i)
            sort(all(tr[cur].ids));
    }

    int query(string &s, int l, int r){
        int p = 0;
        for(int i = 0; i < sz(s); ++i){
            int c = get(s[i]);
            if(tr[p].nxt[c] == -1)
                return 0;
            p = tr[p].nxt[c];
        }
        int lv = lower_bound(all(tr[p].ids), l) - tr[p].ids.begin();
        int rv = upper_bound(all(tr[p].ids), r) - tr[p].ids.begin() - 1;
        return rv - lv + 1;
    }
};

const int N = 1e5 + 3;

int n, m;
string s[N];
Trie trie;
ReversedTrie rtrie;

void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
        cin >> s[i];
    sort(s + 1, s + n + 1);
    for(int i = 1; i <= n; ++i){
        trie.add_string(s[i], i);
        reverse(all(s[i]));
    }
    for(int i = 1; i <= n; ++i)
        rtrie.add_string(s[i], i);

    while(m--){
        string p, q;
        cin >> p >> q;
        pii rn = trie.get_range(p);
        cout << rtrie.query(q, rn.F, rn.S) << '\n';
    }
}

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(0);
    #define task "troll"
    if(fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int test = 1;
//    cin >> test;
    for(int i = 1; i <= test; ++i){
//        cout << "Case #" << i << ": ";
        solve();
    }
    #ifdef LOCAL
        cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    #endif
    return 0;
}

Compilation message

selling_rna.cpp: In function 'int32_t main()':
selling_rna.cpp:166:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  166 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:167:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  167 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 167 ms 148216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 4848 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3420 KB Output isn't correct
2 Halted 0 ms 0 KB -