oj.uz

Submission #774144

# Submission time Handle Problem Language Result Execution time Memory
774144 2023-07-05T12:21:14 Z xetrk Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 46808 KB 
#pragma warning(disable:4996)

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


typedef long long ll;
typedef long double ld;

int n;

vector<vector<ll>> circle;

vector<pair<ll, int>> sortRadius, sortX, sortY;


int ans[301000];
int parentX[300100], parentY[300100];
//int depthX[300100], depthY[300100];

inline ll GetDist(ll x1, ll y1, ll x2, ll y2)
{
    // 아 좌표값 마이너스도 들어오네
    ll xx = max(x1, x2) - min(x1, x2);
    ll yy = max(y1, y2) - min(y1, y2);
    return (xx * xx) + (yy * yy);
}



bool comp(const pair<ll, int>& a, const pair<ll, int>& b)
{
    if (a.first == b.first)
        return a.second < b.second;
    return a.first < b.first;
}

bool compSort(const pair<ll, int>& a, const pair<ll, int>& b)
{
    if (a.first == b.first)
        return a.second < b.second;

    return a.first > b.first;
}


int find(int a, int parent[])
{
    if (parent[a] != a)
        parent[a] = find(parent[a], parent);
    return parent[a];
}

void merge(int a, int b, int parent[]) 
{
    a = find(a, parent), b = find(b, parent);
    if (a > b) swap(a, b);//b가더커야함
    parent[a] = b;//더큰걸부모로
}

int main()
{
    ll x, y, r, r2;
    int i;
    scanf("%d", &n);

    for (int i = 0; i < n; i++)
    {
        scanf("%lld %lld %lld", &x, &y, &r);
        //x = 1, y = 1, r = 3;
        circle.push_back({ x,y,r });
        sortRadius.push_back({ r,i });
        sortX.push_back({ x,i });
        sortY.push_back({ y,i });
        parentX[i] = parentY[i] = i;
        //depthX[i] = depthY[i] = 1;
    }

    sort(sortRadius.begin(), sortRadius.end(), compSort);
    sort(sortX.begin(), sortX.end());
    sort(sortY.begin(), sortY.end());


    int cur, curcmp;
    int xMin, xMax, yMin, yMax;
    int next;
    ll rr;

    fill(ans, ans + n + 2, -1);

    for (int curDelete = 0; curDelete < n; curDelete++)
    {
        cur = sortRadius[curDelete].second;
        if (ans[cur] != -1)
            continue;


        x = circle[cur][0], y = circle[cur][1], r = circle[cur][2];
        if (curDelete < n - 1)
            r2 = r + sortRadius[curDelete + 1].first + 1;
        else
            r2 = r * 2 + 1;

        // a이하를 찾아야하는데 lower bound는  a이상인걸 찾으니까.. 근데 그 이하인걸 찾아야하니 1빼줌
        xMin = lower_bound(sortX.begin(), sortX.end(), pair<ll, int>(x - r2, -1), comp) - sortX.begin();
        xMax = upper_bound(sortX.begin(), sortX.end(), pair<ll, int>(x + r2, 301000), comp) - sortX.begin();

        yMin = lower_bound(sortY.begin(), sortY.end(), pair<ll, int>(y - r2, -1), comp) - sortY.begin();
        yMax = upper_bound(sortY.begin(), sortY.end(), pair<ll, int>(y + r2, 301000), comp) - sortY.begin();

        xMin--;
        yMin--;

        if (xMin < 0) xMin = 0;
        if (yMin < 0) yMin = 0;

        if (xMin >= sortX.size()) xMin = sortX.size() - 1;
        if (yMin >= sortY.size()) yMin = sortY.size() - 1;
        if (xMax >= sortX.size()) xMax = sortX.size() - 1;
        if (yMax >= sortY.size()) yMax = sortY.size() - 1;

        //xMin = 0, yMin = 0, xMax = n - 1, yMax = n - 1;


        ans[cur] = cur;
        //xIdx[cur]

        if (xMax - xMin < yMax - yMin)
        {
            i = xMin;
            while (i <= xMax)
            {
                curcmp = sortX[i].second;
                
                if (ans[curcmp] != -1)
                {
                    i = find(i, parentX) + 1;
                    continue;
                }
                rr = r + circle[curcmp][2];
                if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= rr * rr)
                {
                    ans[curcmp] = cur;

                    if (i - 1 >= 0 && ans[sortX[i - 1].second] != -1)
                        merge(i, i - 1, parentX);
                    if (i + 1 < n && ans[sortX[i + 1].second] != -1)
                        merge(i, i + 1, parentX);
                   
                }
                i++;
            }
        }
        else
        {
            i = yMin;
            while (i <= yMax)
            {
                curcmp = sortY[i].second;
                if (ans[curcmp] != -1)
                {
                    i = find(i, parentY) + 1;
                    continue;
                }
                rr = r + circle[curcmp][2];
                if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= rr * rr)
                {
                    ans[curcmp] = cur;

                    if (i - 1 >= 0 && ans[sortY[i - 1].second] != -1)
                        merge(i, i - 1, parentY);
                    if (i + 1 < n && ans[sortY[i + 1].second] != -1)
                        merge(i, i + 1, parentY);

                }
                i++;
            }
            /*
            for (int i = yMax; i >= yMin; i--)
            {
             curcmp = sortY[i].second;
             if (ans[curcmp]!= -1) continue;
             rr = r + circle[curcmp][2];
             if (GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= rr * rr)
             {
              ans[curcmp] = cur;
              //sortY.erase(sortY.begin() + i);
             }
            }*/
        }
    }

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

    return 0;
}

Compilation message

circle_selection.cpp:1: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    1 | #pragma warning(disable:4996)
      | 
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:117:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         if (xMin >= sortX.size()) xMin = sortX.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:118:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |         if (yMin >= sortY.size()) yMin = sortY.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:119:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |         if (xMax >= sortX.size()) xMax = sortX.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:120:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |         if (yMax >= sortY.size()) yMax = sortY.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:86:9: warning: unused variable 'next' [-Wunused-variable]
   86 |     int next;
      |         ^~~~
circle_selection.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:69:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |         scanf("%lld %lld %lld", &x, &y, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 448 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 4 ms 1188 KB Output is correct
20 Correct 5 ms 1236 KB Output is correct
21 Correct 4 ms 1236 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 5 ms 1236 KB Output is correct
24 Correct 6 ms 1196 KB Output is correct
25 Correct 6 ms 1256 KB Output is correct
26 Correct 5 ms 1212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 36468 KB Output is correct
2 Correct 257 ms 44984 KB Output is correct
3 Correct 210 ms 42832 KB Output is correct
4 Correct 204 ms 43188 KB Output is correct
5 Correct 232 ms 40820 KB Output is correct
6 Correct 285 ms 40948 KB Output is correct
7 Correct 230 ms 41072 KB Output is correct
8 Correct 243 ms 40956 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 205 ms 12220 KB Output is correct
3 Correct 972 ms 36284 KB Output is correct
4 Correct 1033 ms 36288 KB Output is correct
5 Correct 1300 ms 35380 KB Output is correct
6 Correct 333 ms 23404 KB Output is correct
7 Correct 99 ms 12360 KB Output is correct
8 Correct 16 ms 2952 KB Output is correct
9 Correct 981 ms 44400 KB Output is correct
10 Correct 1847 ms 44696 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 622 ms 36288 KB Output is correct
2 Correct 494 ms 36276 KB Output is correct
3 Correct 1044 ms 35944 KB Output is correct
4 Correct 466 ms 43720 KB Output is correct
5 Correct 476 ms 43900 KB Output is correct
6 Correct 425 ms 44148 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 448 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 4 ms 1188 KB Output is correct
20 Correct 5 ms 1236 KB Output is correct
21 Correct 4 ms 1236 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 5 ms 1236 KB Output is correct
24 Correct 6 ms 1196 KB Output is correct
25 Correct 6 ms 1256 KB Output is correct
26 Correct 5 ms 1212 KB Output is correct
27 Correct 7 ms 1928 KB Output is correct
28 Correct 7 ms 1944 KB Output is correct
29 Correct 9 ms 1952 KB Output is correct
30 Correct 11 ms 1888 KB Output is correct
31 Correct 11 ms 1816 KB Output is correct
32 Correct 11 ms 1928 KB Output is correct
33 Correct 71 ms 15340 KB Output is correct
34 Correct 72 ms 15356 KB Output is correct
35 Correct 76 ms 15200 KB Output is correct
36 Correct 143 ms 14836 KB Output is correct
37 Correct 135 ms 14812 KB Output is correct
38 Correct 160 ms 14896 KB Output is correct
39 Correct 502 ms 13388 KB Output is correct
40 Correct 463 ms 13240 KB Output is correct
41 Correct 496 ms 13276 KB Output is correct
42 Correct 226 ms 13916 KB Output is correct
43 Correct 142 ms 14764 KB Output is correct
44 Correct 112 ms 14776 KB Output is correct
45 Correct 113 ms 14808 KB Output is correct
46 Correct 120 ms 14824 KB Output is correct
47 Correct 120 ms 14872 KB Output is correct
48 Correct 113 ms 14804 KB Output is correct
49 Correct 118 ms 14848 KB Output is correct
50 Correct 139 ms 14844 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 448 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 4 ms 1188 KB Output is correct
20 Correct 5 ms 1236 KB Output is correct
21 Correct 4 ms 1236 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 5 ms 1236 KB Output is correct
24 Correct 6 ms 1196 KB Output is correct
25 Correct 6 ms 1256 KB Output is correct
26 Correct 5 ms 1212 KB Output is correct
27 Correct 192 ms 36468 KB Output is correct
28 Correct 257 ms 44984 KB Output is correct
29 Correct 210 ms 42832 KB Output is correct
30 Correct 204 ms 43188 KB Output is correct
31 Correct 232 ms 40820 KB Output is correct
32 Correct 285 ms 40948 KB Output is correct
33 Correct 230 ms 41072 KB Output is correct
34 Correct 243 ms 40956 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 205 ms 12220 KB Output is correct
37 Correct 972 ms 36284 KB Output is correct
38 Correct 1033 ms 36288 KB Output is correct
39 Correct 1300 ms 35380 KB Output is correct
40 Correct 333 ms 23404 KB Output is correct
41 Correct 99 ms 12360 KB Output is correct
42 Correct 16 ms 2952 KB Output is correct
43 Correct 981 ms 44400 KB Output is correct
44 Correct 1847 ms 44696 KB Output is correct
45 Correct 622 ms 36288 KB Output is correct
46 Correct 494 ms 36276 KB Output is correct
47 Correct 1044 ms 35944 KB Output is correct
48 Correct 466 ms 43720 KB Output is correct
49 Correct 476 ms 43900 KB Output is correct
50 Correct 425 ms 44148 KB Output is correct
51 Correct 7 ms 1928 KB Output is correct
52 Correct 7 ms 1944 KB Output is correct
53 Correct 9 ms 1952 KB Output is correct
54 Correct 11 ms 1888 KB Output is correct
55 Correct 11 ms 1816 KB Output is correct
56 Correct 11 ms 1928 KB Output is correct
57 Correct 71 ms 15340 KB Output is correct
58 Correct 72 ms 15356 KB Output is correct
59 Correct 76 ms 15200 KB Output is correct
60 Correct 143 ms 14836 KB Output is correct
61 Correct 135 ms 14812 KB Output is correct
62 Correct 160 ms 14896 KB Output is correct
63 Correct 502 ms 13388 KB Output is correct
64 Correct 463 ms 13240 KB Output is correct
65 Correct 496 ms 13276 KB Output is correct
66 Correct 226 ms 13916 KB Output is correct
67 Correct 142 ms 14764 KB Output is correct
68 Correct 112 ms 14776 KB Output is correct
69 Correct 113 ms 14808 KB Output is correct
70 Correct 120 ms 14824 KB Output is correct
71 Correct 120 ms 14872 KB Output is correct
72 Correct 113 ms 14804 KB Output is correct
73 Correct 118 ms 14848 KB Output is correct
74 Correct 139 ms 14844 KB Output is correct
75 Correct 242 ms 45472 KB Output is correct
76 Correct 240 ms 46808 KB Output is correct
77 Correct 255 ms 45308 KB Output is correct
78 Correct 258 ms 45172 KB Output is correct
79 Correct 332 ms 44952 KB Output is correct
80 Correct 258 ms 45188 KB Output is correct
81 Correct 844 ms 44352 KB Output is correct
82 Correct 795 ms 44192 KB Output is correct
83 Correct 795 ms 44124 KB Output is correct
84 Correct 1253 ms 44700 KB Output is correct
85 Correct 768 ms 44220 KB Output is correct
86 Correct 701 ms 44316 KB Output is correct
87 Correct 945 ms 44460 KB Output is correct
88 Execution timed out 3068 ms 38288 KB Time limit exceeded
89 Halted 0 ms 0 KB -