oj.uz

Submission #1002035

# Submission time Handle Problem Language Result Execution time Memory
1002035 2024-06-19T09:27:25 Z vjudge1 Dabbeh (INOI20_dabbeh) C++17
0 / 100
 539 ms 54964 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define oo 1e9
const int MAX = 1e4 + 5, MAX2 = 500 + 5, B = 61, MOD1 = 1e9 + 7, MOD2 = 1e9 + 9, LOGMAX = 20;
struct ST{
    pii tree[4 * MAX2];
    void init(){
        for(int i = 0; i < 4 * MAX2; 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));
    }
};
int binpow(int a, int b, int m){
    if(b == 0) return 1;
    if(b & 1) return binpow(a, b - 1, m) % m * a % m;
    return binpow(a * a % m, b / 2, m) % m;
}
int inv(int a, int m){
    return binpow(a, m - 2, m);
}
int n, q;
string s;
string t[MAX];

map<pii, int> mp;
pii pre[MAX2];
pii P[(int)5e5 + 5];
pii invP[(int)5e5 + 5];
int nxt[MAX2];
ST st;
int par[LOGMAX][MAX];
int mx[MAX];

pii calc(int l, int r){
    return {(pre[r].first - pre[l - 1].first + 2 * MOD1) % MOD1 * invP[l - 1].first % MOD1,
            (pre[r].second - pre[l - 1].second + 2 * MOD2) % MOD2 * invP[l - 1].second % MOD2};
}


void solve(){
    P[0]= {1, 1};
    invP[0] = {1, 1};
    for(int i = 1; i <= 5e5; i++){
        P[i].first = P[i - 1].first * B % MOD1;
        P[i].second = P[i - 1].second * B % MOD2;
        invP[i].first = invP[i - 1].first * inv(B, MOD1) % MOD1;
        invP[i].second = invP[i - 1].second * inv(B, MOD2) % MOD2;
    }
    cin >> n >> q;
    for(int i = 1; i <= n; i++){
        cin >> t[i];
        pii H = {0, 0};
        for(int j = 0; j < t[i].size(); j++){
            H.first = (H.first + (t[i][j] - 'a' + 1) * P[j].first % MOD1) % MOD1;
            H.second = (H.second + (t[i][j] - 'a' + 1) * P[j].second % MOD2) % MOD2;
            mp[H] = 1;
        }
    }
    cin >> s;
    n = s.size();
    for(int i = 1; i <= n; i++){
        pre[i].first = (pre[i - 1].first + (s[i - 1] - 'a' + 1) * P[i - 1].first % MOD1) % MOD1;
        pre[i].second = (pre[i - 1].second + (s[i - 1] - 'a' + 1) * P[i - 1].second % MOD2) % MOD2;
    }
    nxt[n + 1] = n + 1;
    st.init();
    st.update(1, 1, n + 1, n + 1, {n + 1, n + 1});
    for(int i = n; i >= 1; i--){
        int l = i, r = n;
        if(!mp[calc(i, i)]){
            par[0][i] = i;
            mx[i] = i;
            st.update(1, 1, n + 1, i, {i, i});
            continue;
        }
        while(l < r){
            int mid = (l + r + 1) / 2;
            if(mp[calc(i, mid)]){
                l = mid;
            }
            else{
                r = mid - 1;
            }
        }
        pii a = st.ask(1, 1, n + 1, i + 1, l + 1);
        par[0][i] = a.second;
        mx[i] = l + 1;
        st.update(1, 1, n + 1, i, {a.first, 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++;
        r++;
        int ans = 0;
        for(int i = LOGMAX - 1; i >= 0; i--){
            if(mx[l] >= r) break;
            if(par[i][l] < r){
                ans += (1 << i);
                l = par[i][l];
            }
        }
        if(mx[l] < r) cout << "-1\n";
        else cout << ans + 1 << '\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: 'long long 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
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 357 ms 16464 KB Output is correct
2 Incorrect 539 ms 41296 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 434 ms 54964 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 357 ms 16464 KB Output is correct
2 Incorrect 539 ms 41296 KB Output isn't correct
3 Halted 0 ms 0 KB -