oj.uz

답안 #312481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312481 2020-10-13T13:50:50 Z fivefourthreeone Selling RNA Strands (JOI16_selling_rna) C++17
35 / 100
 46 ms 34680 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define owo(i,a, b) for(auto i=(a);i<(b); ++i)
#define uwu(i,a, b) for(auto i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ttgl, null_type,less<ttgl>, rb_tree_tag,tree_order_statistics_node_update>*/
 
using ll = long long;
using ld = long double;
const ll MOD = 998244353;
const ll root = 62;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll binpow(ll a,ll b){ll res=1;while(b){if(b&1)res=(res*a)%MOD;a=(a*a)%MOD;b>>=1;}return res;}
ll modInv(ll a){return binpow(a, MOD-2);}
const double PI = atan(1);
const double eps = 1e-10;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 100001;
string arr[mxN];
int n, m;
string s;
struct node {
    int adj[4];
    vector<int> ind;
}trie[2][mxN];
int cnt[2] = {0, 0};
int hsh(char a) {
    if(a=='A')return 0;
    if(a=='C')return 1;
    if(a=='G')return 2;
    if(a=='U')return 3;
    cout<<"REEE\n";
    return 69;
}
void add(string &a, int t, int id) {
    int rt = 0;
    //cout<<a<<"\n";
    for(char c: a) {
        //cout<<rt<<" "<<c<<"\n";
        int k = hsh(c);
        if(trie[t][rt].adj[k]==-1){
            trie[t][rt].adj[k] = ++cnt[t];
        }
        rt = trie[t][rt].adj[k];
        trie[t][rt].ind.senpai(id);
    }
}
int main() {
    //freopen("file.in", "r", stdin);
    //freopen("file.out", "w", stdout);
    mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>m;
    owo(i, 0, mxN) {
        owo(j, 0, 4) {
            trie[0][i].adj[j] = -1;
            trie[1][i].adj[j] = -1;
        }
    }
    owo(i, 0, n) {
        cin>>arr[i];
    }
    sort(arr, arr + n);
    owo(i, 0, n) {
        add(arr[i], 0, i);
        reverse(arr[i].begin(), arr[i].end());
        add(arr[i], 1, i);
    }
    string p, q;
    owo(i, 0, m) {
        cin>>p>>q;
        reverse(q.begin(), q.end());
        int pid = 0;
        int qid = 0;
        for(char c: p) {
            int nxt = hsh(c);
            if(trie[0][pid].adj[nxt]==-1){
                pid = -1;
                break;
            }
            pid = trie[0][pid].adj[nxt];
        }
        for(char c: q) {
            int nxt = hsh(c);
            if(trie[1][qid].adj[nxt]==-1) {
                qid = -1;
                break;
            }
            qid = trie[1][qid].adj[nxt];
        }
        if(pid==-1||qid==-1||trie[0][pid].ind.size()==0)cout<<"0\n";
        else {
            /*for(int k: trie[0][pid].ind) {
                cout<<k<<" ";
            }
            cout<<"\n";
            for(int k: trie[1][qid].ind) {
                cout<<k<<" ";
            }
            cout<<"\n";*/
            int l = trie[0][pid].ind[0];
            int r = trie[0][pid].ind[trie[0][pid].ind.size()-1];
            vector<int> &k =trie[1][qid].ind;
            int right = lower_bound(k.begin(), k.end(), r + 1) - k.begin();
            int left = lower_bound(k.begin(), k.end(), l) - k.begin();
            cout<<(right - left)<<"\n";
        }
    }
    return 0;
}

Compilation message

selling_rna.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
selling_rna.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11392 KB Output is correct
2 Correct 9 ms 11264 KB Output is correct
3 Correct 9 ms 11264 KB Output is correct
4 Correct 9 ms 11264 KB Output is correct
5 Correct 9 ms 11264 KB Output is correct
6 Correct 9 ms 11264 KB Output is correct
7 Correct 9 ms 11264 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 46 ms 34680 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 12784 KB Output is correct
2 Correct 31 ms 12544 KB Output is correct
3 Correct 35 ms 12536 KB Output is correct
4 Correct 28 ms 12536 KB Output is correct
5 Correct 33 ms 12536 KB Output is correct
6 Correct 37 ms 12536 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11392 KB Output is correct
2 Correct 9 ms 11264 KB Output is correct
3 Correct 9 ms 11264 KB Output is correct
4 Correct 9 ms 11264 KB Output is correct
5 Correct 9 ms 11264 KB Output is correct
6 Correct 9 ms 11264 KB Output is correct
7 Correct 9 ms 11264 KB Output is correct
8 Runtime error 46 ms 34680 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -