oj.uz

Submission #982466

# Submission time Handle Problem Language Result Execution time Memory
982466 2024-05-14T09:32:43 Z Muhammad_Aneeq Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 88580 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)
    {
        int ans[n]={};
        set<pair<int,int>>val;
        for (int i=0;i<n;i++)
        {
            val.insert({a[i].first,i});
            val.insert({a[i].first+ra[i],i});
            val.insert({a[i].first-ra[i],i});
        }
        while (s.size())
        {
            int i=(*begin(s)).second;
            s.erase(*begin(s));
            auto lb=val.lower_bound({a[i].first-ra[i],i});
            set<int>z;
            while (lb!=val.end()&&(*lb).first<=a[i].first+ra[i])
                z.insert((*lb).second);
            for (auto j:z)
            {
                val.erase({a[j].first,j});
                val.erase({a[j].first+ra[j],j});
                val.erase({a[j].first-ra[j],j});
                ans[j]=i;
            }
        }
        for (auto i:ans)
            cout<<i+1<<' ';
        cout<<endl;
    }
    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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 0 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 3 ms 1112 KB Output is correct
20 Correct 3 ms 1112 KB Output is correct
21 Correct 3 ms 1116 KB Output is correct
22 Correct 105 ms 1028 KB Output is correct
23 Correct 108 ms 856 KB Output is correct
24 Correct 107 ms 1104 KB Output is correct
25 Correct 106 ms 856 KB Output is correct
26 Correct 104 ms 860 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3046 ms 88580 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 3075 ms 11348 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 3039 ms 32596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 0 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 3 ms 1112 KB Output is correct
20 Correct 3 ms 1112 KB Output is correct
21 Correct 3 ms 1116 KB Output is correct
22 Correct 105 ms 1028 KB Output is correct
23 Correct 108 ms 856 KB Output is correct
24 Correct 107 ms 1104 KB Output is correct
25 Correct 106 ms 856 KB Output is correct
26 Correct 104 ms 860 KB Output is correct
27 Incorrect 6 ms 1624 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 0 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 3 ms 1112 KB Output is correct
20 Correct 3 ms 1112 KB Output is correct
21 Correct 3 ms 1116 KB Output is correct
22 Correct 105 ms 1028 KB Output is correct
23 Correct 108 ms 856 KB Output is correct
24 Correct 107 ms 1104 KB Output is correct
25 Correct 106 ms 856 KB Output is correct
26 Correct 104 ms 860 KB Output is correct
27 Execution timed out 3046 ms 88580 KB Time limit exceeded
28 Halted 0 ms 0 KB -