結果

問題 No.5004 Room Assignment
ユーザー negibose2020negibose2020
提出日時 2021-12-01 22:55:10
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,139 ms / 5,000 ms
コード長 3,537 bytes
コンパイル時間 236 ms
実行使用メモリ 107,188 KB
スコア 62,970,158
平均クエリ数 7219.11
最終ジャッジ日時 2021-12-01 22:56:58
合計ジャッジ時間 104,729 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge16
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,022 ms
103,560 KB
testcase_01 AC 986 ms
105,024 KB
testcase_02 AC 972 ms
101,760 KB
testcase_03 AC 939 ms
102,580 KB
testcase_04 AC 974 ms
101,812 KB
testcase_05 AC 978 ms
104,936 KB
testcase_06 AC 960 ms
104,668 KB
testcase_07 AC 1,014 ms
103,556 KB
testcase_08 AC 973 ms
104,472 KB
testcase_09 AC 954 ms
104,460 KB
testcase_10 AC 930 ms
102,312 KB
testcase_11 AC 955 ms
105,220 KB
testcase_12 AC 979 ms
101,552 KB
testcase_13 AC 985 ms
107,144 KB
testcase_14 AC 985 ms
104,408 KB
testcase_15 AC 991 ms
103,888 KB
testcase_16 AC 931 ms
101,852 KB
testcase_17 AC 984 ms
103,488 KB
testcase_18 AC 957 ms
103,144 KB
testcase_19 AC 936 ms
103,460 KB
testcase_20 AC 998 ms
104,660 KB
testcase_21 AC 962 ms
101,968 KB
testcase_22 AC 983 ms
101,992 KB
testcase_23 AC 962 ms
103,280 KB
testcase_24 AC 989 ms
104,992 KB
testcase_25 AC 1,008 ms
102,984 KB
testcase_26 AC 1,010 ms
106,676 KB
testcase_27 AC 977 ms
104,184 KB
testcase_28 AC 1,021 ms
104,028 KB
testcase_29 AC 995 ms
103,680 KB
testcase_30 AC 976 ms
103,996 KB
testcase_31 AC 1,021 ms
105,892 KB
testcase_32 AC 995 ms
102,304 KB
testcase_33 AC 991 ms
104,508 KB
testcase_34 AC 1,040 ms
104,796 KB
testcase_35 AC 943 ms
102,784 KB
testcase_36 AC 1,000 ms
103,240 KB
testcase_37 AC 950 ms
103,308 KB
testcase_38 AC 1,139 ms
106,076 KB
testcase_39 AC 965 ms
102,428 KB
testcase_40 AC 963 ms
101,296 KB
testcase_41 AC 955 ms
102,084 KB
testcase_42 AC 982 ms
104,540 KB
testcase_43 AC 912 ms
103,988 KB
testcase_44 AC 999 ms
105,896 KB
testcase_45 AC 942 ms
102,636 KB
testcase_46 AC 1,001 ms
103,256 KB
testcase_47 AC 1,015 ms
104,944 KB
testcase_48 AC 922 ms
103,272 KB
testcase_49 AC 1,026 ms
106,136 KB
testcase_50 AC 947 ms
104,080 KB
testcase_51 AC 989 ms
105,456 KB
testcase_52 AC 1,018 ms
104,384 KB
testcase_53 AC 956 ms
103,012 KB
testcase_54 AC 974 ms
103,064 KB
testcase_55 AC 1,003 ms
105,140 KB
testcase_56 AC 973 ms
104,740 KB
testcase_57 AC 963 ms
102,740 KB
testcase_58 AC 930 ms
105,892 KB
testcase_59 AC 1,009 ms
103,972 KB
testcase_60 AC 935 ms
101,696 KB
testcase_61 AC 945 ms
102,192 KB
testcase_62 AC 972 ms
103,260 KB
testcase_63 AC 978 ms
103,464 KB
testcase_64 AC 1,006 ms
104,036 KB
testcase_65 AC 974 ms
104,084 KB
testcase_66 AC 971 ms
102,420 KB
testcase_67 AC 904 ms
103,216 KB
testcase_68 AC 980 ms
102,264 KB
testcase_69 AC 936 ms
103,056 KB
testcase_70 AC 937 ms
103,732 KB
testcase_71 AC 972 ms
104,052 KB
testcase_72 AC 933 ms
102,912 KB
testcase_73 AC 995 ms
103,644 KB
testcase_74 AC 964 ms
104,156 KB
testcase_75 AC 962 ms
104,472 KB
testcase_76 AC 977 ms
102,732 KB
testcase_77 AC 1,024 ms
107,188 KB
testcase_78 AC 953 ms
102,260 KB
testcase_79 AC 961 ms
104,308 KB
testcase_80 AC 920 ms
100,448 KB
testcase_81 AC 1,094 ms
103,236 KB
testcase_82 AC 933 ms
102,884 KB
testcase_83 AC 973 ms
102,512 KB
testcase_84 AC 952 ms
103,488 KB
testcase_85 AC 937 ms
102,064 KB
testcase_86 AC 993 ms
102,772 KB
testcase_87 AC 986 ms
105,508 KB
testcase_88 AC 1,079 ms
101,208 KB
testcase_89 AC 935 ms
102,780 KB
testcase_90 AC 952 ms
100,484 KB
testcase_91 AC 999 ms
102,760 KB
testcase_92 AC 1,008 ms
104,396 KB
testcase_93 AC 949 ms
102,412 KB
testcase_94 AC 993 ms
106,248 KB
testcase_95 AC 967 ms
102,860 KB
testcase_96 AC 968 ms
103,516 KB
testcase_97 AC 957 ms
103,572 KB
testcase_98 AC 1,013 ms
102,528 KB
testcase_99 AC 996 ms
103,576 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)

s=set()
# スキル値, プレイヤーi, 出現チック
s.add((-10000000,-1,-1))
s.add((100000000,-1,-1))
pi=1

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)

    t_ans=set()
    for i in range(L[0]):
        # print(s)
        nowi=(L[i+1],pi,t)
        p[pi]=L[i+1]
        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])<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)

        pi+=1
    t+=1

    # print (t_ans)

    ans4print=[]
    ans4print_num=0
    for ans in t_ans:
        m=uf.members(ans)
        mls=[]
        for i in range(1,len(m)) :
            mls.append([m[0],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