oj.uz

Submission #773357

# Submission time Handle Problem Language Result Execution time Memory
773357 2023-07-05T01:00:35 Z xetrk Circle selection (APIO18_circle_selection) C++14
7 / 100
 3000 ms 62352 KB 
#pragma warning(disable:4996)

#include<bits/stdc++.h>
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];

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

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;
        circle.push_back({ x,y,r });
        sortRadius.push_back({ r,i });
        sortX.insert({ x,i });
        sortY.insert({ y,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);

    for (int curDelete = 0; curDelete < n; curDelete++)
    {
        cur = sortRadius[curDelete].second;
        if (ans[cur] != -1)
            continue;


        x = circle[cur][0], y = circle[cur][1], r = circle[cur][2];
        if (curDelete < n - 1)
            r2 = r + sortRadius[curDelete + 1].first + 1;
        else
            r2 = r * 2 + 1;

        auto xMin = lower_bound(sortX.begin(), sortX.end(), pair<ll, int>(x - r2, -1), comp);
        auto xMax = upper_bound(sortX.begin(), sortX.end(), pair<ll, int>(x + r2, 301000), comp);

        auto yMin = lower_bound(sortY.begin(), sortY.end(), pair<ll, int>(y - r2, -1), comp);
        auto yMax = upper_bound(sortY.begin(), sortY.end(), pair<ll, int>(y + r2, 301000), comp);

//        xMin--;
//        yMin--;

        if (xMin != sortX.begin()) xMin--;
        if (yMin != sortY.begin()) yMin--;

        //xMin = 0, yMin = 0, xMax = n - 1, yMax = n - 1;


        ans[cur] = cur;
        //xIdx[cur]

        set<pair<ll,int>>::iterator curX = xMin, curY = yMin, nextX, nextY;
        bool isBreak = false;

        while (curX!=sortX.end() && curY!=sortY.end())
        {
            curcmp = (*curX).second;
            rr = r + circle[curcmp][2];

            nextX = ++curX;
            nextY = ++curY;
            curX--;
            curY--;

            if (curX == xMax || curY == yMax)
                isBreak = true;

            if (ans[curcmp] == -1 && GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= rr * rr)
            {
                ans[curcmp] = cur;
                sortX.erase(curX);
            }

            curcmp = (*curY).second;
            rr = r + circle[curcmp][2];

            if (ans[curcmp] == -1 && GetDist(x, y, circle[curcmp][0], circle[curcmp][1]) <= rr * rr)
            {
                ans[curcmp] = cur;
                sortY.erase(curY);
            }

            if (isBreak)
                break;
            curX = nextX, curY = nextY;
        }

  
    }

    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:50:9: warning: unused variable 'i' [-Wunused-variable]
   50 |     int i;
      |         ^
circle_selection.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         scanf("%lld %lld %lld", &x, &y, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 6 ms 1308 KB Output is correct
20 Correct 6 ms 1348 KB Output is correct
21 Correct 7 ms 1236 KB Output is correct
22 Correct 2543 ms 1324 KB Output is correct
23 Correct 2537 ms 1320 KB Output is correct
24 Correct 2613 ms 1328 KB Output is correct
25 Correct 2543 ms 1324 KB Output is correct
26 Correct 2601 ms 1316 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 804 ms 62236 KB Output is correct
2 Correct 924 ms 62352 KB Output is correct
3 Correct 891 ms 61992 KB Output is correct
4 Correct 774 ms 62224 KB Output is correct
5 Execution timed out 3091 ms 60080 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 3047 ms 20244 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3072 ms 60208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 6 ms 1308 KB Output is correct
20 Correct 6 ms 1348 KB Output is correct
21 Correct 7 ms 1236 KB Output is correct
22 Correct 2543 ms 1324 KB Output is correct
23 Correct 2537 ms 1320 KB Output is correct
24 Correct 2613 ms 1328 KB Output is correct
25 Correct 2543 ms 1324 KB Output is correct
26 Correct 2601 ms 1316 KB Output is correct
27 Correct 16 ms 2324 KB Output is correct
28 Correct 13 ms 2348 KB Output is correct
29 Correct 12 ms 2280 KB Output is correct
30 Execution timed out 3062 ms 2316 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 6 ms 1308 KB Output is correct
20 Correct 6 ms 1348 KB Output is correct
21 Correct 7 ms 1236 KB Output is correct
22 Correct 2543 ms 1324 KB Output is correct
23 Correct 2537 ms 1320 KB Output is correct
24 Correct 2613 ms 1328 KB Output is correct
25 Correct 2543 ms 1324 KB Output is correct
26 Correct 2601 ms 1316 KB Output is correct
27 Correct 804 ms 62236 KB Output is correct
28 Correct 924 ms 62352 KB Output is correct
29 Correct 891 ms 61992 KB Output is correct
30 Correct 774 ms 62224 KB Output is correct
31 Execution timed out 3091 ms 60080 KB Time limit exceeded
32 Halted 0 ms 0 KB -