oj.uz

답안 #774706

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


map<pair<ll, ll>, multiset<vector<ll>>> SetGrid(ll gridSize)
{
    map<pair<ll, ll>, multiset<vector<ll>>> myGrid;
    ll x, y, r, i;
    for (auto c = circleSet.begin(); c != circleSet.end(); c++)
    {
        x = (*c)[0], y = (*c)[1], r = (*c)[2], i = (*c)[3];
        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 * 4LL;
    map<pair<ll, ll>, multiset<vector<ll>>> gridAll = SetGrid(gridSize);
    ll gridX, gridY;
    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*4 && gridSize>2)
        {
            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 });
        (*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++)
            {
                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 });
                    }
                }

                for (auto eraseIt : eraseItems)
                    curGrids.erase(eraseIt);

            }
        }
  
    }

    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:74:17: warning: unused variable 'r2' [-Wunused-variable]
   74 |     ll x, y, r, r2;
      |                 ^~
circle_selection.cpp:75:9: warning: unused variable 'i' [-Wunused-variable]
   75 |     int i;
      |         ^
circle_selection.cpp:96:14: warning: unused variable 'curcmp' [-Wunused-variable]
   96 |     int cur, curcmp;
      |              ^~~~~~
circle_selection.cpp:98:8: warning: unused variable 'rr' [-Wunused-variable]
   98 |     ll rr;
      |        ^~
circle_selection.cpp:76:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:80:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |         scanf("%lld %lld %lld", &x, &y, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 1 ms 340 KB Output is correct
8 Correct 1 ms 372 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 724 KB Output is correct
17 Correct 2 ms 672 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 7 ms 2496 KB Output is correct
20 Correct 7 ms 2516 KB Output is correct
21 Correct 8 ms 2496 KB Output is correct
22 Correct 12 ms 2516 KB Output is correct
23 Correct 13 ms 2520 KB Output is correct
24 Correct 13 ms 2516 KB Output is correct
25 Correct 14 ms 2464 KB Output is correct
26 Correct 12 ms 2508 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 816 ms 129772 KB Output is correct
2 Correct 889 ms 110208 KB Output is correct
3 Correct 926 ms 124460 KB Output is correct
4 Correct 781 ms 136460 KB Output is correct
5 Correct 775 ms 95096 KB Output is correct
6 Correct 1218 ms 99996 KB Output is correct
7 Correct 924 ms 95640 KB Output is correct
8 Correct 967 ms 96256 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 635 ms 40960 KB Output is correct
3 Correct 2413 ms 123120 KB Output is correct
4 Correct 2388 ms 123068 KB Output is correct
5 Correct 2089 ms 141036 KB Output is correct
6 Correct 786 ms 70348 KB Output is correct
7 Correct 307 ms 32180 KB Output is correct
8 Correct 34 ms 6496 KB Output is correct
9 Correct 2448 ms 161688 KB Output is correct
10 Correct 1902 ms 149424 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1744 ms 123156 KB Output is correct
2 Correct 1511 ms 123168 KB Output is correct
3 Correct 1826 ms 90536 KB Output is correct
4 Correct 1436 ms 130676 KB Output is correct
5 Correct 1405 ms 130780 KB Output is correct
6 Correct 1793 ms 98312 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 1 ms 340 KB Output is correct
8 Correct 1 ms 372 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 724 KB Output is correct
17 Correct 2 ms 672 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 7 ms 2496 KB Output is correct
20 Correct 7 ms 2516 KB Output is correct
21 Correct 8 ms 2496 KB Output is correct
22 Correct 12 ms 2516 KB Output is correct
23 Correct 13 ms 2520 KB Output is correct
24 Correct 13 ms 2516 KB Output is correct
25 Correct 14 ms 2464 KB Output is correct
26 Correct 12 ms 2508 KB Output is correct
27 Correct 15 ms 4876 KB Output is correct
28 Correct 15 ms 4296 KB Output is correct
29 Correct 14 ms 4064 KB Output is correct
30 Correct 27 ms 4696 KB Output is correct
31 Correct 26 ms 4692 KB Output is correct
32 Correct 25 ms 4744 KB Output is correct
33 Correct 196 ms 46052 KB Output is correct
34 Correct 184 ms 46032 KB Output is correct
35 Correct 272 ms 39780 KB Output is correct
36 Correct 537 ms 43772 KB Output is correct
37 Correct 602 ms 43864 KB Output is correct
38 Correct 621 ms 43896 KB Output is correct
39 Execution timed out 3075 ms 52660 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 1 ms 340 KB Output is correct
8 Correct 1 ms 372 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 724 KB Output is correct
17 Correct 2 ms 672 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 7 ms 2496 KB Output is correct
20 Correct 7 ms 2516 KB Output is correct
21 Correct 8 ms 2496 KB Output is correct
22 Correct 12 ms 2516 KB Output is correct
23 Correct 13 ms 2520 KB Output is correct
24 Correct 13 ms 2516 KB Output is correct
25 Correct 14 ms 2464 KB Output is correct
26 Correct 12 ms 2508 KB Output is correct
27 Correct 816 ms 129772 KB Output is correct
28 Correct 889 ms 110208 KB Output is correct
29 Correct 926 ms 124460 KB Output is correct
30 Correct 781 ms 136460 KB Output is correct
31 Correct 775 ms 95096 KB Output is correct
32 Correct 1218 ms 99996 KB Output is correct
33 Correct 924 ms 95640 KB Output is correct
34 Correct 967 ms 96256 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 635 ms 40960 KB Output is correct
37 Correct 2413 ms 123120 KB Output is correct
38 Correct 2388 ms 123068 KB Output is correct
39 Correct 2089 ms 141036 KB Output is correct
40 Correct 786 ms 70348 KB Output is correct
41 Correct 307 ms 32180 KB Output is correct
42 Correct 34 ms 6496 KB Output is correct
43 Correct 2448 ms 161688 KB Output is correct
44 Correct 1902 ms 149424 KB Output is correct
45 Correct 1744 ms 123156 KB Output is correct
46 Correct 1511 ms 123168 KB Output is correct
47 Correct 1826 ms 90536 KB Output is correct
48 Correct 1436 ms 130676 KB Output is correct
49 Correct 1405 ms 130780 KB Output is correct
50 Correct 1793 ms 98312 KB Output is correct
51 Correct 15 ms 4876 KB Output is correct
52 Correct 15 ms 4296 KB Output is correct
53 Correct 14 ms 4064 KB Output is correct
54 Correct 27 ms 4696 KB Output is correct
55 Correct 26 ms 4692 KB Output is correct
56 Correct 25 ms 4744 KB Output is correct
57 Correct 196 ms 46052 KB Output is correct
58 Correct 184 ms 46032 KB Output is correct
59 Correct 272 ms 39780 KB Output is correct
60 Correct 537 ms 43772 KB Output is correct
61 Correct 602 ms 43864 KB Output is correct
62 Correct 621 ms 43896 KB Output is correct
63 Execution timed out 3075 ms 52660 KB Time limit exceeded
64 Halted 0 ms 0 KB -