oj.uz

답안 #402815

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
402815 2021-05-12T11:42:47 Z dxz05 원 고르기 (APIO18_circle_selection) C++14
7 / 100
 3000 ms 17340 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 2222;

ll x[N], y[N], r[N];
int ans[N];

void solve(int TC) {
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++) cin >> x[i] >> y[i] >> r[i];

    while (true){
        int j = 0;
        for (int i = 1; i <= n; i++){
            if (ans[i]) continue;
            if (r[i] > r[j]) j = i;
        }
        if (j == 0) break;

        for (int i = 1; i <= n; i++){
            if (ans[i]) continue;
            ll dist = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
            if (dist <= (r[i] + r[j]) * (r[i] + r[j])){
                ans[i] = j;
            }
        }

    }

    for (int i = 1; i <= n; i++) cout << ans[i] << ' ';

}


int main() {
    startTime = clock();
    cin.tie(nullptr); cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    bool llololcal = false;
#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    llololcal = true;
#endif

    int TC = 1;
    //  cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 268 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 3 ms 668 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 4 ms 588 KB Output is correct
22 Correct 114 ms 608 KB Output is correct
23 Correct 112 ms 612 KB Output is correct
24 Correct 113 ms 708 KB Output is correct
25 Correct 112 ms 600 KB Output is correct
26 Correct 113 ms 596 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 165 ms 16700 KB Output is correct
2 Correct 162 ms 17304 KB Output is correct
3 Correct 138 ms 16964 KB Output is correct
4 Correct 137 ms 17340 KB Output is correct
5 Execution timed out 3064 ms 13092 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 3055 ms 5848 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3092 ms 13492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 268 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 3 ms 668 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 4 ms 588 KB Output is correct
22 Correct 114 ms 608 KB Output is correct
23 Correct 112 ms 612 KB Output is correct
24 Correct 113 ms 708 KB Output is correct
25 Correct 112 ms 600 KB Output is correct
26 Correct 113 ms 596 KB Output is correct
27 Correct 6 ms 972 KB Output is correct
28 Correct 6 ms 972 KB Output is correct
29 Correct 6 ms 840 KB Output is correct
30 Correct 527 ms 872 KB Output is correct
31 Correct 508 ms 880 KB Output is correct
32 Correct 506 ms 844 KB Output is correct
33 Correct 49 ms 6732 KB Output is correct
34 Correct 51 ms 6712 KB Output is correct
35 Correct 62 ms 6508 KB Output is correct
36 Execution timed out 3088 ms 5700 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 268 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 460 KB Output is correct
19 Correct 3 ms 668 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 4 ms 588 KB Output is correct
22 Correct 114 ms 608 KB Output is correct
23 Correct 112 ms 612 KB Output is correct
24 Correct 113 ms 708 KB Output is correct
25 Correct 112 ms 600 KB Output is correct
26 Correct 113 ms 596 KB Output is correct
27 Correct 165 ms 16700 KB Output is correct
28 Correct 162 ms 17304 KB Output is correct
29 Correct 138 ms 16964 KB Output is correct
30 Correct 137 ms 17340 KB Output is correct
31 Execution timed out 3064 ms 13092 KB Time limit exceeded
32 Halted 0 ms 0 KB -