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

• 問題: No.2651 [Cherry 6th Tune B] $\mathbb{C}$omplex комбинат
• ユーザー: Kude
• 提出日時: 2024-02-23 22:15:47
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 128 ms / 2,500 ms
• コード長: 1,507 bytes
• コンパイル時間: 4,725 ms
• コンパイル使用メモリ: 272,548 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-02-23 22:16:11
• 合計ジャッジ時間: 8,687 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	118 ms; 6,676 KB
testcase_03	AC	118 ms; 6,676 KB
testcase_04	AC	118 ms; 6,676 KB
testcase_05	AC	120 ms; 6,676 KB
testcase_06	AC	118 ms; 6,676 KB
testcase_07	AC	118 ms; 6,676 KB
testcase_08	AC	120 ms; 6,676 KB
testcase_09	AC	117 ms; 6,676 KB
testcase_10	AC	118 ms; 6,676 KB
testcase_11	AC	119 ms; 6,676 KB
testcase_12	AC	117 ms; 6,676 KB
testcase_13	AC	118 ms; 6,676 KB
testcase_14	AC	118 ms; 6,676 KB
testcase_15	AC	119 ms; 6,676 KB
testcase_16	AC	120 ms; 6,676 KB
testcase_17	AC	118 ms; 6,676 KB
testcase_18	AC	124 ms; 6,676 KB
testcase_19	AC	120 ms; 6,676 KB
testcase_20	AC	128 ms; 6,676 KB
testcase_21	AC	37 ms; 6,676 KB
testcase_22	AC	63 ms; 6,676 KB
testcase_23	AC	83 ms; 6,676 KB
testcase_24	AC	100 ms; 6,676 KB
testcase_25	AC	8 ms; 6,676 KB
testcase_26	AC	60 ms; 6,676 KB
testcase_27	AC	115 ms; 6,676 KB
testcase_28	AC	86 ms; 6,676 KB
testcase_29	AC	37 ms; 6,676 KB
testcase_30	AC	10 ms; 6,676 KB
testcase_31	AC	98 ms; 6,676 KB
testcase_32	AC	16 ms; 6,676 KB
testcase_33	AC	89 ms; 6,676 KB
testcase_34	AC	54 ms; 6,676 KB
testcase_35	AC	110 ms; 6,676 KB
testcase_36	AC	93 ms; 6,676 KB
testcase_37	AC	119 ms; 6,676 KB
testcase_38	AC	109 ms; 6,676 KB

ソースコード

#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    mint ans;
    mint c1, cx4, cy4, cxy, cxy2, cx2, cy2;
    rep(i, n) {
      int xi, yi;
      cin >> xi >> yi;
      mint x = xi, y = yi;
      mint x2 = x * x, y2 = y * y;
      mint x4 = x2 * x2, y4 = y2 * y2;
      mint inv = (x2 + y2).inv();
      ans += (c1 + cx4 * x4 + cy4 * y4 + cy2 * y2 + cxy2 * x2 * y2 + cxy * x * y + cx2 * x2) * inv;
      c1 += (x4 + 2 * x2 * y2 + y4) * inv;
      cx2 += (-2 * x2 + 2 * y2) * inv;
      cxy += (-8 * x * y) * inv;
      cxy2 += (2) * inv;
      cy2 += (2 * x2 - 2 * y2) * inv;
      cx4 += (1) * inv;
      cy4 += (1) * inv;
    }
    cout << ans.val() << '\n';
  }
}