oj.uz

답안 #579112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579112 2022-06-18T11:40:55 Z noedit 원 고르기 (APIO18_circle_selection) C++17
72 / 100
 3000 ms 248424 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 check(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;
    for (int 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 (int 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 s, e;
    e = 0;
    for (int k = 30; k >= 0; k--)
    {
        int r = 1 << k;
        s = e + 1;
        if (R[s] < r / 2)
        {
            continue;
        }
        mp.clear();
        e = 0;
        for (int i = s; i <= n; i++)
        {
            if (ans[i])
            {
                continue;
            }
            int x = X[i] >> k;
            int y = Y[i] >> k;
            if (R[i] < r / 2 && !e)
            {
                e = i - 1;
            }
            for (int xx = x - 1; xx <= x + 1; xx++)
            {
                for (int yy = y - 1; yy <= y + 1; yy++)
                {
                    mp[((ll)xx << 31LL) + yy].push_back(i);
                }
            }
        }
        if (e == 0)
        {
            e = n;
        }
        for (int i = s; i <= e; i++)
        {
            if (ans[i])
            {
                continue;
            }
            ans[i] = i;
            int x, y;
            x = X[i] >> k;
            y = Y[i] >> k;
            for (int xx = x - 1; xx <= x + 1; xx++)
            {
                for (int yy = y - 1; yy <= y + 1; yy++)
                {
                    ll t = ((ll)xx << 31LL) + yy;
                    for (auto& c : mp[t])
                    {
                        if (!ans[c] && check(c, i))
                        {
                            ans[c] = i;
                        }
                    }
                }
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        ri[ind[i]] = i;
    }
    for (int i = 1; i <= n; i++)
    {
        cout << ind[ans[ri[i]]] << ' ';
    }
    return 0;
}

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 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 1 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 828 KB Output is correct
21 Correct 5 ms 800 KB Output is correct
22 Correct 25 ms 4768 KB Output is correct
23 Correct 30 ms 4784 KB Output is correct
24 Correct 19 ms 4784 KB Output is correct
25 Correct 18 ms 4784 KB Output is correct
26 Correct 21 ms 4784 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 237 ms 22108 KB Output is correct
2 Correct 205 ms 22156 KB Output is correct
3 Correct 237 ms 22340 KB Output is correct
4 Correct 202 ms 21928 KB Output is correct
5 Correct 322 ms 33672 KB Output is correct
6 Correct 1570 ms 65048 KB Output is correct
7 Correct 367 ms 32244 KB Output is correct
8 Correct 667 ms 39920 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1012 ms 84576 KB Output is correct
3 Correct 2816 ms 247112 KB Output is correct
4 Correct 2986 ms 247244 KB Output is correct
5 Execution timed out 3069 ms 162840 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1410 ms 248328 KB Output is correct
2 Correct 1481 ms 248396 KB Output is correct
3 Correct 478 ms 37252 KB Output is correct
4 Correct 1402 ms 248408 KB Output is correct
5 Correct 1379 ms 248424 KB Output is correct
6 Correct 324 ms 32004 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 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 1 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 828 KB Output is correct
21 Correct 5 ms 800 KB Output is correct
22 Correct 25 ms 4768 KB Output is correct
23 Correct 30 ms 4784 KB Output is correct
24 Correct 19 ms 4784 KB Output is correct
25 Correct 18 ms 4784 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 8 ms 1108 KB Output is correct
30 Correct 49 ms 9368 KB Output is correct
31 Correct 50 ms 9368 KB Output is correct
32 Correct 49 ms 9336 KB Output is correct
33 Correct 73 ms 7512 KB Output is correct
34 Correct 74 ms 7524 KB Output is correct
35 Correct 72 ms 7924 KB Output is correct
36 Correct 1028 ms 86420 KB Output is correct
37 Correct 912 ms 86504 KB Output is correct
38 Correct 1036 ms 86324 KB Output is correct
39 Correct 681 ms 17788 KB Output is correct
40 Correct 739 ms 17696 KB Output is correct
41 Correct 744 ms 17676 KB Output is correct
42 Correct 168 ms 15208 KB Output is correct
43 Correct 453 ms 81648 KB Output is correct
44 Correct 695 ms 81736 KB Output is correct
45 Correct 458 ms 81664 KB Output is correct
46 Correct 459 ms 81728 KB Output is correct
47 Correct 485 ms 81736 KB Output is correct
48 Correct 477 ms 81720 KB Output is correct
49 Correct 444 ms 81804 KB Output is correct
50 Correct 499 ms 81752 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 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 1 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 828 KB Output is correct
21 Correct 5 ms 800 KB Output is correct
22 Correct 25 ms 4768 KB Output is correct
23 Correct 30 ms 4784 KB Output is correct
24 Correct 19 ms 4784 KB Output is correct
25 Correct 18 ms 4784 KB Output is correct
26 Correct 21 ms 4784 KB Output is correct
27 Correct 237 ms 22108 KB Output is correct
28 Correct 205 ms 22156 KB Output is correct
29 Correct 237 ms 22340 KB Output is correct
30 Correct 202 ms 21928 KB Output is correct
31 Correct 322 ms 33672 KB Output is correct
32 Correct 1570 ms 65048 KB Output is correct
33 Correct 367 ms 32244 KB Output is correct
34 Correct 667 ms 39920 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1012 ms 84576 KB Output is correct
37 Correct 2816 ms 247112 KB Output is correct
38 Correct 2986 ms 247244 KB Output is correct
39 Execution timed out 3069 ms 162840 KB Time limit exceeded
40 Halted 0 ms 0 KB -