oj.uz

답안 #634492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
634492 2022-08-24T13:25:24 Z MohammadAghil Dabbeh (INOI20_dabbeh) C++17
100 / 100
 859 ms 120976 KB 
#include <bits/stdc++.h>
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.pb('$');
    int n = sz(s);
    vector<int> p(n), rnk(n), tmp(n), pn(n), cnt(n);
    iota(all(p), 0);
    sort(all(p), [&](int i, int j){return s[i] < s[j];});
    rep(i,1,n){
        rnk[p[i]] = rnk[p[i-1]] + (s[p[i]] != s[p[i-1]]);
    }
    auto get = [&](int i, int k){
        return pp(rnk[i], rnk[(i + (1<<k))%n]);
    };
    for(int k = 0; (1 << k) < n; k++){
        rep(i,0,n) pn[i] = (p[i] - (1<<k) + n)%n;
        fill(all(cnt), 0);
        rep(i,0,n) cnt[rnk[i]]++;
        rep(i,1,n) cnt[i] += cnt[i-1];
        per(i,n-1,0) p[--cnt[rnk[pn[i]]]] = pn[i];
        tmp[p[0]] = 0;
        rep(i,1,n) tmp[p[i]] = tmp[p[i-1]] + (get(p[i], k) != get(p[i-1], k));
        rnk.swap(tmp);
    }
    p.erase(begin(p));
    return p;
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 68 ms 2064 KB Output is correct
3 Correct 74 ms 1952 KB Output is correct
4 Correct 83 ms 2820 KB Output is correct
5 Correct 86 ms 2112 KB Output is correct
6 Correct 82 ms 3056 KB Output is correct
7 Correct 76 ms 2108 KB Output is correct
8 Correct 78 ms 3108 KB Output is correct
9 Correct 78 ms 2372 KB Output is correct
10 Correct 73 ms 1944 KB Output is correct
11 Correct 65 ms 1632 KB Output is correct
12 Correct 61 ms 1416 KB Output is correct
13 Correct 80 ms 1532 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 461 ms 107400 KB Output is correct
2 Correct 489 ms 108532 KB Output is correct
3 Correct 481 ms 106960 KB Output is correct
4 Correct 495 ms 107764 KB Output is correct
5 Correct 535 ms 108432 KB Output is correct
6 Correct 478 ms 108148 KB Output is correct
7 Correct 509 ms 109108 KB Output is correct
8 Correct 516 ms 108700 KB Output is correct
9 Correct 529 ms 108648 KB Output is correct
10 Correct 476 ms 108352 KB Output is correct
11 Correct 496 ms 107400 KB Output is correct
12 Correct 478 ms 107544 KB Output is correct
13 Correct 477 ms 107312 KB Output is correct
14 Correct 478 ms 107236 KB Output is correct
15 Correct 504 ms 108792 KB Output is correct
16 Correct 400 ms 120976 KB Output is correct
17 Correct 369 ms 113376 KB Output is correct
18 Correct 355 ms 113136 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 68 ms 2064 KB Output is correct
3 Correct 74 ms 1952 KB Output is correct
4 Correct 83 ms 2820 KB Output is correct
5 Correct 86 ms 2112 KB Output is correct
6 Correct 82 ms 3056 KB Output is correct
7 Correct 76 ms 2108 KB Output is correct
8 Correct 78 ms 3108 KB Output is correct
9 Correct 78 ms 2372 KB Output is correct
10 Correct 73 ms 1944 KB Output is correct
11 Correct 65 ms 1632 KB Output is correct
12 Correct 61 ms 1416 KB Output is correct
13 Correct 80 ms 1532 KB Output is correct
14 Correct 461 ms 107400 KB Output is correct
15 Correct 489 ms 108532 KB Output is correct
16 Correct 481 ms 106960 KB Output is correct
17 Correct 495 ms 107764 KB Output is correct
18 Correct 535 ms 108432 KB Output is correct
19 Correct 478 ms 108148 KB Output is correct
20 Correct 509 ms 109108 KB Output is correct
21 Correct 516 ms 108700 KB Output is correct
22 Correct 529 ms 108648 KB Output is correct
23 Correct 476 ms 108352 KB Output is correct
24 Correct 496 ms 107400 KB Output is correct
25 Correct 478 ms 107544 KB Output is correct
26 Correct 477 ms 107312 KB Output is correct
27 Correct 478 ms 107236 KB Output is correct
28 Correct 504 ms 108792 KB Output is correct
29 Correct 400 ms 120976 KB Output is correct
30 Correct 369 ms 113376 KB Output is correct
31 Correct 355 ms 113136 KB Output is correct
32 Correct 527 ms 74460 KB Output is correct
33 Correct 534 ms 76776 KB Output is correct
34 Correct 529 ms 76628 KB Output is correct
35 Correct 497 ms 76556 KB Output is correct
36 Correct 451 ms 76248 KB Output is correct
37 Correct 526 ms 76136 KB Output is correct
38 Correct 813 ms 114600 KB Output is correct
39 Correct 843 ms 113976 KB Output is correct
40 Correct 810 ms 115876 KB Output is correct
41 Correct 713 ms 114940 KB Output is correct
42 Correct 835 ms 113204 KB Output is correct
43 Correct 365 ms 42932 KB Output is correct
44 Correct 368 ms 43164 KB Output is correct
45 Correct 406 ms 41652 KB Output is correct
46 Correct 355 ms 44528 KB Output is correct
47 Correct 840 ms 113396 KB Output is correct
48 Correct 858 ms 113588 KB Output is correct
49 Correct 859 ms 114052 KB Output is correct
50 Correct 853 ms 113600 KB Output is correct
51 Correct 512 ms 113688 KB Output is correct
52 Correct 478 ms 120496 KB Output is correct
53 Correct 555 ms 114136 KB Output is correct