oj.uz

Submission #790919

# Submission time Handle Problem Language Result Execution time Memory
790919 2023-07-23T09:25:41 Z xetrk Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 165628 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 -1;
    //return y * 3000000001L + x;
}

map<pair<ll, ll>, multiset<vector<ll>>> SetGrid(ll gridSize)
{
    map<pair<ll, 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);
        /*
        if (myGrid.insert({ {x / gridSize, y / gridSize},{{x,y,r,i}} }).second == false)
        {
            auto iter = myGrid.find({ x / gridSize, y / gridSize });
            (*iter).second.insert({ x,y,r,i });
        }*/
        auto iter = myGrid.insert({ {x / gridSize, y / gridSize},{{x,y,r,i}} });
        if (iter.second == false)
        {
            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;
        //좌표는 양수로만 그래야 그리드계산 편함
        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;
    map<pair<ll, ll>, multiset<vector<ll>>> gridAll = SetGrid(gridSize);
    ll gridX, gridY, gridll, curll;
    ll nx, ny, nr;
    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({ gridX,gridY })).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({ curGridX, curGridY });
                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 'std::map<std::pair<long long int, long long int>, std::multiset<std::vector<long long int> > > SetGrid(ll)':
circle_selection.cpp:61:20: warning: variable 'posll' set but not used [-Wunused-but-set-variable]
   61 |     ll x, y, r, i, posll;
      |                    ^~~~~
circle_selection.cpp: In function 'int main()':
circle_selection.cpp:87:17: warning: unused variable 'r2' [-Wunused-variable]
   87 |     ll x, y, r, r2;
      |                 ^~
circle_selection.cpp:88:9: warning: unused variable 'i' [-Wunused-variable]
   88 |     int i;
      |         ^
circle_selection.cpp:109:14: warning: unused variable 'curcmp' [-Wunused-variable]
  109 |     int cur, curcmp;
      |              ^~~~~~
circle_selection.cpp:111:8: warning: unused variable 'rr' [-Wunused-variable]
  111 |     ll rr;
      |        ^~
circle_selection.cpp:117:22: warning: variable 'gridll' set but not used [-Wunused-but-set-variable]
  117 |     ll gridX, gridY, gridll, curll;
      |                      ^~~~~~
circle_selection.cpp:117:30: warning: variable 'curll' set but not used [-Wunused-but-set-variable]
  117 |     ll gridX, gridY, gridll, curll;
      |                              ^~~~~
circle_selection.cpp:89:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:93:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |         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 0 ms 340 KB Output is correct
10 Correct 0 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 1 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 596 KB Output is correct
19 Correct 7 ms 2448 KB Output is correct
20 Correct 7 ms 2132 KB Output is correct
21 Correct 7 ms 2260 KB Output is correct
22 Correct 12 ms 2388 KB Output is correct
23 Correct 13 ms 2388 KB Output is correct
24 Correct 14 ms 2400 KB Output is correct
25 Correct 12 ms 2388 KB Output is correct
26 Correct 12 ms 2388 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 834 ms 109392 KB Output is correct
2 Correct 877 ms 110260 KB Output is correct
3 Correct 895 ms 114196 KB Output is correct
4 Correct 795 ms 123324 KB Output is correct
5 Correct 779 ms 90752 KB Output is correct
6 Correct 1152 ms 99924 KB Output is correct
7 Correct 810 ms 91348 KB Output is correct
8 Correct 867 ms 92652 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 554 ms 41072 KB Output is correct
3 Correct 2172 ms 123244 KB Output is correct
4 Correct 2222 ms 123212 KB Output is correct
5 Correct 1973 ms 151560 KB Output is correct
6 Correct 756 ms 73156 KB Output is correct
7 Correct 310 ms 33432 KB Output is correct
8 Correct 34 ms 6576 KB Output is correct
9 Correct 2232 ms 165628 KB Output is correct
10 Correct 1870 ms 157832 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1584 ms 123196 KB Output is correct
2 Correct 1582 ms 123176 KB Output is correct
3 Correct 1243 ms 92800 KB Output is correct
4 Correct 1601 ms 123552 KB Output is correct
5 Correct 1500 ms 123564 KB Output is correct
6 Correct 1179 ms 90512 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 0 ms 340 KB Output is correct
10 Correct 0 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 1 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 596 KB Output is correct
19 Correct 7 ms 2448 KB Output is correct
20 Correct 7 ms 2132 KB Output is correct
21 Correct 7 ms 2260 KB Output is correct
22 Correct 12 ms 2388 KB Output is correct
23 Correct 13 ms 2388 KB Output is correct
24 Correct 14 ms 2400 KB Output is correct
25 Correct 12 ms 2388 KB Output is correct
26 Correct 12 ms 2388 KB Output is correct
27 Correct 16 ms 3944 KB Output is correct
28 Correct 15 ms 4204 KB Output is correct
29 Correct 18 ms 4000 KB Output is correct
30 Correct 27 ms 4704 KB Output is correct
31 Correct 35 ms 4716 KB Output is correct
32 Correct 27 ms 4692 KB Output is correct
33 Correct 204 ms 43364 KB Output is correct
34 Correct 199 ms 36692 KB Output is correct
35 Correct 263 ms 34660 KB Output is correct
36 Correct 573 ms 41768 KB Output is correct
37 Correct 558 ms 41612 KB Output is correct
38 Correct 552 ms 41612 KB Output is correct
39 Correct 2966 ms 49728 KB Output is correct
40 Correct 2911 ms 52336 KB Output is correct
41 Correct 2782 ms 52328 KB Output is correct
42 Correct 337 ms 34564 KB Output is correct
43 Correct 351 ms 43260 KB Output is correct
44 Correct 376 ms 43312 KB Output is correct
45 Correct 343 ms 43200 KB Output is correct
46 Correct 380 ms 43296 KB Output is correct
47 Correct 362 ms 43244 KB Output is correct
48 Correct 364 ms 43244 KB Output is correct
49 Correct 346 ms 43220 KB Output is correct
50 Correct 361 ms 43276 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 0 ms 340 KB Output is correct
10 Correct 0 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 1 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 596 KB Output is correct
19 Correct 7 ms 2448 KB Output is correct
20 Correct 7 ms 2132 KB Output is correct
21 Correct 7 ms 2260 KB Output is correct
22 Correct 12 ms 2388 KB Output is correct
23 Correct 13 ms 2388 KB Output is correct
24 Correct 14 ms 2400 KB Output is correct
25 Correct 12 ms 2388 KB Output is correct
26 Correct 12 ms 2388 KB Output is correct
27 Correct 834 ms 109392 KB Output is correct
28 Correct 877 ms 110260 KB Output is correct
29 Correct 895 ms 114196 KB Output is correct
30 Correct 795 ms 123324 KB Output is correct
31 Correct 779 ms 90752 KB Output is correct
32 Correct 1152 ms 99924 KB Output is correct
33 Correct 810 ms 91348 KB Output is correct
34 Correct 867 ms 92652 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 554 ms 41072 KB Output is correct
37 Correct 2172 ms 123244 KB Output is correct
38 Correct 2222 ms 123212 KB Output is correct
39 Correct 1973 ms 151560 KB Output is correct
40 Correct 756 ms 73156 KB Output is correct
41 Correct 310 ms 33432 KB Output is correct
42 Correct 34 ms 6576 KB Output is correct
43 Correct 2232 ms 165628 KB Output is correct
44 Correct 1870 ms 157832 KB Output is correct
45 Correct 1584 ms 123196 KB Output is correct
46 Correct 1582 ms 123176 KB Output is correct
47 Correct 1243 ms 92800 KB Output is correct
48 Correct 1601 ms 123552 KB Output is correct
49 Correct 1500 ms 123564 KB Output is correct
50 Correct 1179 ms 90512 KB Output is correct
51 Correct 16 ms 3944 KB Output is correct
52 Correct 15 ms 4204 KB Output is correct
53 Correct 18 ms 4000 KB Output is correct
54 Correct 27 ms 4704 KB Output is correct
55 Correct 35 ms 4716 KB Output is correct
56 Correct 27 ms 4692 KB Output is correct
57 Correct 204 ms 43364 KB Output is correct
58 Correct 199 ms 36692 KB Output is correct
59 Correct 263 ms 34660 KB Output is correct
60 Correct 573 ms 41768 KB Output is correct
61 Correct 558 ms 41612 KB Output is correct
62 Correct 552 ms 41612 KB Output is correct
63 Correct 2966 ms 49728 KB Output is correct
64 Correct 2911 ms 52336 KB Output is correct
65 Correct 2782 ms 52328 KB Output is correct
66 Correct 337 ms 34564 KB Output is correct
67 Correct 351 ms 43260 KB Output is correct
68 Correct 376 ms 43312 KB Output is correct
69 Correct 343 ms 43200 KB Output is correct
70 Correct 380 ms 43296 KB Output is correct
71 Correct 362 ms 43244 KB Output is correct
72 Correct 364 ms 43244 KB Output is correct
73 Correct 346 ms 43220 KB Output is correct
74 Correct 361 ms 43276 KB Output is correct
75 Correct 1048 ms 128000 KB Output is correct
76 Correct 992 ms 118028 KB Output is correct
77 Correct 836 ms 138696 KB Output is correct
78 Correct 836 ms 120600 KB Output is correct
79 Correct 1296 ms 100068 KB Output is correct
80 Correct 871 ms 111288 KB Output is correct
81 Correct 2112 ms 131320 KB Output is correct
82 Correct 2299 ms 131084 KB Output is correct
83 Correct 2273 ms 130968 KB Output is correct
84 Correct 2329 ms 131404 KB Output is correct
85 Correct 2269 ms 131092 KB Output is correct
86 Correct 2176 ms 131248 KB Output is correct
87 Correct 2373 ms 130472 KB Output is correct
88 Execution timed out 3093 ms 157412 KB Time limit exceeded
89 Halted 0 ms 0 KB -