#954655 (C++23) No.2651 [Cherry 6th Tune B] $\mathbb{C}$omplex комбинат

• 問題: No.2651 [Cherry 6th Tune B] $\mathbb{C}$omplex комбинат
• ユーザー: kokosei
• 提出日時: 2024-02-23 22:58:31
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 630 ms / 2,500 ms
• コード長: 1,839 bytes
• コンパイル時間: 3,042 ms
• コンパイル使用メモリ: 250,212 KB
• 実行使用メモリ: 6,016 KB
• 最終ジャッジ日時: 2024-09-29 08:15:06
• 合計ジャッジ時間: 23,538 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
other	AC * 39

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;
int N;
pair<mint, mint> Z[301010];
mint absc(pair<mint, mint> z){
    return z.first * z.first + z.second * z.second;
}
pair<mint, mint> neg(pair<mint, mint> z){
    return make_pair(z.first, -z.second);
}
pair<mint, mint> add(pair<mint, mint> a, pair<mint, mint> b){
    return make_pair(a.first + b.first, a.second + b.second);
}
pair<mint, mint> sub(pair<mint, mint> a, pair<mint, mint> b){
    return make_pair(a.first - b.first, a.second - b.second);
}
pair<mint, mint> mul(pair<mint, mint> a, pair<mint, mint> b){
    return make_pair(
        a.first * b.first - a.second * b.second,
        a.second * b.first + a.first * b.second
    );
}
pair<mint, mint> dev(pair<mint, mint> a, pair<mint, mint> b){
    return make_pair(
        (a.first * b.first + a.second * b.second) / absc(b),
        (a.second * b.first - a.first * b.second) / absc(b)
    );
}
void solve(){
    cin >> N;
    for(int i = 0;i < N;i++){
        int x, y; cin >> x >> y;
        Z[i].first = {x};
        Z[i].second = {y};
    }
    mint sabs = 0;
    pair<mint, mint> spos, sneg;
    pair<mint, mint> ans;
    for(int i = 0;i < N;i++){
        sabs += absc(Z[i]);
    }
    for(int i = 0;i < N;i++){
        spos = add(spos, dev(Z[i], neg(Z[i])));
        sneg = add(sneg, dev(neg(Z[i]), Z[i]));
        ans = add(ans, make_pair(sabs / absc(Z[i]), mint::raw(0)));
        ans = sub(ans, dev(spos, dev(Z[i], neg(Z[i]))));
        ans = sub(ans, dev(sneg, dev(neg(Z[i]), Z[i])));
        ans = add(ans, make_pair(mint::raw(1), mint::raw(0)));
    }
    cout << ans.first.val() << "\n";
}
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t; cin >> t;
    while(t--)solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX