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

• 問題: No.2651 [Cherry 6th Tune B] $\mathbb{C}$omplex комбинат
• ユーザー: shobonvip
• 提出日時: 2024-02-23 22:17:06
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 127 ms / 2,500 ms
• コード長: 2,349 bytes
• コンパイル時間: 4,061 ms
• コンパイル使用メモリ: 254,176 KB
• 最終ジャッジ日時: 2025-02-19 20:05:36
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include<bits/stdc++.h>
using namespace std;
//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/
/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/
typedef long long ll;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
template <typename T> bool chmin(T &a, const T &b) {
    if (a <= b) return false;
    a = b;
    return true;
}
template <typename T> bool chmax(T &a, const T &b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T> T max(vector<T> &a){
    assert(!a.empty());
    T ret = a[0];
    for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
    return ret;
}
template <typename T> T min(vector<T> &a){
    assert(!a.empty());
    T ret = a[0];
    for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
    return ret;
}
template <typename T> T sum(vector<T> &a){
    T ret = 0;
    for (int i=0; i<(int)a.size(); i++) ret += a[i];
    return ret;
}
void solve(){
    int n; cin >> n;
    vector<ll> x(n), y(n);
    rep(i,0,n) cin >> x[i] >> y[i];
    vector<mint> norm(n);
    vector<mint> invnorm(n);
    rep(i,0,n){
        norm[i] = (mint(x[i] * x[i]) + mint(y[i] * y[i]));
        invnorm[i] = norm[i].inv();
    }
    mint ans = 0;
    // RED
    {
        mint sminv = sum(invnorm);
        rep(i,0,n){
            ans += (sminv - invnorm[i]) * mint(x[i] * y[i]) * mint(x[i] * y[i]) * invnorm[i] * 4;
        }
    }
    // BLUE
    {
        mint sminv = sum(invnorm);
        rep(i,0,n){
            mint k1 = mint(x[i]) * mint(x[i]) * mint(x[i]) * mint(x[i]);
            mint k2 = mint(y[i]) * mint(y[i]) * mint(y[i]) * mint(y[i]);
            ans += (sminv - invnorm[i]) * (k1 + k2) * invnorm[i] * 2;
        }
    }
    // GREEN
    {
        mint tmp = 0;
        rep(i,0,n){
            tmp += invnorm[i] * (mint(y[i]) * mint(y[i]) - mint(x[i]) * mint(x[i]));
        }
        rep(i,0,n){
            ans += (tmp - invnorm[i] * (mint(y[i]) * mint(y[i]) - mint(x[i]) * mint(x[i])))
                     * (mint(x[i]) * mint(x[i]) - mint(y[i]) * mint(y[i])) * invnorm[i] * 2;
        }
    }
    // YELLOW
    {
        vector<mint> tmp(n);
        rep(i,0,n){
            tmp[i] = invnorm[i] * mint(x[i]) * mint(y[i]);
        }
        mint tmpsum = sum(tmp);
        rep(i,0,n){
            ans -= tmp[i] * 8 * (tmpsum - tmp[i]);
        }
    }
    ans /= 2;
    
    cout << ans.val() << '\n';
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int t; cin >> t;
    while(t--) solve();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX