結果
| 問題 | No.5004 Room Assignment |
| ユーザー |
 negibose2020
|
| 提出日時 | 2021-12-02 00:10:55 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 4,145 bytes |
| コンパイル時間 | 414 ms |
| 実行使用メモリ | 103,140 KB |
| スコア | 0 |
| 平均クエリ数 | 743.67 |
| 最終ジャッジ日時 | 2021-12-02 00:11:30 |
| 合計ジャッジ時間 | 31,924 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge15 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | RE | - |
| testcase_01 | RE | - |
| testcase_02 | RE | - |
| testcase_03 | RE | - |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | RE | - |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
| testcase_35 | RE | - |
| testcase_36 | RE | - |
| testcase_37 | RE | - |
| testcase_38 | RE | - |
| testcase_39 | RE | - |
| testcase_40 | RE | - |
| testcase_41 | RE | - |
| testcase_42 | RE | - |
| testcase_43 | RE | - |
| testcase_44 | RE | - |
| testcase_45 | RE | - |
| testcase_46 | RE | - |
| testcase_47 | RE | - |
| testcase_48 | RE | - |
| testcase_49 | RE | - |
| testcase_50 | RE | - |
| testcase_51 | RE | - |
| testcase_52 | RE | - |
| testcase_53 | RE | - |
| testcase_54 | RE | - |
| testcase_55 | RE | - |
| testcase_56 | RE | - |
| testcase_57 | RE | - |
| testcase_58 | RE | - |
| testcase_59 | RE | - |
| testcase_60 | RE | - |
| testcase_61 | RE | - |
| testcase_62 | RE | - |
| testcase_63 | RE | - |
| testcase_64 | RE | - |
| testcase_65 | RE | - |
| testcase_66 | RE | - |
| testcase_67 | RE | - |
| testcase_68 | RE | - |
| testcase_69 | RE | - |
| testcase_70 | RE | - |
| testcase_71 | RE | - |
| testcase_72 | RE | - |
| testcase_73 | RE | - |
| testcase_74 | RE | - |
| testcase_75 | RE | - |
| testcase_76 | RE | - |
| testcase_77 | RE | - |
| testcase_78 | RE | - |
| testcase_79 | RE | - |
| testcase_80 | RE | - |
| testcase_81 | RE | - |
| testcase_82 | RE | - |
| testcase_83 | RE | - |
| testcase_84 | RE | - |
| testcase_85 | RE | - |
| testcase_86 | RE | - |
| testcase_87 | RE | - |
| testcase_88 | RE | - |
| testcase_89 | RE | - |
| testcase_90 | RE | - |
| testcase_91 | RE | - |
| testcase_92 | RE | - |
| testcase_93 | RE | - |
| testcase_94 | RE | - |
| testcase_95 | RE | - |
| testcase_96 | RE | - |
| testcase_97 | RE | - |
| testcase_98 | RE | - |
| testcase_99 | RE | - |
ソースコード
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)
tick=[-1]*(N+1)
s=set()
# スキル値, プレイヤーi, 出現チック
s.add((-10000000,-1,-1))
s.add((100000000,-1,-1))
pi=1
t_ans=set()
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] >250:
s.discard(e)
for i in range(L[0]):
# print(s)
nowi = (L[i+1],pi,t)
p[pi] = L[i+1]
tick[pi] = t
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:
sz1 = len(uf.members(sorteds[target-1][1]))
sz2 = len(uf.members(pi))
if sz1 + sz2 <= 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:
sz1 = len(uf.members(sorteds[target][1]))
sz2 = len(uf.members(pi))
if sz1 + sz2 <= 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 list(t_ans):
m=uf.members(ans)
if len(m)>=4:
mls=[]
for i in range(1,4):#len(m)) :
mls.append([m[0],m[i]])
t_ans.discard(m[0])
t_ans.discard(m[i])
ans4print_num+=1
ans4print.append(mls)
else:
min_tick=10000000000
for i in range (len(m)):
min_tick = min(min_tick, tick[m[i]])
if min_tick < t - 100 :
mls = []
for i in range (1,len(m)):
mls.append(m[0],m[i])
t_ans.discard(m[0])
t_ans.discard(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()