結果
問題 | No.905 Sorted? |
ユーザー | brthyyjp |
提出日時 | 2020-06-30 06:47:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 479 ms / 2,000 ms |
コード長 | 2,391 bytes |
コンパイル時間 | 401 ms |
コンパイル使用メモリ | 87,088 KB |
実行使用メモリ | 95,744 KB |
最終ジャッジ日時 | 2023-09-26 23:22:27 |
合計ジャッジ時間 | 8,901 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
71,192 KB |
testcase_01 | AC | 75 ms
71,036 KB |
testcase_02 | AC | 73 ms
71,188 KB |
testcase_03 | AC | 74 ms
71,248 KB |
testcase_04 | AC | 75 ms
71,192 KB |
testcase_05 | AC | 112 ms
77,424 KB |
testcase_06 | AC | 91 ms
76,224 KB |
testcase_07 | AC | 146 ms
78,412 KB |
testcase_08 | AC | 448 ms
86,608 KB |
testcase_09 | AC | 360 ms
84,856 KB |
testcase_10 | AC | 423 ms
94,912 KB |
testcase_11 | AC | 477 ms
92,364 KB |
testcase_12 | AC | 479 ms
90,956 KB |
testcase_13 | AC | 452 ms
95,596 KB |
testcase_14 | AC | 460 ms
95,744 KB |
testcase_15 | AC | 249 ms
94,928 KB |
testcase_16 | AC | 275 ms
95,052 KB |
testcase_17 | AC | 267 ms
95,424 KB |
testcase_18 | AC | 302 ms
95,452 KB |
testcase_19 | AC | 75 ms
71,028 KB |
testcase_20 | AC | 74 ms
71,236 KB |
testcase_21 | AC | 75 ms
71,192 KB |
testcase_22 | AC | 74 ms
70,948 KB |
ソースコード
import sys sys.setrecursionlimit(10**7) input = sys.stdin.buffer.readline n = int(input()) A = list(map(int, input().split())) if n == 1: q = int(input()) for i in range(q): l, r = map(int, input().split()) print(1, 1) exit() B = [0]*(n-1) for i in range(n-1): B[i] = A[i+1]-A[i] def min_(x, y): if x <= y: return x else: return y def mininit(init_val): # set_val for i in range(n-1): sgmin[i+num-1] = init_val[i] # built for i in range(num-2, -1, -1): sgmin[i] = min_(sgmin[2*i+1], sgmin[2*i+2]) def minupdate(k, x): k += num - 1 sgmin[k] = x while k: k = (k-1)//2 sgmin[k] = min_(sgmin[2*k+1], sgmin[2*k+2]) def minquery(p, q): if q <= p: return ide_ele_min p += num - 1 q += num - 2 res = ide_ele_min while q-p>1: if p&1 == 0: res = min_(res, sgmin[p]) if q&1 == 1: res = min_(res, sgmin[q]) q -= 1 p = p//2 q = (q-1)//2 if p == q: res = min_(res, sgmin[p]) else: res = min_(min_(res, sgmin[p]), sgmin[q]) return res def max_(x, y): if x >= y: return x else: return y def maxinit(init_val): # set_val for i in range(n-1): sgmax[i+num-1] = init_val[i] # built for i in range(num-2, -1, -1): sgmax[i] = max_(sgmax[2*i+1], sgmax[2*i+2]) def maxupdate(k, x): k += num - 1 sgmax[k] = x while k: k = (k-1)//2 sgmax[k] = max_(sgmax[2*k+1], sgmax[2*k+2]) def maxquery(p, q): if q <= p: return ide_ele_max p += num - 1 q += num - 2 res = ide_ele_max while q-p>1: if p&1 == 0: res = max_(res, sgmax[p]) if q&1 == 1: res = max_(res, sgmax[q]) q -= 1 p = p//2 q = (q-1)//2 if p == q: res = max_(res, sgmax[p]) else: res = max_(max_(res, sgmax[p]), sgmax[q]) return res # identity element ide_ele_min = 10**18 ide_ele_max = -10**18 num = 2**(n-2).bit_length() sgmin = [ide_ele_min]*2*num sgmax = [ide_ele_max]*2*num mininit(B) maxinit(B) q = int(input()) for i in range(q): l, r = map(int, input().split()) ans = [0, 0] if minquery(l, r) >= 0: ans[0] = 1 if maxquery(l, r) <= 0: ans[1] = 1 print(*ans)