oj.uz

답안 #433243

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
433243 2021-06-19T10:51:41 Z parsabahrami Dabbeh (INOI20_dabbeh) C++17
50 / 100
 2000 ms 442024 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("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 4428 KB Output is correct
2 Correct 316 ms 28844 KB Output is correct
3 Correct 265 ms 21484 KB Output is correct
4 Correct 393 ms 28816 KB Output is correct
5 Correct 287 ms 24652 KB Output is correct
6 Correct 419 ms 31820 KB Output is correct
7 Correct 404 ms 34176 KB Output is correct
8 Correct 392 ms 32984 KB Output is correct
9 Correct 359 ms 30856 KB Output is correct
10 Correct 202 ms 11892 KB Output is correct
11 Correct 350 ms 32432 KB Output is correct
12 Correct 228 ms 18556 KB Output is correct
13 Correct 262 ms 24616 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1507 ms 423492 KB Output is correct
2 Correct 1667 ms 430484 KB Output is correct
3 Correct 1323 ms 426392 KB Output is correct
4 Correct 975 ms 419124 KB Output is correct
5 Correct 908 ms 419076 KB Output is correct
6 Correct 1761 ms 431280 KB Output is correct
7 Correct 1927 ms 433540 KB Output is correct
8 Correct 1521 ms 428848 KB Output is correct
9 Correct 1721 ms 431888 KB Output is correct
10 Correct 1600 ms 438284 KB Output is correct
11 Correct 1327 ms 426536 KB Output is correct
12 Correct 1324 ms 423580 KB Output is correct
13 Correct 1746 ms 440124 KB Output is correct
14 Correct 1611 ms 437976 KB Output is correct
15 Correct 674 ms 416668 KB Output is correct
16 Correct 1241 ms 440240 KB Output is correct
17 Correct 784 ms 422116 KB Output is correct
18 Correct 783 ms 421952 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4428 KB Output is correct
2 Correct 316 ms 28844 KB Output is correct
3 Correct 265 ms 21484 KB Output is correct
4 Correct 393 ms 28816 KB Output is correct
5 Correct 287 ms 24652 KB Output is correct
6 Correct 419 ms 31820 KB Output is correct
7 Correct 404 ms 34176 KB Output is correct
8 Correct 392 ms 32984 KB Output is correct
9 Correct 359 ms 30856 KB Output is correct
10 Correct 202 ms 11892 KB Output is correct
11 Correct 350 ms 32432 KB Output is correct
12 Correct 228 ms 18556 KB Output is correct
13 Correct 262 ms 24616 KB Output is correct
14 Correct 1507 ms 423492 KB Output is correct
15 Correct 1667 ms 430484 KB Output is correct
16 Correct 1323 ms 426392 KB Output is correct
17 Correct 975 ms 419124 KB Output is correct
18 Correct 908 ms 419076 KB Output is correct
19 Correct 1761 ms 431280 KB Output is correct
20 Correct 1927 ms 433540 KB Output is correct
21 Correct 1521 ms 428848 KB Output is correct
22 Correct 1721 ms 431888 KB Output is correct
23 Correct 1600 ms 438284 KB Output is correct
24 Correct 1327 ms 426536 KB Output is correct
25 Correct 1324 ms 423580 KB Output is correct
26 Correct 1746 ms 440124 KB Output is correct
27 Correct 1611 ms 437976 KB Output is correct
28 Correct 674 ms 416668 KB Output is correct
29 Correct 1241 ms 440240 KB Output is correct
30 Correct 784 ms 422116 KB Output is correct
31 Correct 783 ms 421952 KB Output is correct
32 Correct 1075 ms 277804 KB Output is correct
33 Correct 1589 ms 289556 KB Output is correct
34 Correct 1710 ms 297772 KB Output is correct
35 Correct 1707 ms 292512 KB Output is correct
36 Correct 1699 ms 300856 KB Output is correct
37 Correct 985 ms 277332 KB Output is correct
38 Execution timed out 2099 ms 442024 KB Time limit exceeded
39 Halted 0 ms 0 KB -