oj.uz

Submission #1016129

# Submission time Handle Problem Language Result Execution time Memory
1016129 2024-07-07T12:29:04 Z fuad27 Dabbeh (INOI20_dabbeh) C++17
100 / 100
 488 ms 63292 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")

namespace hsg {
  mt19937_64 rng(chrono::steady_clock().now().time_since_epoch().count());
  const long long mod = (long long)1e18+9;
  long long R=rng()%(mod);
  struct PolyHash {
    vector<long long> pref,pw;
    int n;
    PolyHash(string s) {
      n = s.size();
      pref.resize(n+1);
      pw.resize(n+1);
      pw[0]=1;
      for(int i = 1;i<=n;i++) {
        pref[i] = ((__int128_t)pref[i-1]*R)%mod;
        pref[i]+=s[i-1];
        pref[i]%=mod;
        pw[i] = ((__int128_t)pw[i-1]*R)%mod;
      }
    }
    long long get(int l, int r) {
 
      long long hs=(pref[r]-((__int128_t)pref[l-1]*pw[r-l+1])%mod + mod)%mod;
      return hs;
    }
  };
};
const int LL = 3e5+10;
const int LG = 20;
int up[LL][LG];
int nxt[LL];
bool cmp(const string& A, const string &B)  {
  return A.size() < B.size();
};
int get(int l, int r) {
  int at = l;
  long long ans=1;
  if(nxt[at] >= r)return 1;
  for(int i = LG-1;i>=0;i--) {
    if(nxt[up[at][i]] < r) {
      at = up[at][i];
      ans+=(1ll<<i);
    }
  }
  if(nxt[up[at][0]] < r)return -1;
  return ans+1;
}
int get2(int l, int r) {
  int at = l;
  int ans=1;
  while(nxt[at] < r) {
    if(at == up[at][0]) {
      return -1;
    }
    at = up[at][0];
    ans++;
  }
  return ans;
}
int main () {
  cin.tie(0)->sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  string s[n];
  for(int i =0;i<n;i++) {
    cin >> s[i];
  }
  sort(s, s+n, cmp);
  string S;
  cin >> S;
  int L = S.size();
  vector<pair<int,int>> inv;
  memset(nxt, -1, sizeof nxt);
  hsg::PolyHash hs(S);
  vector<long long> mp[L+1];
  for(int i = 0;i<n;i++) {
    hsg::PolyHash hss(s[i]);
    for(int j = 0 ;j<min(L, (int)s[i].size());j++) {
      mp[j+1].push_back(hss.get(1, j+1));
    }
  }
  for(int i = 0;i<=L;i++)sort(mp[i].begin(), mp[i].end());
  for(int i = 0;i<L;i++)nxt[i]=i;
  for(int i = 0;i<L;i++) {
    nxt[i]=i;
    int lo = 1, hi = L-i;
    while(lo <= hi) {
      int mid = (lo+hi)/2;
      long long hsss = hs.get(i+1, i+mid);
      auto it = lower_bound(mp[mid].begin(), mp[mid].end(), hsss);
      if(it != mp[mid].end() and (*it) == hsss) {
        nxt[i] = min(L, i+mid);
        lo = mid+1;
      }
      else {
        hi=mid-1;
      }
    }
  }
  {
    vector<int> v[L+1];
    for(int i= 0;i<L;i++) {
      v[nxt[i]].push_back(i);
    }
    vector<int> stk;
    for(int i = 0;i<=L;i++) {
      while(stk.size() and nxt[stk.back()] <= nxt[i]) {
        stk.pop_back();
      }
      stk.push_back(i);
      for(int j:v[i]){
        int idx = (*lower_bound(stk.begin(), stk.end(), j));
        up[j][0] = idx;
      }
    }
    for(int i = L-1;i>=0;i--) {
      if(up[i][0] == 0)up[i][0] = i;

    }
    for(int i = L-1;i>=0;i--) {
      for(int j = 1;j<LG;j++)up[i][j] = up[up[i][j-1]][j-1];
    }
  }
  while(m--) {
    int l, r;
    cin >> l >> r;
    int res = get(l, r);
    cout << res << "\n";
  }

}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 82 ms 8784 KB Output is correct
3 Correct 75 ms 9040 KB Output is correct
4 Correct 87 ms 10580 KB Output is correct
5 Correct 80 ms 9980 KB Output is correct
6 Correct 90 ms 10376 KB Output is correct
7 Correct 68 ms 7636 KB Output is correct
8 Correct 96 ms 11596 KB Output is correct
9 Correct 85 ms 10996 KB Output is correct
10 Correct 71 ms 7080 KB Output is correct
11 Correct 69 ms 10992 KB Output is correct
12 Correct 44 ms 6632 KB Output is correct
13 Correct 47 ms 8940 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 54480 KB Output is correct
2 Correct 343 ms 55460 KB Output is correct
3 Correct 334 ms 53980 KB Output is correct
4 Correct 287 ms 52484 KB Output is correct
5 Correct 296 ms 52352 KB Output is correct
6 Correct 338 ms 55456 KB Output is correct
7 Correct 350 ms 55944 KB Output is correct
8 Correct 296 ms 55244 KB Output is correct
9 Correct 316 ms 55148 KB Output is correct
10 Correct 283 ms 55936 KB Output is correct
11 Correct 271 ms 54620 KB Output is correct
12 Correct 242 ms 53624 KB Output is correct
13 Correct 287 ms 57172 KB Output is correct
14 Correct 295 ms 56052 KB Output is correct
15 Correct 220 ms 52052 KB Output is correct
16 Correct 110 ms 57708 KB Output is correct
17 Correct 112 ms 55024 KB Output is correct
18 Correct 97 ms 55084 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 82 ms 8784 KB Output is correct
3 Correct 75 ms 9040 KB Output is correct
4 Correct 87 ms 10580 KB Output is correct
5 Correct 80 ms 9980 KB Output is correct
6 Correct 90 ms 10376 KB Output is correct
7 Correct 68 ms 7636 KB Output is correct
8 Correct 96 ms 11596 KB Output is correct
9 Correct 85 ms 10996 KB Output is correct
10 Correct 71 ms 7080 KB Output is correct
11 Correct 69 ms 10992 KB Output is correct
12 Correct 44 ms 6632 KB Output is correct
13 Correct 47 ms 8940 KB Output is correct
14 Correct 319 ms 54480 KB Output is correct
15 Correct 343 ms 55460 KB Output is correct
16 Correct 334 ms 53980 KB Output is correct
17 Correct 287 ms 52484 KB Output is correct
18 Correct 296 ms 52352 KB Output is correct
19 Correct 338 ms 55456 KB Output is correct
20 Correct 350 ms 55944 KB Output is correct
21 Correct 296 ms 55244 KB Output is correct
22 Correct 316 ms 55148 KB Output is correct
23 Correct 283 ms 55936 KB Output is correct
24 Correct 271 ms 54620 KB Output is correct
25 Correct 242 ms 53624 KB Output is correct
26 Correct 287 ms 57172 KB Output is correct
27 Correct 295 ms 56052 KB Output is correct
28 Correct 220 ms 52052 KB Output is correct
29 Correct 110 ms 57708 KB Output is correct
30 Correct 112 ms 55024 KB Output is correct
31 Correct 97 ms 55084 KB Output is correct
32 Correct 225 ms 41188 KB Output is correct
33 Correct 281 ms 43832 KB Output is correct
34 Correct 273 ms 44852 KB Output is correct
35 Correct 297 ms 44276 KB Output is correct
36 Correct 290 ms 45784 KB Output is correct
37 Correct 228 ms 41540 KB Output is correct
38 Correct 473 ms 62400 KB Output is correct
39 Correct 434 ms 59352 KB Output is correct
40 Correct 464 ms 62624 KB Output is correct
41 Correct 451 ms 62204 KB Output is correct
42 Correct 488 ms 61688 KB Output is correct
43 Correct 221 ms 28236 KB Output is correct
44 Correct 234 ms 27976 KB Output is correct
45 Correct 215 ms 27552 KB Output is correct
46 Correct 234 ms 29856 KB Output is correct
47 Correct 358 ms 58580 KB Output is correct
48 Correct 443 ms 60200 KB Output is correct
49 Correct 382 ms 58380 KB Output is correct
50 Correct 470 ms 63292 KB Output is correct
51 Correct 181 ms 58476 KB Output is correct
52 Correct 156 ms 60176 KB Output is correct
53 Correct 176 ms 58888 KB Output is correct