oj.uz

답안 #1002671

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1002671 2024-06-19T17:46:32 Z vjudge1 Dabbeh (INOI20_dabbeh) C++17
100 / 100
 1380 ms 137132 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 = 61, MOD = (1ll << 61) - 1, LOGMAX = 21;
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_map<ll, int> mp;
 
int calc(int l, int r){
    return (__int128_t)(pre[r] - pre[l - 1] + MOD) % MOD * invP[l - 1] % MOD;
}
 
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[H] = 1;
        }
    }
    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.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.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:68:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for(int j = 0; j < t[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 640 ms 55380 KB Output is correct
2 Correct 743 ms 75964 KB Output is correct
3 Correct 748 ms 70260 KB Output is correct
4 Correct 802 ms 76224 KB Output is correct
5 Correct 775 ms 72312 KB Output is correct
6 Correct 784 ms 78300 KB Output is correct
7 Correct 785 ms 79984 KB Output is correct
8 Correct 785 ms 79292 KB Output is correct
9 Correct 798 ms 77556 KB Output is correct
10 Correct 722 ms 62880 KB Output is correct
11 Correct 756 ms 78184 KB Output is correct
12 Correct 756 ms 67804 KB Output is correct
13 Correct 763 ms 71864 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1054 ms 116972 KB Output is correct
2 Correct 1022 ms 122732 KB Output is correct
3 Correct 989 ms 119316 KB Output is correct
4 Correct 937 ms 113776 KB Output is correct
5 Correct 966 ms 113508 KB Output is correct
6 Correct 1004 ms 122748 KB Output is correct
7 Correct 1002 ms 124540 KB Output is correct
8 Correct 955 ms 120916 KB Output is correct
9 Correct 1066 ms 123000 KB Output is correct
10 Correct 977 ms 128440 KB Output is correct
11 Correct 972 ms 119416 KB Output is correct
12 Correct 946 ms 116932 KB Output is correct
13 Correct 1000 ms 129728 KB Output is correct
14 Correct 955 ms 128040 KB Output is correct
15 Correct 890 ms 111440 KB Output is correct
16 Correct 1000 ms 129528 KB Output is correct
17 Correct 865 ms 115912 KB Output is correct
18 Correct 977 ms 115564 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 640 ms 55380 KB Output is correct
2 Correct 743 ms 75964 KB Output is correct
3 Correct 748 ms 70260 KB Output is correct
4 Correct 802 ms 76224 KB Output is correct
5 Correct 775 ms 72312 KB Output is correct
6 Correct 784 ms 78300 KB Output is correct
7 Correct 785 ms 79984 KB Output is correct
8 Correct 785 ms 79292 KB Output is correct
9 Correct 798 ms 77556 KB Output is correct
10 Correct 722 ms 62880 KB Output is correct
11 Correct 756 ms 78184 KB Output is correct
12 Correct 756 ms 67804 KB Output is correct
13 Correct 763 ms 71864 KB Output is correct
14 Correct 1054 ms 116972 KB Output is correct
15 Correct 1022 ms 122732 KB Output is correct
16 Correct 989 ms 119316 KB Output is correct
17 Correct 937 ms 113776 KB Output is correct
18 Correct 966 ms 113508 KB Output is correct
19 Correct 1004 ms 122748 KB Output is correct
20 Correct 1002 ms 124540 KB Output is correct
21 Correct 955 ms 120916 KB Output is correct
22 Correct 1066 ms 123000 KB Output is correct
23 Correct 977 ms 128440 KB Output is correct
24 Correct 972 ms 119416 KB Output is correct
25 Correct 946 ms 116932 KB Output is correct
26 Correct 1000 ms 129728 KB Output is correct
27 Correct 955 ms 128040 KB Output is correct
28 Correct 890 ms 111440 KB Output is correct
29 Correct 1000 ms 129528 KB Output is correct
30 Correct 865 ms 115912 KB Output is correct
31 Correct 977 ms 115564 KB Output is correct
32 Correct 936 ms 98192 KB Output is correct
33 Correct 991 ms 107128 KB Output is correct
34 Correct 1082 ms 113644 KB Output is correct
35 Correct 1050 ms 109020 KB Output is correct
36 Correct 1074 ms 115636 KB Output is correct
37 Correct 920 ms 97940 KB Output is correct
38 Correct 1249 ms 134504 KB Output is correct
39 Correct 1226 ms 123120 KB Output is correct
40 Correct 1315 ms 136636 KB Output is correct
41 Correct 1377 ms 137132 KB Output is correct
42 Correct 1318 ms 128004 KB Output is correct
43 Correct 936 ms 90224 KB Output is correct
44 Correct 1012 ms 89688 KB Output is correct
45 Correct 1020 ms 89244 KB Output is correct
46 Correct 1162 ms 97748 KB Output is correct
47 Correct 1318 ms 118812 KB Output is correct
48 Correct 1261 ms 125560 KB Output is correct
49 Correct 1336 ms 118976 KB Output is correct
50 Correct 1380 ms 135668 KB Output is correct
51 Correct 1022 ms 116252 KB Output is correct
52 Correct 1020 ms 121224 KB Output is correct
53 Correct 1059 ms 117092 KB Output is correct