結果

問題 No.1698 Face to Face
ユーザー eSeFeSeF
提出日時 2021-09-18 17:37:52
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,273 ms / 5,000 ms
コード長 4,285 bytes
コンパイル時間 338 ms
コンパイル使用メモリ 86,920 KB
実行使用メモリ 219,748 KB
最終ジャッジ日時 2023-09-26 16:12:20
合計ジャッジ時間 94,333 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 97 ms
72,332 KB
testcase_01 AC 97 ms
72,152 KB
testcase_02 AC 97 ms
71,984 KB
testcase_03 AC 828 ms
184,328 KB
testcase_04 AC 1,215 ms
198,236 KB
testcase_05 AC 3,397 ms
219,408 KB
testcase_06 AC 3,389 ms
219,748 KB
testcase_07 AC 3,146 ms
216,276 KB
testcase_08 AC 3,052 ms
218,724 KB
testcase_09 AC 3,064 ms
217,184 KB
testcase_10 AC 1,179 ms
201,024 KB
testcase_11 AC 3,449 ms
214,336 KB
testcase_12 AC 3,734 ms
218,772 KB
testcase_13 AC 98 ms
72,220 KB
testcase_14 AC 98 ms
72,132 KB
testcase_15 AC 3,752 ms
207,784 KB
testcase_16 AC 4,242 ms
215,368 KB
testcase_17 AC 4,038 ms
215,296 KB
testcase_18 AC 3,512 ms
195,136 KB
testcase_19 AC 3,690 ms
196,352 KB
testcase_20 AC 3,536 ms
195,940 KB
testcase_21 AC 2,154 ms
144,720 KB
testcase_22 AC 2,053 ms
136,724 KB
testcase_23 AC 918 ms
96,292 KB
testcase_24 AC 2,439 ms
155,680 KB
testcase_25 AC 4,115 ms
209,540 KB
testcase_26 AC 693 ms
90,896 KB
testcase_27 AC 1,472 ms
117,840 KB
testcase_28 AC 1,564 ms
123,204 KB
testcase_29 AC 1,390 ms
114,464 KB
testcase_30 AC 2,640 ms
160,984 KB
testcase_31 AC 2,467 ms
149,208 KB
testcase_32 AC 2,960 ms
175,864 KB
testcase_33 AC 3,180 ms
178,972 KB
testcase_34 AC 4,273 ms
209,040 KB
testcase_35 AC 102 ms
72,204 KB
testcase_36 AC 102 ms
72,304 KB
testcase_37 AC 102 ms
72,056 KB
testcase_38 AC 103 ms
72,344 KB
testcase_39 AC 102 ms
72,256 KB
testcase_40 AC 101 ms
72,160 KB
testcase_41 AC 100 ms
71,984 KB
testcase_42 AC 101 ms
72,136 KB
testcase_43 AC 99 ms
72,360 KB
testcase_44 AC 97 ms
72,188 KB
testcase_45 AC 2,344 ms
206,760 KB
testcase_46 AC 2,599 ms
210,304 KB
testcase_47 AC 2,552 ms
209,560 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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
            if self.L[y] > self.L[x]:
                self.L[y] = self.L[x]
            if self.R[y] < self.R[x]:
                self.R[y] = self.R[x]
        else:
            p[x] += p[y]
            p[y] = x
            if self.L[x] > self.L[y]:
                self.L[x] = self.L[y]
            if self.R[x] < self.R[y]:
                self.R[x] = self.R[y]
 
    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):
        rv = self.root(v)
        self.score -= self.sub_score(rv)
        self.num_pair[rv]+=1
        self.score += self.sub_score(rv)
    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

def main():
    input = sys.stdin.buffer.readline
    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
    rn = range(n)
    for i in rn:
        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 = [[] for i in rn]
    for _ in [0]*(17):
        for i in rn:
            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 rn:
            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)
        
            for j in mid[k]:
                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)
            mid[k].clear()

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

    less_k = [0]*n
    ufi = UnionFind_IDX(n)
    ans = []
    for k in rn:
        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)
        for j in mid[k]:
            ufi.add_pair(pos_left[j])
        ans.append(ufi.score)

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

if __name__=='__main__':
    main()
0