結果
問題 | No.1768 The frog in the well knows the great ocean. |
ユーザー | chineristAC |
提出日時 | 2021-10-24 03:54:29 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 1,157 ms / 3,000 ms |
コード長 | 4,075 bytes |
コンパイル時間 | 939 ms |
コンパイル使用メモリ | 86,948 KB |
実行使用メモリ | 153,692 KB |
最終ジャッジ日時 | 2023-09-12 05:47:56 |
合計ジャッジ時間 | 20,187 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 119 ms
74,172 KB |
testcase_01 | AC | 255 ms
83,288 KB |
testcase_02 | AC | 264 ms
83,872 KB |
testcase_03 | AC | 265 ms
84,140 KB |
testcase_04 | AC | 256 ms
84,576 KB |
testcase_05 | AC | 247 ms
83,828 KB |
testcase_06 | AC | 1,006 ms
147,748 KB |
testcase_07 | AC | 1,042 ms
153,692 KB |
testcase_08 | AC | 1,031 ms
133,828 KB |
testcase_09 | AC | 1,033 ms
129,052 KB |
testcase_10 | AC | 1,042 ms
139,844 KB |
testcase_11 | AC | 1,157 ms
145,004 KB |
testcase_12 | AC | 1,033 ms
142,184 KB |
testcase_13 | AC | 814 ms
141,060 KB |
testcase_14 | AC | 929 ms
148,708 KB |
testcase_15 | AC | 1,016 ms
140,936 KB |
testcase_16 | AC | 900 ms
139,848 KB |
testcase_17 | AC | 907 ms
139,504 KB |
testcase_18 | AC | 950 ms
139,740 KB |
testcase_19 | AC | 812 ms
139,612 KB |
testcase_20 | AC | 918 ms
139,548 KB |
testcase_21 | AC | 116 ms
74,220 KB |
testcase_22 | AC | 118 ms
74,380 KB |
testcase_23 | AC | 140 ms
79,184 KB |
testcase_24 | AC | 481 ms
86,104 KB |
testcase_25 | AC | 578 ms
139,508 KB |
testcase_26 | AC | 443 ms
139,604 KB |
testcase_27 | AC | 117 ms
74,236 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] = self.segfunc(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 bisect_left(self,l,r,x): l += self.num r += self.num segment = [] segment_r = [] while l<r: if l&1: segment.append(l) l += 1 if r&1: segment_r.append(r-1) l >>= 1 r >>= 1 segment += segment_r[::-1] tmp = self.ide_ele for pos in segment: check = self.segfunc(tmp,self.tree[pos]) if x <= check : break else: tmp = check else: return -1 while pos < self.num: check = self.segfunc(tmp,self.tree[2*pos]) if x <= check: pos = 2 * pos else: tmp = check pos = 2 * pos + 1 return pos - self.num def bisect_right(self,l,r,x): l += self.num r += self.num segment = [] segment_r = [] while l<r: if l&1: segment.append(l) l += 1 if r&1: segment_r.append(r-1) l >>= 1 r >>= 1 segment += segment_r[::-1] tmp = self.ide_ele for pos in segment[::-1]: check = self.segfunc(tmp,self.tree[pos]) if check >= x: break else: tmp = check else: return -1 while pos < self.num: check = self.segfunc(tmp,self.tree[2*pos]) if check >= x: pos = 2 * pos else: tmp = check pos = 2 * pos + 1 return pos - self.num import sys,random from collections import deque import bisect input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) def solve(N,A,B): if any(A[i] > B[i] for i in range(N)): return "No" val_to_idx = [[] for i in range(N+1)] check = [[] for i in range(N+1)] for i in range(N): val_to_idx[A[i]].append(i) check[B[i]].append(i) seg_A = SegmentTree(A,max,0) seg_B = SegmentTree(B,min,N+1) for k in range(1,N+1): t = val_to_idx[k] for idx in check[k]: flag = (A[idx]==k) i = bisect.bisect_right(t,idx) if i!=0: l = t[i-1] if seg_A.query(l,idx+1) <= k <= seg_B.query(l,idx+1): flag = True if i!=len(t): r = t[i] if seg_A.query(idx,r+1) <= k <= seg_B.query(idx,r+1): flag = True if not flag: return "No" return "Yes" for _ in range(int(input())): N = int(input()) A = li() B = li() print(solve(N,A,B))