oj.uz

답안 #579106

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579106 2022-06-18T11:32:59 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 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 1 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 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 1 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 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 20 ms 4784 KB Output is correct
23 Correct 22 ms 4796 KB Output is correct
24 Correct 20 ms 4784 KB Output is correct
25 Correct 19 ms 4736 KB Output is correct
26 Correct 22 ms 4784 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 203 ms 22176 KB Output is correct
2 Correct 210 ms 22272 KB Output is correct
3 Correct 225 ms 22208 KB Output is correct
4 Correct 192 ms 21828 KB Output is correct
5 Correct 319 ms 33716 KB Output is correct
6 Correct 1575 ms 65080 KB Output is correct
7 Correct 429 ms 32236 KB Output is correct
8 Correct 633 ms 39948 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 966 ms 84556 KB Output is correct
3 Correct 2760 ms 247296 KB Output is correct
4 Correct 2839 ms 247100 KB Output is correct
5 Execution timed out 3091 ms 162908 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1415 ms 248288 KB Output is correct
2 Correct 1448 ms 248424 KB Output is correct
3 Correct 533 ms 37284 KB Output is correct
4 Correct 1365 ms 248392 KB Output is correct
5 Correct 1374 ms 248348 KB Output is correct
6 Correct 299 ms 31896 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 1 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 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 1 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 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 20 ms 4784 KB Output is correct
23 Correct 22 ms 4796 KB Output is correct
24 Correct 20 ms 4784 KB Output is correct
25 Correct 19 ms 4736 KB Output is correct
26 Correct 22 ms 4784 KB Output is correct
27 Correct 7 ms 1236 KB Output is correct
28 Correct 8 ms 1260 KB Output is correct
29 Correct 7 ms 1108 KB Output is correct
30 Correct 49 ms 9328 KB Output is correct
31 Correct 51 ms 9316 KB Output is correct
32 Correct 41 ms 9324 KB Output is correct
33 Correct 67 ms 7424 KB Output is correct
34 Correct 73 ms 7444 KB Output is correct
35 Correct 71 ms 7856 KB Output is correct
36 Correct 948 ms 86412 KB Output is correct
37 Correct 915 ms 86472 KB Output is correct
38 Correct 983 ms 86392 KB Output is correct
39 Correct 640 ms 17576 KB Output is correct
40 Correct 663 ms 17704 KB Output is correct
41 Correct 669 ms 17732 KB Output is correct
42 Correct 172 ms 15192 KB Output is correct
43 Correct 447 ms 81652 KB Output is correct
44 Correct 686 ms 81776 KB Output is correct
45 Correct 455 ms 81716 KB Output is correct
46 Correct 460 ms 81816 KB Output is correct
47 Correct 441 ms 81800 KB Output is correct
48 Correct 463 ms 81772 KB Output is correct
49 Correct 448 ms 81776 KB Output is correct
50 Correct 424 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 1 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 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 1 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 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 20 ms 4784 KB Output is correct
23 Correct 22 ms 4796 KB Output is correct
24 Correct 20 ms 4784 KB Output is correct
25 Correct 19 ms 4736 KB Output is correct
26 Correct 22 ms 4784 KB Output is correct
27 Correct 203 ms 22176 KB Output is correct
28 Correct 210 ms 22272 KB Output is correct
29 Correct 225 ms 22208 KB Output is correct
30 Correct 192 ms 21828 KB Output is correct
31 Correct 319 ms 33716 KB Output is correct
32 Correct 1575 ms 65080 KB Output is correct
33 Correct 429 ms 32236 KB Output is correct
34 Correct 633 ms 39948 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 966 ms 84556 KB Output is correct
37 Correct 2760 ms 247296 KB Output is correct
38 Correct 2839 ms 247100 KB Output is correct
39 Execution timed out 3091 ms 162908 KB Time limit exceeded
40 Halted 0 ms 0 KB -