oj.uz

Submission #864648

# Submission time Handle Problem Language Result Execution time Memory
864648 2023-10-23T11:14:23 Z danikoynov Circle selection (APIO18_circle_selection) C++14
7 / 100
 3000 ms 61012 KB 
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

struct point
{
    ll x, y;
};

struct circle
{
    point centre;
    ll radius;
};

const int maxn = 3e5 + 10;

int n;
circle c[maxn];

void input()
{
    cin >> n;
    for (int i = 1; i <= n; i ++)
        cin >> c[i].centre.x >> c[i].centre.y >> c[i].radius;
}

int used[maxn], par[maxn];

int find_biggest()
{
    int idx = -1;
    for (int i = 1; i <= n; i ++)
    {
        if (used[i])
            continue;
        if (idx == -1 || c[i].radius > c[idx].radius)
            idx = i;
    }

    return idx;
}

ll distance(point A, point B)
{
    ll dx = (A.x - B.x);
    ll dy = (A.y - B.y);

    return dx * dx + dy * dy;
}
void simulate()
{
    while(true)
    {
        int idx = find_biggest();
        if (idx == -1)
            break;
        ///cout << "current " << idx << endl;
        for (int i = 1; i <= n; i ++)
        {
            if (used[i] == 1)
                continue;
            
            if (distance(c[idx].centre, c[i].centre) <=
                 (c[idx].radius + c[i].radius) * (c[idx].radius + c[i].radius))
                used[i] = 1, par[i] = idx;
        }
        
    }
}


void print()
{
    for (int i = 1; i <= n; i ++)
        cout << par[i] << " ";
    cout << endl;
}


void solve_subtask_2()
{
    set < pair < int, int > > lf, rf;
    set < pair < int, int > > act;

    for (int i = 1; i <= n; i ++)
    {
        lf.insert(make_pair(c[i].centre.x - c[i].radius, i));
        rf.insert(make_pair(c[i].centre.x + c[i].radius, i));
        act.insert(make_pair(c[i].radius, i));
    }
    
    int last = n + 1;
    while(!act.empty())
    {
        int idx = act.rbegin() -> second;
        int left = c[idx].centre.x - c[idx].radius;
        int right = c[idx].centre.x + c[idx].radius;

        while(true)
        {
            set < pair < int, int > > :: iterator it = lf.lower_bound({left, -1});
            if (it == lf.end())
                break;

            if (it -> first <= right)
            {
                int i = it -> second;
                par[i] = idx;
                lf.erase(make_pair(c[i].centre.x - c[i].radius, i));
                rf.erase(make_pair(c[i].centre.x + c[i].radius, i));
                act.erase(make_pair(c[i].radius, i));
            }
            else
            {
                break;
            }
        }


        while(true)
        {
            set < pair < int, int > > :: iterator it = rf.upper_bound({right, -1});
            if (it == rf.begin())
                break;
            it = prev(it);
            if (it -> first >= left)
            {
                int i = it -> second;
                par[i] = idx;
                lf.erase(make_pair(c[i].centre.x - c[i].radius, i));
                rf.erase(make_pair(c[i].centre.x + c[i].radius, i));
                act.erase(make_pair(c[i].radius, i));
            }
            else
            {
                break;
            }
        }

    }

}
void solve()
{
    input();
    bool all_on_x = true;
    for (int i = 1; i <= n; i ++)
    {
        if (c[i].centre.y != 0)
            all_on_x = false;
    }
    if (all_on_x)
        solve_subtask_2();
    else
        simulate();
    print();
}
int main()
{
    solve();
    return 0;
}

/**
11
9 9 2
13 2 1
11 8 2
3 3 2
3 12 1
12 14 1
9 8 5
2 8 2
5 2 1
14 4 2
14 14 1

11
9 0 2
13 0 1
11 0 2
3 0 2
3 0 1
12 0 1
9 0 5
2 0 2
5 0 1
14 0 2
14 0 1

1 2 2 4 5 2 5 4 5 2 2
*/

Compilation message

circle_selection.cpp: In function 'void solve_subtask_2()':
circle_selection.cpp:94:9: warning: unused variable 'last' [-Wunused-variable]
   94 |     int last = n + 1;
      |         ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2496 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 5 ms 2396 KB Output is correct
20 Correct 5 ms 2396 KB Output is correct
21 Correct 5 ms 2396 KB Output is correct
22 Correct 108 ms 2536 KB Output is correct
23 Correct 107 ms 2396 KB Output is correct
24 Correct 108 ms 2392 KB Output is correct
25 Correct 109 ms 2516 KB Output is correct
26 Correct 110 ms 2520 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1207 ms 54120 KB Output is correct
2 Correct 1135 ms 60968 KB Output is correct
3 Correct 1063 ms 60708 KB Output is correct
4 Correct 1113 ms 61012 KB Output is correct
5 Incorrect 956 ms 58768 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Execution timed out 3083 ms 5544 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 3048 ms 7764 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 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2496 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 5 ms 2396 KB Output is correct
20 Correct 5 ms 2396 KB Output is correct
21 Correct 5 ms 2396 KB Output is correct
22 Correct 108 ms 2536 KB Output is correct
23 Correct 107 ms 2396 KB Output is correct
24 Correct 108 ms 2392 KB Output is correct
25 Correct 109 ms 2516 KB Output is correct
26 Correct 110 ms 2520 KB Output is correct
27 Correct 10 ms 2396 KB Output is correct
28 Correct 12 ms 2488 KB Output is correct
29 Correct 11 ms 2492 KB Output is correct
30 Correct 535 ms 2568 KB Output is correct
31 Correct 540 ms 2552 KB Output is correct
32 Correct 533 ms 2644 KB Output is correct
33 Correct 92 ms 5800 KB Output is correct
34 Correct 91 ms 5792 KB Output is correct
35 Correct 95 ms 5712 KB Output is correct
36 Execution timed out 3021 ms 5576 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2496 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 5 ms 2396 KB Output is correct
20 Correct 5 ms 2396 KB Output is correct
21 Correct 5 ms 2396 KB Output is correct
22 Correct 108 ms 2536 KB Output is correct
23 Correct 107 ms 2396 KB Output is correct
24 Correct 108 ms 2392 KB Output is correct
25 Correct 109 ms 2516 KB Output is correct
26 Correct 110 ms 2520 KB Output is correct
27 Correct 1207 ms 54120 KB Output is correct
28 Correct 1135 ms 60968 KB Output is correct
29 Correct 1063 ms 60708 KB Output is correct
30 Correct 1113 ms 61012 KB Output is correct
31 Incorrect 956 ms 58768 KB Output isn't correct
32 Halted 0 ms 0 KB -