結果
問題 | No.2696 Sign Creation |
ユーザー | katonyonko |
提出日時 | 2024-03-22 22:59:25 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,333 bytes |
コンパイル時間 | 376 ms |
コンパイル使用メモリ | 82,208 KB |
実行使用メモリ | 228,620 KB |
最終ジャッジ日時 | 2024-05-17 18:17:56 |
合計ジャッジ時間 | 9,622 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
64,388 KB |
testcase_01 | AC | 52 ms
64,904 KB |
testcase_02 | AC | 47 ms
56,072 KB |
testcase_03 | AC | 48 ms
61,788 KB |
testcase_04 | AC | 46 ms
56,856 KB |
testcase_05 | AC | 49 ms
61,600 KB |
testcase_06 | AC | 46 ms
56,604 KB |
testcase_07 | AC | 45 ms
55,856 KB |
testcase_08 | AC | 138 ms
78,724 KB |
testcase_09 | AC | 82 ms
76,684 KB |
testcase_10 | AC | 116 ms
78,160 KB |
testcase_11 | AC | 92 ms
76,724 KB |
testcase_12 | AC | 92 ms
76,852 KB |
testcase_13 | AC | 510 ms
89,448 KB |
testcase_14 | AC | 319 ms
83,576 KB |
testcase_15 | AC | 302 ms
83,828 KB |
testcase_16 | AC | 483 ms
91,864 KB |
testcase_17 | AC | 199 ms
77,616 KB |
testcase_18 | AC | 225 ms
79,204 KB |
testcase_19 | AC | 322 ms
82,644 KB |
testcase_20 | AC | 100 ms
77,420 KB |
testcase_21 | AC | 291 ms
84,184 KB |
testcase_22 | AC | 273 ms
78,876 KB |
testcase_23 | AC | 305 ms
82,464 KB |
testcase_24 | AC | 306 ms
82,504 KB |
testcase_25 | AC | 340 ms
81,844 KB |
testcase_26 | AC | 222 ms
77,828 KB |
testcase_27 | AC | 256 ms
78,864 KB |
testcase_28 | AC | 230 ms
78,252 KB |
testcase_29 | AC | 209 ms
77,672 KB |
testcase_30 | AC | 212 ms
77,784 KB |
testcase_31 | AC | 1,654 ms
228,620 KB |
testcase_32 | AC | 49 ms
61,736 KB |
testcase_33 | AC | 66 ms
71,276 KB |
testcase_34 | AC | 65 ms
69,636 KB |
testcase_35 | AC | 43 ms
57,004 KB |
testcase_36 | AC | 43 ms
56,292 KB |
testcase_37 | AC | 45 ms
55,976 KB |
testcase_38 | AC | 45 ms
56,308 KB |
testcase_39 | WA | - |
testcase_40 | AC | 44 ms
55,244 KB |
ソースコード
import io import sys from collections import defaultdict, deque, Counter from itertools import permutations, combinations, accumulate from heapq import heappush, heappop from bisect import bisect_right, bisect_left from math import gcd import math _INPUT = """\ 6 10 10 5 2 1 4 2 3 3 3 6 3 6 2 10 10 2 2 3 3 6 3 1 5 4 4 1 1 1 2 1 3 1 4 """ def input(): return sys.stdin.readline()[:-1] def solve(test): H,W,N,D=map(int,input().split()) field=[-1]*H*W G=[[] for _ in range(N)] for i in range(N): X,Y=map(lambda x:int(x)-1,input().split()) for x in range(X-D,X+D+1): for y in range(Y-(D-abs(x-X)),Y+(D-abs(x-X))+1): if 0<=x<H and 0<=y<W and field[x*W+y]!=-1: G[i].append(field[x*W+y]) G[field[x*W+y]].append(i) field[X*W+Y]=i inf=10**9 E=[inf]*N C=[-1]*N c=0 for i in range(N): if E[i]!=inf: continue E[i]=0 C[i]=c dq=deque() dq.append(i) while dq: x=dq.popleft() for y in G[x]: if E[y]>E[x]+1: E[y]=E[x]+1 C[y]=c dq.append(y) c+=1 c-=len([1 for g in G if g==[]]) ans1,ans2=10**9,0 for i in range(H): for j in range(W): s=set() s2=set() for x in range(i-D,i+D+1): for y in range(j-(D-abs(x-i)),j+(D-abs(x-i))+1): if 0<=x<H and 0<=y<W and field[x*W+y]!=-1 and C[field[x*W+y]] not in s: s.add(C[field[x*W+y]]) s2.add(field[x*W+y]) if len(s)==0: tmp=c else: tmp=c+1-len([1 for x in s2 if len(G[x])>0]) ans1=min(ans1,tmp) ans2=max(ans2,tmp) print(ans1,ans2) def random_input(): from random import randint,shuffle N=randint(1,10) M=randint(1,N) A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)] shuffle(A) return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3 def simple_solve(): return [] def main(test): if test==0: solve(0) elif test==1: sys.stdin = io.StringIO(_INPUT) case_no=int(input()) for _ in range(case_no): solve(0) else: for i in range(1000): sys.stdin = io.StringIO(random_input()) x=solve(1) y=simple_solve() if x!=y: print(i,x,y) print(*[line for line in sys.stdin],sep='') break #0:提出用、1:与えられたテスト用、2:ストレステスト用 main(0)