結果
問題 | No.2651 [Cherry 6th Tune B] $\mathbb{C}$omplex комбинат |
ユーザー | apricity |
提出日時 | 2024-02-23 22:40:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 164 ms / 2,500 ms |
コード長 | 4,678 bytes |
コンパイル時間 | 2,707 ms |
コンパイル使用メモリ | 138,232 KB |
実行使用メモリ | 12,672 KB |
最終ジャッジ日時 | 2024-02-23 22:40:27 |
合計ジャッジ時間 | 9,497 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge16 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 4 ms
6,676 KB |
testcase_02 | AC | 139 ms
6,676 KB |
testcase_03 | AC | 138 ms
6,676 KB |
testcase_04 | AC | 150 ms
6,676 KB |
testcase_05 | AC | 150 ms
6,676 KB |
testcase_06 | AC | 148 ms
6,676 KB |
testcase_07 | AC | 144 ms
6,676 KB |
testcase_08 | AC | 147 ms
6,676 KB |
testcase_09 | AC | 148 ms
6,676 KB |
testcase_10 | AC | 152 ms
9,856 KB |
testcase_11 | AC | 149 ms
7,260 KB |
testcase_12 | AC | 151 ms
7,772 KB |
testcase_13 | AC | 152 ms
8,796 KB |
testcase_14 | AC | 149 ms
7,424 KB |
testcase_15 | AC | 151 ms
7,132 KB |
testcase_16 | AC | 151 ms
9,948 KB |
testcase_17 | AC | 149 ms
7,424 KB |
testcase_18 | AC | 154 ms
9,984 KB |
testcase_19 | AC | 164 ms
11,776 KB |
testcase_20 | AC | 142 ms
6,676 KB |
testcase_21 | AC | 46 ms
6,676 KB |
testcase_22 | AC | 82 ms
8,320 KB |
testcase_23 | AC | 104 ms
9,728 KB |
testcase_24 | AC | 127 ms
11,136 KB |
testcase_25 | AC | 9 ms
6,676 KB |
testcase_26 | AC | 76 ms
7,936 KB |
testcase_27 | AC | 157 ms
12,544 KB |
testcase_28 | AC | 112 ms
10,240 KB |
testcase_29 | AC | 48 ms
6,676 KB |
testcase_30 | AC | 12 ms
6,676 KB |
testcase_31 | AC | 128 ms
11,136 KB |
testcase_32 | AC | 19 ms
6,676 KB |
testcase_33 | AC | 116 ms
10,368 KB |
testcase_34 | AC | 71 ms
7,552 KB |
testcase_35 | AC | 159 ms
11,776 KB |
testcase_36 | AC | 113 ms
6,676 KB |
testcase_37 | AC | 160 ms
12,672 KB |
testcase_38 | AC | 152 ms
12,672 KB |
ソースコード
#include<iostream> #include<string> #include<vector> #include<algorithm> #include<numeric> #include<cmath> #include<utility> #include<tuple> #include<cstdint> #include<cstdio> #include<iomanip> #include<map> #include<queue> #include<set> #include<stack> #include<deque> #include<unordered_map> #include<unordered_set> #include<bitset> #include<cctype> #include<chrono> #include<random> #include<cassert> #include<cstddef> #include<iterator> #include<string_view> #include<type_traits> #ifdef LOCAL # include "debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast<void>(0)) #endif using namespace std; #define rep1(a) for(int i = 0; i < a; i++) #define rep2(i, a) for(int i = 0; i < a; i++) #define rep3(i, a, b) for(int i = a; i < b; i++) #define rep4(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(a) for(int i = (a)-1; i >= 0; i--) #define rrep2(i, a) for(int i = (a)-1; i >= 0; i--) #define rrep3(i, a, b) for(int i = (b)-1; i >= a; i--) #define rrep4(i, a, b, c) for(int i = (b)-1; i >= a; i -= c) #define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define pb push_back using ll = long long; using D = double; using LD = long double; using P = pair<int, int>; using vi = vector<int>; using vl = vector<ll>; template <class T> using vc = vector<T>; template <class T> using vvc = vector<vc<T>>; template <class T> using vvvc = vector<vvc<T>>; template <class T> using vvvvc = vector<vvvc<T>>; template <class T> using vvvvvc = vector<vvvvc<T>>; #define vv(type, name, h, ...) \ vector<vector<type>> name(h, vector<type>(__VA_ARGS__)) #define vvv(type, name, h, w, ...) \ vector<vector<vector<type>>> name( \ h, vector<vector<type>>(w, vector<type>(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector<vector<vector<vector<type>>>> name( \ a, vector<vector<vector<type>>>( \ b, vector<vector<type>>(c, vector<type>(__VA_ARGS__)))) template<typename T> using PQ = priority_queue<T,vector<T>>; template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>; template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";} template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; } template<typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p) { is >> p.first >> p.second; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } void in() {} template<typename T, class... U> void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template<typename T, class... U, char sep = ' '> void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } void outr() {} template<typename T, class... U, char sep = ' '> void outr(const T &t, const U &...u) { cout << t; outr(u...); } #include "atcoder/modint.hpp" #include "atcoder/fenwicktree.hpp" using mint = atcoder::modint998244353; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int tc; in(tc); while(tc--){ int n; in(n); vi x(n),y(n); rep(i,n) in(x[i],y[i]); vc<mint> r2(n), r2i(n); rep(i,n) r2[i] = (x[i]*x[i] + y[i]*y[i]); rep(i,n) r2i[i] = (mint)1/r2[i]; atcoder::fenwick_tree<mint> f1(n),f2(n),f3_r(n),f3_i(n); mint ans = 0; rep(i,n){ ans += f1.sum(0,i) * r2[i]; f1.add(i,r2i[i]); } rep(i,n){ ans += f2.sum(0,i) * r2i[i]; f2.add(i,r2[i]); } rep(i,n){ mint c = mint(x[i]*x[i]-y[i]*y[i])*r2i[i]; mint d = mint(2*x[i]*y[i])*r2i[i]; mint a = f3_r.sum(0,i); mint b = f3_i.sum(0,i); ans -= 2*(a*c+b*d); f3_r.add(i, c); f3_i.add(i, d); } out(ans.val()); } }