oj.uz

답안 #272751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
272751 2020-08-18T15:04:47 Z MKopchev 원 고르기 (APIO18_circle_selection) C++14
87 / 100
 3000 ms 373508 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=3e5+42,inf=1e9+42,MX=(1<<20)+42;

struct circle
{
    int x,y,r,id;
};

int n;
circle inp[nmax],sorted_inp[nmax],other_sorted[nmax];

bool touch(circle a,circle b)
{
    long long d=1LL*(a.x-b.x)*(a.x-b.x)+1LL*(a.y-b.y)*(a.y-b.y);

    long long mx=a.r+b.r;

    mx=mx*mx;

    return d<=mx;
}

bool cmp(circle a,circle b)
{
    if(a.r!=b.r)return a.r>b.r;
    return a.id<b.id;
}

bool cmp_y(circle a,circle b)
{
    if(a.y!=b.y)return a.y<b.y;
    return a.id<b.id;
}
int outp[nmax];

vector< pair<int/*y*/,int/*id*/> > nodes[MX];
vector<int> prv[MX];
vector<int> nxt[MX];
vector<int> fenwick[MX];

void update(int node,int l,int r,int pos,circle cur)
{
    //cout<<node<<" -> "<<cur.y<<" "<<cur.id<<endl;
    nodes[node].push_back({cur.y,cur.id});

    if(l==r)return;

    int av=(l+r)/2;

    if(pos<=av)update(node*2,l,av,pos,cur);
    else update(node*2+1,av+1,r,pos,cur);
}

int SZ[nmax];

void upd(int where,int j,int val)
{
    j++;

    while(j<=SZ[nodes[where].size()])
    {
        fenwick[where][j]+=val;
        j=j+(j&(-j));
    }
}
void build(int where)
{
    for(int i=0;i<=SZ[nodes[where].size()];i++)fenwick[where].push_back(0);

    //cout<<where<<" -> "<<fenwick[where].size()<<endl;

    for(int i=0;i<nodes[where].size();i++)
    {
        upd(where,i,1);
    }

    //for(int i=1;i<=nodes[where].size();i++)cout<<fenwick[where][i]<<" ";cout<<endl;
}
void sub_tree(int where,int pos)
{
    upd(where,pos,-1);
}

int query(int where,int pos)
{
    pos++;

    int ret=0;

    while(pos)
    {
        ret=ret+fenwick[where][pos];
        pos=pos-(pos&(-pos));
    }
    return ret;
}

int bits[nmax];

int find_first(int where,int start)
{
    int sum=query(where,start-1);

    //cout<<"find_first "<<where<<" "<<start<<" "<<sum<<endl;

    if(sum==fenwick[where][SZ[nodes[where].size()]])return -1;

    int pos=0;

    for(int j=bits[nodes[where].size()]-1;j>=0;j--)
        if(fenwick[where][pos+(1<<j)]<=sum)
        {
            sum=sum-fenwick[where][pos+(1<<j)];
            pos=pos+(1<<j);
        }

    //cout<<"pos= "<<pos<<endl;

    return pos;
}

int pick(int a,int b)
{
    long long sum=a;
    sum=sum+b;

    if(inf<sum)sum=inf;
    if(-inf>sum)sum=-inf;

    return sum;
}

void match(int node,int l,int r,int lq,int rq,circle cur)
{
    if(fenwick[node].size()==0)return;

    if(fenwick[node][SZ[nodes[node].size()]]==0)return;

    if(l==lq&&r==rq)
    {
        int y1=pick(cur.y,-2*cur.r);
        int y2=pick(cur.y,2*cur.r);

        int start=lower_bound(nodes[node].begin(),nodes[node].end(),make_pair(y1,0))-nodes[node].begin();

        if(start==nodes[node].size())return;

        start=find_first(node,start);
        /*
        cout<<"circle "<<l<<" "<<r<<" "<<cur.id<<endl;

        for(auto k:nodes[node])
            cout<<k.first<<" "<<k.second<<"\t";cout<<endl;

        cout<<"y1= "<<y1<<" y2= "<<y2<<" start= "<<start<<endl;
        */
        if(start==-1)return;

        vector<int> to_pop={};

        while(start<nodes[node].size()&&nodes[node][start].first<=y2)
        {
            //cout<<"start= "<<start<<" "<<nodes[node][start].second<<" "<<inp[nodes[node][start].second].x<<" "<<inp[nodes[node][start].second].y<<" "<<inp[nodes[node][start].second].r<<endl;

            if(outp[nodes[node][start].second]==0&&touch(inp[nodes[node][start].second],cur))
            {
                //cout<<"touch "<<nodes[node][start].second<<" "<<cur.id<<" "<<endl;

                outp[nodes[node][start].second]=cur.id;
            }

            if(outp[nodes[node][start].second])to_pop.push_back(start);

            start=nxt[node][start];
        }

        for(auto k:to_pop)
        {
            if(0<=prv[node][k])
            {
                nxt[node][prv[node][k]]=nxt[node][k];
            }
            if(nxt[node][k]<nodes[node].size())
            {
                prv[node][nxt[node][k]]=prv[node][k];
            }

            sub_tree(node,k);
        }

        return;
    }

    int av=(l+r)/2;

    if(lq<=av)match(node*2,l,av,lq,min(av,rq),cur);
    if(av<rq)match(node*2+1,av+1,r,max(av+1,lq),rq,cur);
}

int help_x[nmax];

void push(int which)
{
    outp[sorted_inp[which].id]=sorted_inp[which].id;

    int x1=pick(sorted_inp[which].x,-2*sorted_inp[which].r);
    int x2=pick(sorted_inp[which].x,+2*sorted_inp[which].r);

    int le=lower_bound(help_x+1,help_x+n+1,x1)-help_x;
    int ri=upper_bound(help_x+1,help_x+n+1,x2)-help_x;
    ri--;

    //cout<<"le= "<<le<<" ri= "<<ri<<endl;

    if(le>ri)return;

    match(1,1,n,le,ri,sorted_inp[which]);
}
signed main()
{
    scanf("%i",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%i%i%i",&inp[i].x,&inp[i].y,&inp[i].r);
        inp[i].id=i;
    }

    for(int i=1;i<=n;i++)sorted_inp[i]=inp[i],other_sorted[i]=inp[i];

    sort(other_sorted+1,other_sorted+n+1,cmp_y);

    sort(sorted_inp+1,sorted_inp+n+1,cmp);

    for(int i=1;i<=n;i++)help_x[i]=sorted_inp[i].x;

    sort(help_x+1,help_x+n+1);

    for(int i=1;i<=n;i++)
    {
        int pos=lower_bound(help_x+1,help_x+n+1,other_sorted[i].x)-help_x;

        update(1,1,n,pos,other_sorted[i]);
    }

    int st=0;
    for(int i=1;i<=n;i++)
    {
        if((1<<st)<i)st++;

        SZ[i]=1<<st;

        bits[i]=st;

        //cout<<i<<" -> "<<SZ[i]<<" "<<bits[i]<<endl;
    }
    for(int i=1;i<MX;i++)
        if(nodes[i].size())
        {
            for(int j=0;j<nodes[i].size();j++)
            {
                prv[i].push_back(j-1);
                nxt[i].push_back(j+1);
            }
            build(i);
        }

    for(int i=1;i<=n;i++)
        if(outp[sorted_inp[i].id]==0)
            push(i);

    for(int i=1;i<=n;i++)printf("%i ",outp[i]);printf("\n");
    return 0;
}

Compilation message

circle_selection.cpp: In function 'void build(int)':
circle_selection.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(int i=0;i<nodes[where].size();i++)
      |                 ~^~~~~~~~~~~~~~~~~~~~
circle_selection.cpp: In function 'void match(int, int, int, int, int, circle)':
circle_selection.cpp:147:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |         if(start==nodes[node].size())return;
      |            ~~~~~^~~~~~~~~~~~~~~~~~~~
circle_selection.cpp:162:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  162 |         while(start<nodes[node].size()&&nodes[node][start].first<=y2)
      |               ~~~~~^~~~~~~~~~~~~~~~~~~
circle_selection.cpp:184:28: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  184 |             if(nxt[node][k]<nodes[node].size())
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:260:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  260 |             for(int j=0;j<nodes[i].size();j++)
      |                         ~^~~~~~~~~~~~~~~~
circle_selection.cpp:272:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  272 |     for(int i=1;i<=n;i++)printf("%i ",outp[i]);printf("\n");
      |     ^~~
circle_selection.cpp:272:48: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  272 |     for(int i=1;i<=n;i++)printf("%i ",outp[i]);printf("\n");
      |                                                ^~~~~~
circle_selection.cpp:222:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  222 |     scanf("%i",&n);
      |     ~~~~~^~~~~~~~~
circle_selection.cpp:225:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  225 |         scanf("%i%i%i",&inp[i].x,&inp[i].y,&inp[i].r);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 98944 KB Output is correct
2 Correct 68 ms 98808 KB Output is correct
3 Correct 66 ms 98808 KB Output is correct
4 Correct 66 ms 98808 KB Output is correct
5 Correct 66 ms 98808 KB Output is correct
6 Correct 67 ms 98936 KB Output is correct
7 Correct 66 ms 98936 KB Output is correct
8 Correct 66 ms 98936 KB Output is correct
9 Correct 67 ms 98936 KB Output is correct
10 Correct 66 ms 98936 KB Output is correct
11 Correct 68 ms 98936 KB Output is correct
12 Correct 69 ms 98936 KB Output is correct
13 Correct 67 ms 98936 KB Output is correct
14 Correct 68 ms 98936 KB Output is correct
15 Correct 67 ms 98936 KB Output is correct
16 Correct 77 ms 99324 KB Output is correct
17 Correct 69 ms 99448 KB Output is correct
18 Correct 88 ms 99448 KB Output is correct
19 Correct 92 ms 102520 KB Output is correct
20 Correct 95 ms 102648 KB Output is correct
21 Correct 85 ms 102520 KB Output is correct
22 Correct 85 ms 102520 KB Output is correct
23 Correct 86 ms 102520 KB Output is correct
24 Correct 85 ms 102620 KB Output is correct
25 Correct 84 ms 102404 KB Output is correct
26 Correct 85 ms 102520 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1593 ms 369292 KB Output is correct
2 Correct 1554 ms 369872 KB Output is correct
3 Correct 1523 ms 370036 KB Output is correct
4 Correct 1502 ms 368976 KB Output is correct
5 Correct 1508 ms 351200 KB Output is correct
6 Correct 1775 ms 365856 KB Output is correct
7 Correct 1595 ms 363852 KB Output is correct
8 Correct 1623 ms 365008 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 98808 KB Output is correct
2 Correct 776 ms 174296 KB Output is correct
3 Correct 2657 ms 369612 KB Output is correct
4 Correct 2598 ms 371196 KB Output is correct
5 Correct 2387 ms 363648 KB Output is correct
6 Correct 1071 ms 233768 KB Output is correct
7 Correct 518 ms 166244 KB Output is correct
8 Correct 134 ms 112436 KB Output is correct
9 Correct 2429 ms 367508 KB Output is correct
10 Correct 2363 ms 370024 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2529 ms 371020 KB Output is correct
2 Correct 2275 ms 368456 KB Output is correct
3 Correct 1736 ms 370040 KB Output is correct
4 Correct 2166 ms 369488 KB Output is correct
5 Correct 2192 ms 369340 KB Output is correct
6 Correct 1622 ms 369360 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 98944 KB Output is correct
2 Correct 68 ms 98808 KB Output is correct
3 Correct 66 ms 98808 KB Output is correct
4 Correct 66 ms 98808 KB Output is correct
5 Correct 66 ms 98808 KB Output is correct
6 Correct 67 ms 98936 KB Output is correct
7 Correct 66 ms 98936 KB Output is correct
8 Correct 66 ms 98936 KB Output is correct
9 Correct 67 ms 98936 KB Output is correct
10 Correct 66 ms 98936 KB Output is correct
11 Correct 68 ms 98936 KB Output is correct
12 Correct 69 ms 98936 KB Output is correct
13 Correct 67 ms 98936 KB Output is correct
14 Correct 68 ms 98936 KB Output is correct
15 Correct 67 ms 98936 KB Output is correct
16 Correct 77 ms 99324 KB Output is correct
17 Correct 69 ms 99448 KB Output is correct
18 Correct 88 ms 99448 KB Output is correct
19 Correct 92 ms 102520 KB Output is correct
20 Correct 95 ms 102648 KB Output is correct
21 Correct 85 ms 102520 KB Output is correct
22 Correct 85 ms 102520 KB Output is correct
23 Correct 86 ms 102520 KB Output is correct
24 Correct 85 ms 102620 KB Output is correct
25 Correct 84 ms 102404 KB Output is correct
26 Correct 85 ms 102520 KB Output is correct
27 Correct 101 ms 106488 KB Output is correct
28 Correct 107 ms 106488 KB Output is correct
29 Correct 100 ms 106616 KB Output is correct
30 Correct 111 ms 106360 KB Output is correct
31 Correct 109 ms 106360 KB Output is correct
32 Correct 109 ms 106360 KB Output is correct
33 Correct 478 ms 175076 KB Output is correct
34 Correct 483 ms 175064 KB Output is correct
35 Correct 476 ms 174856 KB Output is correct
36 Correct 674 ms 173920 KB Output is correct
37 Correct 680 ms 174180 KB Output is correct
38 Correct 709 ms 174180 KB Output is correct
39 Correct 527 ms 159060 KB Output is correct
40 Correct 529 ms 159196 KB Output is correct
41 Correct 568 ms 158948 KB Output is correct
42 Correct 399 ms 156256 KB Output is correct
43 Correct 552 ms 173924 KB Output is correct
44 Correct 548 ms 173924 KB Output is correct
45 Correct 563 ms 173924 KB Output is correct
46 Correct 566 ms 174032 KB Output is correct
47 Correct 575 ms 173884 KB Output is correct
48 Correct 546 ms 174052 KB Output is correct
49 Correct 550 ms 173924 KB Output is correct
50 Correct 547 ms 173924 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 98944 KB Output is correct
2 Correct 68 ms 98808 KB Output is correct
3 Correct 66 ms 98808 KB Output is correct
4 Correct 66 ms 98808 KB Output is correct
5 Correct 66 ms 98808 KB Output is correct
6 Correct 67 ms 98936 KB Output is correct
7 Correct 66 ms 98936 KB Output is correct
8 Correct 66 ms 98936 KB Output is correct
9 Correct 67 ms 98936 KB Output is correct
10 Correct 66 ms 98936 KB Output is correct
11 Correct 68 ms 98936 KB Output is correct
12 Correct 69 ms 98936 KB Output is correct
13 Correct 67 ms 98936 KB Output is correct
14 Correct 68 ms 98936 KB Output is correct
15 Correct 67 ms 98936 KB Output is correct
16 Correct 77 ms 99324 KB Output is correct
17 Correct 69 ms 99448 KB Output is correct
18 Correct 88 ms 99448 KB Output is correct
19 Correct 92 ms 102520 KB Output is correct
20 Correct 95 ms 102648 KB Output is correct
21 Correct 85 ms 102520 KB Output is correct
22 Correct 85 ms 102520 KB Output is correct
23 Correct 86 ms 102520 KB Output is correct
24 Correct 85 ms 102620 KB Output is correct
25 Correct 84 ms 102404 KB Output is correct
26 Correct 85 ms 102520 KB Output is correct
27 Correct 1593 ms 369292 KB Output is correct
28 Correct 1554 ms 369872 KB Output is correct
29 Correct 1523 ms 370036 KB Output is correct
30 Correct 1502 ms 368976 KB Output is correct
31 Correct 1508 ms 351200 KB Output is correct
32 Correct 1775 ms 365856 KB Output is correct
33 Correct 1595 ms 363852 KB Output is correct
34 Correct 1623 ms 365008 KB Output is correct
35 Correct 75 ms 98808 KB Output is correct
36 Correct 776 ms 174296 KB Output is correct
37 Correct 2657 ms 369612 KB Output is correct
38 Correct 2598 ms 371196 KB Output is correct
39 Correct 2387 ms 363648 KB Output is correct
40 Correct 1071 ms 233768 KB Output is correct
41 Correct 518 ms 166244 KB Output is correct
42 Correct 134 ms 112436 KB Output is correct
43 Correct 2429 ms 367508 KB Output is correct
44 Correct 2363 ms 370024 KB Output is correct
45 Correct 2529 ms 371020 KB Output is correct
46 Correct 2275 ms 368456 KB Output is correct
47 Correct 1736 ms 370040 KB Output is correct
48 Correct 2166 ms 369488 KB Output is correct
49 Correct 2192 ms 369340 KB Output is correct
50 Correct 1622 ms 369360 KB Output is correct
51 Correct 101 ms 106488 KB Output is correct
52 Correct 107 ms 106488 KB Output is correct
53 Correct 100 ms 106616 KB Output is correct
54 Correct 111 ms 106360 KB Output is correct
55 Correct 109 ms 106360 KB Output is correct
56 Correct 109 ms 106360 KB Output is correct
57 Correct 478 ms 175076 KB Output is correct
58 Correct 483 ms 175064 KB Output is correct
59 Correct 476 ms 174856 KB Output is correct
60 Correct 674 ms 173920 KB Output is correct
61 Correct 680 ms 174180 KB Output is correct
62 Correct 709 ms 174180 KB Output is correct
63 Correct 527 ms 159060 KB Output is correct
64 Correct 529 ms 159196 KB Output is correct
65 Correct 568 ms 158948 KB Output is correct
66 Correct 399 ms 156256 KB Output is correct
67 Correct 552 ms 173924 KB Output is correct
68 Correct 548 ms 173924 KB Output is correct
69 Correct 563 ms 173924 KB Output is correct
70 Correct 566 ms 174032 KB Output is correct
71 Correct 575 ms 173884 KB Output is correct
72 Correct 546 ms 174052 KB Output is correct
73 Correct 550 ms 173924 KB Output is correct
74 Correct 547 ms 173924 KB Output is correct
75 Correct 1770 ms 373508 KB Output is correct
76 Correct 1544 ms 372064 KB Output is correct
77 Correct 1677 ms 371420 KB Output is correct
78 Correct 1587 ms 371792 KB Output is correct
79 Correct 1577 ms 370644 KB Output is correct
80 Correct 1527 ms 371792 KB Output is correct
81 Correct 2454 ms 369844 KB Output is correct
82 Correct 2552 ms 369356 KB Output is correct
83 Correct 2418 ms 369436 KB Output is correct
84 Correct 2606 ms 369864 KB Output is correct
85 Correct 2474 ms 369520 KB Output is correct
86 Correct 2447 ms 369708 KB Output is correct
87 Execution timed out 3071 ms 369396 KB Time limit exceeded
88 Halted 0 ms 0 KB -