#843830 (PyPy3) No.2226 Hello, Forgotten World!

• 問題: No.2226 Hello, Forgotten World!
• ユーザー: maron8676
• 提出日時: 2023-02-24 23:12:01
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 64 ms / 2,000 ms
• コード長: 2,758 bytes
• コンパイル時間: 431 ms
• コンパイル使用メモリ: 82,100 KB
• 実行使用メモリ: 68,272 KB
• 最終ジャッジ日時: 2024-09-13 06:03:45
• 合計ジャッジ時間: 1,438 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 1
other	AC * 9

ソースコード

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
from collections import defaultdict, deque
from sys import stdin
readline = stdin.readline
def li():
    return list(map(int, readline().split()))
T = int(input())
case_list = []
for _ in range(T):
    N = int(input())
    case_list.append(list(input()))
# 後ろから探して最初に見つけた場所をhelloworldにする
# 残りの?にはaを入れる
hello = list('helloworld')
for case_s in case_list:
    if ''.join(case_s).count(''.join(hello)) > 0:
        for j in range(len(case_s)):
            if case_s[j] == '?':
                case_s[j] = 'a'
        print(''.join(case_s))
        continue
    possible = False
    for i in range(len(case_s) - 10, -1, -1):
        partial_possible = True
        for j in range(10):
            if case_s[i + j] != '?' and case_s[i + j] != hello[j]:
                partial_possible = False
        if partial_possible:
            # もう１つ前がhなら再チェック
            before_replace = False
            last_replace = False
            if i - 1 >= 0 and case_s[i - 1] == 'h':
                partial_possible = True
                for j in range(10):
                    if case_s[i + j - 1] != '?' and case_s[i + j - 1] != hello[j]:
                        partial_possible = False
                if partial_possible:
                    before_replace = True
            elif i - 9 >= 0 and case_s[i - 9] == 'h':
                partial_possible = True
                for j in range(9):
                    if case_s[i + j - 9] != '?' and case_s[i + j - 9] != hello[j]:
                        partial_possible = False
                if partial_possible:
                    last_replace = True
            if before_replace:
                for j in range(10):
                    if case_s[i + j - 1] == '?':
                        case_s[i + j - 1] = hello[j]
                possible = True
                for j in range(len(case_s)):
                    if case_s[j] == '?':
                        case_s[j] = 'a'
            elif last_replace:
                for j in range(10):
                    if case_s[i + j - 9] == '?':
                        case_s[i + j - 9] = hello[j]
                possible = True
                for j in range(len(case_s)):
                    if case_s[j] == '?':
                        case_s[j] = 'a'
            else:
                for j in range(10):
                    if case_s[i + j] == '?':
                        case_s[i + j] = hello[j]
                possible = True
                for j in range(len(case_s)):
                    if case_s[j] == '?':
                        case_s[j] = 'a'
        if possible:
            print(''.join(case_s))
            break
    if not possible:
        print(-1)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX