結果

問題 No.5004 Room Assignment
ユーザー negibose2020negibose2020
提出日時 2021-12-02 15:20:48
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 3,316 ms / 5,000 ms
コード長 4,468 bytes
コンパイル時間 772 ms
実行使用メモリ 107,468 KB
スコア 125,246,773
平均クエリ数 51957.23
最終ジャッジ日時 2021-12-02 15:24:43
合計ジャッジ時間 228,991 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,994 ms
102,380 KB
testcase_01 AC 2,687 ms
105,376 KB
testcase_02 AC 2,172 ms
103,804 KB
testcase_03 AC 2,166 ms
104,244 KB
testcase_04 AC 2,117 ms
104,592 KB
testcase_05 AC 2,062 ms
106,084 KB
testcase_06 AC 2,148 ms
104,032 KB
testcase_07 AC 2,020 ms
106,568 KB
testcase_08 AC 2,147 ms
105,240 KB
testcase_09 AC 2,149 ms
102,568 KB
testcase_10 AC 2,201 ms
104,808 KB
testcase_11 AC 2,054 ms
103,732 KB
testcase_12 AC 2,094 ms
103,516 KB
testcase_13 AC 2,196 ms
103,576 KB
testcase_14 AC 2,300 ms
105,324 KB
testcase_15 AC 2,141 ms
105,712 KB
testcase_16 AC 2,026 ms
102,992 KB
testcase_17 AC 1,974 ms
105,464 KB
testcase_18 AC 1,918 ms
101,040 KB
testcase_19 AC 3,316 ms
103,756 KB
testcase_20 AC 2,976 ms
102,996 KB
testcase_21 AC 2,149 ms
103,372 KB
testcase_22 AC 2,169 ms
103,456 KB
testcase_23 AC 2,121 ms
107,072 KB
testcase_24 AC 2,133 ms
103,920 KB
testcase_25 AC 1,925 ms
103,632 KB
testcase_26 AC 2,801 ms
107,468 KB
testcase_27 AC 2,091 ms
103,908 KB
testcase_28 AC 2,067 ms
104,116 KB
testcase_29 AC 2,075 ms
101,840 KB
testcase_30 AC 1,970 ms
102,236 KB
testcase_31 AC 2,192 ms
106,088 KB
testcase_32 AC 2,003 ms
104,624 KB
testcase_33 AC 2,039 ms
104,764 KB
testcase_34 AC 2,138 ms
104,984 KB
testcase_35 AC 2,223 ms
104,808 KB
testcase_36 AC 2,785 ms
103,620 KB
testcase_37 AC 2,927 ms
102,928 KB
testcase_38 AC 2,102 ms
105,100 KB
testcase_39 AC 2,196 ms
103,200 KB
testcase_40 AC 2,028 ms
105,308 KB
testcase_41 AC 2,228 ms
106,244 KB
testcase_42 AC 2,047 ms
102,680 KB
testcase_43 AC 2,045 ms
106,616 KB
testcase_44 AC 2,126 ms
105,220 KB
testcase_45 AC 2,343 ms
105,836 KB
testcase_46 AC 2,009 ms
105,044 KB
testcase_47 AC 2,867 ms
104,552 KB
testcase_48 AC 2,149 ms
104,292 KB
testcase_49 AC 2,180 ms
105,500 KB
testcase_50 AC 2,049 ms
105,432 KB
testcase_51 AC 2,141 ms
102,604 KB
testcase_52 AC 2,200 ms
104,456 KB
testcase_53 AC 2,150 ms
104,024 KB
testcase_54 AC 2,151 ms
103,580 KB
testcase_55 AC 2,071 ms
104,016 KB
testcase_56 AC 2,070 ms
102,540 KB
testcase_57 AC 2,891 ms
104,568 KB
testcase_58 AC 2,093 ms
106,632 KB
testcase_59 AC 1,997 ms
103,592 KB
testcase_60 AC 2,163 ms
103,404 KB
testcase_61 AC 2,008 ms
102,988 KB
testcase_62 AC 2,684 ms
104,980 KB
testcase_63 AC 2,144 ms
103,404 KB
testcase_64 AC 2,192 ms
106,200 KB
testcase_65 AC 2,183 ms
104,292 KB
testcase_66 AC 2,020 ms
103,172 KB
testcase_67 AC 3,023 ms
104,140 KB
testcase_68 AC 1,959 ms
102,884 KB
testcase_69 AC 2,019 ms
103,964 KB
testcase_70 AC 2,317 ms
103,324 KB
testcase_71 AC 2,102 ms
103,416 KB
testcase_72 AC 2,050 ms
103,968 KB
testcase_73 AC 2,095 ms
102,964 KB
testcase_74 AC 2,202 ms
103,752 KB
testcase_75 AC 2,008 ms
104,592 KB
testcase_76 AC 2,052 ms
102,528 KB
testcase_77 AC 2,059 ms
103,056 KB
testcase_78 AC 1,965 ms
104,576 KB
testcase_79 AC 2,132 ms
104,484 KB
testcase_80 AC 2,086 ms
104,460 KB
testcase_81 AC 2,114 ms
105,224 KB
testcase_82 AC 2,194 ms
105,604 KB
testcase_83 AC 2,168 ms
105,740 KB
testcase_84 AC 2,077 ms
102,688 KB
testcase_85 AC 2,172 ms
105,164 KB
testcase_86 AC 2,080 ms
104,372 KB
testcase_87 AC 2,001 ms
103,584 KB
testcase_88 AC 3,197 ms
105,604 KB
testcase_89 AC 2,168 ms
105,200 KB
testcase_90 AC 2,180 ms
106,752 KB
testcase_91 AC 2,043 ms
105,476 KB
testcase_92 AC 2,077 ms
102,228 KB
testcase_93 AC 2,126 ms
103,932 KB
testcase_94 AC 1,945 ms
102,664 KB
testcase_95 AC 2,164 ms
106,184 KB
testcase_96 AC 2,208 ms
103,260 KB
testcase_97 AC 2,035 ms
105,232 KB
testcase_98 AC 1,965 ms
103,816 KB
testcase_99 AC 2,767 ms
105,488 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] >200 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])<5:
            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])<5:
            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