Codeforces Round 1009 (Div. 3)D代码

#include<bits/stdc++.h>
using namespace std;
#define ft first
#define sd second
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<bool> veb;
typedef vector<ll> vel;
typedef vector<vel> vevel;
typedef vector<vevel> vevevel;
typedef vector<vevevel> vevevevel;
typedef vector<pll> velp;
typedef vector<velp> vevelp;
typedef vector<pair<pll,ll>> velpp;
typedef vector<pair<bool,bool>> velb;
typedef set<velp> svelp;
typedef set<pll> spll;
typedef vector<char> vec;
typedef map<ll,ll,greater<>> mll;
typedef map<pll,ll> mplll;
typedef map<ll,pll> mlpll;
typedef map<ll,velp> mlvelp;
typedef map<char,ll> mcl;
typedef map<ll,char> mlc;
typedef map<ll,bool> mlb;
typedef map<ll,svelp> mlsvelp;
typedef map<ll,spll,greater<>> mlspll;
typedef map<char,char> mcc;
typedef vector<pair<char,char>> vecp;
typedef priority_queue<ll> pql;
typedef vector<pql> vpql;
typedef vector<queue<ll>> vql;
typedef vector<veb> veveb;
typedef vector<veveb> veveveb;
typedef vector<set<ll>> vsl;
typedef string sig;
const ll N=1e9+1e5;
ll n,sum,m,sum2;
struct po{
    ll x,r;
};
void slv(){
    cin>>n>>m;
    vector<po> v(n+3);
    mll mp;
    for(int i=1;i<=n;i++){
        ll x;
        cin>>x;
        v[i].x=x;
    }
    for(int i=1;i<=n;i++){
        ll r;
        cin>>r;
        v[i].r=r;
    }
    for(ll i=1;i<=n;i++){
        for(ll j=v[i].x-v[i].r;j<=v[i].x+v[i].r;j++){//循环每一次
            ll x=2*(ll)sqrt(v[i].r*v[i].r-(v[i].x-j)*(v[i].x-j));//求y
            mp[j]=max(mp[j],x+1);//max一下
        }
    }
    sum=0;
    for(auto i:mp)sum+=i.sd;//输出总量
    cout<<sum<<"\n";
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll T = 1;
    cin>>T;
    while(T--){
        slv();
    }
}
//2 4
//10 1 1
//11 2 1
//12 2 1
//13 2 1