oj.uz

답안 #52642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
52642 2018-06-26T10:31:16 Z Kubalionzzale 원 고르기 (APIO18_circle_selection) C++14
7 / 100
 1518 ms 35708 KB 
#include <iostream>
#include <set>
#include <math.h>
#include <algorithm>
#include <functional>
#include <iterator>

long double abss(long double x)
{
    if (x < 0)
        return -x;
    else
        return x;
}

long double sqr(long double x)
{
    return x * x;
}

struct compare {
    bool operator() (const std::pair<int, int>& lhs, const std::pair<int, int>& rhs) const {
        if (lhs.first != rhs.first)
            return lhs.first > rhs.first;
        else
            return lhs.second < rhs.second;
    }
};

struct circle
{
    int x, y, r;
};

circle circles[300010];

void firstSubtask(int n)
{
    std::set< std::pair<int, int>, compare > set;
    int visited[300010] = { 0 };
    int x[300010], y[300010], r[300010];
    for (int i = 1; i <= n; ++i)
    {
        std::cin >> x[i] >> y[i] >> r[i];
        set.insert(std::make_pair(r[i], i));
    }

    while (set.empty() == false)
    {
        std::pair<int, int> p = *set.begin();
        set.erase(set.begin());
        int xs = x[p.second], ys = y[p.second], rs = r[p.second];
        visited[p.second] = p.second;

        for (auto it = set.begin(); it != set.end();)
        {
            std::pair<int, int> sec = *it;
            int xq = x[sec.second], yq = y[sec.second], rq = r[sec.second];
            long double dist = sqrt(sqr(xq * 1.0 - xs * 1.0) + sqr(yq * 1.0 - ys * 1.0));

  //          std::cout << p.second << " " << sec.second << " " << dist << " " << rq * 1.0 + rs * 1.0 << "\n";

            if (dist <= rq * 1.0 + rs * 1.0)
            {
                visited[sec.second] = p.second;
                it = set.erase(it);
            }
            else
            {
                ++it;
            }
        }
    }

    for (int i = 1; i <= n; ++i)
    {
        std::cout << visited[i] << " ";
    }
}

void secondSubtask(int n)
{
    std::set< std::pair<int, int>, compare > radiuses;
    std::set< std::pair<int, int> > xses;
    for (int i = 0; i < n; ++i)
    {
        radiuses.insert(std::make_pair(circles[i].r, i));
        xses.insert(std::make_pair(circles[i].x, i));
    }

    int visited[300010] = { 0 };
    while (radiuses.empty() == false)
    {
        auto radius = radiuses.begin();
        std::pair<int, int> boss = *radius;
        radiuses.erase(radius);

        visited[boss.second] = boss.second;

        auto it = xses.find(std::make_pair(circles[boss.second].x, boss.second));
        int firstX = circles[boss.second].x;

        while (it != xses.begin())
        {
            --it;
            std::pair<int, int> under = *it;
            if (abss(firstX - under.first) <= circles[under.second].r + circles[boss.second].r)
            {
                it = xses.erase(it);
                visited[under.second] = boss.second;
                radiuses.erase(std::make_pair(circles[under.second].r, under.second));
            }
            else
                break;
        }

        it = xses.find(std::make_pair(circles[boss.second].x, boss.second));
        ++it;

        while (it != xses.end())
        {
            std::pair<int, int> under = *it;
            if (abss(firstX - under.first) <= circles[under.second].r + circles[boss.second].r)
            {
                it = xses.erase(it);
                visited[under.second] = boss.second;
                radiuses.erase(std::make_pair(circles[under.second].r, under.second));
            }
            else
                break;
        }

        xses.erase(std::make_pair(circles[boss.second].x, boss.second));
    }

    for (int i = 1; i <= n; ++i)
    {
        std::cout << visited[i] << " ";
    }
}

int main()
{
    int n;
    std::cin >> n;

    if (n <= 5000)
    {
        firstSubtask(n);
        return 0;
    }

    bool flag = true;
    for (int i = 1; i <= n; ++i)
    {
        std::cin >> circles[i].x >> circles[i].y >> circles[i].r;

        if (circles[i].y != 0)
        {
            flag = false;
        }
    }

    if (flag)
    {
        secondSubtask(n);
        return 0;
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1588 KB Output is correct
4 Correct 4 ms 1664 KB Output is correct
5 Correct 3 ms 1824 KB Output is correct
6 Correct 3 ms 1824 KB Output is correct
7 Correct 3 ms 1824 KB Output is correct
8 Correct 3 ms 1824 KB Output is correct
9 Correct 3 ms 1824 KB Output is correct
10 Correct 3 ms 1824 KB Output is correct
11 Correct 3 ms 1824 KB Output is correct
12 Correct 3 ms 1824 KB Output is correct
13 Correct 3 ms 1824 KB Output is correct
14 Correct 3 ms 1824 KB Output is correct
15 Correct 3 ms 1824 KB Output is correct
16 Correct 5 ms 1824 KB Output is correct
17 Correct 7 ms 1844 KB Output is correct
18 Correct 7 ms 1844 KB Output is correct
19 Correct 12 ms 2052 KB Output is correct
20 Correct 13 ms 2052 KB Output is correct
21 Correct 13 ms 2052 KB Output is correct
22 Correct 273 ms 2060 KB Output is correct
23 Correct 336 ms 2148 KB Output is correct
24 Correct 279 ms 2148 KB Output is correct
25 Correct 278 ms 2148 KB Output is correct
26 Correct 280 ms 2164 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1518 ms 35708 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 35708 KB Output is correct
2 Incorrect 151 ms 35708 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 438 ms 35708 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1588 KB Output is correct
4 Correct 4 ms 1664 KB Output is correct
5 Correct 3 ms 1824 KB Output is correct
6 Correct 3 ms 1824 KB Output is correct
7 Correct 3 ms 1824 KB Output is correct
8 Correct 3 ms 1824 KB Output is correct
9 Correct 3 ms 1824 KB Output is correct
10 Correct 3 ms 1824 KB Output is correct
11 Correct 3 ms 1824 KB Output is correct
12 Correct 3 ms 1824 KB Output is correct
13 Correct 3 ms 1824 KB Output is correct
14 Correct 3 ms 1824 KB Output is correct
15 Correct 3 ms 1824 KB Output is correct
16 Correct 5 ms 1824 KB Output is correct
17 Correct 7 ms 1844 KB Output is correct
18 Correct 7 ms 1844 KB Output is correct
19 Correct 12 ms 2052 KB Output is correct
20 Correct 13 ms 2052 KB Output is correct
21 Correct 13 ms 2052 KB Output is correct
22 Correct 273 ms 2060 KB Output is correct
23 Correct 336 ms 2148 KB Output is correct
24 Correct 279 ms 2148 KB Output is correct
25 Correct 278 ms 2148 KB Output is correct
26 Correct 280 ms 2164 KB Output is correct
27 Incorrect 17 ms 35708 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1588 KB Output is correct
4 Correct 4 ms 1664 KB Output is correct
5 Correct 3 ms 1824 KB Output is correct
6 Correct 3 ms 1824 KB Output is correct
7 Correct 3 ms 1824 KB Output is correct
8 Correct 3 ms 1824 KB Output is correct
9 Correct 3 ms 1824 KB Output is correct
10 Correct 3 ms 1824 KB Output is correct
11 Correct 3 ms 1824 KB Output is correct
12 Correct 3 ms 1824 KB Output is correct
13 Correct 3 ms 1824 KB Output is correct
14 Correct 3 ms 1824 KB Output is correct
15 Correct 3 ms 1824 KB Output is correct
16 Correct 5 ms 1824 KB Output is correct
17 Correct 7 ms 1844 KB Output is correct
18 Correct 7 ms 1844 KB Output is correct
19 Correct 12 ms 2052 KB Output is correct
20 Correct 13 ms 2052 KB Output is correct
21 Correct 13 ms 2052 KB Output is correct
22 Correct 273 ms 2060 KB Output is correct
23 Correct 336 ms 2148 KB Output is correct
24 Correct 279 ms 2148 KB Output is correct
25 Correct 278 ms 2148 KB Output is correct
26 Correct 280 ms 2164 KB Output is correct
27 Incorrect 1518 ms 35708 KB Output isn't correct
28 Halted 0 ms 0 KB -