제출 #61413

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
61413		duality	원 고르기 (APIO18_circle_selection)	C++11	49 / 100	3073 ms	331244 KiB

circle_selection

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

struct circle { int x,y,r,i; };
bool comp(circle a,circle b) {
    if (a.r == b.r) return a.i < b.i;
    else return a.r > b.r;
}
int x[300000],y[300000],r[300000];
circle c[300000];
LLI sq(LLI n) { return n*n; }
int inter(int a,int b) {
    return (sq(x[a]-x[b])+sq(y[a]-y[b])) <= sq(r[a]+r[b]);
}
map<pii,vi> M;
int ans[300000];
int main() {
    int i;
    int n;
    scanf("%d",&n);
    for (i = 0; i < n; i++) {
        scanf("%d %d %d",&x[i],&y[i],&r[i]);
        c[i].x = x[i],c[i].y = y[i],c[i].r = r[i],c[i].i = i;
    }
    sort(c,c+n,comp);

    int j,k,l;
    int bs = 1 << 30;
    fill(ans,ans+n,-1);
    M[mp(0,0)] = vi();
    for (i = 0; i < n; i++) M[mp(0,0)].pb(i);
    for (i = 0; i < n; i++) {
        if (ans[c[i].i] == -1) {
            if (c[i].r <= (bs >> 1)) {
                while (c[i].r <= (bs >> 1)) bs >>= 1;
                M.clear();
                for (j = i; j < n; j++) {
                    if (ans[c[j].i] == -1) {
                        pii p = mp(c[j].x/bs,c[j].y/bs);
                        if (!M.count(p)) M[p] = vi();
                        M[p].pb(c[j].i);
                    }
                }
            }
            for (j = c[i].x/bs-2; j <= c[i].x/bs+2; j++) {
                for (k = c[i].y/bs-2; k <= c[i].y/bs+2; k++) {
                    vi v = M[mp(j,k)];
                    M[mp(j,k)].clear();
                    for (l = 0; l < v.size(); l++) {
                        if (inter(c[i].i,v[l])) ans[v[l]] = c[i].i;
                        else M[mp(j,k)].pb(v[l]);
                    }
                }
            }
        }
    }
    for (i = 0; i < n; i++) printf("%d ",ans[i]+1);

    return 0;
}

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

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:103:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for (l = 0; l < v.size(); l++) {
                                 ~~^~~~~~~~~~
circle_selection.cpp:74:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
circle_selection.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&x[i],&y[i],&r[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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