oj.uz

답안 #433254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433254 2021-06-19T11:02:18 Z parsabahrami Dabbeh (INOI20_dabbeh) C++17
50 / 100
 2000 ms 439728 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "fast-math", "Ofast")

using namespace std;
     
typedef long long int ll;
typedef pair<int, int> pii;
  
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second
     
const int N = 3e5 + 10, MOD[] = {(int) 1e9 + 9, (int) 1e9 + 7};
struct pair_hash {
    template <class T1, class T2>
    size_t operator () (const std::pair<T1,T2> &p) const {
        auto h1 = std::hash<T1>{}(p.first);
        auto h2 = std::hash<T2>{}(p.second);
        return h1 ^ h2;  
    }
};

int pw[2][N], H[2][N], dp[19][N], rmq[19][19][N], lg[N], n, m, q, base[] = {37, 31}; 
char S[N * 2]; 
unordered_map<pii, int, pair_hash> mp;
pii get_hash(int l, int r) {
    pii h = {(H[0][r] - 1ll * H[0][l - 1] * pw[0][r - l + 1] % MOD[0] + MOD[0]) % MOD[0], 
        (H[1][r] - 1ll * H[1][l - 1] * pw[1][r - l + 1] % MOD[1] + MOD[1]) % MOD[1]};
    return h;
}
     
void build_rmq(int id) {
    for (int i = 1; i <= n; i++) {
        rmq[id][0][i] = dp[id][i];
    }
    for (int i = 1; i < 19; i++) {
        for (int j = 1; j <= n; j++) {
            if (j + (1 << i) <= n + 1) {
                rmq[id][i][j] = max(rmq[id][i - 1][j], rmq[id][i - 1][j + (1 << (i - 1))]);
            }
        }
    }
}
     
int get_max(int id, int l, int r) {
    if (r <= l) return l;
    r = min(r, n + 1);
    int x = lg[r - l];
    return max(rmq[id][x][l], rmq[id][x][r - (1 << x)]);
}
     
int main() {
    for (int i = 2; i < N; i++) 
        lg[i] = lg[i >> 1] + 1;
    pw[0][0] = pw[1][0] = 1;
    for (int i = 1; i < N; i++) 
        for (int j : {0, 1})
            pw[j][i] = 1ll * pw[j][i - 1] * base[j] % MOD[j];
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; i++) {
        scanf("%s", S);
        pii h = {0, 0};
        for (int j = 0; S[j]; j++) {
            h = {(1ll * h.F * base[0] % MOD[0] + S[j] - 'a' + 1) % MOD[0], 
                (1ll * h.S * base[1] % MOD[1] + S[j] - 'a' + 1) % MOD[1]};
            mp[h] = 1;
        }
    }
    scanf("%s", S + 1); m = strlen(S + 1);
    for (int i = 1; i <= m; i++) {
        for (int j : {0, 1}) 
            H[j][i] = (1ll * H[j][i - 1] * base[j] % MOD[j] + S[i] - 'a' + 1) % MOD[j];
    }
    swap(n, m);
    for (int i = 1; i <= n; i++) {
        int l = i - 1, r = n + 1;
        while (r - l > 1) {
            int md = (l + r) >> 1;
            if (mp.count(get_hash(i, md))) l = md;
            else r = md;
        }
        dp[0][i] = l + 1;
    }
    for (int j = 1; j < 19; j++) {
        build_rmq(j - 1);
        for (int i = 1; i <= n; i++) {
            dp[j][i] = get_max(j - 1, i, dp[j - 1][i] + 1);
        }
    }
    for (build_rmq(18); q; q--) {
        int l, r; scanf("%d%d", &l, &r); l++;
        int ret = 0, p = l;
        for (int i = 18; ~i; i--) {
            if (get_max(i, l, p + 1) <= r) ret += 1 << i, p = get_max(i, l, p + 1);
        }
        printf("%d\n", ret > n ? -1 : ret + 1);
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     scanf("%d%d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         scanf("%s", S);
      |         ~~~~~^~~~~~~~~
Main.cpp:69:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     scanf("%s", S + 1); m = strlen(S + 1);
      |     ~~~~~^~~~~~~~~~~~~
Main.cpp:91:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |         int l, r; scanf("%d%d", &l, &r); l++;
      |                   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4356 KB Output is correct
2 Correct 333 ms 29100 KB Output is correct
3 Correct 244 ms 21484 KB Output is correct
4 Correct 343 ms 28888 KB Output is correct
5 Correct 278 ms 24556 KB Output is correct
6 Correct 374 ms 31760 KB Output is correct
7 Correct 375 ms 34224 KB Output is correct
8 Correct 379 ms 33060 KB Output is correct
9 Correct 342 ms 30872 KB Output is correct
10 Correct 172 ms 11864 KB Output is correct
11 Correct 328 ms 32364 KB Output is correct
12 Correct 195 ms 18540 KB Output is correct
13 Correct 254 ms 24576 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1256 ms 423496 KB Output is correct
2 Correct 1548 ms 430376 KB Output is correct
3 Correct 1140 ms 425832 KB Output is correct
4 Correct 767 ms 418772 KB Output is correct
5 Correct 727 ms 418532 KB Output is correct
6 Correct 1520 ms 430588 KB Output is correct
7 Correct 1729 ms 432992 KB Output is correct
8 Correct 1366 ms 428320 KB Output is correct
9 Correct 1606 ms 431336 KB Output is correct
10 Correct 1517 ms 437604 KB Output is correct
11 Correct 1234 ms 425984 KB Output is correct
12 Correct 1148 ms 423292 KB Output is correct
13 Correct 1596 ms 439516 KB Output is correct
14 Correct 1475 ms 437348 KB Output is correct
15 Correct 665 ms 416320 KB Output is correct
16 Correct 1168 ms 439728 KB Output is correct
17 Correct 755 ms 421812 KB Output is correct
18 Correct 724 ms 421484 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4356 KB Output is correct
2 Correct 333 ms 29100 KB Output is correct
3 Correct 244 ms 21484 KB Output is correct
4 Correct 343 ms 28888 KB Output is correct
5 Correct 278 ms 24556 KB Output is correct
6 Correct 374 ms 31760 KB Output is correct
7 Correct 375 ms 34224 KB Output is correct
8 Correct 379 ms 33060 KB Output is correct
9 Correct 342 ms 30872 KB Output is correct
10 Correct 172 ms 11864 KB Output is correct
11 Correct 328 ms 32364 KB Output is correct
12 Correct 195 ms 18540 KB Output is correct
13 Correct 254 ms 24576 KB Output is correct
14 Correct 1256 ms 423496 KB Output is correct
15 Correct 1548 ms 430376 KB Output is correct
16 Correct 1140 ms 425832 KB Output is correct
17 Correct 767 ms 418772 KB Output is correct
18 Correct 727 ms 418532 KB Output is correct
19 Correct 1520 ms 430588 KB Output is correct
20 Correct 1729 ms 432992 KB Output is correct
21 Correct 1366 ms 428320 KB Output is correct
22 Correct 1606 ms 431336 KB Output is correct
23 Correct 1517 ms 437604 KB Output is correct
24 Correct 1234 ms 425984 KB Output is correct
25 Correct 1148 ms 423292 KB Output is correct
26 Correct 1596 ms 439516 KB Output is correct
27 Correct 1475 ms 437348 KB Output is correct
28 Correct 665 ms 416320 KB Output is correct
29 Correct 1168 ms 439728 KB Output is correct
30 Correct 755 ms 421812 KB Output is correct
31 Correct 724 ms 421484 KB Output is correct
32 Correct 977 ms 274992 KB Output is correct
33 Correct 1486 ms 286696 KB Output is correct
34 Correct 1605 ms 294560 KB Output is correct
35 Correct 1631 ms 289492 KB Output is correct
36 Correct 1597 ms 297620 KB Output is correct
37 Correct 962 ms 274544 KB Output is correct
38 Execution timed out 2114 ms 439572 KB Time limit exceeded
39 Halted 0 ms 0 KB -