結果
問題 | No.1084 積の積 |
ユーザー | yuji9511 |
提出日時 | 2020-06-19 23:02:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 179 ms / 2,000 ms |
コード長 | 1,312 bytes |
コンパイル時間 | 256 ms |
コンパイル使用メモリ | 87,160 KB |
実行使用メモリ | 94,172 KB |
最終ジャッジ日時 | 2023-09-16 15:13:50 |
合計ジャッジ時間 | 5,084 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
73,760 KB |
testcase_01 | AC | 75 ms
73,728 KB |
testcase_02 | AC | 69 ms
73,636 KB |
testcase_03 | AC | 71 ms
73,772 KB |
testcase_04 | AC | 179 ms
91,624 KB |
testcase_05 | AC | 177 ms
93,356 KB |
testcase_06 | AC | 173 ms
93,016 KB |
testcase_07 | AC | 70 ms
73,520 KB |
testcase_08 | AC | 71 ms
73,928 KB |
testcase_09 | AC | 135 ms
94,008 KB |
testcase_10 | AC | 70 ms
73,600 KB |
testcase_11 | AC | 85 ms
79,252 KB |
testcase_12 | AC | 94 ms
84,204 KB |
testcase_13 | AC | 107 ms
91,920 KB |
testcase_14 | AC | 91 ms
82,036 KB |
testcase_15 | AC | 91 ms
81,840 KB |
testcase_16 | AC | 110 ms
94,172 KB |
testcase_17 | AC | 92 ms
83,444 KB |
testcase_18 | AC | 101 ms
88,600 KB |
testcase_19 | AC | 108 ms
92,148 KB |
testcase_20 | AC | 87 ms
80,148 KB |
testcase_21 | AC | 90 ms
81,916 KB |
testcase_22 | AC | 88 ms
80,724 KB |
testcase_23 | AC | 94 ms
86,280 KB |
testcase_24 | AC | 93 ms
85,368 KB |
testcase_25 | AC | 105 ms
92,024 KB |
testcase_26 | AC | 113 ms
92,288 KB |
testcase_27 | AC | 112 ms
92,168 KB |
testcase_28 | AC | 111 ms
92,148 KB |
testcase_29 | AC | 114 ms
92,076 KB |
testcase_30 | AC | 113 ms
92,232 KB |
testcase_31 | AC | 114 ms
92,172 KB |
ソースコード
N = int(input()) A = list(map(int, input().split())) # left_mul = [0] * 100010 # right_mul = [0] * 100010 # left_mul[0] = 1 # for i in range(N): # left_mul[i+1] = left_mul[i] * A[i] # right_mul[0] = 1 # for i in range(N): # right_mul[i+1] = right_mul[i] * A[N-1-i] l1 = 0 r1 = 1 cur = A[0] ps = [0] * 100010 for i in range(N): ps[i] = N-1 while l1 < N: if r1 == N: ps[l1] = r1-1 break if cur * A[r1] >= 1000000000: ps[l1] = r1-1 cur //= A[l1] l1 += 1 else: cur *= A[r1] r1 += 1 ans = 1 MOD = 1000000007 arr = [0] * 100010 val = [0] * 100010 for i in range(N): lv = ps[i] # rv = N # while rv - lv > 1: # mid = (rv + lv) // 2 # mul_v = mul_all // left_mul[i] // right_mul[N-1-mid] # if mul_v >= 1000000000: # rv = mid # else: # lv = mid length = lv - i + 1 val[i] += length arr[lv+2] += 1 # for j in range(i,lv+1): # ans *= pow(A[j], length,MOD) # ans %= MOD # length -= 1 for i in range(N+1): arr[i+1] += arr[i] n = 0 cur = 0 # print(val[:10]) # print(arr[:10]) for i in range(N): cur += val[i] cur -= n; cur += arr[i] # print(cur) ans *= pow(A[i], cur, MOD) ans %= MOD n += 1 print(ans)