結果
| 問題 | No.2651 [Cherry 6th Tune B] omplex комбинат |
| ユーザー |
👑  AngrySadEight
|
| 提出日時 | 2025-02-01 02:15:40 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 787 ms / 2,500 ms |
| コード長 | 4,319 bytes |
| コンパイル時間 | 1,873 ms |
| コンパイル使用メモリ | 127,444 KB |
| 実行使用メモリ | 7,960 KB |
| 最終ジャッジ日時 | 2025-02-01 02:16:06 |
| 合計ジャッジ時間 | 25,047 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 39 |
ソースコード
#include <algorithm>// #include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;// using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>// using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}ll my_pow(ll x, ll n, ll mod) {// 繰り返し二乗法．x^nをmodで割った余り．ll ret;if (n == 0) {ret = 1;} else if (n % 2 == 1) {ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;} else {ret = my_pow((x * x) % mod, n / 2, mod);}return ret;}ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }int main() {ll T;cin >> T;while (T--) {ll N;cin >> N;vector<ll> x(N);vector<ll> y(N);for (ll i = 0; i < N; i++) {cin >> x[i] >> y[i];x[i] = (x[i] + mod2) % mod2;y[i] = (y[i] + mod2) % mod2;}ll val1 = 0;for (ll i = 0; i < N; i++) {val1 += (x[i] * x[i] + y[i] * y[i]) % mod2;val1 %= mod2;}ll val2 = 0;for (ll i = 0; i < N; i++) {val2 += inv((x[i] * x[i] + y[i] * y[i]) % mod2, mod2);val2 %= mod2;}ll val3_re = 0;ll val3_im = 0;ll val4_re = 0;ll val4_im = 0;for (ll i = 0; i < N; i++) {ll xxyy_inv = inv((x[i] * x[i] + y[i] * y[i]) % mod2, mod2);val3_re +=(((x[i] * x[i]) % mod2 - (y[i] * y[i]) % mod2 + mod2) % mod2) *xxyy_inv;val3_re %= mod2;val3_im += ((2 * x[i] * y[i]) % mod2) * xxyy_inv;val3_im %= mod2;val4_im +=(mod2 - (((2 * x[i] * y[i]) % mod2) * xxyy_inv) % mod2) % mod2;val4_im %= mod2;}val4_re = val3_re;ll ans = (val1 * val2) % mod2;ans = (ans + mod2 -(val3_re * val4_re + mod2 - (val3_im * val4_im) % mod2) % mod2) %mod2;cout << ans << endl;}}