結果
問題 | No.1385 Simple Geometry 2 |
ユーザー | mkawa2 |
提出日時 | 2022-09-06 01:12:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 454 ms / 500 ms |
コード長 | 1,266 bytes |
コンパイル時間 | 562 ms |
コンパイル使用メモリ | 86,616 KB |
実行使用メモリ | 259,988 KB |
最終ジャッジ日時 | 2023-09-09 07:35:18 |
合計ジャッジ時間 | 29,898 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 84 ms
71,540 KB |
testcase_01 | AC | 82 ms
71,468 KB |
testcase_02 | AC | 78 ms
71,620 KB |
testcase_03 | AC | 86 ms
71,852 KB |
testcase_04 | AC | 77 ms
71,756 KB |
testcase_05 | AC | 76 ms
72,028 KB |
testcase_06 | AC | 80 ms
71,648 KB |
testcase_07 | AC | 78 ms
71,656 KB |
testcase_08 | AC | 99 ms
77,384 KB |
testcase_09 | AC | 96 ms
77,312 KB |
testcase_10 | AC | 91 ms
77,404 KB |
testcase_11 | AC | 92 ms
76,992 KB |
testcase_12 | AC | 95 ms
77,564 KB |
testcase_13 | AC | 454 ms
257,708 KB |
testcase_14 | AC | 411 ms
259,008 KB |
testcase_15 | AC | 366 ms
258,944 KB |
testcase_16 | AC | 362 ms
259,352 KB |
testcase_17 | AC | 360 ms
258,744 KB |
testcase_18 | AC | 367 ms
258,116 KB |
testcase_19 | AC | 356 ms
257,884 KB |
testcase_20 | AC | 364 ms
258,180 KB |
testcase_21 | AC | 365 ms
258,924 KB |
testcase_22 | AC | 357 ms
255,264 KB |
testcase_23 | AC | 363 ms
258,208 KB |
testcase_24 | AC | 356 ms
255,132 KB |
testcase_25 | AC | 351 ms
254,884 KB |
testcase_26 | AC | 362 ms
259,516 KB |
testcase_27 | AC | 358 ms
259,576 KB |
testcase_28 | AC | 353 ms
258,248 KB |
testcase_29 | AC | 363 ms
258,500 KB |
testcase_30 | AC | 367 ms
259,144 KB |
testcase_31 | AC | 350 ms
258,848 KB |
testcase_32 | AC | 360 ms
257,844 KB |
testcase_33 | AC | 343 ms
258,064 KB |
testcase_34 | AC | 345 ms
257,796 KB |
testcase_35 | AC | 349 ms
258,640 KB |
testcase_36 | AC | 342 ms
258,364 KB |
testcase_37 | AC | 348 ms
259,140 KB |
testcase_38 | AC | 352 ms
258,452 KB |
testcase_39 | AC | 342 ms
258,592 KB |
testcase_40 | AC | 345 ms
257,980 KB |
testcase_41 | AC | 344 ms
258,108 KB |
testcase_42 | AC | 339 ms
258,096 KB |
testcase_43 | AC | 343 ms
258,936 KB |
testcase_44 | AC | 348 ms
259,180 KB |
testcase_45 | AC | 341 ms
257,832 KB |
testcase_46 | AC | 348 ms
259,232 KB |
testcase_47 | AC | 351 ms
259,988 KB |
testcase_48 | AC | 347 ms
259,452 KB |
testcase_49 | AC | 346 ms
258,780 KB |
testcase_50 | AC | 349 ms
259,856 KB |
testcase_51 | AC | 338 ms
257,972 KB |
testcase_52 | AC | 344 ms
258,708 KB |
testcase_53 | AC | 344 ms
259,100 KB |
testcase_54 | AC | 341 ms
258,296 KB |
testcase_55 | AC | 345 ms
258,708 KB |
testcase_56 | AC | 345 ms
258,220 KB |
testcase_57 | AC | 339 ms
258,436 KB |
testcase_58 | AC | 340 ms
259,588 KB |
testcase_59 | AC | 336 ms
255,864 KB |
testcase_60 | AC | 336 ms
258,756 KB |
testcase_61 | AC | 345 ms
257,484 KB |
testcase_62 | AC | 335 ms
258,292 KB |
testcase_63 | AC | 347 ms
259,628 KB |
testcase_64 | AC | 352 ms
258,064 KB |
testcase_65 | AC | 340 ms
258,724 KB |
testcase_66 | AC | 337 ms
258,392 KB |
testcase_67 | AC | 341 ms
258,032 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 from math import * n, l = LI() tt = LI() ss, cc = [], [] for t in tt: ss.append(sin(2*pi*t/l)) cc.append(cos(2*pi*t/l)) ss *= 2 cc *= 2 # pDB(ss, cc) rs = [0] for s in ss: rs.append(rs[-1]+s) rc = [0] for c in cc: rc.append(rc[-1]+c) k = -n+2 s = c = 0 for i in range(n-1): s += ss[i]*k c += cc[i]*k k += 2 ans = 0 for i in range(n, n+n): s += (ss[i-n]+ss[i-1])*(n-2)-2*(rs[i-1]-rs[i-n+1]) c += (cc[i-n]+cc[i-1])*(n-2)-2*(rc[i-1]-rc[i-n+1]) ans += ss[i]*c-cc[i]*s ans = ans/n/(n-1)/(n-2)*3/2 print(ans)