oj.uz

Submission #1002723

# Submission time Handle Problem Language Result Execution time Memory
1002723 2024-06-19T18:38:24 Z vjudge1 Dabbeh (INOI20_dabbeh) C++17
100 / 100
 1307 ms 151712 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
// #define int long long
#define ll long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define oo 1e9
const ll MAX = 5e5 + 5, B = 4639, MOD = (1ll << 61) - 1, LOGMAX = 18;
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++) sz[t[i].size()]++;
    // for(int i = 1; i < MAX; i++) mp[i].reserve(10 * sz[i]);
    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:72:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         for(int j = 0; j < t[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 659 ms 66928 KB Output is correct
2 Correct 749 ms 86480 KB Output is correct
3 Correct 749 ms 82256 KB Output is correct
4 Correct 780 ms 86612 KB Output is correct
5 Correct 709 ms 84964 KB Output is correct
6 Correct 760 ms 89296 KB Output is correct
7 Correct 726 ms 93012 KB Output is correct
8 Correct 734 ms 90752 KB Output is correct
9 Correct 697 ms 88556 KB Output is correct
10 Correct 654 ms 74488 KB Output is correct
11 Correct 664 ms 131812 KB Output is correct
12 Correct 691 ms 98972 KB Output is correct
13 Correct 700 ms 117224 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 853 ms 99764 KB Output is correct
2 Correct 876 ms 105196 KB Output is correct
3 Correct 858 ms 100780 KB Output is correct
4 Correct 853 ms 95824 KB Output is correct
5 Correct 896 ms 95788 KB Output is correct
6 Correct 984 ms 105412 KB Output is correct
7 Correct 1010 ms 107432 KB Output is correct
8 Correct 932 ms 102848 KB Output is correct
9 Correct 966 ms 105880 KB Output is correct
10 Correct 952 ms 109472 KB Output is correct
11 Correct 898 ms 100928 KB Output is correct
12 Correct 970 ms 99744 KB Output is correct
13 Correct 1086 ms 110860 KB Output is correct
14 Correct 979 ms 109000 KB Output is correct
15 Correct 807 ms 93944 KB Output is correct
16 Correct 806 ms 151712 KB Output is correct
17 Correct 855 ms 110428 KB Output is correct
18 Correct 826 ms 109748 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 659 ms 66928 KB Output is correct
2 Correct 749 ms 86480 KB Output is correct
3 Correct 749 ms 82256 KB Output is correct
4 Correct 780 ms 86612 KB Output is correct
5 Correct 709 ms 84964 KB Output is correct
6 Correct 760 ms 89296 KB Output is correct
7 Correct 726 ms 93012 KB Output is correct
8 Correct 734 ms 90752 KB Output is correct
9 Correct 697 ms 88556 KB Output is correct
10 Correct 654 ms 74488 KB Output is correct
11 Correct 664 ms 131812 KB Output is correct
12 Correct 691 ms 98972 KB Output is correct
13 Correct 700 ms 117224 KB Output is correct
14 Correct 853 ms 99764 KB Output is correct
15 Correct 876 ms 105196 KB Output is correct
16 Correct 858 ms 100780 KB Output is correct
17 Correct 853 ms 95824 KB Output is correct
18 Correct 896 ms 95788 KB Output is correct
19 Correct 984 ms 105412 KB Output is correct
20 Correct 1010 ms 107432 KB Output is correct
21 Correct 932 ms 102848 KB Output is correct
22 Correct 966 ms 105880 KB Output is correct
23 Correct 952 ms 109472 KB Output is correct
24 Correct 898 ms 100928 KB Output is correct
25 Correct 970 ms 99744 KB Output is correct
26 Correct 1086 ms 110860 KB Output is correct
27 Correct 979 ms 109000 KB Output is correct
28 Correct 807 ms 93944 KB Output is correct
29 Correct 806 ms 151712 KB Output is correct
30 Correct 855 ms 110428 KB Output is correct
31 Correct 826 ms 109748 KB Output is correct
32 Correct 873 ms 90272 KB Output is correct
33 Correct 997 ms 99384 KB Output is correct
34 Correct 1022 ms 104336 KB Output is correct
35 Correct 1036 ms 102136 KB Output is correct
36 Correct 1171 ms 107432 KB Output is correct
37 Correct 985 ms 89808 KB Output is correct
38 Correct 1307 ms 115744 KB Output is correct
39 Correct 1143 ms 105660 KB Output is correct
40 Correct 1230 ms 118444 KB Output is correct
41 Correct 1211 ms 119080 KB Output is correct
42 Correct 1143 ms 110568 KB Output is correct
43 Correct 917 ms 92500 KB Output is correct
44 Correct 940 ms 91668 KB Output is correct
45 Correct 890 ms 90772 KB Output is correct
46 Correct 973 ms 98668 KB Output is correct
47 Correct 1062 ms 100996 KB Output is correct
48 Correct 1082 ms 106776 KB Output is correct
49 Correct 1029 ms 101596 KB Output is correct
50 Correct 1195 ms 116460 KB Output is correct
51 Correct 945 ms 102648 KB Output is correct
52 Correct 886 ms 117820 KB Output is correct
53 Correct 908 ms 104292 KB Output is correct