oj.uz

답안 #1002716

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1002716 2024-06-19T18:34:11 Z TheSahib Dabbeh (INOI20_dabbeh) C++14
100 / 100
 1304 ms 151780 KB 
// #pragma optimize("O3")
#include <bits/stdc++.h>
 
using namespace std;

#define ll long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define oo 1e9

const int MAX = 5e5 + 5, B = 61, LOGMAX = 18;
const ll MOD = (1ll << 61) - 1;

struct ST{
    pii tree[4 * MAX];
    void init(){
        for(int i = 0; i < 4 * MAX; i++) tree[i] = {0, 0};
    }
    void update(int node, int l, int r, int pos, pii val){
        if(l == r){
            tree[node] = val;
            return;
        }
        int mid = (l + r) / 2;
        if(pos <= mid) update(2 * node, l, mid, pos, val);
        else update(2 * node + 1, mid + 1, r, pos, val);
        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }
    pii ask(int node, int l, int r, int ql, int qr){
        if(qr < l || r < ql) return {0, 0};
        if(ql <= l && r <= qr) return tree[node];
        int mid = (l + r) / 2;
        return max(ask(2 * node, l, mid, ql, qr), ask(2 * node + 1, mid + 1, r, ql, qr));
    }
};
ll binpow(ll a, ll b){
    if(b == 0) return 1;
    if(b & 1) return (__int128_t)binpow(a, b - 1) % MOD * a % MOD;
    return binpow((__int128_t)a * a % MOD, b / 2) % MOD;
}
ll inv(ll a){
    return binpow(a, MOD - 2);
}
int n, q;
string s;
string t[MAX];
 
ll pre[MAX];
ll P[(int)5e5 + 5];
ll invP[(int)5e5 + 5];
int par[LOGMAX][MAX];
int nxt[MAX];
ST st;
unordered_set<ll> mp[MAX];
 
ll calc(int l, int r){
    return (__int128_t)(pre[r] - pre[l - 1] + MOD) % MOD * invP[l - 1] % MOD;
}
 
int sz[MAX];
 
void solve(){
    P[0]= 1;
    invP[0] = 1;
    for(int i = 1; i <= 5e5; i++){
        P[i] = (__int128_t)P[i - 1] * B % MOD;
        invP[i] = (__int128_t)invP[i - 1] * inv(B) % MOD;
    }
    cin >> n >> q;
    for(int i = 1; i <= n; i++){
        cin >> t[i];
        ll H = 0;
        for(int j = 0; j < t[i].size(); j++){
            H = (__int128_t)(H + (__int128_t)(t[i][j] - 'a' + 1) * P[j] % MOD) % MOD;
            mp[j + 1].insert(H);
        }
    }
    cin >> s;
    n = s.size();
    for(int i = 1; i <= n; i++){
        pre[i] = (__int128_t)(pre[i - 1] + (__int128_t)(s[i - 1] - 'a' + 1) * P[i - 1] % MOD) % MOD;
    }
    st.init();
    st.update(1, 1, n + 1, n + 1, {n + 1, n + 1});
    par[0][n + 1] = n + 1;
    nxt[n + 1] = n + 1;
    for(int i = n; i >= 1; i--){
        if(!mp[1].count(calc(i, i))){
            par[0][i] = i;
            nxt[i] = i;
            st.update(1, 1, n + 1, i, {i, i});
            continue;
        }
        int l = i, r = n;
        while(l < r){
            int mid = (l + r + 1) / 2;
            if(mp[mid - i + 1].count(calc(i, mid))) l = mid;
            else r = mid - 1;
        }
        par[0][i] = st.ask(1, 1, n + 1, i + 1, l + 1).second;
        nxt[i] = l + 1;
        st.update(1, 1, n + 1, i, {l + 1, i});
    }
    for(int j = 1; j < LOGMAX; j++){
        for(int i = 1; i <= n + 1; i++){
            par[j][i] = par[j - 1][par[j - 1][i]];
        }
    }
    while(q--){
        int l, r; cin >> l >> r;
        l++;
        if(nxt[l] > r){
            cout << "1\n";
            continue;
        }
        ll ans = 0;
        for(int i = LOGMAX - 1; i >= 0; i--){
            if(nxt[par[i][l]] <= r){
                ans += (1ll << i);
                l = par[i][l];
            }
        }
        if(nxt[par[0][l]] <= r) cout << "-1\n";
        else cout << ans + 2 << '\n';
    }
}
 
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while(t--){
        solve();
    }
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:73:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for(int j = 0; j < t[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 652 ms 66900 KB Output is correct
2 Correct 763 ms 86612 KB Output is correct
3 Correct 713 ms 82296 KB Output is correct
4 Correct 743 ms 86432 KB Output is correct
5 Correct 679 ms 85004 KB Output is correct
6 Correct 798 ms 89196 KB Output is correct
7 Correct 744 ms 92964 KB Output is correct
8 Correct 864 ms 90708 KB Output is correct
9 Correct 752 ms 88428 KB Output is correct
10 Correct 687 ms 74284 KB Output is correct
11 Correct 758 ms 131916 KB Output is correct
12 Correct 699 ms 99036 KB Output is correct
13 Correct 740 ms 117076 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1028 ms 99760 KB Output is correct
2 Correct 999 ms 105128 KB Output is correct
3 Correct 949 ms 100684 KB Output is correct
4 Correct 867 ms 96040 KB Output is correct
5 Correct 890 ms 95856 KB Output is correct
6 Correct 932 ms 105304 KB Output is correct
7 Correct 978 ms 107656 KB Output is correct
8 Correct 918 ms 102824 KB Output is correct
9 Correct 940 ms 105880 KB Output is correct
10 Correct 987 ms 109480 KB Output is correct
11 Correct 883 ms 100996 KB Output is correct
12 Correct 852 ms 99492 KB Output is correct
13 Correct 963 ms 110976 KB Output is correct
14 Correct 981 ms 109212 KB Output is correct
15 Correct 830 ms 93944 KB Output is correct
16 Correct 810 ms 151780 KB Output is correct
17 Correct 801 ms 110384 KB Output is correct
18 Correct 805 ms 109668 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 652 ms 66900 KB Output is correct
2 Correct 763 ms 86612 KB Output is correct
3 Correct 713 ms 82296 KB Output is correct
4 Correct 743 ms 86432 KB Output is correct
5 Correct 679 ms 85004 KB Output is correct
6 Correct 798 ms 89196 KB Output is correct
7 Correct 744 ms 92964 KB Output is correct
8 Correct 864 ms 90708 KB Output is correct
9 Correct 752 ms 88428 KB Output is correct
10 Correct 687 ms 74284 KB Output is correct
11 Correct 758 ms 131916 KB Output is correct
12 Correct 699 ms 99036 KB Output is correct
13 Correct 740 ms 117076 KB Output is correct
14 Correct 1028 ms 99760 KB Output is correct
15 Correct 999 ms 105128 KB Output is correct
16 Correct 949 ms 100684 KB Output is correct
17 Correct 867 ms 96040 KB Output is correct
18 Correct 890 ms 95856 KB Output is correct
19 Correct 932 ms 105304 KB Output is correct
20 Correct 978 ms 107656 KB Output is correct
21 Correct 918 ms 102824 KB Output is correct
22 Correct 940 ms 105880 KB Output is correct
23 Correct 987 ms 109480 KB Output is correct
24 Correct 883 ms 100996 KB Output is correct
25 Correct 852 ms 99492 KB Output is correct
26 Correct 963 ms 110976 KB Output is correct
27 Correct 981 ms 109212 KB Output is correct
28 Correct 830 ms 93944 KB Output is correct
29 Correct 810 ms 151780 KB Output is correct
30 Correct 801 ms 110384 KB Output is correct
31 Correct 805 ms 109668 KB Output is correct
32 Correct 853 ms 90316 KB Output is correct
33 Correct 910 ms 99240 KB Output is correct
34 Correct 986 ms 104636 KB Output is correct
35 Correct 932 ms 102096 KB Output is correct
36 Correct 1006 ms 107560 KB Output is correct
37 Correct 840 ms 89924 KB Output is correct
38 Correct 1107 ms 115716 KB Output is correct
39 Correct 1029 ms 105796 KB Output is correct
40 Correct 1156 ms 118460 KB Output is correct
41 Correct 1142 ms 119096 KB Output is correct
42 Correct 1006 ms 110556 KB Output is correct
43 Correct 867 ms 92500 KB Output is correct
44 Correct 833 ms 91488 KB Output is correct
45 Correct 820 ms 90908 KB Output is correct
46 Correct 874 ms 98604 KB Output is correct
47 Correct 1034 ms 100996 KB Output is correct
48 Correct 1110 ms 107276 KB Output is correct
49 Correct 1092 ms 101556 KB Output is correct
50 Correct 1304 ms 116692 KB Output is correct
51 Correct 966 ms 102712 KB Output is correct
52 Correct 952 ms 117816 KB Output is correct
53 Correct 828 ms 104268 KB Output is correct