Submission #1058244

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058244		caterpillow	Circle selection (APIO18_circle_selection)	C++17	7 / 100	3046 ms	18628 KiB

circle_selection

#include <bits/stdc++.h>
#include <ratio>

using namespace std;

using db = long double;
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end() 
#define size(x) ((int) (x).size())
#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--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;

template<typename... Args> // tuples
ostream& operator<<(ostream& os, tuple<Args...> t) { 
    apply([&](Args... args) { string dlm = "{"; ((os << dlm << args, dlm = ", "), ...); }, t);
    return os << "}";
}

template<typename T, typename V> // pairs
ostream& operator<<(ostream& os, pair<T, V> p) { return os << "{" << p.f << ", " << p.s << "}"; }

template<class T, class = decltype(begin(declval<T>()))> // iterables
typename enable_if<!is_same<T, string>::value, ostream&>::type operator<<(ostream& os, const T& v) {
    string dlm = "{";
    for (auto& i : v) os << dlm << i, dlm = ", ";
    return os << "}";  
}

template <typename T, typename... V>
void printer(string pfx, const char *names, T&& head, V&& ...tail) {
    int i = 0;
    while (names[i] && names[i] != ',') i++;
    constexpr bool is_str = is_same_v<decay_t<T>, const char*>;
    if (is_str) cerr << " " << head;
    else cerr << pfx, cerr.write(names, i) << " = " << head; 
    if constexpr (sizeof...(tail)) printer(is_str ? "" : ",", names + i + 1, tail...);
    else cerr << endl;
}

#ifdef LOCAL
#define dbg(...) printer(to_string(__LINE__) + ": ", #__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(x...)
#define cerr if (0) std::cerr
#endif

/*

circle a intersects with circle b if
    dx^2 + dy^2 <= (ra + rb)^2

subtask 1: brute force

subtask 2: line case
    keep circles in a set
    spam lower bound to delete bad thingies

subtask 3: 

*/

struct Circle {
    ll x, y, r;
};

#define sq(x) ((x) * (x))

bool inter(Circle& a, Circle& b) {
    return sq(a.x - b.x) + sq(a.y - b.y) <= sq(a.r + b.r);
}

int n; 
vt<Circle> circles;

main() {
    cin.tie(0)->sync_with_stdio(0);
    
    cin >> n;
    circles.resize(n);
    for (auto& [x, y, r] : circles) cin >> x >> y >> r;
    vt<int> ord(n); 
    iota(all(ord), 0);
    sort(all(ord), [&] (int i, int j) { return circles[i].r == circles[j].r ? i < j : circles[i].r > circles[j].r; } );
    vt<int> ans(n, -1);
    for (int i : ord) {
        if (ans[i] != -1) continue;
        ans[i] = i;
        F0R (j, n) {
            if (ans[j] != -1) continue;
            if (inter(circles[i], circles[j])) {
                ans[j] = i;
            }
        }
    }
    F0R (i, n) cout << ans[i] + 1 << " \n"[i == n - 1];
}

Compilation message (stderr)

circle_selection.cpp:85:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   85 | main() {
      | ^~~~

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