oj.uz

답안 #579104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579104 2022-06-18T11:31:58 Z noedit 원 고르기 (APIO18_circle_selection) C++17
72 / 100
 3000 ms 248516 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 301010
#define INF 1000000010
pair<pair<int, int>, pair<int, int>> in[MAX];
int X[MAX];
int Y[MAX];
int R[MAX];
int ind[MAX];
int ri[MAX];
int ans[MAX];
inline ll sq(ll x)
{
    return x * x;
}
inline bool chk(int i, int j)
{
    return sq(X[i] - X[j]) + sq(Y[i] - Y[j]) <= sq(R[i] + R[j]);
}
bool isrange(int x, int y)
{
    if (x < 0 || y < 0) return false;
    return true;
}
inline ll trans(int x, int y)
{
    return ((ll)x * (ll)INF) + y;
}
bool cmp(pair<pair<int, int>, pair<int, int>>& p1, pair<pair<int, int>, pair<int, int>>& p2)
{
    if (p1.first.first == p2.first.first) return p1.first.second < p2.first.second;
    else return p1.first.first > p2.first.first;
}
unordered_map<ll, vector<int>> mp;
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    int i;
    for (i = 1; i <= n; i++) cin >> in[i].second.first >> in[i].second.second >> in[i].first.first, in[i].first.second = i;
    sort(in + 1, in + n + 1, cmp);
    for (i = 1; i <= n; i++) tie(X[i], Y[i], R[i], ind[i]) = make_tuple(in[i].second.first + INF, in[i].second.second + INF, in[i].first.first, in[i].first.second);
    int k;
    int s, e;
    e = 0;
    for (k = 30; k >= 0; k--)
    {
        int r = 1 << k;
        s = e + 1;
        if (R[s] < r / 2) continue;
        mp.clear();
        e = 0;
        for (i = s; i <= n; i++)
        {
            if (ans[i]) continue;
            int x, y;
            x = X[i] >> k;
            y = Y[i] >> k;
            if (R[i] < r / 2 && !e) e = i - 1;
            int xx, yy;
            for (xx = x - 1; xx <= x + 1; xx++) for (yy = y - 1; yy <= y + 1; yy++)
                {
                    mp[((ll)xx << 31LL) + yy].push_back(i);
                }

        }
        if (e == 0) e = n;
        for (i = s; i <= e; i++)
        {
            if (ans[i]) continue;
            ans[i] = i;
            int x, y;
            x = X[i] >>k;
            y = Y[i] >>k;
            int xx, yy;
            for (xx = x - 1; xx <= x + 1; xx++) for (yy = y - 1; yy <= y + 1; yy++)
                {
                    ll t = ((ll)xx << 31LL) + yy;
                    for (auto c : mp[t]) if (!ans[c] && chk(c, i)) ans[c] = i;
                }
        }
    }
    for (i = 1; i <= n; i++) ri[ind[i]] = i;
    for (i = 1; i <= n; i++) cout << ind[ans[ri[i]]] << ' ';
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 820 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 17 ms 4784 KB Output is correct
23 Correct 26 ms 4784 KB Output is correct
24 Correct 20 ms 4796 KB Output is correct
25 Correct 18 ms 4800 KB Output is correct
26 Correct 21 ms 4784 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 22104 KB Output is correct
2 Correct 199 ms 22104 KB Output is correct
3 Correct 213 ms 22336 KB Output is correct
4 Correct 261 ms 21832 KB Output is correct
5 Correct 327 ms 33828 KB Output is correct
6 Correct 1604 ms 65084 KB Output is correct
7 Correct 437 ms 32160 KB Output is correct
8 Correct 632 ms 40048 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1008 ms 84516 KB Output is correct
3 Correct 2886 ms 247168 KB Output is correct
4 Correct 2970 ms 247088 KB Output is correct
5 Execution timed out 3093 ms 162856 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1475 ms 248516 KB Output is correct
2 Correct 1406 ms 248392 KB Output is correct
3 Correct 458 ms 37348 KB Output is correct
4 Correct 1395 ms 248340 KB Output is correct
5 Correct 1381 ms 248340 KB Output is correct
6 Correct 299 ms 31948 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 820 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 17 ms 4784 KB Output is correct
23 Correct 26 ms 4784 KB Output is correct
24 Correct 20 ms 4796 KB Output is correct
25 Correct 18 ms 4800 KB Output is correct
26 Correct 21 ms 4784 KB Output is correct
27 Correct 7 ms 1236 KB Output is correct
28 Correct 9 ms 1236 KB Output is correct
29 Correct 7 ms 1108 KB Output is correct
30 Correct 39 ms 9316 KB Output is correct
31 Correct 81 ms 9308 KB Output is correct
32 Correct 53 ms 9316 KB Output is correct
33 Correct 69 ms 7500 KB Output is correct
34 Correct 68 ms 7460 KB Output is correct
35 Correct 71 ms 7936 KB Output is correct
36 Correct 976 ms 86640 KB Output is correct
37 Correct 911 ms 86528 KB Output is correct
38 Correct 971 ms 86308 KB Output is correct
39 Correct 649 ms 17832 KB Output is correct
40 Correct 680 ms 17628 KB Output is correct
41 Correct 665 ms 17760 KB Output is correct
42 Correct 169 ms 15208 KB Output is correct
43 Correct 462 ms 81620 KB Output is correct
44 Correct 637 ms 81896 KB Output is correct
45 Correct 436 ms 81620 KB Output is correct
46 Correct 451 ms 81720 KB Output is correct
47 Correct 432 ms 81804 KB Output is correct
48 Correct 449 ms 81748 KB Output is correct
49 Correct 450 ms 82032 KB Output is correct
50 Correct 488 ms 81764 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 820 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 17 ms 4784 KB Output is correct
23 Correct 26 ms 4784 KB Output is correct
24 Correct 20 ms 4796 KB Output is correct
25 Correct 18 ms 4800 KB Output is correct
26 Correct 21 ms 4784 KB Output is correct
27 Correct 198 ms 22104 KB Output is correct
28 Correct 199 ms 22104 KB Output is correct
29 Correct 213 ms 22336 KB Output is correct
30 Correct 261 ms 21832 KB Output is correct
31 Correct 327 ms 33828 KB Output is correct
32 Correct 1604 ms 65084 KB Output is correct
33 Correct 437 ms 32160 KB Output is correct
34 Correct 632 ms 40048 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1008 ms 84516 KB Output is correct
37 Correct 2886 ms 247168 KB Output is correct
38 Correct 2970 ms 247088 KB Output is correct
39 Execution timed out 3093 ms 162856 KB Time limit exceeded
40 Halted 0 ms 0 KB -