結果

問題 No.2651 [Cherry 6th Tune B] $\mathbb{C}$omplex комбинат
ユーザー tokusakuraitokusakurai
提出日時 2024-02-23 22:03:16
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 119 ms / 2,500 ms
コード長 6,664 bytes
コンパイル時間 1,897 ms
コンパイル使用メモリ 207,588 KB
実行使用メモリ 10,240 KB
最終ジャッジ日時 2024-09-29 06:41:47
合計ジャッジ時間 7,336 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 105 ms
5,248 KB
testcase_03 AC 104 ms
5,248 KB
testcase_04 AC 106 ms
5,248 KB
testcase_05 AC 108 ms
5,528 KB
testcase_06 AC 109 ms
5,468 KB
testcase_07 AC 106 ms
5,248 KB
testcase_08 AC 106 ms
5,248 KB
testcase_09 AC 109 ms
5,248 KB
testcase_10 AC 107 ms
8,192 KB
testcase_11 AC 106 ms
6,240 KB
testcase_12 AC 104 ms
6,624 KB
testcase_13 AC 104 ms
7,264 KB
testcase_14 AC 105 ms
6,144 KB
testcase_15 AC 107 ms
5,984 KB
testcase_16 AC 108 ms
8,160 KB
testcase_17 AC 105 ms
6,144 KB
testcase_18 AC 107 ms
8,192 KB
testcase_19 AC 112 ms
9,600 KB
testcase_20 AC 119 ms
5,248 KB
testcase_21 AC 32 ms
5,376 KB
testcase_22 AC 55 ms
6,912 KB
testcase_23 AC 72 ms
8,064 KB
testcase_24 AC 88 ms
9,088 KB
testcase_25 AC 8 ms
5,248 KB
testcase_26 AC 53 ms
6,784 KB
testcase_27 AC 105 ms
10,112 KB
testcase_28 AC 77 ms
8,320 KB
testcase_29 AC 33 ms
5,376 KB
testcase_30 AC 9 ms
5,248 KB
testcase_31 AC 86 ms
9,088 KB
testcase_32 AC 14 ms
5,248 KB
testcase_33 AC 80 ms
8,448 KB
testcase_34 AC 50 ms
6,528 KB
testcase_35 AC 96 ms
9,600 KB
testcase_36 AC 95 ms
5,248 KB
testcase_37 AC 105 ms
10,112 KB
testcase_38 AC 101 ms
10,240 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

template <int mod>
struct Mod_Int {
    int x;

    Mod_Int() : x(0) {}

    Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    static int get_mod() { return mod; }

    Mod_Int &operator+=(const Mod_Int &p) {
        if ((x += p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator-=(const Mod_Int &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator*=(const Mod_Int &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    Mod_Int &operator/=(const Mod_Int &p) {
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator++() { return *this += Mod_Int(1); }

    Mod_Int operator++(int) {
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator--() { return *this -= Mod_Int(1); }

    Mod_Int operator--(int) {
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator-() const { return Mod_Int(-x); }

    Mod_Int operator+(const Mod_Int &p) const { return Mod_Int(*this) += p; }

    Mod_Int operator-(const Mod_Int &p) const { return Mod_Int(*this) -= p; }

    Mod_Int operator*(const Mod_Int &p) const { return Mod_Int(*this) *= p; }

    Mod_Int operator/(const Mod_Int &p) const { return Mod_Int(*this) /= p; }

    bool operator==(const Mod_Int &p) const { return x == p.x; }

    bool operator!=(const Mod_Int &p) const { return x != p.x; }

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod - 2);
    }

    Mod_Int pow(long long k) const {
        Mod_Int now = *this, ret = 1;
        for (; k > 0; k >>= 1, now *= now) {
            if (k & 1) ret *= now;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const Mod_Int &p) { return os << p.x; }

    friend istream &operator>>(istream &is, Mod_Int &p) {
        long long a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

void solve() {
    int N;
    cin >> N;

    vector<mint> x(N), y(N);
    rep(i, N) cin >> x[i] >> y[i];

    vector<mint> norm(N);
    rep(i, N) norm[i] = x[i] * x[i] + y[i] * y[i];
    vector<mint> inorm(N);
    rep(i, N) inorm[i] = mint(norm[i]).inverse();

    mint sum = accumulate(all(norm), mint(0));
    mint ans = 0;
    rep(i, N) ans += (sum - norm[i]) * inorm[i];

    vector<mint> X(N), Y(N);
    rep(i, N) {
        X[i] = x[i] * x[i] - y[i] * y[i];
        Y[i] = x[i] * y[i] * 2;
    }

    mint sx = 0;
    rep(i, N) sx += X[i] * inorm[i];
    mint sy = 0;
    rep(i, N) sy += Y[i] * inorm[i];

    rep(i, N) ans -= (sx - X[i] * inorm[i]) * X[i] * inorm[i];
    rep(i, N) ans -= (sy - Y[i] * inorm[i]) * Y[i] * inorm[i];

    cout << ans << '\n';
}

int main() {
    int T = 1;
    cin >> T;
    while (T--) solve();
}
0