Archery Tournament Gym - 101630A

​​http://codeforces.com/gym/101630/attachments​​

对于当前xi yi的查询 所有横坐标范围包括xi的圆靶不超过logn个 就是想不到 智障

线段树加vector暴力维护记好了

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
const int maxn=2e5+10;

struct node1
{
    ll x,y;
    int tp;
};

struct node2
{
    vector <int> pre;
};

node1 order[maxn];
node2 tree[8*maxn];
ll val[2*maxn];
int n,tot,ans;

ll getdis(ll x1,ll y1,ll x2,ll y2)
{
    return (x2-x1)*(x2-x1)+(y2-y1)*(y2-y1);
}

void solve(int val,int cur)
{
    int l,r,mid,p;
    l=0,r=tree[cur].pre.size()-1;
    while(l<=r){
        mid=(l+r)/2;
        if(tree[cur].pre[mid]<=val) l=mid+1,p=mid;
        else r=mid-1;
    }
    tree[cur].pre.erase(tree[cur].pre.begin()+p);
}

void update(int tp,int pl,int pr,int val,int l,int r,int cur)
{
    int m;
    if(pl<=l&&r<=pr){
        if(tp) tree[cur].pre.pb(val);
        else solve(val,cur);
        return;
    }
    m=(l+r)/2;
    if(pl<=m) update(tp,pl,pr,val,l,m,2*cur);
    if(pr>m) update(tp,pl,pr,val,m+1,r,2*cur+1);
}

void query(int tar,int val,int l,int r,int cur)
{
    int m,i,p;
    for(i=0;i<tree[cur].pre.size();i++){
        p=tree[cur].pre[i];
        if(getdis(order[p].x,order[p].y,order[val].x,order[val].y)<order[p].y*order[p].y) ans=p;
    }
    if(l==r) return;
    m=(l+r)/2;
    if(tar<=m) query(tar,val,l,m,2*cur);
    else query(tar,val,m+1,r,2*cur+1);
}

int main()
{
    int i,pl,pr;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d%lld%lld",&order[i].tp,&order[i].x,&order[i].y);
        if(order[i].tp==1) val[++tot]=order[i].x-order[i].y,val[++tot]=order[i].x+order[i].y;
        else val[++tot]=order[i].x;
    }
    sort(val+1,val+tot+1);
    tot=unique(val+1,val+tot+1)-val-1;
    for(i=1;i<=n;i++){
        if(order[i].tp==1){
            pl=lower_bound(val+1,val+tot+1,order[i].x-order[i].y)-val;
            pr=lower_bound(val+1,val+tot+1,order[i].x+order[i].y)-val;
            update(1,pl,pr,i,1,tot,1);
        }
        else{
            pl=lower_bound(val+1,val+tot+1,order[i].x)-val;
            ans=-1;
            query(pl,i,1,tot,1);
            printf("%d\n",ans);
            if(ans!=-1){
                pl=lower_bound(val+1,val+tot+1,order[ans].x-order[ans].y)-val;
                pr=lower_bound(val+1,val+tot+1,order[ans].x+order[ans].y)-val;
                update(0,pl,pr,ans,1,tot,1);
            }
        }
    }
    return 0;
}