#744013 (C) No.2162 Copy and Paste 2

• 問題: No.2162 Copy and Paste 2
• ユーザー: 👑 ygussany
• 提出日時: 2022-03-06 21:49:15
• 言語: C (gcc 13.3.0)
• 結果: TLE
• 実行時間: -
• コード長: 2,114 bytes
• コンパイル時間: 486 ms
• コンパイル使用メモリ: 32,104 KB
• 実行使用メモリ: 510,668 KB
• 最終ジャッジ日時: 2024-11-06 21:13:44
• 合計ジャッジ時間: 11,050 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 7 TLE * 1 -- * 18

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#include <stdio.h>
void Z_algorithm(char S[], int Z[])
{
    int i, j, k, l;
    for (l = 0; S[l] != 0; l++);
    Z[0] = l;
    for (i = 1, j = 0; i < l; i++) {
        for (; i + j < l && S[i+j] == S[j]; j++);
        Z[i] = j;
        if (j == 0) continue;
        
        for (k = 1; k < j && k + Z[k] < j; k++) Z[i+k] = Z[k];
        i += k - 1;
        j -= k;
    }
}
#define HASH 9999991
const int H_Mod = HASH;
typedef struct List {
    struct List *next;
    int x, y;
} list;
int hash_func(int x, int y)
{
    return (((long long)x << 20) + y) % H_Mod;
}
#define MAX 27000000
list *hash[HASH] = {}, hd[MAX], *p;
int main()
{
    char S[200001];
    scanf("%s", S);
    
    int i, Z[200001], Z_max[200001];
    Z_algorithm(S, Z);
    for (i = 0; S[i] != 0; i++);
    Z_max[i] = 0;
    for (i--; i >= 0; i--) Z_max[i] = (Z_max[i+1] > Z[i])? Z_max[i+1]: Z[i];
    
    int h, head, tail, x, y, xx, yy, d, l[200001];
    hd[0].x = 0;
    hd[0].y = 0;
    hd[0].next = hash[0];
    hash[0] = &(hd[0]);
    l[0] = 0;
    l[1] = 1;
    for (head = 0, tail = 1, d = 0; head != tail; head++) {
        x = hd[head].x;
        y = hd[head].y;
        if (head == l[d+1]) {
            d++;
            l[d+1] = tail;
        }
        if (S[x] == 0) break;
        
        xx = x + 1;
        yy = (Z_max[xx] >= y)? y: 0;
        h = hash_func(xx, yy);
        for (p = hash[h]; p != NULL; p = p->next) if (p->x == xx && p->y == yy) break;
        if (p == NULL) {
            hd[tail].x = xx;
            hd[tail].y = yy;
            hd[tail].next = hash[h];
            hash[h] = &(hd[tail++]);
            if (tail == MAX) tail = 0;
        }
        
        if (Z[x] >= y) {
            xx = x + y;
            yy = (Z_max[xx] >= y)? y: 0;
            h = hash_func(xx, yy);
            for (p = hash[h]; p != NULL; p = p->next) if (p->x == xx && p->y == yy) break;
            if (p == NULL) {
                hd[tail].x = xx;
                hd[tail].y = yy;
                hd[tail].next = hash[h];
                hash[h] = &(hd[tail++]);
                if (tail == MAX) tail = 0;
            }
        }
        
        if (Z_max[x] >= x) {
            xx = x;
            yy = x;
            h = hash_func(xx, yy);
            for (p = hash[h]; p != NULL; p = p->next) if (p->x == xx && p->y == yy) break;
            if (p == NULL) {
                hd[tail].x = xx;
                hd[tail].y = yy;
                hd[tail].next = hash[h];
                hash[h] = &(hd[tail++]);
                if (tail == MAX) tail = 0;
            }
        }
    }
    printf("%d\n", d);
    fflush(stdout);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX