oj.uz

답안 #790656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
790656 2023-07-23T04:47:17 Z xetrk 원 고르기 (APIO18_circle_selection) C++14
57 / 100
 3000 ms 154088 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 * 2000000001L + 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;
        //좌표는 양수로만 그래야 그리드계산 편함
        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:102:14: warning: unused variable 'curcmp' [-Wunused-variable]
  102 |     int cur, curcmp;
      |              ^~~~~~
circle_selection.cpp:104:8: warning: unused variable 'rr' [-Wunused-variable]
  104 |     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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 240 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 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 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 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 340 KB Output is correct
16 Correct 3 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 2252 KB Output is correct
22 Correct 10 ms 2304 KB Output is correct
23 Correct 10 ms 2236 KB Output is correct
24 Correct 10 ms 2260 KB Output is correct
25 Correct 10 ms 2308 KB Output is correct
26 Correct 11 ms 2472 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 836 ms 109340 KB Output is correct
2 Correct 931 ms 110324 KB Output is correct
3 Correct 896 ms 114160 KB Output is correct
4 Correct 834 ms 123276 KB Output is correct
5 Correct 875 ms 90516 KB Output is correct
6 Correct 1222 ms 99144 KB Output is correct
7 Correct 813 ms 89236 KB Output is correct
8 Correct 865 ms 90604 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 485 ms 40196 KB Output is correct
3 Correct 2071 ms 119156 KB Output is correct
4 Correct 2144 ms 117556 KB Output is correct
5 Correct 2061 ms 143460 KB Output is correct
6 Correct 708 ms 70384 KB Output is correct
7 Correct 268 ms 32488 KB Output is correct
8 Correct 29 ms 6500 KB Output is correct
9 Correct 2415 ms 154088 KB Output is correct
10 Correct 1846 ms 151428 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1526 ms 116588 KB Output is correct
2 Correct 1544 ms 116592 KB Output is correct
3 Correct 1133 ms 92016 KB Output is correct
4 Correct 1509 ms 116624 KB Output is correct
5 Correct 1500 ms 116568 KB Output is correct
6 Correct 1160 ms 90088 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 1 ms 240 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 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 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 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 340 KB Output is correct
16 Correct 3 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 2252 KB Output is correct
22 Correct 10 ms 2304 KB Output is correct
23 Correct 10 ms 2236 KB Output is correct
24 Correct 10 ms 2260 KB Output is correct
25 Correct 10 ms 2308 KB Output is correct
26 Correct 11 ms 2472 KB Output is correct
27 Correct 14 ms 3720 KB Output is correct
28 Correct 14 ms 4052 KB Output is correct
29 Correct 14 ms 3724 KB Output is correct
30 Correct 21 ms 4208 KB Output is correct
31 Correct 21 ms 4208 KB Output is correct
32 Correct 22 ms 4140 KB Output is correct
33 Correct 197 ms 42960 KB Output is correct
34 Correct 191 ms 36280 KB Output is correct
35 Correct 253 ms 34200 KB Output is correct
36 Correct 462 ms 40144 KB Output is correct
37 Correct 494 ms 40220 KB Output is correct
38 Correct 505 ms 40228 KB Output is correct
39 Correct 2772 ms 48216 KB Output is correct
40 Execution timed out 3058 ms 52100 KB Time limit exceeded
41 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 1 ms 240 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 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 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 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 340 KB Output is correct
16 Correct 3 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 2252 KB Output is correct
22 Correct 10 ms 2304 KB Output is correct
23 Correct 10 ms 2236 KB Output is correct
24 Correct 10 ms 2260 KB Output is correct
25 Correct 10 ms 2308 KB Output is correct
26 Correct 11 ms 2472 KB Output is correct
27 Correct 836 ms 109340 KB Output is correct
28 Correct 931 ms 110324 KB Output is correct
29 Correct 896 ms 114160 KB Output is correct
30 Correct 834 ms 123276 KB Output is correct
31 Correct 875 ms 90516 KB Output is correct
32 Correct 1222 ms 99144 KB Output is correct
33 Correct 813 ms 89236 KB Output is correct
34 Correct 865 ms 90604 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 485 ms 40196 KB Output is correct
37 Correct 2071 ms 119156 KB Output is correct
38 Correct 2144 ms 117556 KB Output is correct
39 Correct 2061 ms 143460 KB Output is correct
40 Correct 708 ms 70384 KB Output is correct
41 Correct 268 ms 32488 KB Output is correct
42 Correct 29 ms 6500 KB Output is correct
43 Correct 2415 ms 154088 KB Output is correct
44 Correct 1846 ms 151428 KB Output is correct
45 Correct 1526 ms 116588 KB Output is correct
46 Correct 1544 ms 116592 KB Output is correct
47 Correct 1133 ms 92016 KB Output is correct
48 Correct 1509 ms 116624 KB Output is correct
49 Correct 1500 ms 116568 KB Output is correct
50 Correct 1160 ms 90088 KB Output is correct
51 Correct 14 ms 3720 KB Output is correct
52 Correct 14 ms 4052 KB Output is correct
53 Correct 14 ms 3724 KB Output is correct
54 Correct 21 ms 4208 KB Output is correct
55 Correct 21 ms 4208 KB Output is correct
56 Correct 22 ms 4140 KB Output is correct
57 Correct 197 ms 42960 KB Output is correct
58 Correct 191 ms 36280 KB Output is correct
59 Correct 253 ms 34200 KB Output is correct
60 Correct 462 ms 40144 KB Output is correct
61 Correct 494 ms 40220 KB Output is correct
62 Correct 505 ms 40228 KB Output is correct
63 Correct 2772 ms 48216 KB Output is correct
64 Execution timed out 3058 ms 52100 KB Time limit exceeded
65 Halted 0 ms 0 KB -