제출 #742069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
742069		speedyArda	원 고르기 (APIO18_circle_selection)	C++14	19 / 100	900 ms	48172 KiB

circle_selection

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

/*struct cmpset {
    bool operator()(pair<pair<int, int> , int> &a, pair<pair<int, int> , int> &b)
    {
        if(a.first.first != b.first.first)
            return a < b;
        if(a.first.second != b.first.second)
            return a.first.second > b.first.second;
        return a.second < b.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.first, circles[i].second.second});
            elems.insert({circles[i].first.first + circles[i].second.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";
            vector<int> toerase;
           // auto it = elems.lower_bound({{circles[i].first.first - circles[i].second.first, circles[i].first.first + circles[i].second.first},  circles[i].second.second});
            auto it = elems.lower_bound({circles[i].first.first + circles[i].second.first + 1, 0});
            it--;
            while((*it).first >= circles[i].first.first - circles[i].second.first)
            {
                toerase.push_back((*it).second);
                if(it == elems.begin()) 
                    break;
                it--;
            }

            for(int e : toerase)
            {
                //cout << i << " " << e << "\n";
                if(ans[circles[e].second.second] == 0) {
                    ans[circles[e].second.second] = circles[i].second.second + 1;
                    elems.erase(elems.find({circles[e].first.first - circles[e].second.first,  circles[e].second.second}));
                    elems.erase(elems.find({circles[e].first.first + circles[e].second.first, circles[e].second.second}));
                }
            }
        }
    }

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

컴파일 시 표준 에러 (stderr) 메시지

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:25:10: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
   25 | int main()
      |          ^
circle_selection.cpp:25:10: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
circle_selection.cpp:25:10: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
circle_selection.cpp:25:10: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13