Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #include <ext/pb_ds/assoc_container.hpp>
- using namespace __gnu_pbds;
- using namespace std;
- #define ff first
- #define ss second
- #define int long long
- #define pb push_back
- #define mp make_pair
- #define pii pair<int,int>
- #define vi vector<int>
- #define mii map<int,int>
- #define pqb priority_queue<int>
- #define pqs priority_queue<int,vi,greater<int> >
- #define setbits(x) __builtin_popcountll(x)
- #define zrobits(x) __builtin_ctzll(x)
- #define mod 1000000007
- #define inf 1e18
- #define ps(x,y) fixed<<setprecision(y)<<x
- #define mk(arr,n,type) type *arr=new type[n];
- #define w(x) int x; cin>>x; while(x--)
- mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
- #define fastio ios_base::sync_with_stdio(0); cin.tie(0);
- int32_t main()
- {
- fastio;
- int r;cin>>r;
- for(int t=1;t<=r;t++)
- {
- int n,q,sx=0,sy=0,s2x=0,s2y=0,a,b,ans=0;cin>>n;
- for(int i=0;i<n;i++){
- cin>>a>>b;
- sx=(sx+a)%mod;sy=(sy+b)%mod;
- s2x=(s2x+((a*a)%mod) )%mod;s2y=(s2y+((b*b)%mod))%mod;
- }
- cin>>q;
- for(int i=0;i<q;i++){
- cin>>a>>b;
- ans = (ans + ((n*((a*a)%mod))%mod) + s2x -((2*((a*sx)%mod))%mod)+mod)%mod;
- ans = (ans + ((n*((b*b))%mod)%mod) + s2y -((2*((b*sy)%mod))%mod)+mod)%mod;
- }
- cout<<"Case #"<<t<<": "<<ans<<"\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment