oj.uz

Submission #935032

# Submission time Handle Problem Language Result Execution time Memory
935032 2024-02-28T12:37:40 Z Whisper Selling RNA Strands (JOI16_selling_rna) C++17
100 / 100
 186 ms 190976 KB 
#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.0 / 10.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 190976 KB Output is correct
2 Correct 165 ms 181380 KB Output is correct
3 Correct 48 ms 28240 KB Output is correct
4 Correct 49 ms 27476 KB Output is correct
5 Correct 121 ms 118720 KB Output is correct
6 Correct 121 ms 120660 KB Output is correct
7 Correct 47 ms 23376 KB Output is correct
8 Correct 117 ms 87812 KB Output is correct
9 Correct 102 ms 77648 KB Output is correct
10 Correct 78 ms 72536 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 4300 KB Output is correct
2 Correct 20 ms 3468 KB Output is correct
3 Correct 25 ms 3800 KB Output is correct
4 Correct 18 ms 3312 KB Output is correct
5 Correct 21 ms 3276 KB Output is correct
6 Correct 27 ms 3540 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 168 ms 190976 KB Output is correct
9 Correct 165 ms 181380 KB Output is correct
10 Correct 48 ms 28240 KB Output is correct
11 Correct 49 ms 27476 KB Output is correct
12 Correct 121 ms 118720 KB Output is correct
13 Correct 121 ms 120660 KB Output is correct
14 Correct 47 ms 23376 KB Output is correct
15 Correct 117 ms 87812 KB Output is correct
16 Correct 102 ms 77648 KB Output is correct
17 Correct 78 ms 72536 KB Output is correct
18 Correct 30 ms 4300 KB Output is correct
19 Correct 20 ms 3468 KB Output is correct
20 Correct 25 ms 3800 KB Output is correct
21 Correct 18 ms 3312 KB Output is correct
22 Correct 21 ms 3276 KB Output is correct
23 Correct 27 ms 3540 KB Output is correct
24 Correct 170 ms 159060 KB Output is correct
25 Correct 186 ms 159312 KB Output is correct
26 Correct 159 ms 157096 KB Output is correct
27 Correct 56 ms 27440 KB Output is correct
28 Correct 147 ms 49092 KB Output is correct
29 Correct 74 ms 17388 KB Output is correct