#701009 (PyPy3) No.1698 Face to Face

提出ソース

結果

問題	No.1698 Face to Face
ユーザー	eSeF
提出日時	2021-09-18 16:40:49
言語	PyPy3 (7.3.15)
結果	AC
実行時間	4,483 ms / 5,000 ms
コード長	4,220 bytes
コンパイル時間	196 ms
コンパイル使用メモリ	82,560 KB
実行使用メモリ	269,772 KB
最終ジャッジ日時	2024-07-19 10:10:26
合計ジャッジ時間	99,558 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	47 ms 55,040 KB
testcase_01	AC	46 ms 55,168 KB
testcase_02	AC	45 ms 55,296 KB
testcase_03	AC	797 ms 249,048 KB
testcase_04	AC	1,314 ms 265,424 KB
testcase_05	AC	3,389 ms 267,204 KB
testcase_06	AC	3,265 ms 265,736 KB
testcase_07	AC	3,703 ms 268,700 KB
testcase_08	AC	3,325 ms 269,772 KB
testcase_09	AC	3,403 ms 264,484 KB
testcase_10	AC	1,288 ms 262,852 KB
testcase_11	AC	4,073 ms 267,788 KB
testcase_12	AC	4,146 ms 266,380 KB
testcase_13	AC	43 ms 54,784 KB
testcase_14	AC	43 ms 54,656 KB
testcase_15	AC	4,431 ms 265,268 KB
testcase_16	AC	4,483 ms 265,076 KB
testcase_17	AC	4,455 ms 264,936 KB
testcase_18	AC	4,013 ms 267,844 KB
testcase_19	AC	3,943 ms 268,400 KB
testcase_20	AC	3,837 ms 266,568 KB
testcase_21	AC	2,427 ms 184,632 KB
testcase_22	AC	2,079 ms 159,148 KB
testcase_23	AC	939 ms 104,068 KB
testcase_24	AC	2,730 ms 202,260 KB
testcase_25	AC	4,281 ms 265,268 KB
testcase_26	AC	677 ms 92,336 KB
testcase_27	AC	1,579 ms 137,228 KB
testcase_28	AC	1,712 ms 143,584 KB
testcase_29	AC	1,424 ms 126,436 KB
testcase_30	AC	3,012 ms 217,592 KB
testcase_31	AC	2,432 ms 184,416 KB
testcase_32	AC	3,369 ms 241,252 KB
testcase_33	AC	3,261 ms 241,368 KB
testcase_34	AC	4,182 ms 268,296 KB
testcase_35	AC	45 ms 55,424 KB
testcase_36	AC	45 ms 55,552 KB
testcase_37	AC	44 ms 54,912 KB
testcase_38	AC	44 ms 55,444 KB
testcase_39	AC	44 ms 55,552 KB
testcase_40	AC	46 ms 55,168 KB
testcase_41	AC	46 ms 55,296 KB
testcase_42	AC	46 ms 55,424 KB
testcase_43	AC	52 ms 55,168 KB
testcase_44	AC	46 ms 55,168 KB
testcase_45	AC	2,496 ms 265,504 KB
testcase_46	AC	2,782 ms 268,516 KB
testcase_47	AC	2,720 ms 265,748 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

class UnionFind_AB:
    def __init__(self, N):
        self.p = [-1] * N
        self.L = [i for i in range(N)]
        self.R = [i for i in range(N)]
    def root(self, x):
        while self.p[x] >= 0:
            x = self.p[x]
        return x
 
    def same(self, x, y):
        return self.root(x) == self.root(y)
 
    def unite(self, x, y):
        x = self.root(x)
        y = self.root(y)
        if x == y:
            return
        p = self.p
        if p[x] > p[y]:
            p[y] += p[x]
            p[x] = y
            self.L[y] = min(self.L[y],self.L[x])
            self.R[y] = max(self.R[y],self.R[x])
        else:
            p[x] += p[y]
            p[y] = x
            self.L[x] = min(self.L[y],self.L[x])
            self.R[x] = max(self.R[y],self.R[x])
 
    def size(self, x):
        return -self.p[self.root(x)]
    def left(self, v):
        return self.L[self.root(v)]
    def right(self,v):
        return self.R[self.root(v)]

class UnionFind_IDX:
    def __init__(self, N):
        self.p = [-1] * N
        self.num_pair = [0] * N
        self.score = 0
 
    def root(self, x):
        while self.p[x] >= 0:
            x = self.p[x]
        return x
 
    def same(self, x, y):
        return self.root(x) == self.root(y)
 
    def unite(self, x, y):
        x = self.root(x)
        y = self.root(y)
        if x == y:
            return
        self.score -= self.sub_score(x) + self.sub_score(y)
        p = self.p
        if p[x] > p[y]:
            p[y] += p[x]
            p[x] = y
            self.num_pair[y] += self.num_pair[x]
            self.score += self.sub_score(y)
        else:
            p[x] += p[y]
            p[y] = x
            self.num_pair[x] += self.num_pair[y]
            self.score += self.sub_score(x)

    def add_pair(self,v):
        self.score -= self.sub_score(self.root(v))
        self.num_pair[self.root(v)]+=1
        self.score += self.sub_score(self.root(v))
    def size(self, x):
        return -self.p[self.root(x)]
    def sub_score(self,v):
        return min(-self.p[self.root(v)],self.num_pair[self.root(v)])

import sys
from collections import deque
input = sys.stdin.readline

def main():
    n = int(input())
    a = list(map(int,input().split()))
    b = list(map(int,input().split()))
    z = list(map(int,input().split()))

    ida = [-1]*n
    idb = [-1]*n
    for i in range(n):
        a[i]-=1
        b[i]-=1
        z[i]-=1
        ida[a[i]]=i
        idb[b[i]]=i

    pos_left = [-1]*n
    l = [-1]*n
    r = [n]*n

    mid = [deque() for i in range(n)]
    for _ in range(17):
        for i in range(n):
            if r[i]-l[i]>1:
                mid[(l[i]+r[i])//2].append(i)

        ufa = UnionFind_AB(n)
        ufb = UnionFind_AB(n)
        for k in range(n):
            ia = ida[k]
            ib = idb[k]
            if 0<ia and a[ia-1]<=k:
                ufa.unite(ia-1,ia)
            if ia+1<n and a[ia+1]<=k:
                ufa.unite(ia,ia+1)
            if 0<ib and b[ib-1]<=k:
                ufb.unite(ib-1,ib)
            if ib+1<n and b[ib+1]<=k:
                ufb.unite(ib,ib+1)
        
            while len(mid[k])>0:
                j = mid[k].pop()
                la, ra = ufa.left(ida[j]),ufa.right(ida[j])
                lb, rb = ufb.left(idb[z[j]]),ufb.right(idb[z[j]])

                if ra < lb or rb < la:
                    l[j] = k
                else:
                    r[j] = k
                    pos_left[j] = max(la,lb)

    for i in range(n):
        mid[r[i]].append(i)

    less_k = [0]*n
    ufi = UnionFind_IDX(n)
    ans = []
    for k in range(n):
        ia, ib = ida[k],idb[k]
        less_k[ia]+=1
        less_k[ib]+=1
        if less_k[ia]==2:
            if 0<ia and less_k[ia-1]==2:
                ufi.unite(ia-1,ia)
            if ia+1<n and less_k[ia+1]==2:
                ufi.unite(ia,ia+1)
        if less_k[ib]==2:
            if 0<ib and less_k[ib-1]==2:
                ufi.unite(ib-1,ib)
            if ib+1<n and less_k[ib+1]==2:
                ufi.unite(ib,ib+1)
        while len(mid[k])>0:
            ufi.add_pair(pos_left[mid[k].pop()])
        ans.append(ufi.score)

    print("\n".join(map(str,ans)))

if __name__=='__main__':
    main()

yukicoder

結果

テストケース

ソースコード