oj.uz

답안 #774216

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774216 2023-07-05T13:05:58 Z xetrk 원 고르기 (APIO18_circle_selection) C++14
87 / 100
 3000 ms 48128 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];
int xIdx[300100], yIdx[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());


    for (int i = 0; i < n; i++)
    {
        xIdx[sortX[i].second] = i;
        yIdx[sortY[i].second] = i;
    }

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

    int j;


    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;


        j = xIdx[cur];

        if (j - 1 >= 0 && ans[sortX[j - 1].second] != -1)
            merge(j, j - 1, parentX);
        if (j + 1 < n && ans[sortX[j + 1].second] != -1)
            merge(j, j + 1, parentX);

        j = yIdx[cur];

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

        //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);

                    j = yIdx[curcmp];

                    if (j - 1 >= 0 && ans[sortY[j - 1].second] != -1)
                        merge(j, j - 1, parentY);
                    if (j + 1 < n && ans[sortY[j + 1].second] != -1)
                        merge(j, j + 1, parentY);
                   
                }
                i = find(i, parentX) + 1;
            }
        }
        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);


                    j = xIdx[curcmp];

                    if (j - 1 >= 0 && ans[sortX[j - 1].second] != -1)
                        merge(j, j - 1, parentX);
                    if (j + 1 < n && ans[sortX[j + 1].second] != -1)
                        merge(j, j + 1, parentX);

                }
                i = find(i, parentY) + 1;
            }
            /*
            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:127: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]
  127 |         if (xMin >= sortX.size()) xMin = sortX.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:128: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]
  128 |         if (yMin >= sortY.size()) yMin = sortY.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:129: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]
  129 |         if (xMax >= sortX.size()) xMax = sortX.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:130: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]
  130 |         if (yMax >= sortY.size()) yMax = sortY.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:93:9: warning: unused variable 'next' [-Wunused-variable]
   93 |     int next;
      |         ^~~~
circle_selection.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         scanf("%lld %lld %lld", &x, &y, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 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 308 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 1236 KB Output is correct
20 Correct 4 ms 1352 KB Output is correct
21 Correct 4 ms 1344 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 5 ms 1220 KB Output is correct
24 Correct 6 ms 1236 KB Output is correct
25 Correct 6 ms 1236 KB Output is correct
26 Correct 6 ms 1216 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 212 ms 45564 KB Output is correct
2 Correct 297 ms 47216 KB Output is correct
3 Correct 227 ms 45204 KB Output is correct
4 Correct 211 ms 45508 KB Output is correct
5 Correct 263 ms 43312 KB Output is correct
6 Correct 330 ms 43268 KB Output is correct
7 Correct 268 ms 43384 KB Output is correct
8 Correct 272 ms 43360 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 216 ms 15856 KB Output is correct
3 Correct 1036 ms 46760 KB Output is correct
4 Correct 1038 ms 46764 KB Output is correct
5 Correct 1413 ms 45692 KB Output is correct
6 Correct 325 ms 24540 KB Output is correct
7 Correct 112 ms 12988 KB Output is correct
8 Correct 17 ms 2952 KB Output is correct
9 Correct 1073 ms 46344 KB Output is correct
10 Correct 1885 ms 46244 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 641 ms 46520 KB Output is correct
2 Correct 479 ms 45724 KB Output is correct
3 Correct 1035 ms 46400 KB Output is correct
4 Correct 493 ms 46116 KB Output is correct
5 Correct 508 ms 46248 KB Output is correct
6 Correct 576 ms 45728 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 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 308 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 1236 KB Output is correct
20 Correct 4 ms 1352 KB Output is correct
21 Correct 4 ms 1344 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 5 ms 1220 KB Output is correct
24 Correct 6 ms 1236 KB Output is correct
25 Correct 6 ms 1236 KB Output is correct
26 Correct 6 ms 1216 KB Output is correct
27 Correct 7 ms 2056 KB Output is correct
28 Correct 10 ms 2032 KB Output is correct
29 Correct 7 ms 2056 KB Output is correct
30 Correct 15 ms 1904 KB Output is correct
31 Correct 12 ms 1972 KB Output is correct
32 Correct 11 ms 1928 KB Output is correct
33 Correct 82 ms 16080 KB Output is correct
34 Correct 82 ms 16088 KB Output is correct
35 Correct 77 ms 16012 KB Output is correct
36 Correct 148 ms 15480 KB Output is correct
37 Correct 144 ms 15632 KB Output is correct
38 Correct 159 ms 15752 KB Output is correct
39 Correct 452 ms 14072 KB Output is correct
40 Correct 462 ms 14096 KB Output is correct
41 Correct 431 ms 14084 KB Output is correct
42 Correct 229 ms 14600 KB Output is correct
43 Correct 115 ms 15584 KB Output is correct
44 Correct 118 ms 15620 KB Output is correct
45 Correct 124 ms 15644 KB Output is correct
46 Correct 121 ms 15596 KB Output is correct
47 Correct 115 ms 15620 KB Output is correct
48 Correct 116 ms 15656 KB Output is correct
49 Correct 137 ms 15688 KB Output is correct
50 Correct 116 ms 15580 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 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 308 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 1236 KB Output is correct
20 Correct 4 ms 1352 KB Output is correct
21 Correct 4 ms 1344 KB Output is correct
22 Correct 6 ms 1236 KB Output is correct
23 Correct 5 ms 1220 KB Output is correct
24 Correct 6 ms 1236 KB Output is correct
25 Correct 6 ms 1236 KB Output is correct
26 Correct 6 ms 1216 KB Output is correct
27 Correct 212 ms 45564 KB Output is correct
28 Correct 297 ms 47216 KB Output is correct
29 Correct 227 ms 45204 KB Output is correct
30 Correct 211 ms 45508 KB Output is correct
31 Correct 263 ms 43312 KB Output is correct
32 Correct 330 ms 43268 KB Output is correct
33 Correct 268 ms 43384 KB Output is correct
34 Correct 272 ms 43360 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 216 ms 15856 KB Output is correct
37 Correct 1036 ms 46760 KB Output is correct
38 Correct 1038 ms 46764 KB Output is correct
39 Correct 1413 ms 45692 KB Output is correct
40 Correct 325 ms 24540 KB Output is correct
41 Correct 112 ms 12988 KB Output is correct
42 Correct 17 ms 2952 KB Output is correct
43 Correct 1073 ms 46344 KB Output is correct
44 Correct 1885 ms 46244 KB Output is correct
45 Correct 641 ms 46520 KB Output is correct
46 Correct 479 ms 45724 KB Output is correct
47 Correct 1035 ms 46400 KB Output is correct
48 Correct 493 ms 46116 KB Output is correct
49 Correct 508 ms 46248 KB Output is correct
50 Correct 576 ms 45728 KB Output is correct
51 Correct 7 ms 2056 KB Output is correct
52 Correct 10 ms 2032 KB Output is correct
53 Correct 7 ms 2056 KB Output is correct
54 Correct 15 ms 1904 KB Output is correct
55 Correct 12 ms 1972 KB Output is correct
56 Correct 11 ms 1928 KB Output is correct
57 Correct 82 ms 16080 KB Output is correct
58 Correct 82 ms 16088 KB Output is correct
59 Correct 77 ms 16012 KB Output is correct
60 Correct 148 ms 15480 KB Output is correct
61 Correct 144 ms 15632 KB Output is correct
62 Correct 159 ms 15752 KB Output is correct
63 Correct 452 ms 14072 KB Output is correct
64 Correct 462 ms 14096 KB Output is correct
65 Correct 431 ms 14084 KB Output is correct
66 Correct 229 ms 14600 KB Output is correct
67 Correct 115 ms 15584 KB Output is correct
68 Correct 118 ms 15620 KB Output is correct
69 Correct 124 ms 15644 KB Output is correct
70 Correct 121 ms 15596 KB Output is correct
71 Correct 115 ms 15620 KB Output is correct
72 Correct 116 ms 15656 KB Output is correct
73 Correct 137 ms 15688 KB Output is correct
74 Correct 116 ms 15580 KB Output is correct
75 Correct 280 ms 46016 KB Output is correct
76 Correct 271 ms 48128 KB Output is correct
77 Correct 271 ms 46376 KB Output is correct
78 Correct 275 ms 46080 KB Output is correct
79 Correct 340 ms 46256 KB Output is correct
80 Correct 282 ms 46224 KB Output is correct
81 Correct 894 ms 46376 KB Output is correct
82 Correct 820 ms 46308 KB Output is correct
83 Correct 848 ms 46364 KB Output is correct
84 Correct 1490 ms 46400 KB Output is correct
85 Correct 867 ms 46340 KB Output is correct
86 Correct 788 ms 46344 KB Output is correct
87 Correct 977 ms 46436 KB Output is correct
88 Execution timed out 3063 ms 40044 KB Time limit exceeded
89 Halted 0 ms 0 KB -