Submission #935032

#	Time	Username	Problem	Language	Result	Execution time	Memory
935032		Whisper	Selling RNA Strands (JOI16_selling_rna)	C++17	100 / 100	186 ms	190976 KiB

selling_rna

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, numQuery;

map<char, int> fix = {{'A', 0}, {'C', 1}, {'G', 2}, {'U', 3}};


#define all(x) (x).begin(), (x).end()
#define lb(x...) lower_bound(x)
#define ub(x...) upper_bound(x)

struct Node{
    Node *child[4];
    vector<int> idx;
    Node(){
        REP(i, 4) child[i] = nullptr;
    }
};

Node *root = new Node();
template<class iter>
    inline void Add(Node* p, iter sta, iter fin, int i){
        p -> idx.push_back(i);
        if(sta == fin) return;
        int nxt = fix[*sta];
        if (p -> child[nxt] == nullptr) p -> child[nxt] = new Node();
        Add(p -> child[nxt], next(sta), fin, i);
    }

template<class iter>
    inline int Query(Node *p, iter sta, iter fin, int l, int r){
        if (sta == fin){
            return ub(all(p -> idx), r) - lb(all(p -> idx), l);
        }
        int nxt = fix[*sta];
        if (p -> child[nxt] == nullptr) return 0;
        return Query(p -> child[nxt], next(sta), fin, l, r);
    }
void Whisper(){
    cin >> nArr >> numQuery;
    vector<string> s(nArr);
    REP(i, nArr) cin >> s[i];
    sort(all(s));
    REP(i, nArr){
        Add(root, s[i].rbegin(), s[i].rend(), i);
    }
    for (int i = 1; i <= numQuery; ++i){
        string a, b; cin >> a >> b;
        reverse(all(b));

        int l = lb(all(s), a) - s.begin();
        a.back()++;
        int r = lb(all(s), a) - s.begin();
        --r;
        if (l > r){
            cout << "0\n"; continue;
        }
        cout << Query(root, all(b), l, r) << '\n';
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

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