結果
問題 | No.5004 Room Assignment |
ユーザー |
![]() |
提出日時 | 2021-12-02 14:17:00 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 4,453 bytes |
コンパイル時間 | 458 ms |
実行使用メモリ | 101,400 KB |
スコア | 0 |
平均クエリ数 | 4.09 |
最終ジャッジ日時 | 2021-12-02 14:17:28 |
合計ジャッジ時間 | 23,532 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | RE * 100 |
ソースコード
from collections import defaultdictimport sysimport timeclass UnionFind():def __init__(self, n):self.n = nself.parents = [-1] * ndef find(self, x):if self.parents[x] < 0:return xelse: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:returnif self.parents[x] > self.parents[y]:x, y = y, xself.parents[x] += self.parents[y]self.parents[y] = xdef 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_membersdef __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=0N=5400uf=UnionFind(N+1)p=[-1]*(N+1)tick=[-1]*(N+1)room4set=set()s=set()# スキル値, プレイヤーi, 出現チックs.add((-10000000,-1,-1))s.add((100000000,-1,-1))pi=1t_ans=set()import bisectwhile t<3600 :nowtime=time.perf_counter()L=list(map(int,input().split()))# if nowtime - stime >4.85:# t+=1# print(0)# sys.stdout.flush()# continuefor e in list(s):if e == (-10000000,-1,-1) or e ==(100000000,-1,-1):continueelse:if t - e[2] >250 or e[1] in room4set:s.discard(e)for i in range(L[0]):# print(s)nowi = (L[i+1],pi,t)p[pi] = L[i+1]tick[pi] = tsorteds=sorted(list(s))target=bisect.bisect_right(sorteds,nowi)used=Falsefor _t in list(t_ans):if abs(p[pi] - p[_t]) < 3:sz=len(uf.members(_t))if sz < 4:uf.union(_t, pi)t_ans.add(pi)used = Truebreakif abs(sorteds[target-1][0] - L[i+1])<4: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])<4: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)s.add(nowi)pi+=1t+=1# print (t_ans)ans4print=[]ans4print_num=0for 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+=1room4set.add(m[0])room4set.add(m[i])ans4print.append(mls)else:for i in range (1,len(m)):mls.append([m[0],m[i]])ans4print_num+=1ans4print.append(mls)# 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()