結果
問題 | No.1914 Directed by Two Sequences |
ユーザー | chineristAC |
提出日時 | 2021-10-31 18:00:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,682 ms / 3,000 ms |
コード長 | 5,794 bytes |
コンパイル時間 | 1,902 ms |
コンパイル使用メモリ | 86,936 KB |
実行使用メモリ | 158,696 KB |
最終ジャッジ日時 | 2023-08-22 06:40:24 |
合計ジャッジ時間 | 57,492 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
71,420 KB |
testcase_01 | AC | 72 ms
71,264 KB |
testcase_02 | AC | 528 ms
95,768 KB |
testcase_03 | AC | 529 ms
98,100 KB |
testcase_04 | AC | 504 ms
97,532 KB |
testcase_05 | AC | 509 ms
96,488 KB |
testcase_06 | AC | 495 ms
96,508 KB |
testcase_07 | AC | 526 ms
92,504 KB |
testcase_08 | AC | 533 ms
94,712 KB |
testcase_09 | AC | 527 ms
95,932 KB |
testcase_10 | AC | 1,373 ms
153,296 KB |
testcase_11 | AC | 1,358 ms
152,604 KB |
testcase_12 | AC | 1,296 ms
145,808 KB |
testcase_13 | AC | 1,382 ms
145,680 KB |
testcase_14 | AC | 1,327 ms
141,612 KB |
testcase_15 | AC | 1,360 ms
141,604 KB |
testcase_16 | AC | 1,331 ms
158,600 KB |
testcase_17 | AC | 1,321 ms
158,640 KB |
testcase_18 | AC | 1,277 ms
154,108 KB |
testcase_19 | AC | 915 ms
123,360 KB |
testcase_20 | AC | 873 ms
121,176 KB |
testcase_21 | AC | 911 ms
126,876 KB |
testcase_22 | AC | 1,372 ms
157,660 KB |
testcase_23 | AC | 1,291 ms
150,948 KB |
testcase_24 | AC | 1,277 ms
149,296 KB |
testcase_25 | AC | 1,400 ms
148,472 KB |
testcase_26 | AC | 1,254 ms
142,576 KB |
testcase_27 | AC | 1,551 ms
149,648 KB |
testcase_28 | AC | 1,460 ms
146,680 KB |
testcase_29 | AC | 1,457 ms
153,460 KB |
testcase_30 | AC | 1,461 ms
146,280 KB |
testcase_31 | AC | 1,451 ms
142,284 KB |
testcase_32 | AC | 1,511 ms
154,244 KB |
testcase_33 | AC | 597 ms
110,332 KB |
testcase_34 | AC | 1,648 ms
158,696 KB |
testcase_35 | AC | 817 ms
133,944 KB |
testcase_36 | AC | 1,317 ms
138,228 KB |
testcase_37 | AC | 1,234 ms
134,524 KB |
testcase_38 | AC | 1,481 ms
151,612 KB |
testcase_39 | AC | 1,682 ms
157,068 KB |
ソースコード
class SegmentTree: def __init__(self, init_val, segfunc, ide_ele): n = len(init_val) self.segfunc = segfunc self.ide_ele = ide_ele self.num = 1 << (n - 1).bit_length() self.tree = [ide_ele] * 2 * self.num self.size = n for i in range(n): self.tree[self.num + i] = init_val[i] for i in range(self.num - 1, 0, -1): self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1]) def update(self, k, x): k += self.num self.tree[k] = x while k > 1: k >>= 1 self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1]) def query(self, l, r): if r==self.size: r = self.num res = self.ide_ele l += self.num r += self.num right = [] while l < r: if l & 1: res = self.segfunc(res, self.tree[l]) l += 1 if r & 1: right.append(self.tree[r-1]) l >>= 1 r >>= 1 for e in right[::-1]: res = self.segfunc(res,e) return res def solve(N,A,B,M,E): A = [a-1 for a in A] B = [b-1 for b in B] res = set() edge = [[] for v in range(N)] for u,v in E: edge[u-1].append(v-1) edge[v-1].append(u-1) group = [-1 for v in range(N)] for v in range(N): mex = [False for i in range(len(edge[v])+1)] for nv in edge[v]: if nv < v and group[nv] < len(mex): mex[group[nv]] = True for i in range(len(mex)): if not mex[i]: group[v] = i break n = max(group) + 1 clique = [[] for g in range(n)] for v in range(N): clique[group[v]].append(v) def direct(i,j): if i < j: return A[i] < B[j] else: return B[i] < A[j] def hamilton_path(V): n = len(V) if n <= 1: return V A = hamilton_path(V[:n//2]) B = hamilton_path(V[n//2:]) res = [] bi = 0 for ai in range(len(A)): while bi<len(B) and direct(B[bi],A[ai]): res.append(B[bi]) bi += 1 res.append(A[ai]) res += B[bi:] return res idx = [-1 for v in range(N)] for g in range(n): clique[g] = hamilton_path(clique[g]) for i in range(len(clique[g])): idx[clique[g][i]] = i for u,v in zip(clique[g],clique[g][1:]): res.add((u,v)) memo_to = [N for v in range(N)] memo_from = [-1 for v in range(N)] ci = [i for i in range(n)] ci.sort(lambda g:len(clique[g])) idx_on_ci = [-1 for i in range(n)] for i in range(n): idx_on_ci[ci[i]] = i ban = [[] for v in range(N)] Vs = [] seg_to_large = SegmentTree([N]*2*N,min,N) seg_to_small = SegmentTree([N]*2*N,min,N) seg_from_large = SegmentTree([-1]*2*N,max,-1) seg_from_small = SegmentTree([-1]*2*N,max,-1) for i in range(n): target = ci[i] Vs += clique[target] Vs.sort() for nv in clique[target]: for v in edge[nv]: if idx_on_ci[group[v]] <= i: ban[v].append(nv) for v in Vs[::-1]: for nv in ban[v]: if v < nv: seg_to_large.update(B[nv],N) memo_to[v] = min(memo_to[v],seg_to_large.query(A[v],2*N)) for nv in ban[v]: if v < nv: seg_to_large.update(B[nv],idx[nv]) if group[v]==target: seg_to_large.update(B[v],idx[v]) for v in Vs: for nv in ban[v]: if nv < v: seg_to_small.update(A[nv],N) memo_to[v] = min(memo_to[v],seg_to_small.query(B[v],2*N)) for nv in ban[v]: if nv < v: seg_to_small.update(A[nv],idx[nv]) if group[v]==target: seg_to_small.update(A[v],idx[v]) for v in Vs[::-1]: for nv in ban[v]: if v < nv: seg_from_large.update(B[nv],-1) memo_from[v] = max(memo_from[v],seg_from_large.query(0,A[v])) for nv in ban[v]: if v < nv: seg_from_large.update(B[nv],idx[nv]) if group[v]==target: seg_from_large.update(B[v],idx[v]) for v in Vs: for nv in ban[v]: if nv < v: seg_from_small.update(A[nv],-1) memo_from[v] = max(memo_from[v],seg_from_small.query(0,B[v])) for nv in ban[v]: if nv < v: seg_from_small.update(A[nv],idx[nv]) if group[v]==target: seg_from_small.update(A[v],idx[v]) for v in Vs: if memo_to[v]!=N: nv = clique[target][memo_to[v]] res.add((v,nv)) memo_to[v] = N if memo_from[v]!=-1: pv = clique[target][memo_from[v]] res.add((pv,v)) memo_from[v] = -1 ban[v] = [] if group[v]==target: seg_to_large.update(B[v],N) seg_to_small.update(A[v],N) seg_from_large.update(B[v],-1) seg_from_small.update(A[v],-1) print(len(res)) for u,v in res: print(u+1,v+1) import sys input = lambda :sys.stdin.buffer.readline() mi = lambda :map(int,input().split()) li = lambda :list(mi()) N,M = mi() A = li() B = li() E = [tuple(mi()) for i in range(M)] solve(N,A,B,M,E)