oj.uz

Submission #790941

# Submission time Handle Problem Language Result Execution time Memory
790941 2023-07-23T09:38:02 Z xetrk Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 154188 KB 
#pragma warning(disable:4996)

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


typedef long long ll;
typedef long double ld;

int n;

vector<vector<ll>> circle;

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

//int skipX[300100], skipY[300100];
//int xIdx[300100], yIdx[300100];

set<vector<ll>> circleSet;


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;
}

inline ll Pos2ll(ll x, ll y)
{
    return y * 3000000001L + x;
}

unordered_map<ll, multiset<vector<ll>>> SetGrid(ll gridSize)
{
    unordered_map<ll, multiset<vector<ll>>> myGrid;
    ll x, y, r, i, posll;
    for (auto c = circleSet.begin(); c != circleSet.end(); c++)
    {
        x = (*c)[0], y = (*c)[1], r = (*c)[2], i = (*c)[3];
        posll = Pos2ll(x / gridSize, y / gridSize);
        auto iter = myGrid.insert({ posll ,{{x,y,r,i}} });
        if (iter.second == false)
        {
            //auto iter = myGrid.find(posll);
            iter.first->second.insert({ x,y,r,i });
        }
    }

    return myGrid;

}

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;
        //좌표는 양수로만 그래야 그리드계산 편함
        //1000000000
        x += 1000000000L;
        y += 1000000000L;
        //1000000000
        circle.push_back({ x,y,r });
        circleSet.insert({ x,y,r,i });
        sortRadius.push_back({ r,i });
    }

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


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

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

    ll gridSize = sortRadius[0].first * 2LL;
    unordered_map<ll, multiset<vector<ll>>> gridAll = SetGrid(gridSize);

    ll gridX, gridY;
    ll nx, ny, nr, gridll, curll;
    int ni;

    multiset<vector<ll>> curGrids;


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

        if (gridSize / 2 >= sortRadius[curDelete].first * 2LL && gridSize / 2 >= 1)
        {
            gridSize /= 2;
            gridAll = SetGrid(gridSize);
        }

        ans[cur] = cur;

        x = circle[cur][0], y = circle[cur][1], r = circle[cur][2];

        gridX = x / gridSize, gridY = y / gridSize;
        circleSet.erase({ x,y,r,cur });
        gridll = Pos2ll(gridX, gridY);

        (*gridAll.find(gridll)).second.erase({ x,y,r,cur });

        for (int curGridX = gridX - 1; curGridX <= gridX + 1; curGridX++)
        {
            for (int curGridY = gridY - 1; curGridY <= gridY + 1; curGridY++)
            {
                curll = Pos2ll(curGridX, curGridY);
                auto ggg = gridAll.find(curll);
                if (ggg == gridAll.end())
                    continue;
                curGrids = (*ggg).second;
                vector<multiset<vector<ll>>::iterator> eraseItems;
                for (auto curCircle = curGrids.begin(); curCircle != curGrids.end(); curCircle++)
                {
                    nx = (*curCircle)[0], ny = (*curCircle)[1], nr = (*curCircle)[2], ni = (*curCircle)[3];
                    if (ans[ni] != -1)
                        continue;
                    if (GetDist(x, y, nx, ny) <= (r + nr) * (r + nr))
                    {
                        ans[ni] = cur;
                        eraseItems.push_back(curCircle);

                        circleSet.erase({ nx,ny,nr,ni });//log n 최대 n번
                    }
                }

                for (auto eraseIt : eraseItems)
                    curGrids.erase(eraseIt);//log n 최대 n*32 번

            }
        }

    }

    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:80:17: warning: unused variable 'r2' [-Wunused-variable]
   80 |     ll x, y, r, r2;
      |                 ^~
circle_selection.cpp:81:9: warning: unused variable 'i' [-Wunused-variable]
   81 |     int i;
      |         ^
circle_selection.cpp:103:14: warning: unused variable 'curcmp' [-Wunused-variable]
  103 |     int cur, curcmp;
      |              ^~~~~~
circle_selection.cpp:105:8: warning: unused variable 'rr' [-Wunused-variable]
  105 |     ll rr;
      |        ^~
circle_selection.cpp:82:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:86:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         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 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 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 7 ms 2388 KB Output is correct
20 Correct 7 ms 2132 KB Output is correct
21 Correct 8 ms 2220 KB Output is correct
22 Correct 10 ms 2260 KB Output is correct
23 Correct 11 ms 2316 KB Output is correct
24 Correct 10 ms 2260 KB Output is correct
25 Correct 10 ms 2260 KB Output is correct
26 Correct 13 ms 2308 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 828 ms 109440 KB Output is correct
2 Correct 899 ms 110288 KB Output is correct
3 Correct 902 ms 114156 KB Output is correct
4 Correct 807 ms 123292 KB Output is correct
5 Correct 779 ms 90628 KB Output is correct
6 Correct 1095 ms 99352 KB Output is correct
7 Correct 835 ms 89216 KB Output is correct
8 Correct 905 ms 90524 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 470 ms 40220 KB Output is correct
3 Correct 2012 ms 117260 KB Output is correct
4 Correct 2117 ms 117516 KB Output is correct
5 Correct 1957 ms 143460 KB Output is correct
6 Correct 752 ms 70364 KB Output is correct
7 Correct 268 ms 32380 KB Output is correct
8 Correct 30 ms 6468 KB Output is correct
9 Correct 2274 ms 154100 KB Output is correct
10 Correct 1843 ms 151428 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1502 ms 116528 KB Output is correct
2 Correct 1477 ms 116516 KB Output is correct
3 Correct 1236 ms 92032 KB Output is correct
4 Correct 1546 ms 116520 KB Output is correct
5 Correct 1569 ms 116532 KB Output is correct
6 Correct 1186 ms 90036 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 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 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 7 ms 2388 KB Output is correct
20 Correct 7 ms 2132 KB Output is correct
21 Correct 8 ms 2220 KB Output is correct
22 Correct 10 ms 2260 KB Output is correct
23 Correct 11 ms 2316 KB Output is correct
24 Correct 10 ms 2260 KB Output is correct
25 Correct 10 ms 2260 KB Output is correct
26 Correct 13 ms 2308 KB Output is correct
27 Correct 15 ms 3724 KB Output is correct
28 Correct 13 ms 3980 KB Output is correct
29 Correct 19 ms 3744 KB Output is correct
30 Correct 26 ms 4236 KB Output is correct
31 Correct 22 ms 4092 KB Output is correct
32 Correct 22 ms 4124 KB Output is correct
33 Correct 200 ms 42952 KB Output is correct
34 Correct 189 ms 36200 KB Output is correct
35 Correct 238 ms 34200 KB Output is correct
36 Correct 500 ms 40160 KB Output is correct
37 Correct 542 ms 40160 KB Output is correct
38 Correct 468 ms 40152 KB Output is correct
39 Correct 2743 ms 48192 KB Output is correct
40 Correct 2934 ms 52096 KB Output is correct
41 Correct 2765 ms 52088 KB Output is correct
42 Correct 294 ms 32464 KB Output is correct
43 Correct 366 ms 39004 KB Output is correct
44 Correct 335 ms 39080 KB Output is correct
45 Correct 342 ms 39008 KB Output is correct
46 Correct 329 ms 39084 KB Output is correct
47 Correct 335 ms 39000 KB Output is correct
48 Correct 312 ms 39056 KB Output is correct
49 Correct 349 ms 38964 KB Output is correct
50 Correct 338 ms 39072 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 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 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 7 ms 2388 KB Output is correct
20 Correct 7 ms 2132 KB Output is correct
21 Correct 8 ms 2220 KB Output is correct
22 Correct 10 ms 2260 KB Output is correct
23 Correct 11 ms 2316 KB Output is correct
24 Correct 10 ms 2260 KB Output is correct
25 Correct 10 ms 2260 KB Output is correct
26 Correct 13 ms 2308 KB Output is correct
27 Correct 828 ms 109440 KB Output is correct
28 Correct 899 ms 110288 KB Output is correct
29 Correct 902 ms 114156 KB Output is correct
30 Correct 807 ms 123292 KB Output is correct
31 Correct 779 ms 90628 KB Output is correct
32 Correct 1095 ms 99352 KB Output is correct
33 Correct 835 ms 89216 KB Output is correct
34 Correct 905 ms 90524 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 470 ms 40220 KB Output is correct
37 Correct 2012 ms 117260 KB Output is correct
38 Correct 2117 ms 117516 KB Output is correct
39 Correct 1957 ms 143460 KB Output is correct
40 Correct 752 ms 70364 KB Output is correct
41 Correct 268 ms 32380 KB Output is correct
42 Correct 30 ms 6468 KB Output is correct
43 Correct 2274 ms 154100 KB Output is correct
44 Correct 1843 ms 151428 KB Output is correct
45 Correct 1502 ms 116528 KB Output is correct
46 Correct 1477 ms 116516 KB Output is correct
47 Correct 1236 ms 92032 KB Output is correct
48 Correct 1546 ms 116520 KB Output is correct
49 Correct 1569 ms 116532 KB Output is correct
50 Correct 1186 ms 90036 KB Output is correct
51 Correct 15 ms 3724 KB Output is correct
52 Correct 13 ms 3980 KB Output is correct
53 Correct 19 ms 3744 KB Output is correct
54 Correct 26 ms 4236 KB Output is correct
55 Correct 22 ms 4092 KB Output is correct
56 Correct 22 ms 4124 KB Output is correct
57 Correct 200 ms 42952 KB Output is correct
58 Correct 189 ms 36200 KB Output is correct
59 Correct 238 ms 34200 KB Output is correct
60 Correct 500 ms 40160 KB Output is correct
61 Correct 542 ms 40160 KB Output is correct
62 Correct 468 ms 40152 KB Output is correct
63 Correct 2743 ms 48192 KB Output is correct
64 Correct 2934 ms 52096 KB Output is correct
65 Correct 2765 ms 52088 KB Output is correct
66 Correct 294 ms 32464 KB Output is correct
67 Correct 366 ms 39004 KB Output is correct
68 Correct 335 ms 39080 KB Output is correct
69 Correct 342 ms 39008 KB Output is correct
70 Correct 329 ms 39084 KB Output is correct
71 Correct 335 ms 39000 KB Output is correct
72 Correct 312 ms 39056 KB Output is correct
73 Correct 349 ms 38964 KB Output is correct
74 Correct 338 ms 39072 KB Output is correct
75 Correct 1000 ms 118688 KB Output is correct
76 Correct 935 ms 109232 KB Output is correct
77 Correct 796 ms 129760 KB Output is correct
78 Correct 868 ms 111520 KB Output is correct
79 Correct 1259 ms 91368 KB Output is correct
80 Correct 826 ms 102272 KB Output is correct
81 Correct 2056 ms 117540 KB Output is correct
82 Correct 2092 ms 117504 KB Output is correct
83 Correct 2168 ms 119168 KB Output is correct
84 Correct 2100 ms 117140 KB Output is correct
85 Correct 2312 ms 117508 KB Output is correct
86 Correct 2041 ms 117276 KB Output is correct
87 Correct 2027 ms 116796 KB Output is correct
88 Execution timed out 3087 ms 154188 KB Time limit exceeded
89 Halted 0 ms 0 KB -