84C - Biathlon - CodeForces Solution

#include<bits/stdc++.h>

using namespace std;

const int N = 10010, D = 20000;
int n, m, x, y, z, c[N], r[N], s[N];

vector<int> v[N<<2+1];

int main(){
    cin>>n;
    for (int i=1;i<=n; i++)
    {
        cin>>c[i]>>r[i];
        c[i]+=D;
        for(int j=c[i]-r[i];j<=c[i]+r[i];j++) v[j].push_back(i);
    }
    
    fill(s+1,s+n+1,-1);
    
    cin >> m;
    for (int i=1;i<=m;i++){
        cin >> x >> y;
        x+=D;
        for (auto j:v[x]) 
        if(s[j]==-1)
        if (y*y+(x-c[j])*(x-c[j])<=r[j]*r[j]) s[j] = i,z++;
    }
    cout << z << endl;
    
    for (int i=1;i<=n;i++) cout<<s[i]<<" ";
}