Submission #320108

#	Time	Username	Problem	Language	Result	Execution time	Memory
320108		AmineWeslati	Circle selection (APIO18_circle_selection)	C++14	7 / 100	3047 ms	33724 KiB

circle_selection

//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 3e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

int N; 
vi X(MX),Y(MX),R(MX);

bool check(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]);
}

int32_t main() {
    boost; IO();

    cin>>N;
    FOR(i,0,N) cin>>X[i]>>Y[i]>>R[i];

    set<int> s; FOR(i,0,N) s.insert(i);

    int ans[N];
    while(!s.empty()){
    	int mx=0,i=INF;
    	for(auto c: s){
    		if(ckmax(mx,R[c])) i=c;
    		else if(R[c]==mx) ckmin(i,c);
		}
		vi vec;
		for(auto c: s) if(check(i,c)) vec.pb(c);
		dbgv(vec);
		for(auto x: vec){
			s.erase(x);
			ans[x]=i;
		}
    }
    FOR(i,0,N) cout << ans[i]+1 << ' '; cout << endl;
    

    return 0;
}

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Compilation message (stderr)

circle_selection.cpp: In function 'int32_t main()':
circle_selection.cpp:29:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   29 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
      |                    ^~~
circle_selection.cpp:97:5: note: in expansion of macro 'FOR'
   97 |     FOR(i,0,N) cout << ans[i]+1 << ' '; cout << endl;
      |     ^~~
circle_selection.cpp:97:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   97 |     FOR(i,0,N) cout << ans[i]+1 << ' '; cout << endl;
      |                                         ^~~~

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