結果

問題 No.5004 Room Assignment
ユーザー negibose2020negibose2020
提出日時 2021-12-03 17:09:52
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 6,056 bytes
コンパイル時間 606 ms
実行使用メモリ 111,596 KB
スコア 104,230,851
平均クエリ数 136307.69
最終ジャッジ日時 2021-12-03 17:18:20
合計ジャッジ時間 506,752 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4,945 ms
110,384 KB
testcase_01 AC 4,965 ms
109,500 KB
testcase_02 AC 4,971 ms
105,076 KB
testcase_03 AC 4,938 ms
107,428 KB
testcase_04 AC 4,947 ms
107,376 KB
testcase_05 AC 4,946 ms
108,664 KB
testcase_06 AC 4,643 ms
106,164 KB
testcase_07 AC 4,955 ms
108,488 KB
testcase_08 AC 4,972 ms
109,288 KB
testcase_09 AC 4,953 ms
106,600 KB
testcase_10 AC 4,972 ms
111,596 KB
testcase_11 AC 4,952 ms
108,340 KB
testcase_12 AC 4,963 ms
108,180 KB
testcase_13 AC 4,957 ms
107,200 KB
testcase_14 AC 4,986 ms
108,160 KB
testcase_15 TLE -
testcase_16 AC 4,940 ms
107,744 KB
testcase_17 AC 4,958 ms
107,736 KB
testcase_18 AC 4,950 ms
107,860 KB
testcase_19 AC 4,945 ms
109,332 KB
testcase_20 AC 4,985 ms
105,108 KB
testcase_21 AC 4,988 ms
109,520 KB
testcase_22 AC 4,967 ms
106,488 KB
testcase_23 AC 4,999 ms
106,328 KB
testcase_24 AC 4,979 ms
109,492 KB
testcase_25 AC 4,977 ms
110,068 KB
testcase_26 AC 4,956 ms
107,056 KB
testcase_27 AC 4,973 ms
108,292 KB
testcase_28 AC 4,944 ms
107,672 KB
testcase_29 AC 4,955 ms
105,952 KB
testcase_30 AC 4,941 ms
107,564 KB
testcase_31 AC 4,952 ms
107,208 KB
testcase_32 AC 4,969 ms
110,220 KB
testcase_33 AC 4,947 ms
107,080 KB
testcase_34 AC 4,981 ms
109,076 KB
testcase_35 AC 4,950 ms
110,320 KB
testcase_36 AC 4,941 ms
108,868 KB
testcase_37 AC 4,928 ms
108,232 KB
testcase_38 AC 4,986 ms
108,228 KB
testcase_39 AC 4,923 ms
107,560 KB
testcase_40 AC 4,944 ms
108,424 KB
testcase_41 AC 4,955 ms
107,972 KB
testcase_42 AC 4,970 ms
105,676 KB
testcase_43 AC 4,959 ms
108,144 KB
testcase_44 AC 4,972 ms
109,948 KB
testcase_45 AC 4,928 ms
109,812 KB
testcase_46 AC 4,945 ms
107,696 KB
testcase_47 AC 4,943 ms
108,444 KB
testcase_48 AC 4,985 ms
108,480 KB
testcase_49 AC 4,952 ms
108,472 KB
testcase_50 AC 4,977 ms
106,904 KB
testcase_51 AC 4,938 ms
107,792 KB
testcase_52 AC 4,950 ms
109,148 KB
testcase_53 AC 4,944 ms
107,508 KB
testcase_54 AC 4,946 ms
108,472 KB
testcase_55 AC 4,990 ms
107,232 KB
testcase_56 AC 4,942 ms
108,576 KB
testcase_57 AC 4,986 ms
107,188 KB
testcase_58 AC 4,933 ms
106,560 KB
testcase_59 AC 4,994 ms
109,612 KB
testcase_60 AC 4,944 ms
108,500 KB
testcase_61 AC 4,952 ms
108,380 KB
testcase_62 AC 4,948 ms
105,876 KB
testcase_63 AC 4,938 ms
111,040 KB
testcase_64 AC 4,979 ms
106,800 KB
testcase_65 AC 4,940 ms
106,696 KB
testcase_66 AC 4,975 ms
106,580 KB
testcase_67 AC 4,992 ms
111,500 KB
testcase_68 AC 4,936 ms
107,836 KB
testcase_69 AC 4,939 ms
107,740 KB
testcase_70 AC 4,924 ms
108,864 KB
testcase_71 AC 4,969 ms
105,008 KB
testcase_72 AC 4,972 ms
105,192 KB
testcase_73 AC 4,952 ms
108,600 KB
testcase_74 AC 4,951 ms
108,240 KB
testcase_75 AC 4,952 ms
110,072 KB
testcase_76 AC 4,969 ms
109,484 KB
testcase_77 AC 4,983 ms
108,196 KB
testcase_78 AC 4,941 ms
105,440 KB
testcase_79 AC 4,936 ms
108,272 KB
testcase_80 AC 4,938 ms
111,268 KB
testcase_81 AC 4,929 ms
107,884 KB
testcase_82 AC 4,924 ms
105,980 KB
testcase_83 AC 4,966 ms
106,600 KB
testcase_84 AC 4,968 ms
107,900 KB
testcase_85 AC 4,990 ms
104,208 KB
testcase_86 AC 4,969 ms
109,012 KB
testcase_87 AC 4,937 ms
109,884 KB
testcase_88 AC 4,935 ms
105,780 KB
testcase_89 AC 4,945 ms
106,252 KB
testcase_90 AC 4,970 ms
106,880 KB
testcase_91 AC 4,991 ms
107,800 KB
testcase_92 AC 4,989 ms
110,096 KB
testcase_93 AC 4,943 ms
106,612 KB
testcase_94 AC 4,943 ms
108,964 KB
testcase_95 AC 4,967 ms
110,792 KB
testcase_96 AC 4,935 ms
106,992 KB
testcase_97 AC 4,981 ms
106,088 KB
testcase_98 AC 4,987 ms
108,652 KB
testcase_99 AC 4,974 ms
107,024 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())



def clc_score(num,minskil,maxskil,x,y):
    a=(num*(num-1)//2) * (200-(maxskil-minskil)*(maxskil-minskil)) - (num*(num-1)//2)*(y-x)
    # print(a)
    return max(a,0)

# print (clc_score(2,3,4,3,5))
# print (clc_score(2,3,4,3,14))


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()
# score,minskill,maxskill,x,sz
scores=[[0,0,100,0,1] for i in range (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.8:
        t+=1
        print(0)
        sys.stdout.flush()
        continue

    if t %50 ==0:
        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)

    if L[0] == 0:
        t+=1
        print(0)
        sys.stdout.flush()
        continue


    for i in range(L[0]):
        # print(s)
        nowi = (L[i+1],pi,t)
        p[pi] = L[i+1]
        tick[pi] = t
        scores[pi] = [0,L[i+1],L[i+1],t,1]
        sorteds=sorted(list(s))
        target=bisect.bisect_right(sorteds,nowi)

        for _t in list(t_ans):
            if abs(p[pi] - p[_t]) < 3:
                score,minskill,maxskill,x,sz = scores[_t]
                # print(score,minskill,maxskill,x,sz)
                sz=len(uf.members(_t))
                if sz < 4:
                    _score = clc_score(sz+1,min(minskill,p[pi]),max(maxskill,p[pi]),x,t)
                    if _score > score:
                        uf.union(_t, pi)
                        t_ans.add(pi)
                        scores[_t] = [_score, min(minskill,p[pi]), max(maxskill,p[pi]),x,sz+1] 
                        scores[pi] = [_score, min(minskill,p[pi]), max(maxskill,p[pi]),x,sz+1] 
                        break

        if abs(sorteds[target-1][0] - L[i+1])<3:
            score1,minskill1,maxskill1,x1,sz1 = scores[sorteds[target-1][1]]
            sz1 = len(uf.members(sorteds[target-1][1]))
            # score1=1000
            score2,minskill2,maxskill2,x2,sz2 = scores[pi]
            sz2 = len(uf.members(pi))
            # score2=1000

            if sz1 + sz2 <= 4:
                _score = clc_score((sz1+sz2),min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),t)
                # _score = 100000000000000000000
                if _score > score1 + score2:
                    uf.union(pi, sorteds[target-1][1])
                    t_ans.add(pi)
                    scores[sorteds[target-1][1]] = [_score, min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),(sz1+sz2)]
                    scores[pi] = [_score, min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),(sz1+sz2)]

                # s.discard(sorteds[target-1])

        if abs(sorteds[target][0] - L[i+1])<3:
            score1,minskill1,maxskill1,x1,sz1 = scores[sorteds[target][1]]
            # score1=1000
            sz1 = len(uf.members(sorteds[target][1]))
            score2,minskill2,maxskill2,x2,sz2 = scores[pi]
            # score2 = 10000
            sz2 = len(uf.members(pi))
            if sz1 + sz2 <= 4:
                _score = clc_score((sz1+sz2),min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),t)
                # _score=10000000000
                if _score > score1 + score2:
                    uf.union(pi, sorteds[target][1])
                    t_ans.add(pi)
                    scores[sorteds[target][1]] = [_score, min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),(sz1+sz2)]
                    scores[pi] = [_score, min(minskill1,minskill2),max(maxskill1,maxskill2),min(x1,x2),(sz1+sz2)]

                # s.discard(sorteds[target])

        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)

    print(ans4print_num)
    sys.stdout.flush()
    for i in range (len(ans4print)):
        for e in ans4print[i]:
            print(*e)
            sys.stdout.flush()
0