oj.uz

Submission #1002071

# Submission time Handle Problem Language Result Execution time Memory
1002071 2024-06-19T09:41:09 Z vjudge1 Dabbeh (INOI20_dabbeh) C++17
100 / 100
 1299 ms 91016 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define endl "\n"
 
using namespace std;
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll p = 37, lg = 20;
const ll N = 5e5 + 5;
ll mod[] = {998244353, (ll)1e9 + 9};
long long pw[3][N], invpw[3][N];
ll up[lg][N];
ll binpow(ll n, ll p, ll mod)
{
    n %= mod;
    ll ans = 1;
    while (p)
    {
        ans = 1ll * ans * (p & 1 ? n : 1) % mod;
        p >>= 1;
        n = 1ll * n * n % mod;
    }
    return ans;
}
ll inv(ll n, ll mod)
{
    return binpow(n, mod - 2, mod);
}
struct SegTree
{
    vector<pair<ll, ll>> st;
    ll n;
    SegTree(ll sz = 0)
    {
        n = sz;
        st.resize(n << 1, make_pair(0, 0));
    }
    void set(ll i, ll v)
    {
        st[i + n] = make_pair(v, i);
    }
    void build()
    {
        for (ll i = n - 1; i >= 1; i--) st[i] = max(st[i << 1], st[i << 1 | 1]);
    }
    pair<ll, ll> query(ll l, ll r)
    {
        pair<ll, ll> ans = make_pair(-1, -1);
        for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1)
        {
            if (l & 1) ans = max(ans, st[l++]);
            if (r & 1) ans = max(ans, st[--r]);
        }
        return ans;
    }
};
ll pref[2][N];
array<int, 2> gethash(ll l, ll r)
{
    if (l > r) return array<int, 2>{0, 0};
    array<int, 2> ans = {0, 0};
    for (ll i = 0; i < 2; i++)
        ans[i] = 1ll * (pref[i][r] - (l - 1 < 0 ? 0 : pref[i][l - 1]) + mod[i]) % mod[i] * invpw[i][l] % mod[i];
    return ans;
}
void solve()
{
    ll n, q;
    cin >> n >> q;
    string t[n];
    for (string &i : t) cin >> i;
    for (ll x = 0; x < 2; x++) pw[x][0] = invpw[x][0] = 1;
    for (ll x = 0; x < 2; x++)
    {
        ll invp = inv(p, mod[x]);
        for (ll i = 1; i < N; i++) pw[x][i] = 1ll * pw[x][i - 1] * p % mod[x];
        for (ll i = 1; i < N; i++) invpw[x][i] = 1ll * invpw[x][i - 1] * invp % mod[x];
    }
    vector<array<int, 2>> hs;
    hs.push_back({0, 0});
  	string s;
    cin >> s;
    for (string e : t)
    {
        array<int, 2> cur = {0, 0};
        for (ll j = 0; j < e.size(); j++)
        { 
            for (ll x = 0; x < 2; x++)
            cur[x] = (cur[x] + 1ll * (e[j] - 'a' + 1) * pw[x][j]) % mod[x];
            hs.push_back(cur);
        }
    }
    sort(hs.begin(), hs.end());
    for (ll x = 0; x < 2; x++)
    for (ll i = 0; i < s.size(); i++)
        pref[x][i] = ((i - 1 < 0 ? 0 : pref[x][i - 1]) + 1ll * (s[i] - 'a' + 1) * pw[x][i]) % mod[x];
    ll rig[s.size()];
    for (ll i = 0; i < s.size(); i++)
    {
        ll l = i, r = s.size() - 1, mid, pos;
        array<int, 2> p;
        rig[i] = i;
        while (l <= r)
        {
            mid = (l + r) >> 1;
            p = gethash(i, mid);
            pos = lower_bound(hs.begin(), hs.end(), p) - hs.begin();
            if (pos != hs.size() and hs[pos] == p) rig[i] = mid + 1, l = mid + 1;
            else r = mid - 1;
        }
    }
    SegTree st(s.size() + 1);
    for (ll i = 0; i < s.size(); i++) st.set(i, rig[i]);
    st.set(s.size(), s.size());
    st.build();
    for (ll i = 0; i < s.size(); i++) up[0][i] = rig[i] == i ? i : st.query(i, rig[i]).second;
    up[0][s.size()] = s.size();
    for (ll bit = 1; bit < lg; bit++)
        for (ll i = 0; i <= s.size(); i++) up[bit][i] = up[bit - 1][up[bit - 1][i]];
    while (q--)
    {
        ll l, r;
        cin >> l >> r;
        if (rig[l] >= r) cout << "1\n";
        else
        {
            ll ans = 1;
            for (ll bit = lg - 1; bit >= 0; bit--) if (rig[up[bit][l]] < r) ans += 1 << bit, l = up[bit][l];
            if (rig[up[0][l]] < r) ans = -1;
            else ans++;
            cout << ans << endl;
        }
    }
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t = 1;
    // precomp();
    // cin >> t;
    for (ll cs = 1; cs <= t; cs++)
        solve();
    // cerr << "\nTime elapsed: " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:89: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]
   89 |         for (ll j = 0; j < e.size(); j++)
      |                        ~~^~~~~~~~~~
Main.cpp:98:22: 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]
   98 |     for (ll i = 0; i < s.size(); i++)
      |                    ~~^~~~~~~~~~
Main.cpp:101:22: 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]
  101 |     for (ll i = 0; i < s.size(); i++)
      |                    ~~^~~~~~~~~~
Main.cpp:111:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |             if (pos != hs.size() and hs[pos] == p) rig[i] = mid + 1, l = mid + 1;
      |                 ~~~~^~~~~~~~~~~~
Main.cpp:116:22: 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]
  116 |     for (ll i = 0; i < s.size(); i++) st.set(i, rig[i]);
      |                    ~~^~~~~~~~~~
Main.cpp:119:22: 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]
  119 |     for (ll i = 0; i < s.size(); i++) up[0][i] = rig[i] == i ? i : st.query(i, rig[i]).second;
      |                    ~~^~~~~~~~~~
Main.cpp:122: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]
  122 |         for (ll i = 0; i <= s.size(); i++) up[bit][i] = up[bit - 1][up[bit - 1][i]];
      |                        ~~^~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16220 KB Output is correct
2 Correct 97 ms 22708 KB Output is correct
3 Correct 94 ms 22328 KB Output is correct
4 Correct 108 ms 23732 KB Output is correct
5 Correct 102 ms 22972 KB Output is correct
6 Correct 130 ms 24260 KB Output is correct
7 Correct 120 ms 24272 KB Output is correct
8 Correct 118 ms 24576 KB Output is correct
9 Correct 111 ms 23768 KB Output is correct
10 Correct 95 ms 20652 KB Output is correct
11 Correct 87 ms 23592 KB Output is correct
12 Correct 82 ms 21268 KB Output is correct
13 Correct 75 ms 22564 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 769 ms 82148 KB Output is correct
2 Correct 824 ms 83556 KB Output is correct
3 Correct 699 ms 82264 KB Output is correct
4 Correct 634 ms 81488 KB Output is correct
5 Correct 612 ms 81644 KB Output is correct
6 Correct 738 ms 83756 KB Output is correct
7 Correct 828 ms 84252 KB Output is correct
8 Correct 757 ms 83216 KB Output is correct
9 Correct 771 ms 83724 KB Output is correct
10 Correct 765 ms 84400 KB Output is correct
11 Correct 716 ms 82504 KB Output is correct
12 Correct 694 ms 82208 KB Output is correct
13 Correct 814 ms 84468 KB Output is correct
14 Correct 783 ms 84296 KB Output is correct
15 Correct 545 ms 81412 KB Output is correct
16 Correct 700 ms 84816 KB Output is correct
17 Correct 497 ms 81788 KB Output is correct
18 Correct 506 ms 81516 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16220 KB Output is correct
2 Correct 97 ms 22708 KB Output is correct
3 Correct 94 ms 22328 KB Output is correct
4 Correct 108 ms 23732 KB Output is correct
5 Correct 102 ms 22972 KB Output is correct
6 Correct 130 ms 24260 KB Output is correct
7 Correct 120 ms 24272 KB Output is correct
8 Correct 118 ms 24576 KB Output is correct
9 Correct 111 ms 23768 KB Output is correct
10 Correct 95 ms 20652 KB Output is correct
11 Correct 87 ms 23592 KB Output is correct
12 Correct 82 ms 21268 KB Output is correct
13 Correct 75 ms 22564 KB Output is correct
14 Correct 769 ms 82148 KB Output is correct
15 Correct 824 ms 83556 KB Output is correct
16 Correct 699 ms 82264 KB Output is correct
17 Correct 634 ms 81488 KB Output is correct
18 Correct 612 ms 81644 KB Output is correct
19 Correct 738 ms 83756 KB Output is correct
20 Correct 828 ms 84252 KB Output is correct
21 Correct 757 ms 83216 KB Output is correct
22 Correct 771 ms 83724 KB Output is correct
23 Correct 765 ms 84400 KB Output is correct
24 Correct 716 ms 82504 KB Output is correct
25 Correct 694 ms 82208 KB Output is correct
26 Correct 814 ms 84468 KB Output is correct
27 Correct 783 ms 84296 KB Output is correct
28 Correct 545 ms 81412 KB Output is correct
29 Correct 700 ms 84816 KB Output is correct
30 Correct 497 ms 81788 KB Output is correct
31 Correct 506 ms 81516 KB Output is correct
32 Correct 574 ms 63140 KB Output is correct
33 Correct 668 ms 65664 KB Output is correct
34 Correct 740 ms 66712 KB Output is correct
35 Correct 634 ms 65992 KB Output is correct
36 Correct 670 ms 66876 KB Output is correct
37 Correct 509 ms 63376 KB Output is correct
38 Correct 1125 ms 90328 KB Output is correct
39 Correct 1094 ms 87980 KB Output is correct
40 Correct 1230 ms 91016 KB Output is correct
41 Correct 1299 ms 90964 KB Output is correct
42 Correct 1165 ms 88864 KB Output is correct
43 Correct 459 ms 45696 KB Output is correct
44 Correct 447 ms 45592 KB Output is correct
45 Correct 412 ms 44952 KB Output is correct
46 Correct 484 ms 47332 KB Output is correct
47 Correct 980 ms 87232 KB Output is correct
48 Correct 1077 ms 88372 KB Output is correct
49 Correct 951 ms 87084 KB Output is correct
50 Correct 1218 ms 90308 KB Output is correct
51 Correct 458 ms 85316 KB Output is correct
52 Correct 630 ms 86392 KB Output is correct
53 Correct 495 ms 85628 KB Output is correct