結果

問題 No.1649 Manhattan Square
ユーザー leaf_1415leaf_1415
提出日時 2021-08-13 23:12:25
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 540 ms / 3,000 ms
コード長 8,663 bytes
コンパイル時間 1,996 ms
コンパイル使用メモリ 112,732 KB
実行使用メモリ 26,992 KB
最終ジャッジ日時 2024-10-03 22:48:49
合計ジャッジ時間 21,963 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
9,344 KB
testcase_01 AC 6 ms
9,472 KB
testcase_02 AC 9 ms
9,728 KB
testcase_03 AC 10 ms
9,600 KB
testcase_04 AC 9 ms
9,728 KB
testcase_05 AC 9 ms
9,728 KB
testcase_06 AC 9 ms
9,728 KB
testcase_07 AC 494 ms
26,852 KB
testcase_08 AC 492 ms
26,824 KB
testcase_09 AC 511 ms
26,964 KB
testcase_10 AC 500 ms
26,712 KB
testcase_11 AC 519 ms
26,852 KB
testcase_12 AC 376 ms
21,556 KB
testcase_13 AC 414 ms
21,632 KB
testcase_14 AC 390 ms
21,908 KB
testcase_15 AC 406 ms
22,068 KB
testcase_16 AC 354 ms
20,680 KB
testcase_17 AC 366 ms
21,544 KB
testcase_18 AC 316 ms
20,328 KB
testcase_19 AC 377 ms
20,944 KB
testcase_20 AC 362 ms
20,692 KB
testcase_21 AC 433 ms
22,600 KB
testcase_22 AC 530 ms
26,864 KB
testcase_23 AC 526 ms
26,992 KB
testcase_24 AC 527 ms
26,864 KB
testcase_25 AC 517 ms
26,860 KB
testcase_26 AC 521 ms
26,864 KB
testcase_27 AC 522 ms
26,992 KB
testcase_28 AC 520 ms
26,864 KB
testcase_29 AC 507 ms
26,864 KB
testcase_30 AC 492 ms
26,868 KB
testcase_31 AC 500 ms
26,736 KB
testcase_32 AC 509 ms
26,736 KB
testcase_33 AC 513 ms
26,988 KB
testcase_34 AC 511 ms
26,868 KB
testcase_35 AC 535 ms
26,736 KB
testcase_36 AC 532 ms
26,992 KB
testcase_37 AC 539 ms
26,988 KB
testcase_38 AC 529 ms
26,864 KB
testcase_39 AC 540 ms
26,736 KB
testcase_40 AC 516 ms
26,864 KB
testcase_41 AC 537 ms
26,716 KB
testcase_42 AC 295 ms
23,668 KB
testcase_43 AC 5 ms
9,472 KB
testcase_44 AC 6 ms
9,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define inf 1e18
const double PI = 3.1415926535897932384626433;

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

//const ll mod = 1000000007;
const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
	bool operator <(const mint &ope){return x < ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

vector<mint> fact, fact_inv;
void make_fact(int n){
	fact.resize(n+1), fact_inv.resize(n+1);
	fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
	fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(ll n, ll k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(ll n, ll k){ return comb(n, k) * fact[k]; }

vector<int> prime, pvec;
void make_prime(int n){
	prime.resize(n+1);
	rep(i, 2, n){
		if(prime[i]) continue;
		for(int j = i; j <= n; j+=i) prime[j] = i;
	}
	rep(i, 2, n) if(prime[i] == i) pvec.push_back(i);
}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}

template<class S, class T> pair<S, T>& operator+=(pair<S,T> &s, const pair<S,T> &t){
	s.first += t.first, s.second += t.second;
	return s;
}
template<class S, class T> pair<S, T>& operator-=(pair<S,T> &s, const pair<S,T> &t){
	s.first -= t.first, s.second -= t.second;
	return s;
}
template<class S, class T> pair<S, T> operator+(const pair<S,T> &s, const pair<S,T> &t){
	return pair<S,T>(s.first+t.first, s.second+t.second);
}
template<class S, class T> pair<S, T> operator-(const pair<S,T> &s, const pair<S,T> &t){
	return pair<S,T>(s.first-t.first, s.second-t.second);
}
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++; if(itr != map_var.end()) os << ","; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
	for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t){for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}cout << endl;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}

struct BIT{
	typedef llint T;
	T Ident(){ return 0; }//単位元
	T ope(T a, T b){ return a+b; } //作用素
	
	int size;
	vector<T> bit;
	BIT(){size = 0;}
	BIT(int s){
		size = s;
		bit.resize(size+2);
		init();
	}
	void init(){
		for(int i = 1; i <= size+1; i++) bit[i] = Ident();
	}
	T query(int i){
		i++;
		T ret = 0;
		while(i > 0){
			ret = ope(ret, bit[i]);
			i -= i&(-i);
		}
		return ret;
	}
	T query(int l, int r){
		return query(r) - query(l-1);
	}
	void add(int i, T x){
		i++;
		while(i <= size+1){
			bit[i] = ope(bit[i], x);
			i += i&(-i);
		}
	}
};

ll n;
ll x[200005], y[200005];
vector<ll> vec[200005];
vector<ll> xcomp, ycomp;
BIT bit(200005);

mint calc(ll x[])
{
	mint ret = 0;
	rep(i, 1, n) ret += mint(x[i]*x[i]);
	ret *= mint(n-1);
	
	mint sum = 0;
	rep(i, 1, n){
		ret -= mint(2) * sum * mint(x[i]);
		sum += mint(x[i]);
	}
	return ret;
}

mint solve()
{
	vector<ll> xcomp, ycomp;
	rep(i, 1, n) xcomp.push_back(x[i]), ycomp.push_back(y[i]);
	
	sort(xcomp.begin(), xcomp.end());
	xcomp.erase(unique(xcomp.begin(), xcomp.end()), xcomp.end());
	sort(ycomp.begin(), ycomp.end());
	ycomp.erase(unique(ycomp.begin(), ycomp.end()), ycomp.end());
	
	ll w = xcomp.size(), h = ycomp.size();
	rep(i, 0, h-1) vec[i].clear();
	rep(i, 1, n){
		ll X = lower_bound(xcomp.begin(), xcomp.end(), x[i]) - xcomp.begin();
		ll Y = lower_bound(ycomp.begin(), ycomp.end(), y[i]) - ycomp.begin();
		vec[Y].push_back(X);
	}
	
	mint ret = 0;
	
	BIT bit(w), bit2(w); 
	rep(i, 0, h-1){
		sort(all(vec[i]));
		for(auto X : vec[i]){
			ll x = xcomp[X], y = ycomp[i];
			bit.add(X, 1), bit2.add(X, x);
			ret += mint(x*y) * mint(bit.query(X));
			ret -= mint(y) * mint(bit2.query(X));
		}
	}
	
	bit.init(), bit2.init();
	per(i, h-1, 0){
		reverse(all(vec[i]));
		for(auto X : vec[i]){
			ll x = xcomp[X], y = ycomp[i];
			bit.add(X, 1), bit2.add(X, x);
			ret += mint(x*y) * mint(bit.query(X, w));
			ret -= mint(y) * mint(bit2.query(X, w));
		}
	}
	
	return ret;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	rep(i, 1, n) cin >> x[i] >> y[i];
	
	mint ans = calc(x) + calc(y);
	
	ans += mint(2) * solve();
	rep(i, 1, n) x[i] *= -1, x[i] += 1000000000;
	ans += mint(2) * solve();
	
	outl(ans);
	
	return 0;
}
0