結果
| 問題 |
No.1649 Manhattan Square
|
| コンテスト | |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2021-08-13 23:01:07 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 294 ms / 3,000 ms |
| コード長 | 6,679 bytes |
| コンパイル時間 | 2,818 ms |
| コンパイル使用メモリ | 216,916 KB |
| 最終ジャッジ日時 | 2025-01-23 20:51:36 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 43 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#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>;
//const int MOD = 1000000007;
const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
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;};
struct io_setup{
io_setup(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
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) {}
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>;
template<typename T>
struct Binary_Indexed_Tree{
vector<T> bit;
const int n;
Binary_Indexed_Tree(const vector<T> &v) : n((int)v.size()){
bit.resize(n+1);
copy(begin(v), end(v), begin(bit)+1);
for(int a = 2; a <= n; a <<= 1){
for(int b = a; b <= n; b += a){
bit[b] += bit[b-a/2];
}
}
}
Binary_Indexed_Tree(int n, const T &x) : n(n){
bit.resize(n+1);
vector<T> v(n, x);
copy(begin(v), end(v), begin(bit)+1);
for(int a = 2; a <= n; a <<= 1){
for(int b = a; b <= n; b += a){
bit[b] += bit[b-a/2];
}
}
}
void add(int i, const T &x){
for(i++; i <= n; i += (i & -i)) bit[i] += x;
}
void change(int i, const T&x){
add(i, x-query(i, i+1));
}
T sum(int i) const{
T ret = 0;
for(; i > 0; i -= (i & -i)) ret += bit[i];
return ret;
}
T query(int l, int r) const{
return sum(r) - sum(l);
}
T operator [] (int i) const {return query(i, i+1);}
int lower_bound(T x) const{
int ret = 0;
for(int k = 31-__builtin_clz(n); k >= 0; k--){
if(ret+(1<<k) <= n && bit[ret+(1<<k)] < x) x -= bit[ret += (1<<k)];
}
return ret;
}
int upper_bound(T x) const{
int ret = 0;
for(int k = 31-__builtin_clz(n); k >= 0; k--){
if(ret+(1<<k) <= n && bit[ret+(1<<k)] <= x) x -= bit[ret += (1<<k)];
}
return ret;
}
};
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' : ' ');
}
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 unique(vector<T> &v){
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template<typename T>
vector<int> iota(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;
}
int main(){
int N; cin >> N;
vector<pll> p(N);
rep(i, N) cin >> p[i].first >> p[i].second;
sort(all(p));
mint x1 = 0, x2 = 0, y1 = 0, y2 = 0;
vector<ll> xs, ys;
rep(i, N){
auto [x, y] = p[i];
x1 += x, x2 += x*x, y1 += y, y2 += y*y;
xs.eb(x), ys.eb(y);
}
//cout << x1 << ' ' << x2 << ' ' << y1 << ' ' << y2 << '\n';
mint ans = x2*N-x1*x1+y2*N-y1*y1;
//cout << ans << '\n';
unique(xs), unique(ys);
int n = sz(ys);
//each(e, ys) cout << e << ' '; cout << '\n';
vector<mint> s1(n, 0), s2(n, 0), s3(n, 0), s4(n, 0);
rep(i, N){
auto [x, y] = p[i];
int j = lb(ys, y);
s1[j] += x, s2[j] += y, s3[j] += x*y, s4[j]++;
}
Binary_Indexed_Tree<mint> b1(s1), b2(s2), b3(s3), b4(s4);
rep(i, N){
auto [x, y] = p[i];
int j = lb(ys, y);
ans -= (b1.query(j, n)*y + b2.query(j, n)*x)*2;
ans += (b3.query(j, n) + b4.query(j, n)*mint(x*y))*2;
ans += (b1.query(0, j)*y + b2.query(0, j)*x)*2;
ans -= (b3.query(0, j) + b4.query(0, j)*mint(x*y))*2;
b1.add(j, -x), b2.add(j, -y), b3.add(j, -mint(x*y)), b4.add(j, -1);
}
cout << ans << '\n';
}