oj.uz

Submission #61413

# Submission time Handle Problem Language Result Execution time Memory
61413 2018-07-25T21:24:39 Z duality Circle selection (APIO18_circle_selection) C++11
49 / 100
 3000 ms 331244 KB 
#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;
}

Compilation message

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.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 3 ms 704 KB Output is correct
5 Correct 3 ms 704 KB Output is correct
6 Correct 3 ms 780 KB Output is correct
7 Correct 3 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 3 ms 780 KB Output is correct
10 Correct 3 ms 780 KB Output is correct
11 Correct 5 ms 780 KB Output is correct
12 Correct 4 ms 780 KB Output is correct
13 Correct 4 ms 848 KB Output is correct
14 Correct 4 ms 852 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 9 ms 1212 KB Output is correct
20 Correct 10 ms 1352 KB Output is correct
21 Correct 11 ms 1520 KB Output is correct
22 Correct 103 ms 6028 KB Output is correct
23 Correct 101 ms 6432 KB Output is correct
24 Correct 92 ms 6432 KB Output is correct
25 Correct 87 ms 6432 KB Output is correct
26 Correct 94 ms 6720 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 21344 KB Output is correct
2 Correct 240 ms 29804 KB Output is correct
3 Correct 229 ms 36208 KB Output is correct
4 Correct 220 ms 40636 KB Output is correct
5 Correct 432 ms 48616 KB Output is correct
6 Correct 2443 ms 101016 KB Output is correct
7 Correct 683 ms 101016 KB Output is correct
8 Correct 828 ms 101016 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 101016 KB Output is correct
2 Correct 2404 ms 138068 KB Output is correct
3 Execution timed out 3073 ms 296068 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 3051 ms 331244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 3 ms 704 KB Output is correct
5 Correct 3 ms 704 KB Output is correct
6 Correct 3 ms 780 KB Output is correct
7 Correct 3 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 3 ms 780 KB Output is correct
10 Correct 3 ms 780 KB Output is correct
11 Correct 5 ms 780 KB Output is correct
12 Correct 4 ms 780 KB Output is correct
13 Correct 4 ms 848 KB Output is correct
14 Correct 4 ms 852 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 9 ms 1212 KB Output is correct
20 Correct 10 ms 1352 KB Output is correct
21 Correct 11 ms 1520 KB Output is correct
22 Correct 103 ms 6028 KB Output is correct
23 Correct 101 ms 6432 KB Output is correct
24 Correct 92 ms 6432 KB Output is correct
25 Correct 87 ms 6432 KB Output is correct
26 Correct 94 ms 6720 KB Output is correct
27 Correct 15 ms 331244 KB Output is correct
28 Correct 11 ms 331244 KB Output is correct
29 Correct 14 ms 331244 KB Output is correct
30 Correct 216 ms 331244 KB Output is correct
31 Correct 221 ms 331244 KB Output is correct
32 Correct 160 ms 331244 KB Output is correct
33 Correct 85 ms 331244 KB Output is correct
34 Correct 89 ms 331244 KB Output is correct
35 Correct 91 ms 331244 KB Output is correct
36 Correct 2426 ms 331244 KB Output is correct
37 Correct 2256 ms 331244 KB Output is correct
38 Correct 2424 ms 331244 KB Output is correct
39 Correct 902 ms 331244 KB Output is correct
40 Correct 828 ms 331244 KB Output is correct
41 Correct 944 ms 331244 KB Output is correct
42 Correct 471 ms 331244 KB Output is correct
43 Correct 1502 ms 331244 KB Output is correct
44 Correct 1648 ms 331244 KB Output is correct
45 Correct 1744 ms 331244 KB Output is correct
46 Correct 1631 ms 331244 KB Output is correct
47 Correct 1607 ms 331244 KB Output is correct
48 Correct 1539 ms 331244 KB Output is correct
49 Correct 1617 ms 331244 KB Output is correct
50 Correct 1742 ms 331244 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 3 ms 704 KB Output is correct
5 Correct 3 ms 704 KB Output is correct
6 Correct 3 ms 780 KB Output is correct
7 Correct 3 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 3 ms 780 KB Output is correct
10 Correct 3 ms 780 KB Output is correct
11 Correct 5 ms 780 KB Output is correct
12 Correct 4 ms 780 KB Output is correct
13 Correct 4 ms 848 KB Output is correct
14 Correct 4 ms 852 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 9 ms 1212 KB Output is correct
20 Correct 10 ms 1352 KB Output is correct
21 Correct 11 ms 1520 KB Output is correct
22 Correct 103 ms 6028 KB Output is correct
23 Correct 101 ms 6432 KB Output is correct
24 Correct 92 ms 6432 KB Output is correct
25 Correct 87 ms 6432 KB Output is correct
26 Correct 94 ms 6720 KB Output is correct
27 Correct 308 ms 21344 KB Output is correct
28 Correct 240 ms 29804 KB Output is correct
29 Correct 229 ms 36208 KB Output is correct
30 Correct 220 ms 40636 KB Output is correct
31 Correct 432 ms 48616 KB Output is correct
32 Correct 2443 ms 101016 KB Output is correct
33 Correct 683 ms 101016 KB Output is correct
34 Correct 828 ms 101016 KB Output is correct
35 Correct 3 ms 101016 KB Output is correct
36 Correct 2404 ms 138068 KB Output is correct
37 Execution timed out 3073 ms 296068 KB Time limit exceeded
38 Halted 0 ms 0 KB -