結果

問題 No.5004 Room Assignment
ユーザー negibose2020negibose2020
提出日時 2021-12-03 18:30:01
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,941 ms / 5,000 ms
コード長 6,058 bytes
コンパイル時間 241 ms
実行使用メモリ 114,336 KB
スコア 123,919,814
平均クエリ数 112393.92
最終ジャッジ日時 2021-12-03 18:38:05
合計ジャッジ時間 480,374 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4,890 ms
108,916 KB
testcase_01 AC 4,720 ms
110,932 KB
testcase_02 AC 4,881 ms
108,332 KB
testcase_03 AC 4,628 ms
105,456 KB
testcase_04 AC 4,661 ms
106,384 KB
testcase_05 AC 4,880 ms
107,324 KB
testcase_06 AC 4,089 ms
108,612 KB
testcase_07 AC 4,647 ms
106,112 KB
testcase_08 AC 4,894 ms
107,196 KB
testcase_09 AC 4,875 ms
107,856 KB
testcase_10 AC 4,362 ms
108,676 KB
testcase_11 AC 4,877 ms
108,972 KB
testcase_12 AC 4,338 ms
108,776 KB
testcase_13 AC 4,838 ms
111,116 KB
testcase_14 AC 4,927 ms
106,528 KB
testcase_15 AC 4,920 ms
106,524 KB
testcase_16 AC 4,663 ms
110,520 KB
testcase_17 AC 4,886 ms
106,628 KB
testcase_18 AC 4,738 ms
105,684 KB
testcase_19 AC 4,024 ms
107,156 KB
testcase_20 AC 4,929 ms
105,976 KB
testcase_21 AC 4,909 ms
106,564 KB
testcase_22 AC 4,386 ms
107,244 KB
testcase_23 AC 4,915 ms
106,044 KB
testcase_24 AC 4,898 ms
107,408 KB
testcase_25 AC 4,881 ms
109,080 KB
testcase_26 AC 4,880 ms
107,316 KB
testcase_27 AC 4,872 ms
105,460 KB
testcase_28 AC 4,879 ms
109,444 KB
testcase_29 AC 4,890 ms
105,848 KB
testcase_30 AC 4,011 ms
108,196 KB
testcase_31 AC 4,876 ms
110,428 KB
testcase_32 AC 4,890 ms
112,012 KB
testcase_33 AC 4,716 ms
108,044 KB
testcase_34 AC 4,144 ms
107,300 KB
testcase_35 AC 4,117 ms
106,284 KB
testcase_36 AC 4,405 ms
108,188 KB
testcase_37 AC 4,531 ms
105,536 KB
testcase_38 AC 4,940 ms
107,368 KB
testcase_39 AC 4,374 ms
105,228 KB
testcase_40 AC 4,807 ms
108,496 KB
testcase_41 AC 4,653 ms
111,068 KB
testcase_42 AC 4,903 ms
107,132 KB
testcase_43 AC 4,721 ms
107,688 KB
testcase_44 AC 4,911 ms
109,556 KB
testcase_45 AC 4,759 ms
108,932 KB
testcase_46 AC 4,889 ms
106,380 KB
testcase_47 AC 4,886 ms
107,740 KB
testcase_48 AC 4,916 ms
105,860 KB
testcase_49 AC 4,173 ms
107,484 KB
testcase_50 AC 4,898 ms
106,072 KB
testcase_51 AC 4,258 ms
109,040 KB
testcase_52 AC 4,876 ms
108,624 KB
testcase_53 AC 4,411 ms
114,336 KB
testcase_54 AC 4,285 ms
108,560 KB
testcase_55 AC 4,922 ms
106,708 KB
testcase_56 AC 4,883 ms
107,956 KB
testcase_57 AC 4,348 ms
108,588 KB
testcase_58 AC 4,234 ms
108,892 KB
testcase_59 AC 4,915 ms
107,328 KB
testcase_60 AC 4,101 ms
107,540 KB
testcase_61 AC 4,766 ms
106,476 KB
testcase_62 AC 4,719 ms
107,284 KB
testcase_63 AC 4,885 ms
108,748 KB
testcase_64 AC 4,891 ms
109,028 KB
testcase_65 AC 4,514 ms
108,412 KB
testcase_66 AC 4,911 ms
107,748 KB
testcase_67 AC 4,941 ms
109,864 KB
testcase_68 AC 4,874 ms
107,120 KB
testcase_69 AC 4,741 ms
107,060 KB
testcase_70 AC 4,519 ms
107,064 KB
testcase_71 AC 4,916 ms
109,944 KB
testcase_72 AC 4,899 ms
107,848 KB
testcase_73 AC 4,258 ms
109,056 KB
testcase_74 AC 4,612 ms
108,996 KB
testcase_75 AC 4,696 ms
107,704 KB
testcase_76 AC 4,810 ms
108,644 KB
testcase_77 AC 4,921 ms
106,076 KB
testcase_78 AC 4,798 ms
111,764 KB
testcase_79 AC 4,753 ms
107,552 KB
testcase_80 AC 4,876 ms
108,700 KB
testcase_81 AC 4,446 ms
107,596 KB
testcase_82 AC 4,177 ms
109,124 KB
testcase_83 AC 4,907 ms
108,568 KB
testcase_84 AC 4,898 ms
105,604 KB
testcase_85 AC 4,916 ms
108,368 KB
testcase_86 AC 4,716 ms
108,204 KB
testcase_87 AC 3,478 ms
107,420 KB
testcase_88 AC 4,428 ms
105,976 KB
testcase_89 AC 4,851 ms
106,516 KB
testcase_90 AC 4,914 ms
108,764 KB
testcase_91 AC 4,888 ms
106,764 KB
testcase_92 AC 4,920 ms
105,192 KB
testcase_93 AC 4,632 ms
106,828 KB
testcase_94 AC 4,878 ms
110,376 KB
testcase_95 AC 4,890 ms
108,164 KB
testcase_96 AC 3,993 ms
106,556 KB
testcase_97 AC 4,920 ms
105,764 KB
testcase_98 AC 4,747 ms
109,576 KB
testcase_99 AC 4,899 ms
107,176 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)//3)*(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.75:
        t+=1
        print(0)
        sys.stdout.flush()
        continue

    if t %100 ==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