oj.uz

Submission #354549

# Submission time Handle Problem Language Result Execution time Memory
354549 2021-01-22T04:05:02 Z IloveN Circle selection (APIO18_circle_selection) C++14
72 / 100
 3000 ms 395744 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(),vr.end()
#define vi vector<int>
#define vll vector<ll>
const int N=3e5+10;
const ll inf=1e9;
struct circle{int x,y,r,id;};

circle a[N];
int n;
pii X[N],Y[N];
int ans[N];

ll sqr(ll x) { return x*x;}

bool intersect(int i,int j)
{
    return sqr(a[i].x-a[j].x)+sqr(a[i].y-a[j].y)<=sqr(a[i].r+a[j].r);
}

struct segment_tree_2d
{
    vi pre[N*4],nex[N*4],pos_in[N],bit[N*4];
    vector<pii> val[N*4];
    pii arr[N];
    int len,lg[N*4];

    void add(int id,int pos,int len)
    {
        for (int i=pos;i<=len;i+=(i&-i)) --bit[id][i];
    }

    int get(int id,int x,int len)
    {
        int res=0,pos=0;
        for (int i=(1<<lg[id]);i;i>>=1)
            if ((pos | i)<=len && val[id][(pos | i) - 1].fi<=x) pos|=i,res+=bit[id][pos];
        return res;
    }

    int lw(int id,int x)
    {
        int sum=0,res=0,len=val[id].size();
        for (int i=(1<<lg[id]);i;i>>=1)
            if ((res | i)<=len && sum+bit[id][res | i]<=x) res|=i,sum+=bit[id][res];
        return res+1;
    }

    void build(int id,int l,int r)
    {
        if (l==r)
        {
            val[id].eb(arr[l]);
            bit[id].resize(2,1);
            pre[id].eb(-1);
            nex[id].eb(2);
            pos_in[l].eb(0);
            return;
        }
        int mid=(l+r)/2;
        build(id*2,l,mid);
        build(id*2+1,mid+1,r);
        val[id].resize(val[id*2].size()+val[id*2+1].size());
        merge(all(val[id*2]),all(val[id*2+1]),val[id].begin());
        int len=val[id].size();
        pre[id].resize(len);
        nex[id].resize(len);
        for (int i=0;i<len;i++) pre[id][i]=i-1,nex[id][i]=i+1,pos_in[val[id][i].se].eb(i);
        bit[id].resize(val[id].size()+1,0);
        for (int i=1;i<=len;i++) bit[id][i]=(i&-i);
        while (len>1) len>>=1,lg[id]++;
    }

    void input(pii ar[],int siz)
    {
        len=siz;
        for (int i=1;i<=len;i++) arr[i]=ar[i];
        for (int i=1;i<=len*4;i++) pos_in[i].reserve(20);
        build(1,1,len);
    }

    void update(int id,int l,int r,int v,int layer)
    {
        int pos=pos_in[v][layer];
        add(id,pos+1,val[id].size());
        if (pre[id][pos]>-1) nex[id][pre[id][pos]]=nex[id][pos];
        if (nex[id][pos]<(int)val[id].size()) pre[id][nex[id][pos]]=pre[id][pos];
        if (l==r) return;
        int mid=(l+r)/2;
        if (v<=mid) update(id*2,l,mid,v,layer-1);
        else update(id*2+1,mid+1,r,v,layer-1);
    }

    void searc(int id,int l,int r,int u,int v,int y1,int y2,int i)
    {
        if (l>v || r<u) return;
        if (u<=l && r<=v)
        {
            int pos=lw(id,get(id,y1-1,val[id].size()))-1;
            if (pos>=(int)val[id].size()) return;
            while (pos<(int)val[id].size() && val[id][pos].fi<=y2)
            {
                int x=val[id][pos].se;
                pos=nex[id][pos];
                if (intersect(i,X[x].se))
                {
                    ans[a[X[x].se].id]=a[i].id;
                    update(1,1,n,x,pos_in[x].size()-1);
                }
            }
            return;
        }
        int mid=(l+r)/2;
        searc(id*2,l,mid,u,v,y1,y2,i);
        searc(id*2+1,mid+1,r,u,v,y1,y2,i);
    }

    void find_pot(int u,int v,int y1,int y2,int i)
    {
        if (u<=v) searc(1,1,n,u,v,y1,y2,i);
    }
} seg;

void read()
{
    cin>>n;
    for (int i=1;i<=n;i++) cin>>a[i].x>>a[i].y>>a[i].r,a[i].id=i;
}

bool cmp(circle &obj1, circle &obj2) { return (obj1.r>obj2.r) || ((obj1.r==obj2.r) && (obj1.id<obj2.id));}


void process()
{
    sort(a+1,a+n+1,cmp);
    for (int i=1;i<=n;i++) X[i]=mp(a[i].x,i);
    sort(X+1,X+n+1);
    for (int i=1;i<=n;i++) Y[i]=mp(a[X[i].se].y,i);
    seg.input(Y,n);
    for (int i=1;i<=n;i++)
    if (ans[a[i].id]==0)
    {
        int x1=max(-inf,(ll)a[i].x-a[i].r*2),x2=min(inf,(ll)a[i].x+a[i].r*2);
        int y1=max(-inf,(ll)a[i].y-a[i].r*2),y2=min(inf,(ll)a[i].y+a[i].r*2);
        int u=lower_bound(X+1,X+n+1,mp(x1,0))-X;
        int v=upper_bound(X+1,X+n+1,mp(x2,n+2))-X-1;
        seg.find_pot(u,v,y1,y2,i);
    }
    for (int i=1;i<=n;i++) cout<<ans[i]<<" ";
}

int main()
{
    //freopen("ss.inp","r",stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    read();
    process();
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 122476 KB Output is correct
2 Correct 86 ms 122476 KB Output is correct
3 Correct 88 ms 122476 KB Output is correct
4 Correct 86 ms 122476 KB Output is correct
5 Correct 88 ms 122476 KB Output is correct
6 Correct 88 ms 122604 KB Output is correct
7 Correct 87 ms 122604 KB Output is correct
8 Correct 88 ms 122604 KB Output is correct
9 Correct 87 ms 122604 KB Output is correct
10 Correct 88 ms 122604 KB Output is correct
11 Correct 87 ms 122604 KB Output is correct
12 Correct 88 ms 122604 KB Output is correct
13 Correct 94 ms 122544 KB Output is correct
14 Correct 88 ms 122604 KB Output is correct
15 Correct 89 ms 122604 KB Output is correct
16 Correct 102 ms 123244 KB Output is correct
17 Correct 88 ms 123244 KB Output is correct
18 Correct 89 ms 123244 KB Output is correct
19 Correct 103 ms 126828 KB Output is correct
20 Correct 102 ms 126828 KB Output is correct
21 Correct 107 ms 126956 KB Output is correct
22 Correct 108 ms 126956 KB Output is correct
23 Correct 109 ms 126828 KB Output is correct
24 Correct 106 ms 126828 KB Output is correct
25 Correct 109 ms 126828 KB Output is correct
26 Correct 107 ms 126892 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1203 ms 394632 KB Output is correct
2 Correct 1285 ms 394580 KB Output is correct
3 Correct 1241 ms 394476 KB Output is correct
4 Correct 1253 ms 395420 KB Output is correct
5 Correct 1390 ms 395324 KB Output is correct
6 Correct 1734 ms 395528 KB Output is correct
7 Correct 1337 ms 395744 KB Output is correct
8 Correct 1418 ms 395500 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 122476 KB Output is correct
2 Correct 935 ms 213856 KB Output is correct
3 Execution timed out 3032 ms 395500 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2908 ms 395372 KB Output is correct
2 Correct 2653 ms 395500 KB Output is correct
3 Correct 1949 ms 394964 KB Output is correct
4 Correct 2742 ms 395164 KB Output is correct
5 Correct 2700 ms 395244 KB Output is correct
6 Correct 1806 ms 394580 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 122476 KB Output is correct
2 Correct 86 ms 122476 KB Output is correct
3 Correct 88 ms 122476 KB Output is correct
4 Correct 86 ms 122476 KB Output is correct
5 Correct 88 ms 122476 KB Output is correct
6 Correct 88 ms 122604 KB Output is correct
7 Correct 87 ms 122604 KB Output is correct
8 Correct 88 ms 122604 KB Output is correct
9 Correct 87 ms 122604 KB Output is correct
10 Correct 88 ms 122604 KB Output is correct
11 Correct 87 ms 122604 KB Output is correct
12 Correct 88 ms 122604 KB Output is correct
13 Correct 94 ms 122544 KB Output is correct
14 Correct 88 ms 122604 KB Output is correct
15 Correct 89 ms 122604 KB Output is correct
16 Correct 102 ms 123244 KB Output is correct
17 Correct 88 ms 123244 KB Output is correct
18 Correct 89 ms 123244 KB Output is correct
19 Correct 103 ms 126828 KB Output is correct
20 Correct 102 ms 126828 KB Output is correct
21 Correct 107 ms 126956 KB Output is correct
22 Correct 108 ms 126956 KB Output is correct
23 Correct 109 ms 126828 KB Output is correct
24 Correct 106 ms 126828 KB Output is correct
25 Correct 109 ms 126828 KB Output is correct
26 Correct 107 ms 126892 KB Output is correct
27 Correct 127 ms 131564 KB Output is correct
28 Correct 132 ms 131692 KB Output is correct
29 Correct 124 ms 131564 KB Output is correct
30 Correct 139 ms 131564 KB Output is correct
31 Correct 136 ms 131692 KB Output is correct
32 Correct 132 ms 131564 KB Output is correct
33 Correct 649 ms 213612 KB Output is correct
34 Correct 642 ms 213612 KB Output is correct
35 Correct 645 ms 213612 KB Output is correct
36 Correct 879 ms 213612 KB Output is correct
37 Correct 886 ms 213612 KB Output is correct
38 Correct 887 ms 213584 KB Output is correct
39 Correct 905 ms 213784 KB Output is correct
40 Correct 890 ms 213508 KB Output is correct
41 Correct 886 ms 213484 KB Output is correct
42 Correct 737 ms 213356 KB Output is correct
43 Correct 770 ms 213612 KB Output is correct
44 Correct 768 ms 213728 KB Output is correct
45 Correct 776 ms 213484 KB Output is correct
46 Correct 779 ms 213568 KB Output is correct
47 Correct 783 ms 213540 KB Output is correct
48 Correct 772 ms 213612 KB Output is correct
49 Correct 774 ms 213612 KB Output is correct
50 Correct 763 ms 213484 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 122476 KB Output is correct
2 Correct 86 ms 122476 KB Output is correct
3 Correct 88 ms 122476 KB Output is correct
4 Correct 86 ms 122476 KB Output is correct
5 Correct 88 ms 122476 KB Output is correct
6 Correct 88 ms 122604 KB Output is correct
7 Correct 87 ms 122604 KB Output is correct
8 Correct 88 ms 122604 KB Output is correct
9 Correct 87 ms 122604 KB Output is correct
10 Correct 88 ms 122604 KB Output is correct
11 Correct 87 ms 122604 KB Output is correct
12 Correct 88 ms 122604 KB Output is correct
13 Correct 94 ms 122544 KB Output is correct
14 Correct 88 ms 122604 KB Output is correct
15 Correct 89 ms 122604 KB Output is correct
16 Correct 102 ms 123244 KB Output is correct
17 Correct 88 ms 123244 KB Output is correct
18 Correct 89 ms 123244 KB Output is correct
19 Correct 103 ms 126828 KB Output is correct
20 Correct 102 ms 126828 KB Output is correct
21 Correct 107 ms 126956 KB Output is correct
22 Correct 108 ms 126956 KB Output is correct
23 Correct 109 ms 126828 KB Output is correct
24 Correct 106 ms 126828 KB Output is correct
25 Correct 109 ms 126828 KB Output is correct
26 Correct 107 ms 126892 KB Output is correct
27 Correct 1203 ms 394632 KB Output is correct
28 Correct 1285 ms 394580 KB Output is correct
29 Correct 1241 ms 394476 KB Output is correct
30 Correct 1253 ms 395420 KB Output is correct
31 Correct 1390 ms 395324 KB Output is correct
32 Correct 1734 ms 395528 KB Output is correct
33 Correct 1337 ms 395744 KB Output is correct
34 Correct 1418 ms 395500 KB Output is correct
35 Correct 86 ms 122476 KB Output is correct
36 Correct 935 ms 213856 KB Output is correct
37 Execution timed out 3032 ms 395500 KB Time limit exceeded
38 Halted 0 ms 0 KB -