oj.uz

답안 #791185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
791185 2023-07-23T14:08:37 Z xetrk 원 고르기 (APIO18_circle_selection) C++17
72 / 100
 3000 ms 168036 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;
                auto nextCircle = curGrids.begin();
                multiset<vector<ll>>::iterator curCircle;
                while(nextCircle!=curGrids.end())
                {
                    curCircle = nextCircle;
                    nextCircle++;
                    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);


                        //curGrids.erase(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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 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 1 ms 340 KB Output is correct
13 Correct 1 ms 300 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 724 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 6 ms 2500 KB Output is correct
20 Correct 6 ms 2368 KB Output is correct
21 Correct 13 ms 2620 KB Output is correct
22 Correct 10 ms 2424 KB Output is correct
23 Correct 11 ms 2420 KB Output is correct
24 Correct 10 ms 2388 KB Output is correct
25 Correct 12 ms 2368 KB Output is correct
26 Correct 10 ms 2368 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 789 ms 147100 KB Output is correct
2 Correct 809 ms 146240 KB Output is correct
3 Correct 632 ms 121272 KB Output is correct
4 Correct 820 ms 134184 KB Output is correct
5 Correct 1312 ms 141376 KB Output is correct
6 Correct 2431 ms 140584 KB Output is correct
7 Correct 1974 ms 168036 KB Output is correct
8 Correct 1910 ms 162644 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 447 ms 42976 KB Output is correct
3 Correct 1924 ms 125360 KB Output is correct
4 Correct 1963 ms 125684 KB Output is correct
5 Execution timed out 3086 ms 157328 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1352 ms 124436 KB Output is correct
2 Correct 1367 ms 123672 KB Output is correct
3 Correct 818 ms 100564 KB Output is correct
4 Correct 1362 ms 123956 KB Output is correct
5 Correct 1366 ms 124252 KB Output is correct
6 Correct 753 ms 98588 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 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 1 ms 340 KB Output is correct
13 Correct 1 ms 300 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 724 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 6 ms 2500 KB Output is correct
20 Correct 6 ms 2368 KB Output is correct
21 Correct 13 ms 2620 KB Output is correct
22 Correct 10 ms 2424 KB Output is correct
23 Correct 11 ms 2420 KB Output is correct
24 Correct 10 ms 2388 KB Output is correct
25 Correct 12 ms 2368 KB Output is correct
26 Correct 10 ms 2368 KB Output is correct
27 Correct 34 ms 5388 KB Output is correct
28 Correct 12 ms 4192 KB Output is correct
29 Correct 15 ms 4360 KB Output is correct
30 Correct 21 ms 4464 KB Output is correct
31 Correct 21 ms 4384 KB Output is correct
32 Correct 21 ms 4364 KB Output is correct
33 Correct 165 ms 44228 KB Output is correct
34 Correct 176 ms 39056 KB Output is correct
35 Correct 981 ms 62480 KB Output is correct
36 Correct 423 ms 43200 KB Output is correct
37 Correct 442 ms 42876 KB Output is correct
38 Correct 496 ms 42836 KB Output is correct
39 Correct 2556 ms 49524 KB Output is correct
40 Correct 2596 ms 53184 KB Output is correct
41 Correct 2477 ms 53288 KB Output is correct
42 Correct 196 ms 34096 KB Output is correct
43 Correct 298 ms 40664 KB Output is correct
44 Correct 309 ms 40656 KB Output is correct
45 Correct 304 ms 40636 KB Output is correct
46 Correct 320 ms 40760 KB Output is correct
47 Correct 313 ms 40664 KB Output is correct
48 Correct 321 ms 40844 KB Output is correct
49 Correct 299 ms 40732 KB Output is correct
50 Correct 316 ms 40768 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 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 1 ms 340 KB Output is correct
13 Correct 1 ms 300 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 724 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 700 KB Output is correct
19 Correct 6 ms 2500 KB Output is correct
20 Correct 6 ms 2368 KB Output is correct
21 Correct 13 ms 2620 KB Output is correct
22 Correct 10 ms 2424 KB Output is correct
23 Correct 11 ms 2420 KB Output is correct
24 Correct 10 ms 2388 KB Output is correct
25 Correct 12 ms 2368 KB Output is correct
26 Correct 10 ms 2368 KB Output is correct
27 Correct 789 ms 147100 KB Output is correct
28 Correct 809 ms 146240 KB Output is correct
29 Correct 632 ms 121272 KB Output is correct
30 Correct 820 ms 134184 KB Output is correct
31 Correct 1312 ms 141376 KB Output is correct
32 Correct 2431 ms 140584 KB Output is correct
33 Correct 1974 ms 168036 KB Output is correct
34 Correct 1910 ms 162644 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 447 ms 42976 KB Output is correct
37 Correct 1924 ms 125360 KB Output is correct
38 Correct 1963 ms 125684 KB Output is correct
39 Execution timed out 3086 ms 157328 KB Time limit exceeded
40 Halted 0 ms 0 KB -