#1059683 (PyPy3) No.2366 登校

提出ソース
結果

問題	No.2366 登校
ユーザー	lam6er
提出日時	2025-03-26 15:57:59
言語	PyPy3 (7.3.15)
結果	WA
実行時間	-
コード長	5,440 bytes
コンパイル時間	329 ms
コンパイル使用メモリ	82,176 KB
実行使用メモリ	86,228 KB
最終ジャッジ日時	2025-03-26 15:59:21
合計ジャッジ時間	4,011 ms
ジャッジサーバーID （参考情報）	judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 2
other	AC * 18 WA * 7
権限があれば一括ダウンロードができます
ソースコード

raw source code
プレゼンテーションモードにする

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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
import heapq
def main():
    n, m, k, T = map(int, input().split())
    myst = {}
    for _ in range(k):
        a, b, c, d = map(int, input().split())
        a -= 1
        b -= 1
        myst[(a, b)] = (c, d)
    
    start_i, start_j = 0, 0
    end_i, end_j = n - 1, m - 1
    best = {}
    heap = []
    initial_state = (start_i, start_j, True)
    best[initial_state] = {0: 0}
    heapq.heappush(heap, (0, start_i, start_j, True, 0))
    dirs = [(-1, 0), (1, 0), (0, -1), (0, 1)]
    found = False
    answer = -1
    while heap:
        sum_d, i, j, can_move, adj_time = heapq.heappop(heap)
        
        if i == end_i and j == end_j and adj_time <= T:
            answer = sum_d
            found = True
            break
        
        current_key = (i, j, can_move)
        if current_key not in best:
            continue
        current_best = best[current_key]
        if sum_d not in current_best or current_best[sum_d] < adj_time:
            continue
        
        if can_move:
            for di, dj in dirs:
                ni, nj = i + di, j + dj
                if 0 <= ni < n and 0 <= nj < m:
                    new_sum_d = sum_d
                    new_adj_time = adj_time + 1
                    if new_adj_time > T:
                        continue
                    new_key = (ni, nj, True)
                    if new_key not in best:
                        best[new_key] = {}
                    entry = best[new_key]
                    add = True
                    remove = []
                    for d_entry in list(entry.keys()):
                        if d_entry <= new_sum_d and entry[d_entry] <= new_adj_time:
                            add = False
                            break
                    if add:
                        for d_entry in list(entry.keys()):
                            if d_entry >= new_sum_d and entry[d_entry] >= new_adj_time:
                                remove.append(d_entry)
                        for d in remove:
                            del entry[d]
                        entry[new_sum_d] = new_adj_time
                        heapq.heappush(heap, (new_sum_d, ni, nj, True, new_adj_time))
            
            if (i, j) in myst:
                c, d = myst[(i, j)]
                new_sum_d = sum_d + d
                new_adj_time = adj_time + 1 - c
                new_can_move = False
                if new_adj_time > T:
                    continue
                new_key = (i, j, new_can_move)
                if new_key not in best:
                    best[new_key] = {}
                entry = best[new_key]
                add = True
                remove = []
                for d_entry in list(entry.keys()):
                    if d_entry <= new_sum_d and entry[d_entry] <= new_adj_time:
                        add = False
                        break
                if add:
                    for d_entry in list(entry.keys()):
                        if d_entry >= new_sum_d and entry[d_entry] >= new_adj_time:
                            remove.append(d_entry)
                    for d in remove:
                        del entry[d]
                    entry[new_sum_d] = new_adj_time
                    heapq.heappush(heap, (new_sum_d, i, j, new_can_move, new_adj_time))
        else:
            new_sum_d = sum_d
            new_adj_time = adj_time + 1
            new_can_move = True
            if new_adj_time > T:
                continue
            new_key = (i, j, new_can_move)
            if new_key not in best:
                best[new_key] = {}
            entry = best[new_key]
            add = True
            remove = []
            for d_entry in list(entry.keys()):
                if d_entry <= new_sum_d and entry[d_entry] <= new_adj_time:
                    add = False
                    break
            if add:
                for d_entry in list(entry.keys()):
                    if d_entry >= new_sum_d and entry[d_entry] >= new_adj_time:
                        remove.append(d_entry)
                for d in remove:
                    del entry[d]
                entry[new_sum_d] = new_adj_time
                heapq.heappush(heap, (new_sum_d, i, j, new_can_move, new_adj_time))
            
            if (i, j) in myst:
                c, d = myst[(i, j)]
                new_sum_d = sum_d + d
                new_adj_time = adj_time + 1 - c
                new_can_move = False
                if new_adj_time > T:
                    continue
                new_key = (i, j, new_can_move)
                if new_key not in best:
                    best[new_key] = {}
                entry = best[new_key]
                add = True
                remove = []
                for d_entry in list(entry.keys()):
                    if d_entry <= new_sum_d and entry[d_entry] <= new_adj_time:
                        add = False
                        break
                if add:
                    for d_entry in list(entry.keys()):
                        if d_entry >= new_sum_d and entry[d_entry] >= new_adj_time:
                            remove.append(d_entry)
                    for d in remove:
                        del entry[d]
                    entry[new_sum_d] = new_adj_time
                    heapq.heappush(heap, (new_sum_d, i, j, new_can_move, new_adj_time))
    
    print(answer if found else -1)
if __name__ == "__main__":
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
yukicoder

結果

ソースコード
