結果

問題 No.5004 Room Assignment
ユーザー negibose2020negibose2020
提出日時 2021-12-02 14:22:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 3,554 ms / 5,000 ms
コード長 4,468 bytes
コンパイル時間 236 ms
実行使用メモリ 107,812 KB
スコア 133,655,303
平均クエリ数 62266.33
最終ジャッジ日時 2021-12-02 14:26:48
合計ジャッジ時間 255,911 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,387 ms
104,648 KB
testcase_01 AC 3,115 ms
107,096 KB
testcase_02 AC 2,356 ms
102,904 KB
testcase_03 AC 2,554 ms
106,088 KB
testcase_04 AC 2,305 ms
104,160 KB
testcase_05 AC 3,391 ms
103,436 KB
testcase_06 AC 3,383 ms
101,732 KB
testcase_07 AC 2,265 ms
104,864 KB
testcase_08 AC 2,284 ms
104,816 KB
testcase_09 AC 2,344 ms
104,600 KB
testcase_10 AC 2,233 ms
104,544 KB
testcase_11 AC 3,303 ms
102,564 KB
testcase_12 AC 2,256 ms
105,184 KB
testcase_13 AC 2,311 ms
103,648 KB
testcase_14 AC 2,410 ms
105,436 KB
testcase_15 AC 2,505 ms
103,592 KB
testcase_16 AC 2,263 ms
104,196 KB
testcase_17 AC 2,015 ms
103,668 KB
testcase_18 AC 2,143 ms
105,512 KB
testcase_19 AC 2,635 ms
106,300 KB
testcase_20 AC 2,344 ms
104,500 KB
testcase_21 AC 2,388 ms
105,344 KB
testcase_22 AC 2,381 ms
103,696 KB
testcase_23 AC 2,995 ms
104,924 KB
testcase_24 AC 2,438 ms
104,644 KB
testcase_25 AC 2,110 ms
106,144 KB
testcase_26 AC 2,038 ms
102,916 KB
testcase_27 AC 3,071 ms
104,292 KB
testcase_28 AC 2,152 ms
105,048 KB
testcase_29 AC 2,196 ms
103,916 KB
testcase_30 AC 2,278 ms
104,788 KB
testcase_31 AC 2,534 ms
103,648 KB
testcase_32 AC 3,033 ms
104,936 KB
testcase_33 AC 2,196 ms
103,192 KB
testcase_34 AC 2,416 ms
103,504 KB
testcase_35 AC 2,347 ms
104,864 KB
testcase_36 AC 2,273 ms
107,812 KB
testcase_37 AC 3,192 ms
104,380 KB
testcase_38 AC 2,390 ms
102,672 KB
testcase_39 AC 3,466 ms
104,244 KB
testcase_40 AC 3,043 ms
105,572 KB
testcase_41 AC 2,465 ms
105,668 KB
testcase_42 AC 2,215 ms
102,988 KB
testcase_43 AC 2,187 ms
105,496 KB
testcase_44 AC 3,186 ms
106,136 KB
testcase_45 AC 2,540 ms
106,356 KB
testcase_46 AC 2,161 ms
103,828 KB
testcase_47 AC 2,970 ms
104,416 KB
testcase_48 AC 2,308 ms
103,300 KB
testcase_49 AC 2,227 ms
103,216 KB
testcase_50 AC 2,118 ms
105,900 KB
testcase_51 AC 2,250 ms
106,192 KB
testcase_52 AC 2,350 ms
104,952 KB
testcase_53 AC 2,249 ms
104,508 KB
testcase_54 AC 2,364 ms
102,492 KB
testcase_55 AC 2,169 ms
105,480 KB
testcase_56 AC 2,342 ms
104,820 KB
testcase_57 AC 2,409 ms
104,660 KB
testcase_58 AC 2,354 ms
103,676 KB
testcase_59 AC 2,235 ms
105,784 KB
testcase_60 AC 3,408 ms
103,372 KB
testcase_61 AC 2,223 ms
105,652 KB
testcase_62 AC 2,105 ms
102,848 KB
testcase_63 AC 2,310 ms
104,480 KB
testcase_64 AC 2,636 ms
103,056 KB
testcase_65 AC 2,339 ms
101,460 KB
testcase_66 AC 2,165 ms
103,732 KB
testcase_67 AC 3,263 ms
105,788 KB
testcase_68 AC 2,235 ms
105,812 KB
testcase_69 AC 2,120 ms
104,116 KB
testcase_70 AC 2,417 ms
102,976 KB
testcase_71 AC 2,346 ms
104,180 KB
testcase_72 AC 2,919 ms
103,280 KB
testcase_73 AC 2,299 ms
104,768 KB
testcase_74 AC 2,296 ms
104,856 KB
testcase_75 AC 2,282 ms
104,400 KB
testcase_76 AC 2,190 ms
104,152 KB
testcase_77 AC 3,285 ms
104,552 KB
testcase_78 AC 3,021 ms
105,740 KB
testcase_79 AC 2,483 ms
107,524 KB
testcase_80 AC 2,315 ms
105,740 KB
testcase_81 AC 2,420 ms
106,144 KB
testcase_82 AC 2,353 ms
103,192 KB
testcase_83 AC 2,359 ms
103,656 KB
testcase_84 AC 2,962 ms
103,624 KB
testcase_85 AC 2,221 ms
104,032 KB
testcase_86 AC 2,254 ms
106,528 KB
testcase_87 AC 2,187 ms
103,640 KB
testcase_88 AC 3,554 ms
107,024 KB
testcase_89 AC 2,378 ms
103,676 KB
testcase_90 AC 2,499 ms
104,020 KB
testcase_91 AC 3,157 ms
106,984 KB
testcase_92 AC 2,214 ms
102,432 KB
testcase_93 AC 2,244 ms
103,120 KB
testcase_94 AC 2,163 ms
102,956 KB
testcase_95 AC 2,334 ms
103,884 KB
testcase_96 AC 2,555 ms
105,508 KB
testcase_97 AC 2,192 ms
104,512 KB
testcase_98 AC 2,059 ms
103,292 KB
testcase_99 AC 2,124 ms
106,008 KB
権限があれば一括ダウンロードができます

ソースコード

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()

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 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:
                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])<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+=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()
0