oj.uz

Submission #972700

# Submission time Handle Problem Language Result Execution time Memory
972700 2024-05-01T02:34:49 Z bachhoangxuan Circle selection (APIO18_circle_selection) C++17
7 / 100
 1890 ms 69140 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const long long inf=1e18;
const int mod=998244353;
const int maxn=300005;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,x[maxn],y[maxn],r[maxn],res[maxn],B;
map<pii,vector<int>> mp;
set<int> cc;

void build(){
    mp.clear();
    for(int i:cc) mp[{x[i]/B,y[i]/B}].push_back(i);
}

bool intersect(int i,int j){
    return (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])<=(r[i]+r[j])*(r[i]+r[j]);
}

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> x[i] >> y[i] >> r[i];
        cc.insert(i);
    }
    vector<int> ord(n);
    iota(ord.begin(),ord.end(),1);
    sort(ord.begin(),ord.end(),[&](int a,int b){
        return r[a]>r[b];
    });
    for(int i:ord){
        if(res[i]) continue;
        if(!B || r[i]*2<=B){
            B=r[i];
            build();
        }
        for(int X=x[i]/B-2;X<=x[i]/B+2;X++) for(int Y=y[i]/B-2;Y<=y[i]/B+2;Y++){
            auto it=mp.find({X,Y});
            if(it!=mp.end()){
                for(int j:it->se) if(!res[j] && intersect(i,j)){
                    res[j]=i;
                    cc.erase(j);
                }
            }
        }
    }
    for(int i=1;i<=n;i++) cout << res[i] << ' ';
    cout << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6620 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6612 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6576 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6640 KB Output is correct
19 Correct 4 ms 7004 KB Output is correct
20 Correct 4 ms 7004 KB Output is correct
21 Correct 4 ms 6932 KB Output is correct
22 Correct 13 ms 7516 KB Output is correct
23 Correct 14 ms 7516 KB Output is correct
24 Correct 13 ms 7516 KB Output is correct
25 Correct 14 ms 7532 KB Output is correct
26 Correct 13 ms 7612 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 35508 KB Output is correct
2 Correct 217 ms 36984 KB Output is correct
3 Correct 197 ms 37176 KB Output is correct
4 Correct 192 ms 36036 KB Output is correct
5 Incorrect 358 ms 37300 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 410 ms 27108 KB Output is correct
3 Correct 1890 ms 69052 KB Output is correct
4 Correct 1826 ms 69140 KB Output is correct
5 Incorrect 1807 ms 62352 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6620 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6612 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6576 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6640 KB Output is correct
19 Correct 4 ms 7004 KB Output is correct
20 Correct 4 ms 7004 KB Output is correct
21 Correct 4 ms 6932 KB Output is correct
22 Correct 13 ms 7516 KB Output is correct
23 Correct 14 ms 7516 KB Output is correct
24 Correct 13 ms 7516 KB Output is correct
25 Correct 14 ms 7532 KB Output is correct
26 Correct 13 ms 7612 KB Output is correct
27 Correct 7 ms 7516 KB Output is correct
28 Correct 7 ms 7516 KB Output is correct
29 Correct 7 ms 7512 KB Output is correct
30 Correct 30 ms 8540 KB Output is correct
31 Correct 28 ms 8600 KB Output is correct
32 Correct 26 ms 8540 KB Output is correct
33 Correct 66 ms 17348 KB Output is correct
34 Correct 67 ms 17604 KB Output is correct
35 Correct 73 ms 16600 KB Output is correct
36 Correct 395 ms 26708 KB Output is correct
37 Correct 348 ms 27000 KB Output is correct
38 Correct 383 ms 26904 KB Output is correct
39 Incorrect 278 ms 23888 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6620 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6612 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6488 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6576 KB Output is correct
14 Correct 2 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6640 KB Output is correct
19 Correct 4 ms 7004 KB Output is correct
20 Correct 4 ms 7004 KB Output is correct
21 Correct 4 ms 6932 KB Output is correct
22 Correct 13 ms 7516 KB Output is correct
23 Correct 14 ms 7516 KB Output is correct
24 Correct 13 ms 7516 KB Output is correct
25 Correct 14 ms 7532 KB Output is correct
26 Correct 13 ms 7612 KB Output is correct
27 Correct 187 ms 35508 KB Output is correct
28 Correct 217 ms 36984 KB Output is correct
29 Correct 197 ms 37176 KB Output is correct
30 Correct 192 ms 36036 KB Output is correct
31 Incorrect 358 ms 37300 KB Output isn't correct
32 Halted 0 ms 0 KB -