結果

問題 No.5004 Room Assignment
ユーザー negibose2020
提出日時 2021-12-01 22:15:18
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 983 ms / 5,000 ms
コード長 3,449 bytes
コンパイル時間 229 ms
実行使用メモリ 106,588 KB
スコア 55,003,033
平均クエリ数 6421.51
最終ジャッジ日時 2021-12-01 22:16:51
合計ジャッジ時間 92,067 ms
ジャッジサーバーID
(参考情報)
judge16 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 100
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from collections import defaultdict
import sys
import time
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
stime=time.perf_counter()
T,R=map(int,input().split())
t=0
N=5400
uf=UnionFind(N+1)
p=[-1]*(N+1)
s=set()
# , i,
s.add((-10000000,-1,-1))
s.add((100000000,-1,-1))
pi=1
import bisect
while t<3600 :
nowtime=time.perf_counter()
L=list(map(int,input().split()))
if nowtime - stime >4.85:
t+=1
print(0)
sys.stdout.flush()
continue
for e in list(s):
if e == (-10000000,-1,-1) or e ==(100000000,-1,-1):
continue
else:
if t - e[2] >200:
s.discard(e)
t_ans=set()
for i in range(L[0]):
# print(s)
nowi=(L[i+1],pi,t)
p[pi]=L[i+1]
sorteds=sorted(list(s))
target=bisect.bisect_right(sorteds,nowi)
used=False
# for _t in list(t_ans):
# if abs(p[pi] - p[_t]) < 5:
# sz=len(uf.members(_t))
# if sz < 4:
# uf.union(_t, pi)
# t_ans.add(pi)
# used = True
# break
if abs(sorteds[target-1][0] - L[i+1])<5:
sz=len(uf.members(sorteds[target-1][1]))
if sz<4:
uf.union(pi,sorteds[target-1][1])
t_ans.add(pi)
used = True
s.discard(sorteds[target-1])
if abs(sorteds[target][0] - L[i+1])<5:
sz=len(uf.members(sorteds[target][1]))
if sz<4:
uf.union(pi,sorteds[target][1])
t_ans.add(pi)
used = True
s.discard(sorteds[target])
if used == False:
s.add(nowi)
pi+=1
t+=1
# print (t_ans)
ans4print=[]
ans4print_num=0
for ans in t_ans:
m=uf.members(ans)
mls=[]
for i in range(1,len(m)) :
mls.append([m[0],m[i]])
ans4print_num+=1
ans4print.append(mls)
print(ans4print_num)
sys.stdout.flush()
for i in range (len(ans4print)):
for e in ans4print[i]:
print(*e)
sys.stdout.flush()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0