oj.uz

Submission #741228

# Submission time Handle Problem Language Result Execution time Memory
741228 2023-05-13T22:27:05 Z speedyArda Circle selection (APIO18_circle_selection) C++14
7 / 100
 389 ms 25592 KB 
#include "bits/stdc++.h"
#pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
using namespace std;
const int MAXN = 3e5+5;
vector< pair < pair<int, int>, pair<int, int> > > circles;
vector<int> ans(MAXN, 0);
int id[MAXN];
bool cmp(int &a, int &b)
{
    if(circles[a].second.first != circles[b].second.first)
        return circles[a].second.first > circles[b].second.first;
    return circles[a].second.second < circles[b].second.second;
}
int main() 
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int maxy = -1e9;
    for(int i = 0; i < n; i++)
    {
        int x, y, r;

        cin >> x >> y >> r;
        maxy = max(maxy, y);
        circles.push_back({{x, y}, {r, i}});
        id[i] = i;
    }

    sort(id, id + n, cmp);
    //cout << "s\n";
    if(n <= 5e3 && maxy != 0)
    {
        for(int idx = 0; idx < n; idx++)
        {
            int i = id[idx];
            if(ans[circles[i].second.second] != 0)
                continue;
            //cout << circles[i].second.second << "\n";
            ans[circles[i].second.second] = circles[i].second.second + 1;
            for(int a = 0; a < n; a++)
            {
                if(ans[circles[a].second.second] == 0)
                {
                    long double dist = sqrt(pow(abs(circles[i].first.first - circles[a].first.first), 2) + pow(abs(circles[i].first.second - circles[a].first.second), 2));
                    if(dist <= circles[i].second.first + circles[a].second.first)
                        ans[circles[a].second.second] = circles[i].second.second + 1;
                }
            }
        }
    } else 
    {
        multiset< pair<int, int> > elems;
        for(int i = 0; i < n; i++)
        {
            elems.insert({circles[i].first.first, circles[i].second.second});
        }
        for(int idx = 0; idx < n; idx++)
        {
            int i = id[idx];
            if(ans[circles[i].second.second] != 0)
                continue;
            //cout << circles[i].second.second << "\n";
            auto it = elems.find({circles[i].first.first,  circles[i].second.second});
            auto prev = it;
            vector<int> toerase;
            if(it != elems.begin()) {
                it--;
                while(true)
                {
                    pair<int, int> temp = (*it);
                    if(abs(circles[i].first.first - temp.first) <= circles[i].second.first  + circles[temp.second].second.first)
                    {
                        toerase.push_back(temp.second);
                    } else
                        break;
                    if(it == elems.begin())
                        break;
                    it--;
                }
            }
            it = prev;
            while(it != elems.end())
            {
                pair<int, int> temp = (*it);
                if(abs(circles[i].first.first - temp.first) <= circles[i].second.first  + circles[temp.second].second.first)
                {
                    toerase.push_back(temp.second);
                } else
                    break;
                it++;
            }

            for(int e : toerase)
            {
                ans[circles[e].second.second] = circles[i].second.second + 1;
                elems.erase({circles[e].first.first,  circles[e].second.second});
            }
        }
    }

    for(int i = 0; i < n; i++)
        cout << ans[i] << " ";
    cout << "\n";
}

Compilation message

circle_selection.cpp:2:55: warning: bad option '-f O2' to pragma 'optimize' [-Wpragmas]
    2 | #pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
      |                                                       ^
circle_selection.cpp:2:55: warning: bad option '-f O3' to pragma 'optimize' [-Wpragmas]
circle_selection.cpp:2:55: warning: bad option '-f Ofast' to pragma 'optimize' [-Wpragmas]
circle_selection.cpp:2:55: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
circle_selection.cpp:8:24: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
    8 | bool cmp(int &a, int &b)
      |                        ^
circle_selection.cpp:8:24: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
circle_selection.cpp:8:24: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
circle_selection.cpp:8:24: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
circle_selection.cpp:14:10: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
   14 | int main()
      |          ^
circle_selection.cpp:14:10: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
circle_selection.cpp:14:10: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
circle_selection.cpp:14:10: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1512 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1508 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1492 KB Output is correct
17 Correct 2 ms 1492 KB Output is correct
18 Correct 2 ms 1524 KB Output is correct
19 Correct 4 ms 1916 KB Output is correct
20 Correct 3 ms 1932 KB Output is correct
21 Correct 4 ms 1876 KB Output is correct
22 Correct 105 ms 1876 KB Output is correct
23 Correct 109 ms 1860 KB Output is correct
24 Correct 101 ms 1864 KB Output is correct
25 Correct 127 ms 1856 KB Output is correct
26 Correct 116 ms 1856 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1512 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1508 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1492 KB Output is correct
17 Correct 2 ms 1492 KB Output is correct
18 Correct 2 ms 1524 KB Output is correct
19 Correct 4 ms 1916 KB Output is correct
20 Correct 3 ms 1932 KB Output is correct
21 Correct 4 ms 1876 KB Output is correct
22 Correct 105 ms 1876 KB Output is correct
23 Correct 109 ms 1860 KB Output is correct
24 Correct 101 ms 1864 KB Output is correct
25 Correct 127 ms 1856 KB Output is correct
26 Correct 116 ms 1856 KB Output is correct
27 Incorrect 10 ms 2600 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1512 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1508 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1492 KB Output is correct
17 Correct 2 ms 1492 KB Output is correct
18 Correct 2 ms 1524 KB Output is correct
19 Correct 4 ms 1916 KB Output is correct
20 Correct 3 ms 1932 KB Output is correct
21 Correct 4 ms 1876 KB Output is correct
22 Correct 105 ms 1876 KB Output is correct
23 Correct 109 ms 1860 KB Output is correct
24 Correct 101 ms 1864 KB Output is correct
25 Correct 127 ms 1856 KB Output is correct
26 Correct 116 ms 1856 KB Output is correct
27 Incorrect 389 ms 25592 KB Output isn't correct
28 Halted 0 ms 0 KB -