제출 #123991

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
123991		hani	원 고르기 (APIO18_circle_selection)	C++14	7 / 100	3042 ms	22036 KiB

circle_selection

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct cir
{
    ll x,y,r,in;
    bool eliminated;
};
bool comp(cir a,cir b)
{
    if(a.r==b.r) return a.in<b.in;
     return a.r>b.r;
}
bool inter(cir a,cir b)
{
    long long g=(a.r+b.r)*(a.r+b.r), p=(a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
    if   ( g>=p) return true;
    return false;
}
int main()
{
    int n; cin>>n;
    cir t[n];
    for(int i=0;i<n;i++)
    {
        ll x,y,r;
        scanf("%lld%lld%lld",&x,&y,&r );
        t[i].x=x; t[i].y=y; t[i].r=r; t[i].in=i+1; t[i].eliminated=0;
    }
    sort(t,t+n,comp);
    //for(int i=0;i<n;i++){printf("%d %d %d %d \n",t[i].x,t[i].y,t[i].r,t[i].in);}
    int eliminations[n+1];
    for (int i=0;i<n;i++)
    {
        if(!t[i].eliminated)
        {
            eliminations[t[i].in]=t[i].in;
            for(int j=i+1;j<n;j++)
            {
                if(inter(t[i],t[j]) && !t[j].eliminated)
                {
                    eliminations[t[j].in]=t[i].in;
                    t[j].eliminated=true;
                }
            }
            t[i].eliminated=true;
        }
    }
    for(int i=1;i<=n;i++) cout<<eliminations[i]<<" ";

}

컴파일 시 표준 에러 (stderr) 메시지

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld",&x,&y,&r );
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13