oj.uz

답안 #773348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
773348 2023-07-04T23:56:22 Z xetrk 원 고르기 (APIO18_circle_selection) C++14
42 / 100
 1549 ms 38804 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 skipX[300100], skipY[300100];
int xIdx[300100], yIdx[300100];

int ans[301000];

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 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 });
        skipX[i] = i + 1;
        skipY[i] = 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;

    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;
        if (xIdx[cur] - 1 >= 0)
        {
            skipX[xIdx[cur] - 1] = skipX[xIdx[cur]];
            if (skipX[xIdx[cur] - 1] == 0) skipX[xIdx[cur] - 1] = n + 1;
        }
        if (yIdx[cur] - 1 >= 0)
        {
            skipY[yIdx[cur] - 1] = skipY[yIdx[cur]];
            if (skipY[yIdx[cur] - 1] == 0) skipY[yIdx[cur] - 1] = n + 1;
        }
        //xIdx[cur]

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

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

                    if (xIdx[curcmp] - 1 >= 0)
                    {
                        skipX[xIdx[curcmp] - 1] = skipX[xIdx[curcmp]];
                        if (skipX[yIdx[curcmp] - 1] == 0) skipX[xIdx[curcmp] - 1] = n + 1;
                    }
                }
                i = next;
            }
            /*
            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:108: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]
  108 |         if (xMin >= sortX.size()) xMin = sortX.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:109: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]
  109 |         if (yMin >= sortY.size()) yMin = sortY.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:110: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]
  110 |         if (xMax >= sortX.size()) xMax = sortX.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:111: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]
  111 |         if (yMax >= sortY.size()) yMax = sortY.size() - 1;
      |             ~~~~~^~~~~~~~~~~~~~~
circle_selection.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |         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 212 KB Output is correct
3 Correct 0 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 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 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 1200 KB Output is correct
20 Correct 3 ms 1108 KB Output is correct
21 Correct 4 ms 1180 KB Output is correct
22 Correct 5 ms 1108 KB Output is correct
23 Correct 5 ms 1108 KB Output is correct
24 Correct 5 ms 1108 KB Output is correct
25 Correct 5 ms 1108 KB Output is correct
26 Correct 5 ms 1108 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 207 ms 38804 KB Output is correct
2 Correct 220 ms 38796 KB Output is correct
3 Correct 227 ms 38444 KB Output is correct
4 Correct 210 ms 38764 KB Output is correct
5 Correct 220 ms 38508 KB Output is correct
6 Correct 292 ms 38784 KB Output is correct
7 Correct 271 ms 38644 KB Output is correct
8 Correct 250 ms 38704 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 173 ms 12984 KB Output is correct
3 Correct 937 ms 38656 KB Output is correct
4 Correct 927 ms 38656 KB Output is correct
5 Correct 1160 ms 37588 KB Output is correct
6 Correct 305 ms 20308 KB Output is correct
7 Correct 113 ms 10708 KB Output is correct
8 Correct 16 ms 2440 KB Output is correct
9 Correct 904 ms 38640 KB Output is correct
10 Incorrect 1549 ms 38732 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 593 ms 38660 KB Output is correct
2 Correct 498 ms 38648 KB Output is correct
3 Correct 948 ms 38272 KB Output is correct
4 Correct 477 ms 38648 KB Output is correct
5 Correct 494 ms 38704 KB Output is correct
6 Correct 467 ms 38012 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 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 1200 KB Output is correct
20 Correct 3 ms 1108 KB Output is correct
21 Correct 4 ms 1180 KB Output is correct
22 Correct 5 ms 1108 KB Output is correct
23 Correct 5 ms 1108 KB Output is correct
24 Correct 5 ms 1108 KB Output is correct
25 Correct 5 ms 1108 KB Output is correct
26 Correct 5 ms 1108 KB Output is correct
27 Correct 7 ms 1708 KB Output is correct
28 Correct 7 ms 1672 KB Output is correct
29 Correct 7 ms 1684 KB Output is correct
30 Correct 11 ms 1672 KB Output is correct
31 Correct 11 ms 1672 KB Output is correct
32 Correct 11 ms 1672 KB Output is correct
33 Correct 68 ms 13064 KB Output is correct
34 Correct 70 ms 13004 KB Output is correct
35 Incorrect 80 ms 12956 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 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 1200 KB Output is correct
20 Correct 3 ms 1108 KB Output is correct
21 Correct 4 ms 1180 KB Output is correct
22 Correct 5 ms 1108 KB Output is correct
23 Correct 5 ms 1108 KB Output is correct
24 Correct 5 ms 1108 KB Output is correct
25 Correct 5 ms 1108 KB Output is correct
26 Correct 5 ms 1108 KB Output is correct
27 Correct 207 ms 38804 KB Output is correct
28 Correct 220 ms 38796 KB Output is correct
29 Correct 227 ms 38444 KB Output is correct
30 Correct 210 ms 38764 KB Output is correct
31 Correct 220 ms 38508 KB Output is correct
32 Correct 292 ms 38784 KB Output is correct
33 Correct 271 ms 38644 KB Output is correct
34 Correct 250 ms 38704 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 173 ms 12984 KB Output is correct
37 Correct 937 ms 38656 KB Output is correct
38 Correct 927 ms 38656 KB Output is correct
39 Correct 1160 ms 37588 KB Output is correct
40 Correct 305 ms 20308 KB Output is correct
41 Correct 113 ms 10708 KB Output is correct
42 Correct 16 ms 2440 KB Output is correct
43 Correct 904 ms 38640 KB Output is correct
44 Incorrect 1549 ms 38732 KB Output isn't correct
45 Halted 0 ms 0 KB -