#977850 (PyPy3) No.2743 Twisted Lattice

• 問題: No.2743 Twisted Lattice
• ユーザー: tcltk
• 提出日時: 2024-04-28 16:52:36
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 1,358 ms / 3,000 ms
• コード長: 2,498 bytes
• コンパイル時間: 170 ms
• コンパイル使用メモリ: 82,560 KB
• 実行使用メモリ: 220,652 KB
• 最終ジャッジ日時: 2024-11-17 10:37:16
• 合計ジャッジ時間: 12,220 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 8

ソースコード

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
#!/usr/bin/env python3
# from typing import *
import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq
import random
def input():
    return sys.stdin.readline()[:-1]
# sys.setrecursionlimit(1000000)
# _INPUT = """10 10 6
# 1 2
# 2 3
# 3 3
# 10 7
# 8 2
# 3 5
# """
# sys.stdin = io.StringIO(_INPUT)
INF = 10**18
YES = 'Yes'
NO = 'No'
    
def solve(H, W, N, X, Y):
    dic = dict()
    for i in range(N):
        dic[(X[i], Y[i])] = i
    Y1 = list(set(Y))
    Y1.sort()
    Ans = [INF] * N
    Line = collections.defaultdict(list)
    for i in range(N):
        Line[Y[i]].append(X[i])
    for l in Line.values():
        l.sort()
    
    for y in Y1:
        for k in range(len(Line[y])):
            x = Line[y][k]
            i = dic[(x, y)]
            if 0 <= k-1:
                x1 = Line[y][k-1]
                Ans[i] = min(Ans[i], x-x1)
            if k+1 < len(Line[y]):
                x2 = Line[y][k+1]
                Ans[i] = min(Ans[i], x2-x)
    for i in range(N):
        x, y = X[i], Y[i]
        for y1 in [y-1, y+1]:
            if y1 in Line:
                k = bisect.bisect_left(Line[y1], x)
                if 0 <= k-1:
                    x1 = Line[y1][k-1]
                    Ans[i] = min(Ans[i], x) #x1 + (x-x1)
                if k < len(Line[y1]):
                    x2 = Line[y1][k]
                    Ans[i] = min(Ans[i], x2) # x + (x2-x)
    i0 = -1
    for y in Y1:
        if i0 == -1:
            x0 = Line[y][0]
            i0 = dic[(x0, y)]
            continue
        x0, y0 = X[i0], Y[i0]
        if y0 == y:
            continue
        for x in Line[y]:
            cost = (x-1) + (x0-1) + (y-y0)
            i = dic[(x, y)]
            Ans[i] = min(Ans[i], cost)
        x = Line[y][0]
        if x-y < x0-y0:
            i0 = dic[(x, y)]
    i0 = -1
    for y in reversed(Y1):
        if i0 == -1:
            x0 = Line[y][0]
            i0 = dic[(x0, y)]
            continue
        x0, y0 = X[i0], Y[i0]
        if y0 == y:
            continue
        for x in Line[y]:
            cost = (x-1) + (x0-1) + (y0-y)
            i = dic[(x, y)]
            Ans[i] = min(Ans[i], cost)
        x = Line[y][0]
        if x+y < x0+y0:
            i0 = dic[(x, y)]
    return Ans
H, W, N = map(int, input().split())
X, Y = [], []
for _ in range(N):
    x, y = map(int, input().split())
    X.append(x)
    Y.append(y)
ans = solve(H, W, N, X, Y)
for v in ans:
    print(v)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX