oj.uz

Submission #773350

# Submission time Handle Problem Language Result Execution time Memory
773350 2023-07-05T00:01:26 Z xetrk Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 38844 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[xIdx[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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 0 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 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 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 1108 KB Output is correct
20 Correct 5 ms 1108 KB Output is correct
21 Correct 4 ms 1108 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

# Verdict Execution time Memory Grader output
1 Correct 201 ms 38724 KB Output is correct
2 Correct 214 ms 38712 KB Output is correct
3 Correct 206 ms 38548 KB Output is correct
4 Correct 195 ms 38724 KB Output is correct
5 Correct 223 ms 38524 KB Output is correct
6 Correct 310 ms 38644 KB Output is correct
7 Correct 227 ms 38568 KB Output is correct
8 Correct 236 ms 38700 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 184 ms 12976 KB Output is correct
3 Correct 878 ms 38660 KB Output is correct
4 Correct 976 ms 38656 KB Output is correct
5 Correct 1138 ms 37712 KB Output is correct
6 Correct 288 ms 20264 KB Output is correct
7 Correct 94 ms 10716 KB Output is correct
8 Correct 16 ms 2440 KB Output is correct
9 Correct 936 ms 38772 KB Output is correct
10 Correct 1648 ms 38640 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 572 ms 38640 KB Output is correct
2 Correct 484 ms 38660 KB Output is correct
3 Correct 865 ms 38280 KB Output is correct
4 Correct 550 ms 38636 KB Output is correct
5 Correct 484 ms 38644 KB Output is correct
6 Correct 444 ms 38012 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 0 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 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 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 1108 KB Output is correct
20 Correct 5 ms 1108 KB Output is correct
21 Correct 4 ms 1108 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 1672 KB Output is correct
28 Correct 8 ms 1672 KB Output is correct
29 Correct 7 ms 1672 KB Output is correct
30 Correct 13 ms 1668 KB Output is correct
31 Correct 12 ms 1740 KB Output is correct
32 Correct 11 ms 1716 KB Output is correct
33 Correct 72 ms 12996 KB Output is correct
34 Correct 70 ms 13052 KB Output is correct
35 Correct 73 ms 12956 KB Output is correct
36 Correct 141 ms 12972 KB Output is correct
37 Correct 138 ms 13032 KB Output is correct
38 Correct 149 ms 13012 KB Output is correct
39 Correct 411 ms 12980 KB Output is correct
40 Correct 440 ms 12984 KB Output is correct
41 Correct 369 ms 13004 KB Output is correct
42 Correct 239 ms 12964 KB Output is correct
43 Correct 112 ms 13020 KB Output is correct
44 Correct 114 ms 12984 KB Output is correct
45 Correct 113 ms 12956 KB Output is correct
46 Correct 142 ms 12952 KB Output is correct
47 Correct 114 ms 12960 KB Output is correct
48 Correct 116 ms 12984 KB Output is correct
49 Correct 113 ms 13036 KB Output is correct
50 Correct 140 ms 12988 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 0 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 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 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 1108 KB Output is correct
20 Correct 5 ms 1108 KB Output is correct
21 Correct 4 ms 1108 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 201 ms 38724 KB Output is correct
28 Correct 214 ms 38712 KB Output is correct
29 Correct 206 ms 38548 KB Output is correct
30 Correct 195 ms 38724 KB Output is correct
31 Correct 223 ms 38524 KB Output is correct
32 Correct 310 ms 38644 KB Output is correct
33 Correct 227 ms 38568 KB Output is correct
34 Correct 236 ms 38700 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 184 ms 12976 KB Output is correct
37 Correct 878 ms 38660 KB Output is correct
38 Correct 976 ms 38656 KB Output is correct
39 Correct 1138 ms 37712 KB Output is correct
40 Correct 288 ms 20264 KB Output is correct
41 Correct 94 ms 10716 KB Output is correct
42 Correct 16 ms 2440 KB Output is correct
43 Correct 936 ms 38772 KB Output is correct
44 Correct 1648 ms 38640 KB Output is correct
45 Correct 572 ms 38640 KB Output is correct
46 Correct 484 ms 38660 KB Output is correct
47 Correct 865 ms 38280 KB Output is correct
48 Correct 550 ms 38636 KB Output is correct
49 Correct 484 ms 38644 KB Output is correct
50 Correct 444 ms 38012 KB Output is correct
51 Correct 7 ms 1672 KB Output is correct
52 Correct 8 ms 1672 KB Output is correct
53 Correct 7 ms 1672 KB Output is correct
54 Correct 13 ms 1668 KB Output is correct
55 Correct 12 ms 1740 KB Output is correct
56 Correct 11 ms 1716 KB Output is correct
57 Correct 72 ms 12996 KB Output is correct
58 Correct 70 ms 13052 KB Output is correct
59 Correct 73 ms 12956 KB Output is correct
60 Correct 141 ms 12972 KB Output is correct
61 Correct 138 ms 13032 KB Output is correct
62 Correct 149 ms 13012 KB Output is correct
63 Correct 411 ms 12980 KB Output is correct
64 Correct 440 ms 12984 KB Output is correct
65 Correct 369 ms 13004 KB Output is correct
66 Correct 239 ms 12964 KB Output is correct
67 Correct 112 ms 13020 KB Output is correct
68 Correct 114 ms 12984 KB Output is correct
69 Correct 113 ms 12956 KB Output is correct
70 Correct 142 ms 12952 KB Output is correct
71 Correct 114 ms 12960 KB Output is correct
72 Correct 116 ms 12984 KB Output is correct
73 Correct 113 ms 13036 KB Output is correct
74 Correct 140 ms 12988 KB Output is correct
75 Correct 240 ms 38504 KB Output is correct
76 Correct 258 ms 38716 KB Output is correct
77 Correct 246 ms 38844 KB Output is correct
78 Correct 239 ms 38444 KB Output is correct
79 Correct 315 ms 38700 KB Output is correct
80 Correct 238 ms 38436 KB Output is correct
81 Correct 828 ms 38660 KB Output is correct
82 Correct 723 ms 38656 KB Output is correct
83 Correct 760 ms 38660 KB Output is correct
84 Correct 1197 ms 38672 KB Output is correct
85 Correct 787 ms 38636 KB Output is correct
86 Correct 700 ms 38696 KB Output is correct
87 Correct 862 ms 38660 KB Output is correct
88 Execution timed out 3076 ms 36700 KB Time limit exceeded
89 Halted 0 ms 0 KB -