oj.uz

답안 #160530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160530 2019-10-28T10:44:49 Z Minnakhmetov 원 고르기 (APIO18_circle_selection) C++14
7 / 100
 2221 ms 54320 KB 
#include <bits/stdc++.h>
    
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
  
using namespace std;

struct C {
    ll x, y, r, i;
};

const int N = 3e5 + 5, INF = 1e9;
map<pair<ll, ll>, vector<int>> mp;
bool used[N];
C cir[N];
int n;
int ans[N];

bool check(C a, C b) {
    return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y) <= 
        (a.r + b.r) * (a.r + b.r);
}

void build(int r) {
    mp.clear();
    for (int i = 0; i < n; i++) {
        if (!used[i]) {
            mp[{cir[i].x / r, cir[i].y / r}].push_back(i);
        }
    }
}
 
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    cin >> n;

    int cur = 0;

    for (int i = 0; i < n; i++) {
        cin >> cir[i].x >> cir[i].y >> cir[i].r;
        cir[i].x += INF;
        cir[i].y += INF;
        cir[i].i = i;
    }

    sort(cir, cir + n, [](const C &a, const C &b) {
        return a.r > b.r;
    });

    cur = cir[0].r;

    build(cur);

    for (int i = 0; i < n; i++) {
        if (!used[i]) {
            // cout << cir[i].x << " " << cir[i].y << " " << cir[i].r << "\n";

            if (cir[i].r * 2 < cur) {
                cur = cir[i].r;
                build(cur);
            }

            int x = cir[i].x / cur,
                y = cir[i].y / cur;

            for (int j = x - 2; j <= x + 2; j++) {
                for (int k = y - 2; k <= y + 2; k++) {
                    if (mp.count({j, k})) {
                        vector<int> &v = mp[{j, k}];
                        for (int h = 0; h < v.size(); h++) {
                            if (check(cir[i], cir[v[h]])) {
                                ans[cir[v[h]].i] = cir[i].i;
                                used[v[h]] = 1;
                                swap(v.back(), v[h]);
                                v.pop_back();
                                h--;
                            }
                        }
                    }
                    
                }
            }
        }
    }

    for (int i = 0; i < n; i++) {
        cout << ans[i] + 1 << " ";
    }
 
    return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:72:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for (int h = 0; h < v.size(); h++) {
                                         ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 404 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 4 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 5 ms 760 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 17 ms 1272 KB Output is correct
23 Correct 18 ms 1276 KB Output is correct
24 Correct 17 ms 1272 KB Output is correct
25 Correct 16 ms 1272 KB Output is correct
26 Correct 17 ms 1272 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 20332 KB Output is correct
2 Correct 206 ms 20332 KB Output is correct
3 Correct 199 ms 21224 KB Output is correct
4 Correct 199 ms 20520 KB Output is correct
5 Incorrect 274 ms 18988 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 559 ms 18388 KB Output is correct
3 Correct 2160 ms 54296 KB Output is correct
4 Correct 2221 ms 54320 KB Output is correct
5 Incorrect 2188 ms 47612 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1889 ms 54216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 404 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 4 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 5 ms 760 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 17 ms 1272 KB Output is correct
23 Correct 18 ms 1276 KB Output is correct
24 Correct 17 ms 1272 KB Output is correct
25 Correct 16 ms 1272 KB Output is correct
26 Correct 17 ms 1272 KB Output is correct
27 Correct 10 ms 1144 KB Output is correct
28 Correct 22 ms 1152 KB Output is correct
29 Correct 9 ms 1148 KB Output is correct
30 Correct 38 ms 2268 KB Output is correct
31 Correct 34 ms 2168 KB Output is correct
32 Correct 33 ms 2168 KB Output is correct
33 Correct 77 ms 8196 KB Output is correct
34 Correct 76 ms 8180 KB Output is correct
35 Correct 78 ms 7760 KB Output is correct
36 Correct 521 ms 18044 KB Output is correct
37 Correct 512 ms 18208 KB Output is correct
38 Correct 523 ms 18424 KB Output is correct
39 Incorrect 436 ms 15020 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 404 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 4 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 5 ms 760 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 17 ms 1272 KB Output is correct
23 Correct 18 ms 1276 KB Output is correct
24 Correct 17 ms 1272 KB Output is correct
25 Correct 16 ms 1272 KB Output is correct
26 Correct 17 ms 1272 KB Output is correct
27 Correct 205 ms 20332 KB Output is correct
28 Correct 206 ms 20332 KB Output is correct
29 Correct 199 ms 21224 KB Output is correct
30 Correct 199 ms 20520 KB Output is correct
31 Incorrect 274 ms 18988 KB Output isn't correct
32 Halted 0 ms 0 KB -