結果
問題 | No.1649 Manhattan Square |
ユーザー | kwm_t |
提出日時 | 2021-08-14 00:13:31 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 480 ms / 3,000 ms |
コード長 | 2,501 bytes |
コンパイル時間 | 4,865 ms |
コンパイル使用メモリ | 243,672 KB |
実行使用メモリ | 27,992 KB |
最終ジャッジ日時 | 2024-04-14 21:35:19 |
合計ジャッジ時間 | 21,215 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 3 ms
6,812 KB |
testcase_02 | AC | 6 ms
6,812 KB |
testcase_03 | AC | 6 ms
6,944 KB |
testcase_04 | AC | 6 ms
6,944 KB |
testcase_05 | AC | 7 ms
6,944 KB |
testcase_06 | AC | 7 ms
6,940 KB |
testcase_07 | AC | 480 ms
27,652 KB |
testcase_08 | AC | 428 ms
27,864 KB |
testcase_09 | AC | 425 ms
27,752 KB |
testcase_10 | AC | 425 ms
27,616 KB |
testcase_11 | AC | 425 ms
27,748 KB |
testcase_12 | AC | 271 ms
12,780 KB |
testcase_13 | AC | 345 ms
18,948 KB |
testcase_14 | AC | 306 ms
16,632 KB |
testcase_15 | AC | 331 ms
17,516 KB |
testcase_16 | AC | 251 ms
12,028 KB |
testcase_17 | AC | 258 ms
12,240 KB |
testcase_18 | AC | 236 ms
10,128 KB |
testcase_19 | AC | 316 ms
16,928 KB |
testcase_20 | AC | 277 ms
13,004 KB |
testcase_21 | AC | 351 ms
19,016 KB |
testcase_22 | AC | 414 ms
27,808 KB |
testcase_23 | AC | 419 ms
27,916 KB |
testcase_24 | AC | 415 ms
27,992 KB |
testcase_25 | AC | 406 ms
27,900 KB |
testcase_26 | AC | 413 ms
27,900 KB |
testcase_27 | AC | 409 ms
27,864 KB |
testcase_28 | AC | 417 ms
27,836 KB |
testcase_29 | AC | 420 ms
27,840 KB |
testcase_30 | AC | 422 ms
27,812 KB |
testcase_31 | AC | 421 ms
27,824 KB |
testcase_32 | AC | 414 ms
27,892 KB |
testcase_33 | AC | 410 ms
27,768 KB |
testcase_34 | AC | 402 ms
27,872 KB |
testcase_35 | AC | 402 ms
27,884 KB |
testcase_36 | AC | 415 ms
27,812 KB |
testcase_37 | AC | 419 ms
27,808 KB |
testcase_38 | AC | 411 ms
27,704 KB |
testcase_39 | AC | 406 ms
27,704 KB |
testcase_40 | AC | 417 ms
27,980 KB |
testcase_41 | AC | 409 ms
27,804 KB |
testcase_42 | AC | 233 ms
27,804 KB |
testcase_43 | AC | 2 ms
6,944 KB |
testcase_44 | AC | 2 ms
6,940 KB |
ソースコード
#include "bits/stdc++.h" #include "atcoder/all" using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; //const bool debug = false; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair<long long,long long> template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } struct ele { mint c, x, y, xy; ele(mint _c, mint _x, mint _y, mint _xy) :c(_c), x(_x), y(_y), xy(_xy) {} }; ele op(ele a, ele b) { ele c(a.c + b.c, a.x + b.x, a.y + b.y, a.xy + b.xy); return c; } ele e() { ele c(0, 0, 0, 0); return c; } map<int, int> Compless(const vector<int> &v) { vector<int>vv = v; sort(all(vv)); vv.erase(unique(all(vv)), vv.end()); map<int, int>mp; rep(i, vv.size()) { mp[vv[i]] = i; } return mp; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<P>xy(n); rep(i, n)cin >> xy[i].first >> xy[i].second; mint sumx = 0, sumy = 0; rep(i, n) { sumx += xy[i].first; sumy += xy[i].second; } mint ans = 0; rep(i, n) { ans += xy[i].first * xy[i].first; ans += xy[i].second * xy[i].second; } ans *= n; ans -= sumx * sumx + sumy * sumy; //kokokara sort(all(xy)); vector<int>copyy(n); rep(i, n)copyy[i] = xy[i].second; auto mp = Compless(copyy); int sz = mp.size(); segtree<ele, op, e>seg(sz); mint anssub = 0; rep(i, n) { int idx = mp[xy[i].second]; { //r ele now = seg.prod(idx, sz); anssub -= now.c*xy[i].first * xy[i].second; anssub -= now.xy; anssub += now.y * xy[i].first; anssub += now.x * xy[i].second; } { //l ele now = seg.prod(0, idx); anssub += now.c*xy[i].first * xy[i].second; anssub += now.xy; anssub -= now.y * xy[i].first; anssub -= now.x * xy[i].second; } { ele bef = seg.get(idx); ele aft(bef.c + 1, bef.x + xy[i].first, bef.y + xy[i].second, bef.xy + xy[i].first * xy[i].second); seg.set(idx, aft); } } ans += anssub * 2; cout << ans.val() << endl; return 0; }