結果

問題 No.5004 Room Assignment
ユーザー negibose2020negibose2020
提出日時 2021-12-02 00:27:42
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,611 ms / 5,000 ms
コード長 4,147 bytes
コンパイル時間 911 ms
実行使用メモリ 106,356 KB
スコア 108,531,655
平均クエリ数 14720.40
最終ジャッジ日時 2021-12-02 00:31:00
合計ジャッジ時間 188,429 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,480 ms
105,008 KB
testcase_01 AC 1,657 ms
101,652 KB
testcase_02 AC 1,639 ms
103,292 KB
testcase_03 AC 1,722 ms
104,276 KB
testcase_04 AC 1,655 ms
101,824 KB
testcase_05 AC 2,572 ms
103,688 KB
testcase_06 AC 1,760 ms
102,300 KB
testcase_07 AC 1,552 ms
103,004 KB
testcase_08 AC 1,691 ms
104,360 KB
testcase_09 AC 1,702 ms
102,624 KB
testcase_10 AC 1,667 ms
106,356 KB
testcase_11 AC 1,722 ms
102,648 KB
testcase_12 AC 1,710 ms
103,568 KB
testcase_13 AC 1,672 ms
101,756 KB
testcase_14 AC 1,813 ms
103,148 KB
testcase_15 AC 1,745 ms
103,576 KB
testcase_16 AC 1,715 ms
102,736 KB
testcase_17 AC 2,204 ms
102,616 KB
testcase_18 AC 1,647 ms
102,024 KB
testcase_19 AC 1,817 ms
102,548 KB
testcase_20 AC 1,855 ms
103,300 KB
testcase_21 AC 1,752 ms
102,164 KB
testcase_22 AC 1,855 ms
104,028 KB
testcase_23 AC 1,681 ms
104,968 KB
testcase_24 AC 1,844 ms
102,716 KB
testcase_25 AC 1,635 ms
101,960 KB
testcase_26 AC 1,741 ms
103,944 KB
testcase_27 AC 1,699 ms
102,964 KB
testcase_28 AC 1,671 ms
102,840 KB
testcase_29 AC 1,744 ms
104,064 KB
testcase_30 AC 2,303 ms
103,680 KB
testcase_31 AC 1,804 ms
104,028 KB
testcase_32 AC 1,648 ms
101,948 KB
testcase_33 AC 1,622 ms
102,616 KB
testcase_34 AC 2,464 ms
103,980 KB
testcase_35 AC 1,787 ms
102,900 KB
testcase_36 AC 1,693 ms
102,576 KB
testcase_37 AC 1,707 ms
102,024 KB
testcase_38 AC 2,421 ms
102,768 KB
testcase_39 AC 1,759 ms
103,288 KB
testcase_40 AC 1,705 ms
104,664 KB
testcase_41 AC 1,913 ms
101,796 KB
testcase_42 AC 1,656 ms
102,868 KB
testcase_43 AC 2,237 ms
103,924 KB
testcase_44 AC 1,716 ms
100,852 KB
testcase_45 AC 1,766 ms
103,892 KB
testcase_46 AC 1,654 ms
103,876 KB
testcase_47 AC 1,705 ms
103,648 KB
testcase_48 AC 1,723 ms
105,572 KB
testcase_49 AC 2,459 ms
104,172 KB
testcase_50 AC 1,675 ms
102,788 KB
testcase_51 AC 1,628 ms
102,516 KB
testcase_52 AC 1,776 ms
103,648 KB
testcase_53 AC 1,738 ms
102,296 KB
testcase_54 AC 1,729 ms
103,384 KB
testcase_55 AC 1,714 ms
103,232 KB
testcase_56 AC 2,611 ms
101,716 KB
testcase_57 AC 2,426 ms
103,968 KB
testcase_58 AC 1,761 ms
103,356 KB
testcase_59 AC 1,655 ms
103,040 KB
testcase_60 AC 1,811 ms
102,904 KB
testcase_61 AC 1,710 ms
103,664 KB
testcase_62 AC 1,644 ms
102,900 KB
testcase_63 AC 1,684 ms
104,128 KB
testcase_64 AC 1,785 ms
102,924 KB
testcase_65 AC 1,757 ms
103,496 KB
testcase_66 AC 1,627 ms
103,276 KB
testcase_67 AC 1,748 ms
104,260 KB
testcase_68 AC 1,634 ms
101,860 KB
testcase_69 AC 1,613 ms
103,620 KB
testcase_70 AC 1,800 ms
103,604 KB
testcase_71 AC 1,803 ms
103,972 KB
testcase_72 AC 1,632 ms
103,184 KB
testcase_73 AC 1,755 ms
102,344 KB
testcase_74 AC 1,775 ms
104,784 KB
testcase_75 AC 1,623 ms
101,832 KB
testcase_76 AC 1,698 ms
104,196 KB
testcase_77 AC 1,684 ms
103,220 KB
testcase_78 AC 1,627 ms
103,112 KB
testcase_79 AC 1,770 ms
102,064 KB
testcase_80 AC 2,236 ms
103,156 KB
testcase_81 AC 1,796 ms
102,884 KB
testcase_82 AC 1,778 ms
104,052 KB
testcase_83 AC 2,552 ms
101,964 KB
testcase_84 AC 1,682 ms
104,580 KB
testcase_85 AC 1,739 ms
102,764 KB
testcase_86 AC 1,703 ms
105,884 KB
testcase_87 AC 1,661 ms
102,412 KB
testcase_88 AC 1,701 ms
104,560 KB
testcase_89 AC 1,742 ms
102,164 KB
testcase_90 AC 1,777 ms
102,648 KB
testcase_91 AC 1,601 ms
101,884 KB
testcase_92 AC 1,757 ms
104,208 KB
testcase_93 AC 1,714 ms
101,676 KB
testcase_94 AC 1,714 ms
102,944 KB
testcase_95 AC 1,776 ms
102,840 KB
testcase_96 AC 1,777 ms
103,040 KB
testcase_97 AC 1,630 ms
102,140 KB
testcase_98 AC 1,637 ms
103,336 KB
testcase_99 AC 1,612 ms
103,132 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)


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:
                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]) < 5:
                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])<8:
            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])<8:
            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)

        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
            ans4print.append(mls)
        else:
            min_tick=10000000000
            for i in range (len(m)):
                min_tick = min(min_tick, tick[m[i]])
            if min_tick < t - 150 :
                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