結果
| 問題 | No.5004 Room Assignment |
| ユーザー |
 negibose2020
|
| 提出日時 | 2021-12-03 16:31:54 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 4,875 ms / 5,000 ms |
| コード長 | 6,055 bytes |
| コンパイル時間 | 893 ms |
| 実行使用メモリ | 112,024 KB |
| スコア | 125,037,027 |
| 平均クエリ数 | 122087.15 |
| 最終ジャッジ日時 | 2021-12-03 16:39:31 |
| 合計ジャッジ時間 | 429,520 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge15 |
| 純コード判定しない問題か言語 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 4,752 ms
107,192 KB |
| testcase_01 | AC | 4,841 ms
105,464 KB |
| testcase_02 | AC | 3,847 ms
109,148 KB |
| testcase_03 | AC | 4,831 ms
103,952 KB |
| testcase_04 | AC | 3,799 ms
104,560 KB |
| testcase_05 | AC | 4,369 ms
110,704 KB |
| testcase_06 | AC | 3,891 ms
107,680 KB |
| testcase_07 | AC | 4,821 ms
105,480 KB |
| testcase_08 | AC | 4,202 ms
106,864 KB |
| testcase_09 | AC | 4,829 ms
108,456 KB |
| testcase_10 | AC | 4,437 ms
108,752 KB |
| testcase_11 | AC | 4,414 ms
108,652 KB |
| testcase_12 | AC | 4,853 ms
107,108 KB |
| testcase_13 | AC | 4,152 ms
107,864 KB |
| testcase_14 | AC | 3,513 ms
109,116 KB |
| testcase_15 | AC | 3,941 ms
105,972 KB |
| testcase_16 | AC | 3,727 ms
108,836 KB |
| testcase_17 | AC | 4,006 ms
106,976 KB |
| testcase_18 | AC | 4,822 ms
105,748 KB |
| testcase_19 | AC | 3,999 ms
106,244 KB |
| testcase_20 | AC | 3,908 ms
107,616 KB |
| testcase_21 | AC | 4,579 ms
108,404 KB |
| testcase_22 | AC | 4,062 ms
105,904 KB |
| testcase_23 | AC | 4,218 ms
106,972 KB |
| testcase_24 | AC | 4,138 ms
106,980 KB |
| testcase_25 | AC | 4,845 ms
104,404 KB |
| testcase_26 | AC | 4,831 ms
107,940 KB |
| testcase_27 | AC | 4,706 ms
108,400 KB |
| testcase_28 | AC | 4,509 ms
107,200 KB |
| testcase_29 | AC | 4,839 ms
106,900 KB |
| testcase_30 | AC | 4,179 ms
109,064 KB |
| testcase_31 | AC | 3,862 ms
109,764 KB |
| testcase_32 | AC | 4,288 ms
108,156 KB |
| testcase_33 | AC | 4,257 ms
108,016 KB |
| testcase_34 | AC | 3,950 ms
108,524 KB |
| testcase_35 | AC | 3,584 ms
106,748 KB |
| testcase_36 | AC | 3,721 ms
106,252 KB |
| testcase_37 | AC | 4,858 ms
110,060 KB |
| testcase_38 | AC | 4,553 ms
109,156 KB |
| testcase_39 | AC | 4,087 ms
112,008 KB |
| testcase_40 | AC | 3,956 ms
105,676 KB |
| testcase_41 | AC | 4,211 ms
105,096 KB |
| testcase_42 | AC | 4,812 ms
105,448 KB |
| testcase_43 | AC | 4,645 ms
107,216 KB |
| testcase_44 | AC | 4,214 ms
106,228 KB |
| testcase_45 | AC | 4,831 ms
106,952 KB |
| testcase_46 | AC | 4,193 ms
109,316 KB |
| testcase_47 | AC | 4,770 ms
107,512 KB |
| testcase_48 | AC | 4,570 ms
108,520 KB |
| testcase_49 | AC | 3,413 ms
106,584 KB |
| testcase_50 | AC | 4,691 ms
106,832 KB |
| testcase_51 | AC | 4,088 ms
106,352 KB |
| testcase_52 | AC | 4,220 ms
109,180 KB |
| testcase_53 | AC | 4,097 ms
106,240 KB |
| testcase_54 | AC | 3,200 ms
105,012 KB |
| testcase_55 | AC | 3,917 ms
108,500 KB |
| testcase_56 | AC | 4,875 ms
108,184 KB |
| testcase_57 | AC | 4,024 ms
105,912 KB |
| testcase_58 | AC | 3,963 ms
110,680 KB |
| testcase_59 | AC | 4,407 ms
106,696 KB |
| testcase_60 | AC | 3,829 ms
107,324 KB |
| testcase_61 | AC | 4,411 ms
108,532 KB |
| testcase_62 | AC | 4,859 ms
109,192 KB |
| testcase_63 | AC | 3,600 ms
106,220 KB |
| testcase_64 | AC | 3,765 ms
107,344 KB |
| testcase_65 | AC | 3,567 ms
105,744 KB |
| testcase_66 | AC | 3,600 ms
106,744 KB |
| testcase_67 | AC | 4,084 ms
108,080 KB |
| testcase_68 | AC | 3,618 ms
105,632 KB |
| testcase_69 | AC | 4,400 ms
107,864 KB |
| testcase_70 | AC | 3,735 ms
112,024 KB |
| testcase_71 | AC | 4,873 ms
110,172 KB |
| testcase_72 | AC | 4,105 ms
107,084 KB |
| testcase_73 | AC | 3,852 ms
108,724 KB |
| testcase_74 | AC | 3,832 ms
106,632 KB |
| testcase_75 | AC | 4,175 ms
106,588 KB |
| testcase_76 | AC | 4,209 ms
108,480 KB |
| testcase_77 | AC | 3,986 ms
108,372 KB |
| testcase_78 | AC | 4,845 ms
108,828 KB |
| testcase_79 | AC | 3,651 ms
108,292 KB |
| testcase_80 | AC | 4,321 ms
108,128 KB |
| testcase_81 | AC | 4,068 ms
106,484 KB |
| testcase_82 | AC | 4,061 ms
110,088 KB |
| testcase_83 | AC | 3,239 ms
106,256 KB |
| testcase_84 | AC | 4,012 ms
106,448 KB |
| testcase_85 | AC | 4,666 ms
109,840 KB |
| testcase_86 | AC | 3,733 ms
107,828 KB |
| testcase_87 | AC | 4,008 ms
109,108 KB |
| testcase_88 | AC | 3,347 ms
104,672 KB |
| testcase_89 | AC | 4,052 ms
111,424 KB |
| testcase_90 | AC | 3,624 ms
107,704 KB |
| testcase_91 | AC | 4,384 ms
107,260 KB |
| testcase_92 | AC | 3,499 ms
105,404 KB |
| testcase_93 | AC | 3,596 ms
109,592 KB |
| testcase_94 | AC | 4,617 ms
106,228 KB |
| testcase_95 | AC | 4,838 ms
108,564 KB |
| testcase_96 | AC | 3,776 ms
107,380 KB |
| testcase_97 | AC | 3,673 ms
105,288 KB |
| testcase_98 | AC | 3,651 ms
106,280 KB |
| testcase_99 | AC | 4,663 ms
106,860 KB |
ソースコード
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())
def clc_score(num,minskil,maxskil,x,y):
a=(num*(num-1)//2) * (200-(maxskil-minskil)*(maxskil-minskil)) - (num*(num-1)//2)*(y-x)
# print(a)
return max(a,0)
# print (clc_score(2,3,4,3,5))
# print (clc_score(2,3,4,3,14))
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,sz
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()
import bisect
while t<3600 :
nowtime=time.perf_counter()
L=list(map(int,input().split()))
if nowtime - stime >4.70:
t+=1
print(0)
sys.stdout.flush()
continue
if t %50 ==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)
if L[0] == 0:
t+=1
print(0)
sys.stdout.flush()
continue
for i in range(L[0]):
# print(s)
nowi = (L[i+1],pi,t)
p[pi] = L[i+1]
tick[pi] = t
scores[pi] = [0,L[i+1],L[i+1],t,1]
sorteds=sorted(list(s))
target=bisect.bisect_right(sorteds,nowi)
for _t in list(t_ans):
if abs(p[pi] - p[_t]) < 3:
score,minskill,maxskill,x,sz = scores[_t]
# print(score,minskill,maxskill,x,sz)
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)
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:
# score1,minskill1,maxskill1,x1,sz1 = scores[sorteds[target-1][1]]
sz1 = len(uf.members(sorteds[target-1][1]))
score1=1000
# score2,minskill2,maxskill2,x2,sz2 = scores[pi]
sz2 = len(uf.members(pi))
score2=1000
if sz1 + sz2 <= 4:
# _score = clc_score((sz1+sz2),min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),t)
_score = 100000000000000000000
if _score > score1 + score2:
uf.union(pi, sorteds[target-1][1])
t_ans.add(pi)
# 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:
# score1,minskill1,maxskill1,x1,sz1 = scores[sorteds[target][1]]
score1=1000
sz1 = len(uf.members(sorteds[target][1]))
# score2,minskill2,maxskill2,x2,sz2 = scores[pi]
score2 = 10000
sz2 = len(uf.members(pi))
if sz1 + sz2 <= 4:
# _score = clc_score((sz1+sz2),min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),t)
_score=1
if _score > score1 + score2:
uf.union(pi, sorteds[target][1])
t_ans.add(pi)
# 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])
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)
print(ans4print_num)
sys.stdout.flush()
for i in range (len(ans4print)):
for e in ans4print[i]:
print(*e)
sys.stdout.flush()