oj.uz

답안 #579101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579101 2022-06-18T11:30:43 Z noedit 원 고르기 (APIO18_circle_selection) C++17
72 / 100
 3000 ms 248672 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 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 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 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 420 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 504 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 972 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 5 ms 964 KB Output is correct
22 Correct 19 ms 4904 KB Output is correct
23 Correct 23 ms 4920 KB Output is correct
24 Correct 20 ms 4912 KB Output is correct
25 Correct 18 ms 4944 KB Output is correct
26 Correct 31 ms 4956 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 22444 KB Output is correct
2 Correct 213 ms 22520 KB Output is correct
3 Correct 232 ms 22720 KB Output is correct
4 Correct 210 ms 22276 KB Output is correct
5 Correct 332 ms 34360 KB Output is correct
6 Correct 1591 ms 65440 KB Output is correct
7 Correct 373 ms 32476 KB Output is correct
8 Correct 620 ms 40224 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 965 ms 84960 KB Output is correct
3 Correct 2791 ms 247524 KB Output is correct
4 Correct 2780 ms 247348 KB Output is correct
5 Execution timed out 3081 ms 163152 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1477 ms 248660 KB Output is correct
2 Correct 1428 ms 248672 KB Output is correct
3 Correct 511 ms 37504 KB Output is correct
4 Correct 1417 ms 248588 KB Output is correct
5 Correct 1404 ms 248588 KB Output is correct
6 Correct 307 ms 32076 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 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 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 420 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 504 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 972 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 5 ms 964 KB Output is correct
22 Correct 19 ms 4904 KB Output is correct
23 Correct 23 ms 4920 KB Output is correct
24 Correct 20 ms 4912 KB Output is correct
25 Correct 18 ms 4944 KB Output is correct
26 Correct 31 ms 4956 KB Output is correct
27 Correct 7 ms 1296 KB Output is correct
28 Correct 8 ms 1364 KB Output is correct
29 Correct 8 ms 1244 KB Output is correct
30 Correct 44 ms 9472 KB Output is correct
31 Correct 71 ms 9444 KB Output is correct
32 Correct 58 ms 9436 KB Output is correct
33 Correct 70 ms 7760 KB Output is correct
34 Correct 68 ms 7772 KB Output is correct
35 Correct 76 ms 8116 KB Output is correct
36 Correct 989 ms 86780 KB Output is correct
37 Correct 962 ms 86984 KB Output is correct
38 Correct 997 ms 86700 KB Output is correct
39 Correct 643 ms 17740 KB Output is correct
40 Correct 666 ms 17580 KB Output is correct
41 Correct 669 ms 17732 KB Output is correct
42 Correct 165 ms 15200 KB Output is correct
43 Correct 435 ms 81652 KB Output is correct
44 Correct 632 ms 81724 KB Output is correct
45 Correct 431 ms 81628 KB Output is correct
46 Correct 457 ms 81864 KB Output is correct
47 Correct 439 ms 81800 KB Output is correct
48 Correct 444 ms 81748 KB Output is correct
49 Correct 437 ms 81936 KB Output is correct
50 Correct 462 ms 81752 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 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 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 420 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 504 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 972 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 5 ms 964 KB Output is correct
22 Correct 19 ms 4904 KB Output is correct
23 Correct 23 ms 4920 KB Output is correct
24 Correct 20 ms 4912 KB Output is correct
25 Correct 18 ms 4944 KB Output is correct
26 Correct 31 ms 4956 KB Output is correct
27 Correct 205 ms 22444 KB Output is correct
28 Correct 213 ms 22520 KB Output is correct
29 Correct 232 ms 22720 KB Output is correct
30 Correct 210 ms 22276 KB Output is correct
31 Correct 332 ms 34360 KB Output is correct
32 Correct 1591 ms 65440 KB Output is correct
33 Correct 373 ms 32476 KB Output is correct
34 Correct 620 ms 40224 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 965 ms 84960 KB Output is correct
37 Correct 2791 ms 247524 KB Output is correct
38 Correct 2780 ms 247348 KB Output is correct
39 Execution timed out 3081 ms 163152 KB Time limit exceeded
40 Halted 0 ms 0 KB -