結果

問題 No.905 Sorted?
ユーザー McGregorshMcGregorsh
提出日時 2022-07-05 21:53:02
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 452 ms / 2,000 ms
コード長 2,443 bytes
コンパイル時間 180 ms
コンパイル使用メモリ 82,032 KB
実行使用メモリ 126,456 KB
最終ジャッジ日時 2024-05-09 17:55:21
合計ジャッジ時間 8,230 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 118 ms
83,116 KB
testcase_01 AC 117 ms
83,748 KB
testcase_02 AC 117 ms
83,632 KB
testcase_03 AC 116 ms
83,156 KB
testcase_04 AC 113 ms
83,568 KB
testcase_05 AC 142 ms
89,668 KB
testcase_06 AC 137 ms
89,712 KB
testcase_07 AC 155 ms
89,884 KB
testcase_08 AC 420 ms
105,576 KB
testcase_09 AC 343 ms
102,028 KB
testcase_10 AC 383 ms
126,456 KB
testcase_11 AC 422 ms
115,740 KB
testcase_12 AC 452 ms
112,592 KB
testcase_13 AC 426 ms
124,408 KB
testcase_14 AC 421 ms
121,816 KB
testcase_15 AC 424 ms
123,544 KB
testcase_16 AC 426 ms
124,724 KB
testcase_17 AC 423 ms
124,500 KB
testcase_18 AC 358 ms
124,620 KB
testcase_19 AC 116 ms
83,316 KB
testcase_20 AC 114 ms
83,852 KB
testcase_21 AC 112 ms
83,496 KB
testcase_22 AC 117 ms
83,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


###関数コピーしたか？###
def main():
   
   n = int(input())
   a = i_list()
   plus = [0] * n
   mainsu = [0] * n
   ikoru = [0] * n
   for i in range(1, n):
   	  if a[i-1] > a[i]:
   	  	  mainsu[i] += 1
   	  elif a[i-1] == a[i]:
   	  	  ikoru[i] += 1
   	  elif a[i-1] < a[i]:
   	  	  plus[i] += 1
   
   accumu_plus = list(accumulate(plus))
   accumu_mainsu = list(accumulate(mainsu))
   accumu_ikoru = list(accumulate(ikoru))
   #print(accumu_plus)
   #print(accumu_mainsu)
   #print(accumu_ikoru)
   
   
   q = int(input())
   for i in range(q):
   	  l, r = i_map()
   	  cost = r - l 
   	  num1 = 0
   	  num2 = 0
   	  
   	  #print(l, r)
   	  #print(cost)
   	  
   	  numplus = accumu_plus[r] - accumu_plus[l]
   	  nummainsu = accumu_mainsu[r] - accumu_mainsu[l] 
   	  numikoru = accumu_ikoru[r] - accumu_ikoru[l]
   	  
   	  #print(numplus)
   	  #print(nummainsu)
   	  #print(numikoru)
   	  
   	  if numplus == cost:
   	  	  num1 = 1
   	  elif numplus + numikoru == cost:
   	  	  num1 = 1
   	  if nummainsu == cost:
   	  	  num2 = 1
   	  elif nummainsu + numikoru == cost:
   	  	  num2 = 1
   	  print(num1, num2)
   
   
if __name__ == '__main__':
    main()
0