# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
482429 | oToToT | Circle selection (APIO18_circle_selection) | C++17 | 2287 ms | 330812 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize( "O3" )
#include <bits/stdc++.h>
using namespace std;
const int N = 300000 + 5;
const int C = 1000000000;
template < typename A, typename B >
using UMP = unordered_map< A, B >;
using lld = int64_t;
int n;
vector< int > ord;
lld x[ N ], y[ N ], r[ N ];
inline bool inter( int i, int j ) {
const lld ox = x[ i ] - x[ j ];
const lld oy = y[ i ] - y[ j ];
const lld R = r[ i ] + r[ j ];
return ox * ox + oy * oy <= R * R;
}
void init() {
cin >> n;
for ( int i = 0 ; i < n ; ++ i )
cin >> x[ i ] >> y[ i ] >> r[ i ];
for ( int i = 0 ; i < n ; ++ i )
x[ i ] += C, y[ i ] += C;
ord.resize( n );
iota( ord.begin(), ord.end(), 0 );
sort( ord.begin(), ord.end(), []( int a, int b ) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |