CF76.E. Points (贡献 思维)

原题链接

题意：

给定$n$个点，求所有点对之间距离的平方和。

思路：

考虑每一个点的贡献，现在有两个点对$u,v$，距离的平方和为$(x[u]-x[v]{)}^2+(y[u]-y[v{]}^2)$。
单独看$x$，$x[u{]}^2+x[v{]}^2-2\ast x[u]\ast x[v]$；
对于$u$来说，贡献是$x[u{]}^2-2\ast x[u]\ast x[v]$
一共有$n-1$个$(u,t)$类型的点对，所以$x[u{]}^2$会出现$n-1$次。
由于$2\ast x[u]\ast x[v]$也算是$v$的贡献，为了避免重复，每次都只计算$t>u$时的贡献。
$y$同理。维护两个前缀和就好了

代码：

// Problem: E. Points
// Contest: Codeforces - All-Ukrainian School Olympiad in Informatics
// URL: https://codeforces.com/contest/76/problem/E
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>PLL;
typedef pair<int, int>PII;
typedef pair<double, double>PDD;
#define I_int ll
inline ll read(){ll x = 0, f = 1;char ch = getchar();while(ch < '0' || ch > '9'){if(ch == '-')f = -1;ch = getchar();}while(ch >= '0' && ch <= '9'){x = x * 10 + ch - '0';ch = getchar();}return x * f;}

inline void write(ll x){if (x < 0) x = ~x + 1, putchar('-');if (x > 9) write(x / 10);putchar(x % 10 + '0');}

#define read read()
#define closeSync ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define multiCase int T;cin>>T;for(int t=1;t<=T;t++)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define repp(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define perr(i,a,b) for(int i=(a);i>(b);i--)

ll ksm(ll a, ll b,ll mod){ll res = 1;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}


const int maxn=1e6+7;

ll sumx[maxn],sumy[maxn];
PLL p[maxn];

int main(){
	int n=read;
	rep(i,1,n){
		p[i].first=read,p[i].second=read;
		sumx[i]=sumx[i-1]+p[i].first;
		sumy[i]=sumy[i-1]+p[i].second;
	}
	ll ans=0;
	rep(i,1,n){
		ans=ans+(n-1)*p[i].first*p[i].first-2*p[i].first*(sumx[n]-sumx[i]);
		ans=ans+(n-1)*p[i].second*p[i].second-2*p[i].second*(sumy[n]-sumy[i]);
	}
	write(ans);
	return 0;
}