結果

問題 No.5004 Room Assignment
ユーザー negibose2020
提出日時 2021-12-03 15:35:47
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 6,329 bytes
コンパイル時間 209 ms
実行使用メモリ 106,608 KB
スコア 1,119,775
平均クエリ数 87661.00
最終ジャッジ日時 2021-12-03 15:39:23
合計ジャッジ時間 212,672 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 33 RE * 57 TLE * 10
権限があれば一括ダウンロードができます

ソースコード

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)
tick=[-1]*(N+1)
room4set=set()
# score,minskill,maxskill,x,nowe
scores=[[0,0,100,0,1] for i in range (N+1)]
s=set()
# , i,
s.add((-10000000,-1,-1))
s.add((100000000,-1,-1))
pi=1
t_ans=set()
def clc_score(num,minskil,maxskil,x,y):
a=(num*(num-1)//2) * (200-(maxskil-minskil)*(maxskil*minskil)) - (num*(num-1)//2)*(y-x)
return max(a,0)
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
if L[0] == 0:
t+=1
print(0)
sys.stdout.flush()
continue
if t %30 ==0:
for e in list(s):
if e == (-10000000,-1,-1) or e ==(100000000,-1,-1):
continue
else:
if t - e[2] >100 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] = 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]) < 3:
score,minskill,maxskill,x,sz=scores[_t]
# sz=len(uf.members(_t))
if sz < 4:
_score = clc_score(sz+1,min(minskill,p[pi]),max(maxskill,p[pi]),x,t)
if _score > score:
uf.union(_t, pi)
t_ans.add(pi)
used = True
scores[_t] = [_score, min(minskill,p[pi]), max(maxskill,p[pi]),x,sz+1]
scores[pi] = [_score, min(minskill,p[pi]), max(maxskill,p[pi]),x,sz+1]
break
if abs(sorteds[target-1][0] - L[i+1])<3:
sz1 = len(uf.members(sorteds[target-1][1]))
score1,minskill1,maxskill1,x1,sz1 = scores[sorteds[target-1][1]]
sz2 = len(uf.members(pi))
score2,minskill2,maxskill2,x2,sz2 = scores[pi]
if sz1 + sz2 <= 4:
_score = clc_score((sz1+sz2),min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),t)
if _score > score1 + score2:
uf.union(pi, sorteds[target-1][1])
t_ans.add(pi)
used = True
scores[sorteds[target-1][1]] = [_score, min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),(sz1+sz2)]
scores[pi] = [_score, min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),(sz1+sz2)]
# s.discard(sorteds[target-1])
if abs(sorteds[target][0] - L[i+1])<3:
sz1 = len(uf.members(sorteds[target][1]))
score1,minskill1,maxskill1,x1,sz1 = scores[sorteds[target][1]]
sz2 = len(uf.members(pi))
score2,minskill2,maxskill2,x2,sz2 = scores[pi]
if sz1 + sz2 <= 4:
_score = clc_score((sz1+sz2),min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),t)
if _score > score1 + score2:
uf.union(pi, sorteds[target][1])
t_ans.add(pi)
used = True
scores[sorteds[target][1]] = [_score, min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),(sz1+sz2)]
scores[pi] = [_score, min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),(sz1+sz2)]
# s.discard(sorteds[target])
# if used == False:
# s.add(nowi)
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
room4set.add(m[0])
room4set.add(m[i])
ans4print.append(mls)
else:
mls=[]
for i in range (1,len(m)):
mls.append([m[0],m[i]])
ans4print_num+=1
ans4print.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()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0