oj.uz

Submission #52690

# Submission time Handle Problem Language Result Execution time Memory
52690 2018-06-26T11:20:32 Z Kubalionzzale Circle selection (APIO18_circle_selection) C++14
19 / 100
 2137 ms 49776 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> > right, left;
    for (int i = 1; i <= n; ++i)
    {
        radiuses.insert(std::make_pair(circles[i].r, i));
        right.insert(std::make_pair(circles[i].x + circles[i].r, i));
        left.insert(std::make_pair(circles[i].x - circles[i].r, 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 = right.find(std::make_pair(circles[boss.second].x + circles[boss.second].r, boss.second));
        int leftCheck = circles[boss.second].x - circles[boss.second].r;
        int rightCheck = circles[boss.second].x + circles[boss.second].r;

        while (it != right.begin())
        {
            --it;
            std::pair<int, int> under = *it;

    //        std::cout << boss.second << " " << boss.first << " " << under.first << " " << under.second << " " << leftCheck << "\n";
            if (under.first >= leftCheck)
            {
                it = right.erase(it);
                left.erase(std::make_pair(circles[under.second].x - circles[under.second].r, under.second));
                visited[under.second] = boss.second;
                radiuses.erase(std::make_pair(circles[under.second].r, under.second));
            }
            else
                break;
        }

        right.erase(std::make_pair(circles[boss.second].x + circles[boss.second].r, boss.second));
        it = left.find(std::make_pair(circles[boss.second].x - circles[boss.second].r, boss.second));
        ++it;

        while (it != left.end())
        {
            std::pair<int, int> under = *it;

  //          std::cout << boss.second << " " << boss.first << " " << under.first << " " << under.second << " " << rightCheck << "\n";
            if (under.first <= rightCheck)
            {
                it = left.erase(it);
                right.erase(std::make_pair(circles[under.second].x + circles[under.second].r, under.second));
                visited[under.second] = boss.second;
                radiuses.erase(std::make_pair(circles[under.second].r, under.second));
            }
            else
                break;
        }

        left.erase(left.find(std::make_pair(circles[boss.second].x - circles[boss.second].r, 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1544 KB Output is correct
4 Correct 4 ms 1620 KB Output is correct
5 Correct 3 ms 1672 KB Output is correct
6 Correct 4 ms 1672 KB Output is correct
7 Correct 4 ms 1672 KB Output is correct
8 Correct 3 ms 1748 KB Output is correct
9 Correct 3 ms 1748 KB Output is correct
10 Correct 3 ms 1748 KB Output is correct
11 Correct 3 ms 1764 KB Output is correct
12 Correct 3 ms 1764 KB Output is correct
13 Correct 3 ms 1764 KB Output is correct
14 Correct 3 ms 1764 KB Output is correct
15 Correct 3 ms 1764 KB Output is correct
16 Correct 5 ms 1764 KB Output is correct
17 Correct 5 ms 1764 KB Output is correct
18 Correct 5 ms 1764 KB Output is correct
19 Correct 13 ms 2020 KB Output is correct
20 Correct 13 ms 2020 KB Output is correct
21 Correct 13 ms 2036 KB Output is correct
22 Correct 293 ms 2124 KB Output is correct
23 Correct 266 ms 2196 KB Output is correct
24 Correct 310 ms 2196 KB Output is correct
25 Correct 309 ms 2212 KB Output is correct
26 Correct 310 ms 2220 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2115 ms 49696 KB Output is correct
2 Correct 2137 ms 49700 KB Output is correct
3 Correct 2100 ms 49700 KB Output is correct
4 Correct 2017 ms 49700 KB Output is correct
5 Correct 1861 ms 49700 KB Output is correct
6 Correct 1646 ms 49700 KB Output is correct
7 Correct 1632 ms 49728 KB Output is correct
8 Correct 1622 ms 49776 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 49776 KB Output is correct
2 Incorrect 148 ms 49776 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 428 ms 49776 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1544 KB Output is correct
4 Correct 4 ms 1620 KB Output is correct
5 Correct 3 ms 1672 KB Output is correct
6 Correct 4 ms 1672 KB Output is correct
7 Correct 4 ms 1672 KB Output is correct
8 Correct 3 ms 1748 KB Output is correct
9 Correct 3 ms 1748 KB Output is correct
10 Correct 3 ms 1748 KB Output is correct
11 Correct 3 ms 1764 KB Output is correct
12 Correct 3 ms 1764 KB Output is correct
13 Correct 3 ms 1764 KB Output is correct
14 Correct 3 ms 1764 KB Output is correct
15 Correct 3 ms 1764 KB Output is correct
16 Correct 5 ms 1764 KB Output is correct
17 Correct 5 ms 1764 KB Output is correct
18 Correct 5 ms 1764 KB Output is correct
19 Correct 13 ms 2020 KB Output is correct
20 Correct 13 ms 2020 KB Output is correct
21 Correct 13 ms 2036 KB Output is correct
22 Correct 293 ms 2124 KB Output is correct
23 Correct 266 ms 2196 KB Output is correct
24 Correct 310 ms 2196 KB Output is correct
25 Correct 309 ms 2212 KB Output is correct
26 Correct 310 ms 2220 KB Output is correct
27 Incorrect 18 ms 49776 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1544 KB Output is correct
4 Correct 4 ms 1620 KB Output is correct
5 Correct 3 ms 1672 KB Output is correct
6 Correct 4 ms 1672 KB Output is correct
7 Correct 4 ms 1672 KB Output is correct
8 Correct 3 ms 1748 KB Output is correct
9 Correct 3 ms 1748 KB Output is correct
10 Correct 3 ms 1748 KB Output is correct
11 Correct 3 ms 1764 KB Output is correct
12 Correct 3 ms 1764 KB Output is correct
13 Correct 3 ms 1764 KB Output is correct
14 Correct 3 ms 1764 KB Output is correct
15 Correct 3 ms 1764 KB Output is correct
16 Correct 5 ms 1764 KB Output is correct
17 Correct 5 ms 1764 KB Output is correct
18 Correct 5 ms 1764 KB Output is correct
19 Correct 13 ms 2020 KB Output is correct
20 Correct 13 ms 2020 KB Output is correct
21 Correct 13 ms 2036 KB Output is correct
22 Correct 293 ms 2124 KB Output is correct
23 Correct 266 ms 2196 KB Output is correct
24 Correct 310 ms 2196 KB Output is correct
25 Correct 309 ms 2212 KB Output is correct
26 Correct 310 ms 2220 KB Output is correct
27 Correct 2115 ms 49696 KB Output is correct
28 Correct 2137 ms 49700 KB Output is correct
29 Correct 2100 ms 49700 KB Output is correct
30 Correct 2017 ms 49700 KB Output is correct
31 Correct 1861 ms 49700 KB Output is correct
32 Correct 1646 ms 49700 KB Output is correct
33 Correct 1632 ms 49728 KB Output is correct
34 Correct 1622 ms 49776 KB Output is correct
35 Correct 3 ms 49776 KB Output is correct
36 Incorrect 148 ms 49776 KB Output isn't correct
37 Halted 0 ms 0 KB -