oj.uz

답안 #790910

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
790910 2023-07-23T09:21:42 Z xetrk 원 고르기 (APIO18_circle_selection) C++14
57 / 100
 3000 ms 165888 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;
}

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

    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:60:20: warning: variable 'posll' set but not used [-Wunused-but-set-variable]
   60 |     ll x, y, r, i, posll;
      |                    ^~~~~
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:110:22: warning: variable 'gridll' set but not used [-Wunused-but-set-variable]
  110 |     ll gridX, gridY, gridll, curll;
      |                      ^~~~~~
circle_selection.cpp:110:30: warning: variable 'curll' set but not used [-Wunused-but-set-variable]
  110 |     ll gridX, gridY, gridll, curll;
      |                              ^~~~~
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 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 304 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 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 724 KB Output is correct
19 Correct 7 ms 2516 KB Output is correct
20 Correct 7 ms 2276 KB Output is correct
21 Correct 8 ms 2388 KB Output is correct
22 Correct 14 ms 2516 KB Output is correct
23 Correct 13 ms 2492 KB Output is correct
24 Correct 12 ms 2504 KB Output is correct
25 Correct 12 ms 2472 KB Output is correct
26 Correct 13 ms 2420 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 788 ms 109660 KB Output is correct
2 Correct 893 ms 110460 KB Output is correct
3 Correct 860 ms 114420 KB Output is correct
4 Correct 768 ms 123556 KB Output is correct
5 Correct 789 ms 90936 KB Output is correct
6 Correct 1133 ms 100180 KB Output is correct
7 Correct 856 ms 91692 KB Output is correct
8 Correct 906 ms 93000 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 574 ms 41348 KB Output is correct
3 Correct 2285 ms 123524 KB Output is correct
4 Correct 2256 ms 123448 KB Output is correct
5 Correct 2012 ms 151880 KB Output is correct
6 Correct 767 ms 73424 KB Output is correct
7 Correct 342 ms 33660 KB Output is correct
8 Correct 41 ms 6720 KB Output is correct
9 Correct 2295 ms 165888 KB Output is correct
10 Correct 1816 ms 157872 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1635 ms 123124 KB Output is correct
2 Correct 1538 ms 123160 KB Output is correct
3 Correct 1219 ms 92408 KB Output is correct
4 Correct 1452 ms 123164 KB Output is correct
5 Correct 1444 ms 123164 KB Output is correct
6 Correct 1144 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 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 304 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 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 724 KB Output is correct
19 Correct 7 ms 2516 KB Output is correct
20 Correct 7 ms 2276 KB Output is correct
21 Correct 8 ms 2388 KB Output is correct
22 Correct 14 ms 2516 KB Output is correct
23 Correct 13 ms 2492 KB Output is correct
24 Correct 12 ms 2504 KB Output is correct
25 Correct 12 ms 2472 KB Output is correct
26 Correct 13 ms 2420 KB Output is correct
27 Correct 17 ms 3760 KB Output is correct
28 Correct 14 ms 3980 KB Output is correct
29 Correct 15 ms 3800 KB Output is correct
30 Correct 27 ms 4436 KB Output is correct
31 Correct 26 ms 4460 KB Output is correct
32 Correct 25 ms 4456 KB Output is correct
33 Correct 190 ms 43024 KB Output is correct
34 Correct 199 ms 36212 KB Output is correct
35 Correct 245 ms 34276 KB Output is correct
36 Correct 540 ms 41356 KB Output is correct
37 Correct 547 ms 41232 KB Output is correct
38 Correct 529 ms 41220 KB Output is correct
39 Correct 2747 ms 49468 KB Output is correct
40 Correct 2856 ms 53296 KB Output is correct
41 Execution timed out 3076 ms 53300 KB Time limit exceeded
42 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 308 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 304 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 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 724 KB Output is correct
19 Correct 7 ms 2516 KB Output is correct
20 Correct 7 ms 2276 KB Output is correct
21 Correct 8 ms 2388 KB Output is correct
22 Correct 14 ms 2516 KB Output is correct
23 Correct 13 ms 2492 KB Output is correct
24 Correct 12 ms 2504 KB Output is correct
25 Correct 12 ms 2472 KB Output is correct
26 Correct 13 ms 2420 KB Output is correct
27 Correct 788 ms 109660 KB Output is correct
28 Correct 893 ms 110460 KB Output is correct
29 Correct 860 ms 114420 KB Output is correct
30 Correct 768 ms 123556 KB Output is correct
31 Correct 789 ms 90936 KB Output is correct
32 Correct 1133 ms 100180 KB Output is correct
33 Correct 856 ms 91692 KB Output is correct
34 Correct 906 ms 93000 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 574 ms 41348 KB Output is correct
37 Correct 2285 ms 123524 KB Output is correct
38 Correct 2256 ms 123448 KB Output is correct
39 Correct 2012 ms 151880 KB Output is correct
40 Correct 767 ms 73424 KB Output is correct
41 Correct 342 ms 33660 KB Output is correct
42 Correct 41 ms 6720 KB Output is correct
43 Correct 2295 ms 165888 KB Output is correct
44 Correct 1816 ms 157872 KB Output is correct
45 Correct 1635 ms 123124 KB Output is correct
46 Correct 1538 ms 123160 KB Output is correct
47 Correct 1219 ms 92408 KB Output is correct
48 Correct 1452 ms 123164 KB Output is correct
49 Correct 1444 ms 123164 KB Output is correct
50 Correct 1144 ms 90088 KB Output is correct
51 Correct 17 ms 3760 KB Output is correct
52 Correct 14 ms 3980 KB Output is correct
53 Correct 15 ms 3800 KB Output is correct
54 Correct 27 ms 4436 KB Output is correct
55 Correct 26 ms 4460 KB Output is correct
56 Correct 25 ms 4456 KB Output is correct
57 Correct 190 ms 43024 KB Output is correct
58 Correct 199 ms 36212 KB Output is correct
59 Correct 245 ms 34276 KB Output is correct
60 Correct 540 ms 41356 KB Output is correct
61 Correct 547 ms 41232 KB Output is correct
62 Correct 529 ms 41220 KB Output is correct
63 Correct 2747 ms 49468 KB Output is correct
64 Correct 2856 ms 53296 KB Output is correct
65 Execution timed out 3076 ms 53300 KB Time limit exceeded
66 Halted 0 ms 0 KB -