結果

問題 No.5004 Room Assignment
ユーザー negibose2020negibose2020
提出日時 2021-12-02 17:22:36
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,234 ms / 5,000 ms
コード長 4,468 bytes
コンパイル時間 495 ms
実行使用メモリ 108,632 KB
スコア 137,447,626
平均クエリ数 77680.27
最終ジャッジ日時 2021-12-02 17:27:34
合計ジャッジ時間 291,487 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,607 ms
102,892 KB
testcase_01 AC 2,495 ms
104,184 KB
testcase_02 AC 2,652 ms
105,468 KB
testcase_03 AC 2,644 ms
101,956 KB
testcase_04 AC 2,762 ms
103,788 KB
testcase_05 AC 2,724 ms
103,928 KB
testcase_06 AC 2,765 ms
102,972 KB
testcase_07 AC 2,510 ms
105,528 KB
testcase_08 AC 2,634 ms
105,000 KB
testcase_09 AC 2,688 ms
102,784 KB
testcase_10 AC 2,537 ms
102,716 KB
testcase_11 AC 3,856 ms
103,276 KB
testcase_12 AC 2,738 ms
104,672 KB
testcase_13 AC 3,804 ms
104,080 KB
testcase_14 AC 4,104 ms
104,580 KB
testcase_15 AC 2,772 ms
105,200 KB
testcase_16 AC 2,707 ms
105,980 KB
testcase_17 AC 2,563 ms
103,276 KB
testcase_18 AC 2,587 ms
106,520 KB
testcase_19 AC 2,974 ms
103,540 KB
testcase_20 AC 2,870 ms
105,524 KB
testcase_21 AC 2,749 ms
103,220 KB
testcase_22 AC 2,788 ms
106,096 KB
testcase_23 AC 2,723 ms
102,704 KB
testcase_24 AC 2,778 ms
103,424 KB
testcase_25 AC 2,545 ms
104,244 KB
testcase_26 AC 2,538 ms
104,944 KB
testcase_27 AC 2,647 ms
104,260 KB
testcase_28 AC 2,630 ms
103,560 KB
testcase_29 AC 2,663 ms
105,700 KB
testcase_30 AC 2,545 ms
106,412 KB
testcase_31 AC 2,865 ms
104,532 KB
testcase_32 AC 2,453 ms
102,084 KB
testcase_33 AC 2,522 ms
105,728 KB
testcase_34 AC 2,851 ms
104,956 KB
testcase_35 AC 2,718 ms
102,612 KB
testcase_36 AC 2,562 ms
101,828 KB
testcase_37 AC 2,594 ms
103,932 KB
testcase_38 AC 2,921 ms
102,640 KB
testcase_39 AC 2,748 ms
103,596 KB
testcase_40 AC 2,562 ms
101,948 KB
testcase_41 AC 2,864 ms
104,856 KB
testcase_42 AC 3,841 ms
104,420 KB
testcase_43 AC 2,406 ms
102,992 KB
testcase_44 AC 2,820 ms
103,260 KB
testcase_45 AC 4,234 ms
104,984 KB
testcase_46 AC 2,519 ms
103,588 KB
testcase_47 AC 2,601 ms
103,408 KB
testcase_48 AC 2,483 ms
103,652 KB
testcase_49 AC 2,616 ms
105,156 KB
testcase_50 AC 2,533 ms
105,460 KB
testcase_51 AC 2,542 ms
103,764 KB
testcase_52 AC 2,906 ms
103,404 KB
testcase_53 AC 2,750 ms
103,304 KB
testcase_54 AC 3,772 ms
103,364 KB
testcase_55 AC 3,583 ms
102,232 KB
testcase_56 AC 2,939 ms
108,632 KB
testcase_57 AC 2,743 ms
104,796 KB
testcase_58 AC 2,656 ms
102,156 KB
testcase_59 AC 2,596 ms
104,716 KB
testcase_60 AC 2,761 ms
103,040 KB
testcase_61 AC 3,818 ms
103,024 KB
testcase_62 AC 2,512 ms
104,844 KB
testcase_63 AC 2,689 ms
103,624 KB
testcase_64 AC 2,879 ms
103,628 KB
testcase_65 AC 2,779 ms
105,016 KB
testcase_66 AC 2,662 ms
104,080 KB
testcase_67 AC 2,732 ms
103,964 KB
testcase_68 AC 2,582 ms
104,568 KB
testcase_69 AC 2,531 ms
103,548 KB
testcase_70 AC 3,086 ms
103,600 KB
testcase_71 AC 2,764 ms
104,244 KB
testcase_72 AC 2,624 ms
103,840 KB
testcase_73 AC 2,769 ms
103,496 KB
testcase_74 AC 2,990 ms
102,556 KB
testcase_75 AC 2,573 ms
103,392 KB
testcase_76 AC 2,571 ms
103,780 KB
testcase_77 AC 2,706 ms
104,360 KB
testcase_78 AC 2,633 ms
105,820 KB
testcase_79 AC 2,861 ms
105,240 KB
testcase_80 AC 2,622 ms
102,284 KB
testcase_81 AC 2,855 ms
103,676 KB
testcase_82 AC 2,713 ms
102,920 KB
testcase_83 AC 2,898 ms
105,640 KB
testcase_84 AC 2,540 ms
104,768 KB
testcase_85 AC 2,582 ms
102,616 KB
testcase_86 AC 2,612 ms
104,992 KB
testcase_87 AC 2,519 ms
104,048 KB
testcase_88 AC 2,450 ms
103,876 KB
testcase_89 AC 2,691 ms
103,160 KB
testcase_90 AC 4,169 ms
104,076 KB
testcase_91 AC 2,608 ms
105,048 KB
testcase_92 AC 2,535 ms
103,920 KB
testcase_93 AC 2,611 ms
103,300 KB
testcase_94 AC 2,690 ms
105,512 KB
testcase_95 AC 3,005 ms
106,564 KB
testcase_96 AC 3,856 ms
102,792 KB
testcase_97 AC 2,716 ms
104,936 KB
testcase_98 AC 2,760 ms
103,088 KB
testcase_99 AC 3,659 ms
102,552 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] >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:
                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])<3:
            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])<3:
            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