oj.uz

Submission #393318

# Submission time Handle Problem Language Result Execution time Memory
393318 2021-04-23T07:44:06 Z parsabahrami Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 8192 KB 
/* There's someone in my head but it's not me */ 
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 3e5 + 10, MOD = 1e9 + 7;
int n, X[N], Y[N], R[N], ord[N], ret[N];

int intersect(int i, int j) {
    ll x1 = X[i], x2 = X[j], y1 = Y[i], y2 = Y[j], r1 = R[i], r2 = R[j];
    return x1 * x1 + x2 * x2 + y1 * y1 + y2 * y2 - r1 * r1 - r2 * r2 <= 2 * (r1 * r2 + x1 * x2 + y1 * y2);
}

void sub1() {
    for (int _ = 1; _ <= n; _++) {
        int i = ord[_]; 
        if (ret[i]) continue; 
        ret[i] = i;
        for (int j = _ + 1; j <= n; j++) {
            if (!ret[ord[j]] && intersect(i, ord[j])) ret[ord[j]] = i;
        }
    }
    for (int i = 1; i <= n; i++) 
        printf("%d ", ret[i]);
    printf("\n");
    exit(0);
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) 
        scanf("%d%d%d", &X[i], &Y[i], &R[i]);
    iota(ord + 1, ord + n + 1, 1);
    sort(ord + 1, ord + n + 1, [&] (int i, int j) { return R[i] == R[j] ? i < j : R[i] > R[j]; });
    if (n * n <= 1e8) sub1();
    stack<int> st;
    ret[ord[1]] = ord[1]; st.push(ord[1]);
    for (int _ = 2; _ <= n; _++) {
        int i = ord[_];
        while (SZ(st) && !intersect(st.top(), i)) 
            st.pop();
        if (SZ(st)) ret[i] = st.top();
        else ret[i] = i, st.push(i);
    }
    for (int i = 1; i <= n; i++) printf("%d ", ret[i]);
    printf("\n");
    return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
circle_selection.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |         scanf("%d%d%d", &X[i], &Y[i], &R[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 92 ms 412 KB Output is correct
23 Correct 102 ms 412 KB Output is correct
24 Correct 94 ms 404 KB Output is correct
25 Correct 92 ms 416 KB Output is correct
26 Correct 93 ms 412 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 8188 KB Output is correct
2 Correct 187 ms 8192 KB Output is correct
3 Correct 185 ms 7924 KB Output is correct
4 Correct 180 ms 8172 KB Output is correct
5 Execution timed out 3079 ms 6228 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 61 ms 2780 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3084 ms 5100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 92 ms 412 KB Output is correct
23 Correct 102 ms 412 KB Output is correct
24 Correct 94 ms 404 KB Output is correct
25 Correct 92 ms 416 KB Output is correct
26 Correct 93 ms 412 KB Output is correct
27 Correct 6 ms 460 KB Output is correct
28 Correct 8 ms 460 KB Output is correct
29 Correct 6 ms 456 KB Output is correct
30 Correct 378 ms 504 KB Output is correct
31 Correct 403 ms 580 KB Output is correct
32 Correct 369 ms 512 KB Output is correct
33 Correct 63 ms 2884 KB Output is correct
34 Correct 62 ms 2856 KB Output is correct
35 Incorrect 61 ms 2756 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 4 ms 332 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 92 ms 412 KB Output is correct
23 Correct 102 ms 412 KB Output is correct
24 Correct 94 ms 404 KB Output is correct
25 Correct 92 ms 416 KB Output is correct
26 Correct 93 ms 412 KB Output is correct
27 Correct 187 ms 8188 KB Output is correct
28 Correct 187 ms 8192 KB Output is correct
29 Correct 185 ms 7924 KB Output is correct
30 Correct 180 ms 8172 KB Output is correct
31 Execution timed out 3079 ms 6228 KB Time limit exceeded
32 Halted 0 ms 0 KB -