oj.uz

답안 #741175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
741175 2023-05-13T17:56:40 Z speedyArda 원 고르기 (APIO18_circle_selection) C++14
7 / 100
 3000 ms 22224 KB 
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 3e5+5;
vector< pair < pair<int, int>, pair<int, int> > > circles;
vector<int> ans(MAXN, 0);
bool cmp(pair < pair<int, int>, pair<int, int> > &a, pair < pair<int, int>, pair<int, int> > &b)
{
    if(a.second.first != b.second.first)
        return a.second.first > b.second.first;
    return a.second.second < b.second.second;
}
int main() 
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    int maxy = -1e9;
    for(int i = 0; i < n; i++)
    {
        int x = i + 1, y = 0, r = 1000;

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

    sort(circles.begin(), circles.end(), cmp);
    //cout << "s\n";
    if(n <= 5e3 && maxy != 0)
    {
        for(int i = 0; i < n; i++)
        {
            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 i = 0; i < n; i++)
        {
            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";
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 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 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 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 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 3 ms 1748 KB Output is correct
20 Correct 3 ms 1748 KB Output is correct
21 Correct 3 ms 1620 KB Output is correct
22 Correct 81 ms 1692 KB Output is correct
23 Correct 85 ms 1620 KB Output is correct
24 Correct 86 ms 1696 KB Output is correct
25 Correct 86 ms 1696 KB Output is correct
26 Correct 82 ms 1740 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3058 ms 22224 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 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 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 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 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 3 ms 1748 KB Output is correct
20 Correct 3 ms 1748 KB Output is correct
21 Correct 3 ms 1620 KB Output is correct
22 Correct 81 ms 1692 KB Output is correct
23 Correct 85 ms 1620 KB Output is correct
24 Correct 86 ms 1696 KB Output is correct
25 Correct 86 ms 1696 KB Output is correct
26 Correct 82 ms 1740 KB Output is correct
27 Incorrect 9 ms 2264 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 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 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 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 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 3 ms 1748 KB Output is correct
20 Correct 3 ms 1748 KB Output is correct
21 Correct 3 ms 1620 KB Output is correct
22 Correct 81 ms 1692 KB Output is correct
23 Correct 85 ms 1620 KB Output is correct
24 Correct 86 ms 1696 KB Output is correct
25 Correct 86 ms 1696 KB Output is correct
26 Correct 82 ms 1740 KB Output is correct
27 Execution timed out 3058 ms 22224 KB Time limit exceeded
28 Halted 0 ms 0 KB -