結果

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

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,267 ms
103,656 KB
testcase_01 AC 3,005 ms
104,932 KB
testcase_02 AC 2,188 ms
102,260 KB
testcase_03 AC 2,290 ms
104,712 KB
testcase_04 AC 2,339 ms
103,812 KB
testcase_05 AC 3,223 ms
104,764 KB
testcase_06 AC 3,465 ms
102,208 KB
testcase_07 AC 2,120 ms
104,452 KB
testcase_08 AC 2,287 ms
106,280 KB
testcase_09 AC 2,309 ms
104,424 KB
testcase_10 AC 2,177 ms
105,472 KB
testcase_11 AC 3,076 ms
102,392 KB
testcase_12 AC 2,248 ms
104,344 KB
testcase_13 AC 2,389 ms
104,324 KB
testcase_14 AC 2,353 ms
103,888 KB
testcase_15 AC 2,361 ms
104,612 KB
testcase_16 AC 2,276 ms
105,132 KB
testcase_17 AC 2,215 ms
102,896 KB
testcase_18 AC 2,220 ms
103,784 KB
testcase_19 AC 2,629 ms
102,036 KB
testcase_20 AC 2,352 ms
105,056 KB
testcase_21 AC 2,485 ms
104,388 KB
testcase_22 AC 2,389 ms
105,516 KB
testcase_23 AC 3,068 ms
103,700 KB
testcase_24 AC 2,400 ms
102,056 KB
testcase_25 AC 2,211 ms
105,660 KB
testcase_26 AC 2,111 ms
105,444 KB
testcase_27 AC 3,109 ms
102,572 KB
testcase_28 AC 2,223 ms
101,996 KB
testcase_29 AC 2,205 ms
104,044 KB
testcase_30 AC 2,308 ms
104,172 KB
testcase_31 AC 2,364 ms
102,996 KB
testcase_32 AC 2,995 ms
104,248 KB
testcase_33 AC 2,157 ms
102,664 KB
testcase_34 AC 2,383 ms
103,672 KB
testcase_35 AC 2,169 ms
101,076 KB
testcase_36 AC 2,186 ms
104,632 KB
testcase_37 AC 3,167 ms
104,644 KB
testcase_38 AC 2,419 ms
104,340 KB
testcase_39 AC 3,299 ms
103,308 KB
testcase_40 AC 3,103 ms
103,620 KB
testcase_41 AC 2,552 ms
107,488 KB
testcase_42 AC 2,229 ms
103,348 KB
testcase_43 AC 2,211 ms
104,664 KB
testcase_44 AC 2,956 ms
103,088 KB
testcase_45 AC 2,560 ms
104,672 KB
testcase_46 AC 2,162 ms
103,708 KB
testcase_47 AC 3,067 ms
104,108 KB
testcase_48 AC 2,192 ms
104,628 KB
testcase_49 AC 2,361 ms
103,332 KB
testcase_50 AC 2,199 ms
105,016 KB
testcase_51 AC 2,175 ms
103,740 KB
testcase_52 AC 2,314 ms
104,868 KB
testcase_53 AC 2,293 ms
104,988 KB
testcase_54 AC 2,156 ms
104,232 KB
testcase_55 AC 2,244 ms
104,676 KB
testcase_56 AC 2,542 ms
104,220 KB
testcase_57 AC 2,294 ms
103,716 KB
testcase_58 AC 2,389 ms
107,688 KB
testcase_59 AC 2,200 ms
101,780 KB
testcase_60 AC 3,522 ms
102,200 KB
testcase_61 AC 2,303 ms
105,684 KB
testcase_62 AC 2,151 ms
102,968 KB
testcase_63 AC 2,272 ms
102,008 KB
testcase_64 AC 2,535 ms
105,440 KB
testcase_65 AC 2,406 ms
103,652 KB
testcase_66 AC 2,197 ms
104,112 KB
testcase_67 AC 3,421 ms
105,268 KB
testcase_68 AC 2,234 ms
105,084 KB
testcase_69 AC 2,098 ms
105,056 KB
testcase_70 AC 2,535 ms
102,824 KB
testcase_71 AC 2,447 ms
104,356 KB
testcase_72 AC 2,914 ms
104,220 KB
testcase_73 AC 2,312 ms
103,640 KB
testcase_74 AC 2,200 ms
103,952 KB
testcase_75 AC 2,282 ms
104,064 KB
testcase_76 AC 2,129 ms
104,924 KB
testcase_77 AC 3,203 ms
103,816 KB
testcase_78 AC 2,949 ms
104,872 KB
testcase_79 AC 2,438 ms
104,364 KB
testcase_80 AC 2,383 ms
106,152 KB
testcase_81 AC 2,440 ms
104,176 KB
testcase_82 AC 2,335 ms
104,148 KB
testcase_83 AC 2,335 ms
102,288 KB
testcase_84 AC 2,984 ms
104,764 KB
testcase_85 AC 2,273 ms
104,172 KB
testcase_86 AC 2,254 ms
104,932 KB
testcase_87 AC 2,195 ms
103,356 KB
testcase_88 AC 3,204 ms
104,888 KB
testcase_89 AC 2,400 ms
102,660 KB
testcase_90 AC 2,421 ms
105,100 KB
testcase_91 AC 3,080 ms
105,016 KB
testcase_92 AC 2,360 ms
102,572 KB
testcase_93 AC 2,286 ms
103,468 KB
testcase_94 AC 2,171 ms
104,700 KB
testcase_95 AC 2,334 ms
104,108 KB
testcase_96 AC 2,397 ms
104,956 KB
testcase_97 AC 2,172 ms
103,932 KB
testcase_98 AC 2,158 ms
103,304 KB
testcase_99 AC 2,164 ms
102,892 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])<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