oj.uz

답안 #982376

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982376 2024-05-14T07:41:00 Z Muhammad_Aneeq 원 고르기 (APIO18_circle_selection) C++17
7 / 100
 3000 ms 49120 KB 
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
#define int long long
int man(pair<int,int>a,pair<int,int>b)
{
    return ((a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));
}
inline void solve()
{
    int n;
    cin>>n;
    pair<int,int>a[n];
    bool w=0;
    set<pair<int,int>>s;
    int ra[n]={};
    for (int i=0;i<n;i++)
    {
        int x,y,r;
        cin>>x>>y>>r;
        a[i]={x,y};
        if (y!=0)
            w=1;
        s.insert({-r,i});
        ra[i]=r;
    }  
    if (w==0)
    {
        bool vis[n]={};
        vector<vector<int>>f;
        for (int i=0;i<n;i++)
            f.push_back({a[i].first,ra[i],i});
        sort(begin(f),end(f));
        int ans[n]={};
        while (s.size())
        {
            int r=(*begin(s)).first,i=(*begin(s)).second;
            s.erase(*begin(s));
            ans[i]=i;
            vector<int>z={a[i].first,ra[i],i};
            int ind=lower_bound(begin(f),end(f),z)-begin(f);
            vis[ind]=1;
            for (int j=ind+1;j<n;j++)
            {
                if (vis[j])
                    break;
                int z=f[j][0]-f[ind][0];
                if (z<=abs(r)+abs(f[j][1]))
                {
                    s.erase({-f[j][1],f[j][2]});
                    vis[j]=1;
                    ans[f[j][2]]=i;
                }
                else
                    break;
            }
            for (int j=ind-1;j>=0;j--)
            {
                if (vis[j])
                    break;
                int z=f[j][0]-f[ind][0];
                if (z<=abs(r)+abs(f[j][1]))
                {
                    s.erase({-f[j][1],f[j][2]});
                    vis[j]=1;
                    ans[f[j][2]]=i;
                }
                else
                    break;
            }
        }
        for (auto i:ans)
            cout<<i+1<<' ';
        cout<<endl;
        return;
    }
    else
    {
        int ans[n]={};
        while (s.size())
        {
            int r=(*begin(s)).first,i=(*begin(s)).second;
            s.erase(*begin(s));
            ans[i]=i;
            vector<pair<int,int>>z;
            for (auto [r1,j]:s)
            {
                int dis=man(a[i],a[j]);
                if (dis<=((r+r1)*(r+r1)))
                    z.push_back({r1,j});
                if (z.size()&&n>5000)
                    break;
            }
            for (auto j:z)
            {
                ans[j.second]=i;
                s.erase(j);
            }
        }
        for (auto i:ans)
            cout<<i+1<<' ';
        cout<<endl;
    }
}
signed main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 3 ms 1020 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 106 ms 908 KB Output is correct
23 Correct 110 ms 892 KB Output is correct
24 Correct 107 ms 860 KB Output is correct
25 Correct 107 ms 896 KB Output is correct
26 Correct 110 ms 896 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Execution timed out 3084 ms 9740 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 3 ms 1020 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 106 ms 908 KB Output is correct
23 Correct 110 ms 892 KB Output is correct
24 Correct 107 ms 860 KB Output is correct
25 Correct 107 ms 896 KB Output is correct
26 Correct 110 ms 896 KB Output is correct
27 Incorrect 6 ms 1368 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 3 ms 1020 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 106 ms 908 KB Output is correct
23 Correct 110 ms 892 KB Output is correct
24 Correct 107 ms 860 KB Output is correct
25 Correct 107 ms 896 KB Output is correct
26 Correct 110 ms 896 KB Output is correct
27 Incorrect 485 ms 49120 KB Output isn't correct
28 Halted 0 ms 0 KB -