oj.uz

답안 #1099413

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099413 2024-10-11T09:24:45 Z underwaterkillerwhale Selling RNA Strands (JOI16_selling_rna) C++17
100 / 100
 212 ms 234028 KB 
#include <bits/stdc++.h>
#define ll long long
#define rep(i,m,n) for(int i=(m); i<=(n); i++)
#define reb(i,m,n) for(int i=(m); i>=(n); i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MP make_pair
#define fs first
#define se second
#define bit(msk, i) ((msk >> i) & 1)
#define iter(id, v) for(auto id : v)
#define pb push_back
#define SZ(v) (ll)v.size()
#define ALL(v) v.begin(),v.end()

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now ().time_since_epoch().count());
ll Rand (ll l, ll r) { return uniform_int_distribution<ll> (l, r) (rd); }

const int N = 1e5 + 7;
int Mod = 1e9 + 7;///lon
const int INF = 1e9;
const ll BASE = 137;
const int szBL = 450;

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

int n, Q;
vector<string> vec;

string Rev (string &S) {
    static string res;
    res = "";
    reb (i, SZ(S) - 1, 0) res += S[i];
    return res;
}

struct tNode {
    tNode *child[4];
    vector<int> vec;

    tNode () {
        rep (i, 0, 3) child[i] = NULL;
    }
}*proot = new tNode(), *sroot = new tNode();

void Add (tNode *cur, string S, int idx) {
    iter (&id, S) {
        int c = getId(id);
        if (cur->child[c] == NULL) cur->child[c] = new tNode();
        cur = cur->child[c];
        cur->vec.pb(idx);
    }
}

pii getRange (tNode *cur, string S) {
    iter (&id, S) {
        int c = getId(id);
        if (cur->child[c] == NULL) {
            return MP(INF, 0);
        }
        cur = cur->child[c];
    }
    return MP(cur->vec[0], cur->vec.back());
}

int get (tNode *cur, string S, pii Range) {
    if (Range.fs > Range.se) return 0;
    iter (&id, S) {
        int c = getId(id);
        if (cur->child[c] == NULL)
            return 0;
        cur = cur->child[c];
    }
    int L = lower_bound(ALL(cur->vec), Range.fs) - cur->vec.begin();
    int R = upper_bound(ALL(cur->vec), Range.se) - cur->vec.begin();
    return R - L;
}

void solution () {
    cin >> n >> Q;
    vec.resize(n + 1, "");
    rep (i, 1, n) {
        cin >> vec[i];
    }
    sort (vec.begin() + 1, vec.end());
    rep (i, 1, n) {
        Add(proot, vec[i], i);
        Add(sroot, Rev(vec[i]), i);
    }
    rep (i, 1, Q) {
        string T, Y;
        cin >> T >> Y;
        cout << get(sroot, Rev(Y), getRange(proot, T)) <<"\n";
    }

}

#define file(name) freopen(name".inp","r",stdin); \
freopen(name".out","w",stdout);
int main () {
//    file("c");
    ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int num_Test = 1;
//    cin >> num_Test;
    while (num_Test--)
        solution();
}
/*
no bug challenge +10

5 5
01101
10001
00110
10101
00100
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 188 ms 198880 KB Output is correct
2 Correct 193 ms 188300 KB Output is correct
3 Correct 163 ms 196156 KB Output is correct
4 Correct 163 ms 186704 KB Output is correct
5 Correct 208 ms 230644 KB Output is correct
6 Correct 212 ms 234028 KB Output is correct
7 Correct 67 ms 19024 KB Output is correct
8 Correct 193 ms 148560 KB Output is correct
9 Correct 164 ms 125868 KB Output is correct
10 Correct 129 ms 122960 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 3272 KB Output is correct
2 Correct 15 ms 2908 KB Output is correct
3 Correct 18 ms 3128 KB Output is correct
4 Correct 15 ms 2652 KB Output is correct
5 Correct 18 ms 2940 KB Output is correct
6 Correct 19 ms 2976 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 372 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 188 ms 198880 KB Output is correct
9 Correct 193 ms 188300 KB Output is correct
10 Correct 163 ms 196156 KB Output is correct
11 Correct 163 ms 186704 KB Output is correct
12 Correct 208 ms 230644 KB Output is correct
13 Correct 212 ms 234028 KB Output is correct
14 Correct 67 ms 19024 KB Output is correct
15 Correct 193 ms 148560 KB Output is correct
16 Correct 164 ms 125868 KB Output is correct
17 Correct 129 ms 122960 KB Output is correct
18 Correct 21 ms 3272 KB Output is correct
19 Correct 15 ms 2908 KB Output is correct
20 Correct 18 ms 3128 KB Output is correct
21 Correct 15 ms 2652 KB Output is correct
22 Correct 18 ms 2940 KB Output is correct
23 Correct 19 ms 2976 KB Output is correct
24 Correct 190 ms 163924 KB Output is correct
25 Correct 183 ms 163876 KB Output is correct
26 Correct 174 ms 161968 KB Output is correct
27 Correct 179 ms 162032 KB Output is correct
28 Correct 136 ms 42800 KB Output is correct
29 Correct 74 ms 13392 KB Output is correct