結果
問題 | No.731 等差数列がだいすき |
ユーザー | simamumu |
提出日時 | 2018-09-07 22:56:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 152 ms / 1,500 ms |
コード長 | 1,454 bytes |
コンパイル時間 | 343 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 80,320 KB |
最終ジャッジ日時 | 2024-05-07 04:50:15 |
合計ジャッジ時間 | 4,342 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 145 ms
79,872 KB |
testcase_01 | AC | 152 ms
79,872 KB |
testcase_02 | AC | 139 ms
79,872 KB |
testcase_03 | AC | 140 ms
80,128 KB |
testcase_04 | AC | 139 ms
80,320 KB |
testcase_05 | AC | 138 ms
79,872 KB |
testcase_06 | AC | 141 ms
80,000 KB |
testcase_07 | AC | 141 ms
80,000 KB |
testcase_08 | AC | 141 ms
80,128 KB |
testcase_09 | AC | 143 ms
80,192 KB |
testcase_10 | AC | 142 ms
80,256 KB |
testcase_11 | AC | 144 ms
79,744 KB |
testcase_12 | AC | 142 ms
80,256 KB |
testcase_13 | AC | 143 ms
80,128 KB |
testcase_14 | AC | 143 ms
79,872 KB |
testcase_15 | AC | 147 ms
80,000 KB |
testcase_16 | AC | 144 ms
80,000 KB |
testcase_17 | AC | 144 ms
80,128 KB |
testcase_18 | AC | 144 ms
79,872 KB |
testcase_19 | AC | 147 ms
79,936 KB |
testcase_20 | AC | 142 ms
80,200 KB |
ソースコード
from collections import defaultdict,deque import sys,heapq,bisect,math,itertools,string,queue,datetime sys.setrecursionlimit(10**8) INF = float('inf') mod = 10**9+7 eps = 10**-7 def inpl(): return list(map(int, input().split())) def inpls(): return list(input().split()) N = int(input()) aa = inpl() SUMa = sum(aa) SUM2a = 0 SUMaa = 0 for i in range(N): SUM2a += aa[i]*(2*i) SUMaa += aa[i]**2 def calc(A,d): tmp = SUMaa - 2*SUMa*A - SUM2a*d tmp += A**2*N #A^2 tmp += (N-1)*N*A*d #2Ad tmp += (N-1)*N*(2*N-1)//6*d**2 #d^2 return tmp def calc_d(A): xx =[0]*4 xx[0] = -10**7 xx[3] = 10**7 xx[1] = (xx[0]*2 + xx[3]) /3 xx[2] = (xx[0] + xx[3]*2) /3 yy = [0]*4 for i in range(4): yy[i] = calc(A,xx[i]) for _ in range(300): if yy[1] < yy[2]: xx[3] = xx[2] xx[1] = (xx[0]*2 + xx[3]) /3 xx[2] = (xx[0] + xx[3]*2) /3 else: xx[0] = xx[1] xx[1] = (xx[0]*2 + xx[3]) /3 xx[2] = (xx[0] + xx[3]*2) /3 yy[1] = calc(A,xx[1]) yy[2] = calc(A,xx[2]) return yy[1],xx[1] xx =[0]*4 xx[0] = -10**10 xx[3] = 10**10 xx[1] = (xx[0]*2 + xx[3]) /3 xx[2] = (xx[0] + xx[3]*2) /3 yy = [0]*4 for i in range(4): yy[i],d = calc_d(xx[i]) by = yy[1] for _ in range(1000): if yy[1] < yy[2]: xx[3] = xx[2] xx[1] = (xx[0]*2 + xx[3]) /3 xx[2] = (xx[0] + xx[3]*2) /3 else: xx[0] = xx[1] xx[1] = (xx[0]*2 + xx[3]) /3 xx[2] = (xx[0] + xx[3]*2) /3 yy[1],d = calc_d(xx[1]) yy[2],d = calc_d(xx[2]) print(xx[1],d) print(yy[1])