oj.uz

Submission #49638

# Submission time Handle Problem Language Result Execution time Memory
49638 2018-06-01T12:26:33 Z gs13105 Circle selection (APIO18_circle_selection) C++17
100 / 100
 1483 ms 36256 KB 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <iterator>

using namespace std;

struct cir
{
    int x, y, r, i;
    bool operator <(const cir &a) const
    {
        return r != a.r ? r > a.r : i < a.i;
    }
};

const int MAXN = 300000;
const int MAXV = 1000000000;
cir arr[MAXN + 10];
int num[MAXN + 10];
int res[MAXN + 10];
int n;

bool inter(const cir &a, const cir &b)
{
    return 1LL * (a.x - b.x) * (a.x - b.x) + 1LL * (a.y - b.y) * (a.y - b.y) <= 1LL * (a.r + b.r) * (a.r + b.r);
}

vector<long long> com;
long long tmp[MAXN + 10];
vector<int> lis[MAXN + 10];

inline int idx(long long x)
{
    return lower_bound(com.begin(), com.end(), x) - com.begin();
}

inline long long idx2(int x, int y, int r)
{
    return (2LL * MAXV + 1) * ((x + MAXV) / r) + (y + MAXV) / r;
}

void init(int s, int mx)
{
    com.clear();
    for(int i = 0; i < n - s; i++)
        lis[i].clear();

    for(int i = s; i <= n; i++)
    {
        if(num[i])
            continue;

        tmp[i] = idx2(arr[i].x, arr[i].y, mx);
        com.push_back(tmp[i]);
    }

    sort(com.begin(), com.end());
    com.erase(unique(com.begin(), com.end()), com.end());

    for(int i = s; i <= n; i++)
    {
        if(num[i])
            continue;
        lis[idx(tmp[i])].push_back(i);
    }
}

int main()
{
    //freopen("in", "r", stdin);
    //freopen("out", "w", stdout);

    int i, j, k;
    scanf("%d", &n);
    for(i = 1; i <= n; i++)
    {
        int x, y, r;
        scanf("%d%d%d", &x, &y, &r);
        arr[i] = { x, y, r, i };
    }

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

    int mx = arr[1].r;
    init(1, mx);
    for(i = 1; i <= n; i++)
    {
        if(num[i])
            continue;

        if(arr[i].r <= mx / 2)
        {
            mx = arr[i].r;
            init(i, mx);
        }

        for(j = -2; j <= 2; j++)
        {
            for(k = -2; k <= 2; k++)
            {
                int nx = max(0LL + -MAXV, min(0LL + MAXV, arr[i].x + 1LL * j * mx));
                int ny = max(0LL + -MAXV, min(0LL + MAXV, arr[i].y + 1LL * k * mx));

                long long t = idx2(nx, ny, mx);
                int t2 = idx(t);
                if(t2 == com.size() || com[t2] != t)
                    continue;

                vector<int> nex;
                for(int &x : lis[t2])
                {
                    if(inter(arr[i], arr[x]))
                        num[x] = arr[i].i;
                    else
                        nex.push_back(x);
                }
                lis[t2] = nex;
            }
        }
    }

    for(i = 1; i <= n; i++)
        res[arr[i].i] = num[i];

    for(i = 1; i <= n; i++)
        printf("%d ", res[i]);

    return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:119:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(t2 == com.size() || com[t2] != t)
                    ~~~^~~~~~~~~~~~~
circle_selection.cpp:87:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
circle_selection.cpp:91:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &x, &y, &r);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7416 KB Output is correct
2 Correct 7 ms 7528 KB Output is correct
3 Correct 8 ms 7584 KB Output is correct
4 Correct 7 ms 7636 KB Output is correct
5 Correct 7 ms 7636 KB Output is correct
6 Correct 7 ms 7636 KB Output is correct
7 Correct 8 ms 7684 KB Output is correct
8 Correct 8 ms 7712 KB Output is correct
9 Correct 9 ms 7712 KB Output is correct
10 Correct 10 ms 7712 KB Output is correct
11 Correct 9 ms 7816 KB Output is correct
12 Correct 10 ms 7816 KB Output is correct
13 Correct 10 ms 7816 KB Output is correct
14 Correct 8 ms 7816 KB Output is correct
15 Correct 10 ms 7816 KB Output is correct
16 Correct 9 ms 7816 KB Output is correct
17 Correct 10 ms 7816 KB Output is correct
18 Correct 12 ms 7816 KB Output is correct
19 Correct 12 ms 7908 KB Output is correct
20 Correct 13 ms 7908 KB Output is correct
21 Correct 13 ms 7988 KB Output is correct
22 Correct 26 ms 8072 KB Output is correct
23 Correct 23 ms 8084 KB Output is correct
24 Correct 24 ms 8084 KB Output is correct
25 Correct 20 ms 8084 KB Output is correct
26 Correct 22 ms 8100 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 24012 KB Output is correct
2 Correct 246 ms 24012 KB Output is correct
3 Correct 297 ms 24012 KB Output is correct
4 Correct 297 ms 24012 KB Output is correct
5 Correct 319 ms 24012 KB Output is correct
6 Correct 789 ms 25992 KB Output is correct
7 Correct 352 ms 25992 KB Output is correct
8 Correct 440 ms 25992 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25992 KB Output is correct
2 Correct 379 ms 25992 KB Output is correct
3 Correct 1189 ms 30760 KB Output is correct
4 Correct 1181 ms 30760 KB Output is correct
5 Correct 1022 ms 30760 KB Output is correct
6 Correct 472 ms 30760 KB Output is correct
7 Correct 218 ms 30760 KB Output is correct
8 Correct 45 ms 30760 KB Output is correct
9 Correct 1483 ms 30760 KB Output is correct
10 Correct 924 ms 30760 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1115 ms 30856 KB Output is correct
2 Correct 1022 ms 31008 KB Output is correct
3 Correct 616 ms 31008 KB Output is correct
4 Correct 929 ms 31008 KB Output is correct
5 Correct 910 ms 31008 KB Output is correct
6 Correct 300 ms 31008 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7416 KB Output is correct
2 Correct 7 ms 7528 KB Output is correct
3 Correct 8 ms 7584 KB Output is correct
4 Correct 7 ms 7636 KB Output is correct
5 Correct 7 ms 7636 KB Output is correct
6 Correct 7 ms 7636 KB Output is correct
7 Correct 8 ms 7684 KB Output is correct
8 Correct 8 ms 7712 KB Output is correct
9 Correct 9 ms 7712 KB Output is correct
10 Correct 10 ms 7712 KB Output is correct
11 Correct 9 ms 7816 KB Output is correct
12 Correct 10 ms 7816 KB Output is correct
13 Correct 10 ms 7816 KB Output is correct
14 Correct 8 ms 7816 KB Output is correct
15 Correct 10 ms 7816 KB Output is correct
16 Correct 9 ms 7816 KB Output is correct
17 Correct 10 ms 7816 KB Output is correct
18 Correct 12 ms 7816 KB Output is correct
19 Correct 12 ms 7908 KB Output is correct
20 Correct 13 ms 7908 KB Output is correct
21 Correct 13 ms 7988 KB Output is correct
22 Correct 26 ms 8072 KB Output is correct
23 Correct 23 ms 8084 KB Output is correct
24 Correct 24 ms 8084 KB Output is correct
25 Correct 20 ms 8084 KB Output is correct
26 Correct 22 ms 8100 KB Output is correct
27 Correct 16 ms 31008 KB Output is correct
28 Correct 15 ms 31008 KB Output is correct
29 Correct 15 ms 31008 KB Output is correct
30 Correct 34 ms 31008 KB Output is correct
31 Correct 33 ms 31008 KB Output is correct
32 Correct 36 ms 31008 KB Output is correct
33 Correct 85 ms 31008 KB Output is correct
34 Correct 86 ms 31008 KB Output is correct
35 Correct 97 ms 31008 KB Output is correct
36 Correct 369 ms 31008 KB Output is correct
37 Correct 324 ms 31008 KB Output is correct
38 Correct 334 ms 31008 KB Output is correct
39 Correct 314 ms 31008 KB Output is correct
40 Correct 344 ms 31008 KB Output is correct
41 Correct 365 ms 31008 KB Output is correct
42 Correct 245 ms 31008 KB Output is correct
43 Correct 300 ms 31008 KB Output is correct
44 Correct 305 ms 31008 KB Output is correct
45 Correct 295 ms 31008 KB Output is correct
46 Correct 297 ms 31008 KB Output is correct
47 Correct 294 ms 31008 KB Output is correct
48 Correct 281 ms 31008 KB Output is correct
49 Correct 298 ms 31008 KB Output is correct
50 Correct 272 ms 31008 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7416 KB Output is correct
2 Correct 7 ms 7528 KB Output is correct
3 Correct 8 ms 7584 KB Output is correct
4 Correct 7 ms 7636 KB Output is correct
5 Correct 7 ms 7636 KB Output is correct
6 Correct 7 ms 7636 KB Output is correct
7 Correct 8 ms 7684 KB Output is correct
8 Correct 8 ms 7712 KB Output is correct
9 Correct 9 ms 7712 KB Output is correct
10 Correct 10 ms 7712 KB Output is correct
11 Correct 9 ms 7816 KB Output is correct
12 Correct 10 ms 7816 KB Output is correct
13 Correct 10 ms 7816 KB Output is correct
14 Correct 8 ms 7816 KB Output is correct
15 Correct 10 ms 7816 KB Output is correct
16 Correct 9 ms 7816 KB Output is correct
17 Correct 10 ms 7816 KB Output is correct
18 Correct 12 ms 7816 KB Output is correct
19 Correct 12 ms 7908 KB Output is correct
20 Correct 13 ms 7908 KB Output is correct
21 Correct 13 ms 7988 KB Output is correct
22 Correct 26 ms 8072 KB Output is correct
23 Correct 23 ms 8084 KB Output is correct
24 Correct 24 ms 8084 KB Output is correct
25 Correct 20 ms 8084 KB Output is correct
26 Correct 22 ms 8100 KB Output is correct
27 Correct 261 ms 24012 KB Output is correct
28 Correct 246 ms 24012 KB Output is correct
29 Correct 297 ms 24012 KB Output is correct
30 Correct 297 ms 24012 KB Output is correct
31 Correct 319 ms 24012 KB Output is correct
32 Correct 789 ms 25992 KB Output is correct
33 Correct 352 ms 25992 KB Output is correct
34 Correct 440 ms 25992 KB Output is correct
35 Correct 9 ms 25992 KB Output is correct
36 Correct 379 ms 25992 KB Output is correct
37 Correct 1189 ms 30760 KB Output is correct
38 Correct 1181 ms 30760 KB Output is correct
39 Correct 1022 ms 30760 KB Output is correct
40 Correct 472 ms 30760 KB Output is correct
41 Correct 218 ms 30760 KB Output is correct
42 Correct 45 ms 30760 KB Output is correct
43 Correct 1483 ms 30760 KB Output is correct
44 Correct 924 ms 30760 KB Output is correct
45 Correct 1115 ms 30856 KB Output is correct
46 Correct 1022 ms 31008 KB Output is correct
47 Correct 616 ms 31008 KB Output is correct
48 Correct 929 ms 31008 KB Output is correct
49 Correct 910 ms 31008 KB Output is correct
50 Correct 300 ms 31008 KB Output is correct
51 Correct 16 ms 31008 KB Output is correct
52 Correct 15 ms 31008 KB Output is correct
53 Correct 15 ms 31008 KB Output is correct
54 Correct 34 ms 31008 KB Output is correct
55 Correct 33 ms 31008 KB Output is correct
56 Correct 36 ms 31008 KB Output is correct
57 Correct 85 ms 31008 KB Output is correct
58 Correct 86 ms 31008 KB Output is correct
59 Correct 97 ms 31008 KB Output is correct
60 Correct 369 ms 31008 KB Output is correct
61 Correct 324 ms 31008 KB Output is correct
62 Correct 334 ms 31008 KB Output is correct
63 Correct 314 ms 31008 KB Output is correct
64 Correct 344 ms 31008 KB Output is correct
65 Correct 365 ms 31008 KB Output is correct
66 Correct 245 ms 31008 KB Output is correct
67 Correct 300 ms 31008 KB Output is correct
68 Correct 305 ms 31008 KB Output is correct
69 Correct 295 ms 31008 KB Output is correct
70 Correct 297 ms 31008 KB Output is correct
71 Correct 294 ms 31008 KB Output is correct
72 Correct 281 ms 31008 KB Output is correct
73 Correct 298 ms 31008 KB Output is correct
74 Correct 272 ms 31008 KB Output is correct
75 Correct 274 ms 31008 KB Output is correct
76 Correct 276 ms 31008 KB Output is correct
77 Correct 259 ms 31008 KB Output is correct
78 Correct 250 ms 31008 KB Output is correct
79 Correct 283 ms 31008 KB Output is correct
80 Correct 267 ms 31008 KB Output is correct
81 Correct 1225 ms 31008 KB Output is correct
82 Correct 1208 ms 31008 KB Output is correct
83 Correct 1148 ms 31008 KB Output is correct
84 Correct 1219 ms 31008 KB Output is correct
85 Correct 1305 ms 31008 KB Output is correct
86 Correct 1231 ms 31008 KB Output is correct
87 Correct 1357 ms 31008 KB Output is correct
88 Correct 1158 ms 36112 KB Output is correct
89 Correct 1211 ms 36256 KB Output is correct
90 Correct 1199 ms 36256 KB Output is correct
91 Correct 1201 ms 36256 KB Output is correct
92 Correct 1199 ms 36256 KB Output is correct
93 Correct 998 ms 36256 KB Output is correct
94 Correct 1115 ms 36256 KB Output is correct
95 Correct 1002 ms 36256 KB Output is correct
96 Correct 1022 ms 36256 KB Output is correct
97 Correct 1359 ms 36256 KB Output is correct
98 Correct 848 ms 36256 KB Output is correct
99 Correct 1133 ms 36256 KB Output is correct
100 Correct 1083 ms 36256 KB Output is correct
101 Correct 1006 ms 36256 KB Output is correct
102 Correct 1159 ms 36256 KB Output is correct
103 Correct 1304 ms 36256 KB Output is correct
104 Correct 1138 ms 36256 KB Output is correct
105 Correct 833 ms 36256 KB Output is correct
106 Correct 869 ms 36256 KB Output is correct
107 Correct 1028 ms 36256 KB Output is correct
108 Correct 908 ms 36256 KB Output is correct
109 Correct 1093 ms 36256 KB Output is correct
110 Correct 968 ms 36256 KB Output is correct
111 Correct 1026 ms 36256 KB Output is correct
112 Correct 907 ms 36256 KB Output is correct
113 Correct 872 ms 36256 KB Output is correct
114 Correct 906 ms 36256 KB Output is correct
115 Correct 928 ms 36256 KB Output is correct
116 Correct 966 ms 36256 KB Output is correct