oj.uz

Submission #318509

# Submission time Handle Problem Language Result Execution time Memory
318509 2020-11-02T07:42:47 Z IloveN Circle selection (APIO18_circle_selection) C++14
49 / 100
 3000 ms 352340 KB 
#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;

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

    void build(int id,int l,int r)
    {
        if (l==r)
        {
            val[id].eb(arr[l]);
            it[id].resize(5,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());
        pre[id].resize(val[id].size());
        nex[id].resize(val[id].size());
        for (int i=0;i<(int)val[id].size();i++) pre[id][i]=i-1,nex[id][i]=i+1,pos_in[val[id][i].se].eb(i);
        it[id].resize(val[id].size()*4+1,1);
    }

    void input(pii ar[],int siz)
    {
        len=siz;
        for (int i=1;i<=len;i++) arr[i]=ar[i];
        build(1,1,len);
    }

    void update_sub(int sub,int id,int l,int r,int v)
    {
        if (l==r)
        {
            it[sub][id]=0;
            return;
        }
        int mid=(l+r)/2;
        if (v<=mid) update_sub(sub,id*2,l,mid,v);
        else update_sub(sub,id*2+1,mid+1,r,v);
        it[sub][id]=(it[sub][id*2] | it[sub][id*2+1]);
    }

    void update(int id,int l,int r,int v,int layer)
    {
        int pos=pos_in[v][layer];
        update_sub(id,1,1,val[id].size(),pos+1);
        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);
    }

    int lw_sub(int sub,int id,int l,int r,int v)
    {
        if (r<v || !it[sub][id]) return 0;
        if (l==r) return l;
        int mid=(l+r)/2;
        int res=lw_sub(sub,id*2,l,mid,v);
        if (res) return res;
        return lw_sub(sub,id*2+1,mid+1,r,v);
    }

    vi pot;

    void searc(int id,int l,int r,int u,int v,int y1,int y2)
    {
        if (l>v || r<u) return;
        if (u<=l && r<=v)
        {
            int pos=lower_bound(all(val[id]),mp(y1,0))-val[id].begin()+1;
            pos=lw_sub(id,1,1,val[id].size(),pos)-1;
            if (pos<0) return;
            while (pos<(int)val[id].size() && val[id][pos].fi<=y2)
            {
                pot.eb(val[id][pos].se);
                pos=nex[id][pos];
            }
            return;
        }
        int mid=(l+r)/2;
        searc(id*2,l,mid,u,v,y1,y2);
        searc(id*2+1,mid+1,r,u,v,y1,y2);
    }

    vi find_pot(int u,int v,int y1,int y2)
    {
        pot.clear();
        if (u<=v) searc(1,1,n,u,v,y1,y2);
        return pot;
    }

    void del(vi &vt)
    {
        for (int x : vt) update(1,1,n,x,pos_in[x].size()-1);
    }
} 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));}
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);
}

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;
        vi vt=seg.find_pot(u,v,y1,y2);
        vi vt2;
        for (int x : vt)
            if (intersect(i,X[x].se)) ans[a[X[x].se].id]=a[i].id,vt2.eb(x);
        seg.del(vt2);
    }
    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 83 ms 122468 KB Output is correct
2 Correct 82 ms 122512 KB Output is correct
3 Correct 82 ms 122468 KB Output is correct
4 Correct 83 ms 122468 KB Output is correct
5 Correct 82 ms 122472 KB Output is correct
6 Correct 84 ms 122584 KB Output is correct
7 Correct 82 ms 122596 KB Output is correct
8 Correct 84 ms 122468 KB Output is correct
9 Correct 85 ms 122468 KB Output is correct
10 Correct 85 ms 122468 KB Output is correct
11 Correct 84 ms 122468 KB Output is correct
12 Correct 85 ms 122468 KB Output is correct
13 Correct 83 ms 122468 KB Output is correct
14 Correct 82 ms 122580 KB Output is correct
15 Correct 86 ms 122468 KB Output is correct
16 Correct 88 ms 123108 KB Output is correct
17 Correct 86 ms 123108 KB Output is correct
18 Correct 89 ms 123236 KB Output is correct
19 Correct 104 ms 125540 KB Output is correct
20 Correct 103 ms 125540 KB Output is correct
21 Correct 104 ms 125572 KB Output is correct
22 Correct 107 ms 125412 KB Output is correct
23 Correct 109 ms 125428 KB Output is correct
24 Correct 106 ms 125412 KB Output is correct
25 Correct 106 ms 125540 KB Output is correct
26 Correct 107 ms 125384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1834 ms 352244 KB Output is correct
2 Correct 1850 ms 350716 KB Output is correct
3 Correct 1847 ms 351444 KB Output is correct
4 Correct 1840 ms 352340 KB Output is correct
5 Correct 1919 ms 348008 KB Output is correct
6 Correct 2568 ms 347940 KB Output is correct
7 Correct 1996 ms 347620 KB Output is correct
8 Correct 2116 ms 347620 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 122600 KB Output is correct
2 Correct 1273 ms 196412 KB Output is correct
3 Execution timed out 3061 ms 346756 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3108 ms 345956 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 122468 KB Output is correct
2 Correct 82 ms 122512 KB Output is correct
3 Correct 82 ms 122468 KB Output is correct
4 Correct 83 ms 122468 KB Output is correct
5 Correct 82 ms 122472 KB Output is correct
6 Correct 84 ms 122584 KB Output is correct
7 Correct 82 ms 122596 KB Output is correct
8 Correct 84 ms 122468 KB Output is correct
9 Correct 85 ms 122468 KB Output is correct
10 Correct 85 ms 122468 KB Output is correct
11 Correct 84 ms 122468 KB Output is correct
12 Correct 85 ms 122468 KB Output is correct
13 Correct 83 ms 122468 KB Output is correct
14 Correct 82 ms 122580 KB Output is correct
15 Correct 86 ms 122468 KB Output is correct
16 Correct 88 ms 123108 KB Output is correct
17 Correct 86 ms 123108 KB Output is correct
18 Correct 89 ms 123236 KB Output is correct
19 Correct 104 ms 125540 KB Output is correct
20 Correct 103 ms 125540 KB Output is correct
21 Correct 104 ms 125572 KB Output is correct
22 Correct 107 ms 125412 KB Output is correct
23 Correct 109 ms 125428 KB Output is correct
24 Correct 106 ms 125412 KB Output is correct
25 Correct 106 ms 125540 KB Output is correct
26 Correct 107 ms 125384 KB Output is correct
27 Correct 128 ms 128740 KB Output is correct
28 Correct 130 ms 128740 KB Output is correct
29 Correct 132 ms 128740 KB Output is correct
30 Correct 150 ms 128484 KB Output is correct
31 Correct 142 ms 128488 KB Output is correct
32 Correct 142 ms 128484 KB Output is correct
33 Correct 826 ms 197596 KB Output is correct
34 Correct 835 ms 197724 KB Output is correct
35 Correct 849 ms 197468 KB Output is correct
36 Correct 1192 ms 196068 KB Output is correct
37 Correct 1189 ms 196348 KB Output is correct
38 Correct 1212 ms 196324 KB Output is correct
39 Correct 1220 ms 195544 KB Output is correct
40 Correct 1231 ms 195412 KB Output is correct
41 Correct 1219 ms 195412 KB Output is correct
42 Correct 997 ms 195044 KB Output is correct
43 Correct 1012 ms 196068 KB Output is correct
44 Correct 1012 ms 195940 KB Output is correct
45 Correct 1014 ms 195940 KB Output is correct
46 Correct 1012 ms 195940 KB Output is correct
47 Correct 1022 ms 195940 KB Output is correct
48 Correct 1014 ms 195940 KB Output is correct
49 Correct 1014 ms 196068 KB Output is correct
50 Correct 1022 ms 195944 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 122468 KB Output is correct
2 Correct 82 ms 122512 KB Output is correct
3 Correct 82 ms 122468 KB Output is correct
4 Correct 83 ms 122468 KB Output is correct
5 Correct 82 ms 122472 KB Output is correct
6 Correct 84 ms 122584 KB Output is correct
7 Correct 82 ms 122596 KB Output is correct
8 Correct 84 ms 122468 KB Output is correct
9 Correct 85 ms 122468 KB Output is correct
10 Correct 85 ms 122468 KB Output is correct
11 Correct 84 ms 122468 KB Output is correct
12 Correct 85 ms 122468 KB Output is correct
13 Correct 83 ms 122468 KB Output is correct
14 Correct 82 ms 122580 KB Output is correct
15 Correct 86 ms 122468 KB Output is correct
16 Correct 88 ms 123108 KB Output is correct
17 Correct 86 ms 123108 KB Output is correct
18 Correct 89 ms 123236 KB Output is correct
19 Correct 104 ms 125540 KB Output is correct
20 Correct 103 ms 125540 KB Output is correct
21 Correct 104 ms 125572 KB Output is correct
22 Correct 107 ms 125412 KB Output is correct
23 Correct 109 ms 125428 KB Output is correct
24 Correct 106 ms 125412 KB Output is correct
25 Correct 106 ms 125540 KB Output is correct
26 Correct 107 ms 125384 KB Output is correct
27 Correct 1834 ms 352244 KB Output is correct
28 Correct 1850 ms 350716 KB Output is correct
29 Correct 1847 ms 351444 KB Output is correct
30 Correct 1840 ms 352340 KB Output is correct
31 Correct 1919 ms 348008 KB Output is correct
32 Correct 2568 ms 347940 KB Output is correct
33 Correct 1996 ms 347620 KB Output is correct
34 Correct 2116 ms 347620 KB Output is correct
35 Correct 83 ms 122600 KB Output is correct
36 Correct 1273 ms 196412 KB Output is correct
37 Execution timed out 3061 ms 346756 KB Time limit exceeded
38 Halted 0 ms 0 KB -