oj.uz

Submission #253002

# Submission time Handle Problem Language Result Execution time Memory
253002 2020-07-26T15:34:36 Z infinite_iq Circle selection (APIO18_circle_selection) C++14
7 / 100
 31 ms 1152 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=1e18;
const ll mod=987654321;
const ld Pi=acos(-1);
ll n ;
pair < pll , pll > a [5009] ;
ll done [5009] , p [5009] ;     
bool cmp ( pair < pll , pll > x , pair < pll , pll > y ) {
        if ( x .fi.fi == y .fi.fi ) {
                return x .fi.se < y .fi.se ;
        }
        return x .fi.fi > y .fi.fi ;
}
int main () {
        cin >> n ;
        for ( ll i = 0 ; i < n ; i ++ ) {
                cin >> a [i] .se.fi >> a [i] .se.se >> a [i] .fi.fi ;
                a [i] .fi.se = i ;
        }
        sort ( a , a + n , cmp ) ;
        for ( ll i = 0 ; i < n ; i ++ ) {
                if ( done [i] ) C ;
                ll x1 = a [i] .se.fi , y1 = a [i] .se.se , r1 = a [i] .fi.fi , id1 = a [i] .fi.se ;
                for ( ll j = i ; j < n ; j ++ ) {
                        if ( done [j] ) C ;
                        ll x2 = a [j] .se.fi , y2 = a [j] .se.se , r2 = a [j] .fi.fi , id2 = a [j] .fi.se ;
                        if ( ( r1 + r2 ) * ( r1 + r2 ) >= ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 ) ) {
                                p [id2] = id1 ;
                                done [j] = 1ll ;
                        }
                }
        }
        for ( ll i = 0 ; i < n ; i ++ ) 
                cout << p [i] + 1 << " " ;
        cout << endl ;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 11 ms 768 KB Output is correct
20 Correct 11 ms 768 KB Output is correct
21 Correct 11 ms 768 KB Output is correct
22 Correct 29 ms 640 KB Output is correct
23 Correct 30 ms 640 KB Output is correct
24 Correct 31 ms 760 KB Output is correct
25 Correct 31 ms 640 KB Output is correct
26 Correct 29 ms 640 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Runtime error 10 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 11 ms 768 KB Output is correct
20 Correct 11 ms 768 KB Output is correct
21 Correct 11 ms 768 KB Output is correct
22 Correct 29 ms 640 KB Output is correct
23 Correct 30 ms 640 KB Output is correct
24 Correct 31 ms 760 KB Output is correct
25 Correct 31 ms 640 KB Output is correct
26 Correct 29 ms 640 KB Output is correct
27 Runtime error 11 ms 1024 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 11 ms 768 KB Output is correct
20 Correct 11 ms 768 KB Output is correct
21 Correct 11 ms 768 KB Output is correct
22 Correct 29 ms 640 KB Output is correct
23 Correct 30 ms 640 KB Output is correct
24 Correct 31 ms 760 KB Output is correct
25 Correct 31 ms 640 KB Output is correct
26 Correct 29 ms 640 KB Output is correct
27 Runtime error 9 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -