結果
問題 | No.2651 [Cherry 6th Tune B] $\mathbb{C}$omplex комбинат |
ユーザー | 👑 chro_96 |
提出日時 | 2024-02-23 23:02:34 |
言語 | C (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 352 ms / 2,500 ms |
コード長 | 1,503 bytes |
コンパイル時間 | 289 ms |
コンパイル使用メモリ | 32,128 KB |
実行使用メモリ | 6,676 KB |
最終ジャッジ日時 | 2024-02-23 23:02:48 |
合計ジャッジ時間 | 13,385 ms |
ジャッジサーバーID (参考情報) |
judge16 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,676 KB |
testcase_01 | AC | 3 ms
6,676 KB |
testcase_02 | AC | 342 ms
6,676 KB |
testcase_03 | AC | 340 ms
6,676 KB |
testcase_04 | AC | 339 ms
6,676 KB |
testcase_05 | AC | 339 ms
6,676 KB |
testcase_06 | AC | 339 ms
6,676 KB |
testcase_07 | AC | 341 ms
6,676 KB |
testcase_08 | AC | 338 ms
6,676 KB |
testcase_09 | AC | 338 ms
6,676 KB |
testcase_10 | AC | 340 ms
6,676 KB |
testcase_11 | AC | 338 ms
6,676 KB |
testcase_12 | AC | 338 ms
6,676 KB |
testcase_13 | AC | 338 ms
6,676 KB |
testcase_14 | AC | 340 ms
6,676 KB |
testcase_15 | AC | 338 ms
6,676 KB |
testcase_16 | AC | 341 ms
6,676 KB |
testcase_17 | AC | 339 ms
6,676 KB |
testcase_18 | AC | 341 ms
6,676 KB |
testcase_19 | AC | 339 ms
6,676 KB |
testcase_20 | AC | 352 ms
6,676 KB |
testcase_21 | AC | 103 ms
6,676 KB |
testcase_22 | AC | 180 ms
6,676 KB |
testcase_23 | AC | 231 ms
6,676 KB |
testcase_24 | AC | 279 ms
6,676 KB |
testcase_25 | AC | 22 ms
6,676 KB |
testcase_26 | AC | 164 ms
6,676 KB |
testcase_27 | AC | 333 ms
6,676 KB |
testcase_28 | AC | 246 ms
6,676 KB |
testcase_29 | AC | 106 ms
6,676 KB |
testcase_30 | AC | 26 ms
6,676 KB |
testcase_31 | AC | 281 ms
6,676 KB |
testcase_32 | AC | 44 ms
6,676 KB |
testcase_33 | AC | 254 ms
6,676 KB |
testcase_34 | AC | 155 ms
6,676 KB |
testcase_35 | AC | 306 ms
6,676 KB |
testcase_36 | AC | 253 ms
6,676 KB |
testcase_37 | AC | 340 ms
6,676 KB |
testcase_38 | AC | 335 ms
6,676 KB |
ソースコード
#include <stdio.h> long long power_mod (long long a, long long b, long long mod_num) { long long ans = 1LL; if (b > 0LL) { ans = power_mod(a, b/2LL, mod_num); ans = (ans * ans) % mod_num; if (b%2LL == 1LL) { ans = (ans * (a % mod_num)) % mod_num; } } return ans; } int main () { int t = 0; int n = 0; long long x[300000] = {}; long long y[300000] = {}; int res = 0; long long mod_num = 998244353LL; res = scanf("%d", &t); while (t > 0) { long long ans = 0LL; long long acc[6] = {}; res = scanf("%d", &n); for (int i = 0; i < n; i++) { res = scanf("%lld", x+i); res = scanf("%lld", y+i); } for (int i = n-1; i >= 0; i--) { long long tmp[6] = {}; long long abs_sq = (x[i]*x[i]+y[i]*y[i])%mod_num; long long inv = power_mod(abs_sq, mod_num-2LL, mod_num); tmp[0] = inv; tmp[1] = abs_sq; tmp[2] = ((x[i]*x[i]+mod_num-(y[i]*y[i])%mod_num)*inv)%mod_num; tmp[3] = ((2LL*x[i]*y[i])*inv)%mod_num; tmp[4] = tmp[2]; tmp[5] = (mod_num-tmp[3])%mod_num; ans += (tmp[0]*acc[1])%mod_num; ans += (tmp[1]*acc[0])%mod_num; ans += mod_num-(tmp[2]*acc[4])%mod_num; ans += (tmp[3]*acc[5])%mod_num; ans += mod_num-(tmp[4]*acc[2])%mod_num; ans += (tmp[5]*acc[3])%mod_num; for (int j = 0; j < 6; j++) { acc[j] += tmp[j]; acc[j] %= mod_num; } } printf("%lld\n", ans%mod_num); t--; } return 0; }