oj.uz

Submission #634516

# Submission time Handle Problem Language Result Execution time Memory
634516 2022-08-24T13:55:19 Z MohammadAghil Dabbeh (INOI20_dabbeh) C++17
100 / 100
 1887 ms 121012 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target ("avx2")
using namespace std;

typedef long long ll;
typedef pair<int, int> pp;

#define rep(i,l,r) for(int i = (l); i < (r); i++)
#define per(i,r,l) for(int i = (r); i >= (l); i--)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define pb push_back
#define ff first
#define ss second

void dbg(){
    cerr << endl;
}
template<typename Head, typename... Tail> void dbg(Head h, Tail... t){
    cerr << " " << h << ",";
    dbg(t...);
}
#define er(...) cerr << __LINE__ << " <" << #__VA_ARGS__ << ">:", dbg(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void IOS(){
    cin.tie(0) -> sync_with_stdio(0);
//    #ifndef ONLINE_JUDGE
//        freopen("inp.txt", "r", stdin);
//        freopen("out.txt", "w", stdout);
//    #endif
}

const ll mod = 1e9 + 7, mod2 = 1e9 + 9, maxn = 3e5 + 5, lg = 19, inf = ll(1e9) + 5;

/*
struct C{
    int operator()(pair<int, int> x) const {
        return x.ff^x.ss;
    }
};

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

gp_hash_table<pair<int, int>, bool, C> is;

void add(string s){
    pp hsh = {0, 0};
    for(char c: s){
        hsh.ff = (hsh.ff*p + c - 'a' + 1)%mod;
        hsh.ss = (hsh.ss*p + c - 'a' + 1)%mod2;
        is[hsh] = true;
    }
}

ll pw1[maxn], pw2[maxn];
pp hsh[maxn];

void build_hash(string s){
    rep(i,0,sz(s)){
        hsh[i].ff = ((i?hsh[i-1].ff:0)*p + s[i] - 'a' + 1)%mod;
        hsh[i].ss = ((i?hsh[i-1].ss:0)*p + s[i] - 'a' + 1)%mod2;
    }
    pw1[0] = pw2[0] = 1;
    rep(i,1,sz(s) + 1){
        pw1[i] = pw1[i-1]*p%mod;
        pw2[i] = pw2[i-1]*p%mod2;
    }
}

pair<int, int> get_hsh(int l, int r){
    return {
        (hsh[r].ff - (l?hsh[l-1].ff*pw1[r-l+1]%mod:0) + mod)%mod,
        (hsh[r].ss - (l?hsh[l-1].ss*pw2[r-l+1]%mod2:0) + mod2)%mod2
    };
}

*/
int nxt[maxn][lg], nxt_id[maxn][lg];
pair<int, int> rmq[maxn][lg];
int lgg[maxn], m;

void build_rmq(int x){
    m++;
    rep(i,0,m) rmq[i][0] = {nxt[i][x], i};
    rep(i,2,m + 1) lgg[i] = lgg[i>>1] + 1;
    rep(j,1,lg){
        rep(i,0,m - (1<<j) + 1){
            rmq[i][j] = max(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
        }
    }
    m--;
}

pp get_rmq(int l, int r){
    int k = lgg[r - l + 1];
    return max(rmq[l][k], rmq[r-(1<<k)+1][k]);
}

vector<int> SuffixArray(string s){
     s += '$';
     int n = sz(s);
     vector<int> srt(n); iota(all(srt), 0);
     sort(all(srt), [&](int i, int j){ return s[i] < s[j]; });
     vector<int> rnk(n);
     rnk[srt[0]] = 0;
     rep(i,1,n){
          rnk[srt[i]] = rnk[srt[i-1]] + (s[srt[i]] != s[srt[i-1]]);
     }
     for(int k = 1; k <= n; k <<= 1){
          sort(all(srt), [&](int i, int j){
               if(rnk[i] == rnk[j]){
                    return rnk[i+k] < rnk[j+k];
               }
               return rnk[i] < rnk[j];
          });
          vector<int> tmp(n);
          tmp[srt[0]] = 0;
          rep(i,1,n){
               tmp[srt[i]] = tmp[srt[i-1]] + (rnk[srt[i]] != rnk[srt[i-1]] || rnk[srt[i]+k] != rnk[srt[i-1]+k]);
          }
          rnk = tmp;
          // rep(i,0,n) er(i, k, rnk[i]);
          // er(n);
     }
     srt.erase(begin(srt));
     return srt;
}

int main(){ IOS();
    int n, q; cin >> n >> q;
    vector<string> t(n);
    rep(i,0,n){
        cin >> t[i];
    }
    string s; cin >> s;
    m = sz(s);

    vector<int> srt = SuffixArray(s);
//    int rr = 0;
//    for(int c: srt){
//        cerr << rr++ << ' ' << string(begin(s) + c, end(s)) << endl;
//    }

    vector<vector<pp>> add(m), rem(m + 1);

    int tmp = 0;
    rep(i,0,n){
        int lx = 0, rx = m, ptr = 0;
        for(char c: t[i]){
            int lx1 = lx-1, rx1 = rx;
            while(lx1 + 1 < rx1){
                int mid = (lx1 + rx1)>>1;
                int en = srt[mid] + ptr;
                if(en >= m || c > s[en]) lx1 = mid;
                else rx1 = mid;
            }
            int lx2 = lx1, rx2 = rx;
            while(lx2 + 1 < rx2){
                int mid = (lx2 + rx2)>>1;
                int en = srt[mid] + ptr;
                if(en >= m || c >= s[en]) lx2 = mid;
                else rx2 = mid;
            }
            if(lx1 == lx2) break;
            ptr++;
            lx = rx1, rx = rx2;
            add[lx].pb({ptr, tmp});
            rem[rx-1].pb({ptr, tmp}); tmp++;
//            er(i, lx, rx-1);
        }
    }

    rep(j,0,lg) nxt[m][j] = nxt_id[m][j] = m;
    vector<bool> is(maxn<<1);
    priority_queue<pp> pq;
    rep(i,0,m){
        for(pp c: add[i]) pq.push(c), is[c.ss] = true;
        while(sz(pq) && !is[pq.top().ss]) pq.pop();
        nxt[srt[i]][0] = srt[i];
        if(sz(pq)) nxt[srt[i]][0] += pq.top().ff;
        for(pp c: rem[i]) is[c.ss] = false;
    }

//    rep(i,0,m) er(i, nxt[i][0]);

    /*
    build_hash(s);

    rep(i,0,m){
        int lx = i-1, rx = m;
        while(lx + 1 < rx){
            int mid = (lx + rx)>>1;
            if(is[get_hsh(i, mid)]) lx = mid;
            else rx = mid;
        }
        nxt[i][0] = rx;
    }
    */

    build_rmq(0);
    rep(i,0,m){
        nxt_id[i][0] = get_rmq(i, nxt[i][0]).ss;
    }
    rep(j,1,lg){
        rep(i,0,m){
            nxt[i][j] = nxt[nxt_id[i][j-1]][j-1], nxt_id[i][j] = nxt_id[nxt_id[i][j-1]][j-1];
        }
    }

    while(q--){
        int l, r; cin >> l >> r; r--;
        if(nxt[l][lg-1] <= r) cout << -1 << '\n';
        else{
            int ans = 0;
            per(i,lg-1,0){
                int nx = nxt[l][i];
                if(nx <= r){
                    ans |= 1<<i;
                    l = nxt_id[l][i];
                }
            }
            cout << ans + 1 << '\n';
        }
    }
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 76 ms 2072 KB Output is correct
3 Correct 102 ms 2080 KB Output is correct
4 Correct 90 ms 2752 KB Output is correct
5 Correct 84 ms 2284 KB Output is correct
6 Correct 82 ms 3068 KB Output is correct
7 Correct 87 ms 2076 KB Output is correct
8 Correct 98 ms 3096 KB Output is correct
9 Correct 78 ms 2280 KB Output is correct
10 Correct 78 ms 1984 KB Output is correct
11 Correct 67 ms 1656 KB Output is correct
12 Correct 95 ms 1316 KB Output is correct
13 Correct 77 ms 1504 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1222 ms 107852 KB Output is correct
2 Correct 1203 ms 108452 KB Output is correct
3 Correct 1148 ms 107796 KB Output is correct
4 Correct 1149 ms 107868 KB Output is correct
5 Correct 1164 ms 108508 KB Output is correct
6 Correct 1191 ms 108072 KB Output is correct
7 Correct 1192 ms 109084 KB Output is correct
8 Correct 1152 ms 108700 KB Output is correct
9 Correct 1137 ms 108536 KB Output is correct
10 Correct 1249 ms 108236 KB Output is correct
11 Correct 1146 ms 108056 KB Output is correct
12 Correct 1099 ms 107864 KB Output is correct
13 Correct 1100 ms 107984 KB Output is correct
14 Correct 1229 ms 107856 KB Output is correct
15 Correct 1046 ms 108720 KB Output is correct
16 Correct 1153 ms 121012 KB Output is correct
17 Correct 1069 ms 113348 KB Output is correct
18 Correct 1095 ms 113196 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 76 ms 2072 KB Output is correct
3 Correct 102 ms 2080 KB Output is correct
4 Correct 90 ms 2752 KB Output is correct
5 Correct 84 ms 2284 KB Output is correct
6 Correct 82 ms 3068 KB Output is correct
7 Correct 87 ms 2076 KB Output is correct
8 Correct 98 ms 3096 KB Output is correct
9 Correct 78 ms 2280 KB Output is correct
10 Correct 78 ms 1984 KB Output is correct
11 Correct 67 ms 1656 KB Output is correct
12 Correct 95 ms 1316 KB Output is correct
13 Correct 77 ms 1504 KB Output is correct
14 Correct 1222 ms 107852 KB Output is correct
15 Correct 1203 ms 108452 KB Output is correct
16 Correct 1148 ms 107796 KB Output is correct
17 Correct 1149 ms 107868 KB Output is correct
18 Correct 1164 ms 108508 KB Output is correct
19 Correct 1191 ms 108072 KB Output is correct
20 Correct 1192 ms 109084 KB Output is correct
21 Correct 1152 ms 108700 KB Output is correct
22 Correct 1137 ms 108536 KB Output is correct
23 Correct 1249 ms 108236 KB Output is correct
24 Correct 1146 ms 108056 KB Output is correct
25 Correct 1099 ms 107864 KB Output is correct
26 Correct 1100 ms 107984 KB Output is correct
27 Correct 1229 ms 107856 KB Output is correct
28 Correct 1046 ms 108720 KB Output is correct
29 Correct 1153 ms 121012 KB Output is correct
30 Correct 1069 ms 113348 KB Output is correct
31 Correct 1095 ms 113196 KB Output is correct
32 Correct 912 ms 72992 KB Output is correct
33 Correct 941 ms 73760 KB Output is correct
34 Correct 1197 ms 73512 KB Output is correct
35 Correct 1047 ms 73500 KB Output is correct
36 Correct 1016 ms 73228 KB Output is correct
37 Correct 1018 ms 73340 KB Output is correct
38 Correct 1535 ms 109932 KB Output is correct
39 Correct 1716 ms 109492 KB Output is correct
40 Correct 1887 ms 111220 KB Output is correct
41 Correct 1484 ms 110236 KB Output is correct
42 Correct 1862 ms 109608 KB Output is correct
43 Correct 644 ms 39044 KB Output is correct
44 Correct 627 ms 39316 KB Output is correct
45 Correct 573 ms 37828 KB Output is correct
46 Correct 726 ms 40544 KB Output is correct
47 Correct 1771 ms 109392 KB Output is correct
48 Correct 1703 ms 109620 KB Output is correct
49 Correct 1835 ms 109756 KB Output is correct
50 Correct 1701 ms 109660 KB Output is correct
51 Correct 1328 ms 109388 KB Output is correct
52 Correct 1321 ms 116320 KB Output is correct
53 Correct 1352 ms 110016 KB Output is correct