oj.uz

답안 #1002728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1002728 2024-06-19T18:40:28 Z TheSahib Dabbeh (INOI20_dabbeh) C++14
100 / 100
 1361 ms 151788 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;
}
 
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:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("O3")
      | 
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

# 결과 실행 시간 메모리 Grader output
1 Correct 658 ms 66944 KB Output is correct
2 Correct 761 ms 86620 KB Output is correct
3 Correct 791 ms 82256 KB Output is correct
4 Correct 769 ms 86612 KB Output is correct
5 Correct 761 ms 85072 KB Output is correct
6 Correct 780 ms 89296 KB Output is correct
7 Correct 801 ms 93144 KB Output is correct
8 Correct 796 ms 90548 KB Output is correct
9 Correct 810 ms 88440 KB Output is correct
10 Correct 721 ms 74320 KB Output is correct
11 Correct 712 ms 131988 KB Output is correct
12 Correct 719 ms 99036 KB Output is correct
13 Correct 665 ms 117220 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 913 ms 99764 KB Output is correct
2 Correct 944 ms 105168 KB Output is correct
3 Correct 879 ms 100704 KB Output is correct
4 Correct 915 ms 95792 KB Output is correct
5 Correct 887 ms 95624 KB Output is correct
6 Correct 959 ms 105240 KB Output is correct
7 Correct 981 ms 107652 KB Output is correct
8 Correct 958 ms 103000 KB Output is correct
9 Correct 981 ms 106000 KB Output is correct
10 Correct 1020 ms 109384 KB Output is correct
11 Correct 913 ms 100868 KB Output is correct
12 Correct 948 ms 99452 KB Output is correct
13 Correct 1016 ms 110992 KB Output is correct
14 Correct 953 ms 108860 KB Output is correct
15 Correct 836 ms 93944 KB Output is correct
16 Correct 866 ms 151788 KB Output is correct
17 Correct 912 ms 110400 KB Output is correct
18 Correct 805 ms 109740 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 658 ms 66944 KB Output is correct
2 Correct 761 ms 86620 KB Output is correct
3 Correct 791 ms 82256 KB Output is correct
4 Correct 769 ms 86612 KB Output is correct
5 Correct 761 ms 85072 KB Output is correct
6 Correct 780 ms 89296 KB Output is correct
7 Correct 801 ms 93144 KB Output is correct
8 Correct 796 ms 90548 KB Output is correct
9 Correct 810 ms 88440 KB Output is correct
10 Correct 721 ms 74320 KB Output is correct
11 Correct 712 ms 131988 KB Output is correct
12 Correct 719 ms 99036 KB Output is correct
13 Correct 665 ms 117220 KB Output is correct
14 Correct 913 ms 99764 KB Output is correct
15 Correct 944 ms 105168 KB Output is correct
16 Correct 879 ms 100704 KB Output is correct
17 Correct 915 ms 95792 KB Output is correct
18 Correct 887 ms 95624 KB Output is correct
19 Correct 959 ms 105240 KB Output is correct
20 Correct 981 ms 107652 KB Output is correct
21 Correct 958 ms 103000 KB Output is correct
22 Correct 981 ms 106000 KB Output is correct
23 Correct 1020 ms 109384 KB Output is correct
24 Correct 913 ms 100868 KB Output is correct
25 Correct 948 ms 99452 KB Output is correct
26 Correct 1016 ms 110992 KB Output is correct
27 Correct 953 ms 108860 KB Output is correct
28 Correct 836 ms 93944 KB Output is correct
29 Correct 866 ms 151788 KB Output is correct
30 Correct 912 ms 110400 KB Output is correct
31 Correct 805 ms 109740 KB Output is correct
32 Correct 895 ms 90316 KB Output is correct
33 Correct 1054 ms 99332 KB Output is correct
34 Correct 1000 ms 104272 KB Output is correct
35 Correct 1053 ms 102172 KB Output is correct
36 Correct 998 ms 107572 KB Output is correct
37 Correct 909 ms 89800 KB Output is correct
38 Correct 1166 ms 115712 KB Output is correct
39 Correct 1074 ms 105800 KB Output is correct
40 Correct 1320 ms 118328 KB Output is correct
41 Correct 1361 ms 119192 KB Output is correct
42 Correct 1306 ms 110612 KB Output is correct
43 Correct 1042 ms 92400 KB Output is correct
44 Correct 942 ms 91660 KB Output is correct
45 Correct 890 ms 90928 KB Output is correct
46 Correct 921 ms 98572 KB Output is correct
47 Correct 1082 ms 100880 KB Output is correct
48 Correct 1128 ms 107048 KB Output is correct
49 Correct 1027 ms 101556 KB Output is correct
50 Correct 1120 ms 116956 KB Output is correct
51 Correct 843 ms 102848 KB Output is correct
52 Correct 834 ms 118064 KB Output is correct
53 Correct 848 ms 104556 KB Output is correct