結果
問題 | No.1965 Heavier |
ユーザー | chineristAC |
提出日時 | 2022-06-03 23:02:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 546 ms / 2,000 ms |
コード長 | 1,610 bytes |
コンパイル時間 | 323 ms |
コンパイル使用メモリ | 81,876 KB |
実行使用メモリ | 144,688 KB |
最終ジャッジ日時 | 2023-10-21 02:18:11 |
合計ジャッジ時間 | 11,204 ms |
ジャッジサーバーID (参考情報) |
judge9 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
55,864 KB |
testcase_01 | AC | 45 ms
55,864 KB |
testcase_02 | AC | 45 ms
55,864 KB |
testcase_03 | AC | 47 ms
55,864 KB |
testcase_04 | AC | 44 ms
55,864 KB |
testcase_05 | AC | 44 ms
55,864 KB |
testcase_06 | AC | 533 ms
135,084 KB |
testcase_07 | AC | 483 ms
135,088 KB |
testcase_08 | AC | 289 ms
130,904 KB |
testcase_09 | AC | 343 ms
144,688 KB |
testcase_10 | AC | 356 ms
144,680 KB |
testcase_11 | AC | 357 ms
144,676 KB |
testcase_12 | AC | 46 ms
55,996 KB |
testcase_13 | AC | 44 ms
55,996 KB |
testcase_14 | AC | 45 ms
55,996 KB |
testcase_15 | AC | 402 ms
140,852 KB |
testcase_16 | AC | 406 ms
142,152 KB |
testcase_17 | AC | 348 ms
107,568 KB |
testcase_18 | AC | 463 ms
136,464 KB |
testcase_19 | AC | 546 ms
135,224 KB |
testcase_20 | AC | 478 ms
135,760 KB |
testcase_21 | AC | 438 ms
125,640 KB |
testcase_22 | AC | 423 ms
126,016 KB |
testcase_23 | AC | 357 ms
97,832 KB |
testcase_24 | AC | 518 ms
119,676 KB |
testcase_25 | AC | 262 ms
136,476 KB |
testcase_26 | AC | 261 ms
136,096 KB |
testcase_27 | AC | 216 ms
135,928 KB |
testcase_28 | AC | 216 ms
135,932 KB |
ソースコード
import sys,random,bisect from collections import deque,defaultdict from heapq import heapify,heappop,heappush from itertools import permutations from math import log,gcd input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) def solve(N,A,B): r = -1 M = [] del_M = [] m = [] del_m = [] res = 0 for l in range(N): if r==l-1: heappush(M,-(A[l]+B[l])) heappush(m,-(A[l]-B[l])) r = l while del_M and M[0]==del_M[0]: heappop(M) heappop(del_M) while del_m and m[0]==del_m[0]: heappop(m) heappop(del_m) while r!=N-1: if -M[0] < A[r+1]+B[r+1] and -m[0] < A[r+1]-B[r+1]: heappush(M,-(A[r+1]+B[r+1])) heappush(m,-(A[r+1]-B[r+1])) r += 1 else: break #print(l,r,M,m) res += r-l heappush(del_M,-(A[l]+B[l])) heappush(del_m,-(A[l]-B[l])) return res def brute(N,A,B): res = 0 for l in range(N): for r in range(l+1,N): if all(A[i]+B[i] < A[i+1]+B[i+1] for i in range(l,r)) and all(A[i]-B[i] < A[i+1]-B[i+1] for i in range(l,r)): res += 1 return res while False: N = 3 A = [random.randint(1,20) for i in range(N)] B = [random.randint(1,20) for i in range(N)] A.sort() print(A) print(B) print(solve(N,A,B),brute(N,A,B)) assert solve(N,A,B)==brute(N,A,B) N = int(input()) A = li() B = li() print(solve(N,A,B))