oj.uz

답안 #579064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579064 2022-06-18T11:06:04 Z noedit 원 고르기 (APIO18_circle_selection) C++17
37 / 100
 3000 ms 141900 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("O0")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#define sz(x) (x.size())
using namespace std;
using namespace __gnu_pbds;

template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
//#define int long long

const int INF = 1e9;
const int MAXN = 3e5 + 10;

pair<pair<int, int>, pair<int, int> > in[MAXN];

int X[MAXN], Y[MAXN], R[MAXN];
int ind[MAXN];
int ans[MAXN];
int ri[MAXN];

inline ll sq(ll x)
{
    return x * x;
}

bool check(int i, int j)
{
    return sq(X[i] - X[j]) + sq(Y[i] - Y[j]) <= sq(R[i] + R[j]);
}

inline bool isrange(int x, int y)
{
    if (x < 0 || y < 0)
        return false;
    return true;
}

ll trans(int x, int y)
{
    return ((ll)x * 1ll * 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;

void solve()
{
    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;
            }
            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 (i = s; i <= e; i++)
        {
            if (ans[i])
            {
                continue;
            }
            ans[i] = i;
            int x = X[i] >> k;
            int 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 (i = 1; i <= n; i++)
    {
        ri[ind[i]] = i;
    }
    for (i = 1; i <= n; i++)
    {
        cout << ind[ans[ri[i]]] << ' ';
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    t = 1;
    while (t--)
    {
        solve();
    }
    return 0;
}

Compilation message

circle_selection.cpp: In function 'void solve()':
circle_selection.cpp:109:39: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
  109 |                     mp[(ll)xx << 31LL + yy].push_back(i);
      |                                  ~~~~~^~~~
circle_selection.cpp:130:44: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
  130 |                     ll t = ((ll)xx << 31LL + yy);
      |                                       ~~~~~^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 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 1 ms 324 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 332 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 328 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 6 ms 980 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 5 ms 980 KB Output is correct
22 Correct 21 ms 3752 KB Output is correct
23 Correct 22 ms 1896 KB Output is correct
24 Correct 33 ms 3760 KB Output is correct
25 Correct 28 ms 3888 KB Output is correct
26 Correct 31 ms 3756 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 209 ms 31352 KB Output is correct
2 Correct 243 ms 30288 KB Output is correct
3 Correct 221 ms 29472 KB Output is correct
4 Correct 208 ms 30400 KB Output is correct
5 Correct 422 ms 35264 KB Output is correct
6 Execution timed out 3083 ms 51568 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2174 ms 26056 KB Output is correct
3 Execution timed out 3034 ms 65200 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3048 ms 141900 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 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 1 ms 324 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 332 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 328 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 6 ms 980 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 5 ms 980 KB Output is correct
22 Correct 21 ms 3752 KB Output is correct
23 Correct 22 ms 1896 KB Output is correct
24 Correct 33 ms 3760 KB Output is correct
25 Correct 28 ms 3888 KB Output is correct
26 Correct 31 ms 3756 KB Output is correct
27 Correct 9 ms 1620 KB Output is correct
28 Correct 8 ms 1492 KB Output is correct
29 Correct 7 ms 1588 KB Output is correct
30 Correct 47 ms 5352 KB Output is correct
31 Correct 83 ms 6964 KB Output is correct
32 Correct 56 ms 7004 KB Output is correct
33 Correct 73 ms 11212 KB Output is correct
34 Correct 69 ms 11212 KB Output is correct
35 Correct 76 ms 10904 KB Output is correct
36 Correct 2221 ms 56196 KB Output is correct
37 Correct 2134 ms 56160 KB Output is correct
38 Correct 2104 ms 52920 KB Output is correct
39 Correct 1388 ms 13180 KB Output is correct
40 Correct 1406 ms 13000 KB Output is correct
41 Correct 1369 ms 13068 KB Output is correct
42 Correct 669 ms 12404 KB Output is correct
43 Correct 2024 ms 64712 KB Output is correct
44 Correct 1981 ms 64404 KB Output is correct
45 Correct 2168 ms 64252 KB Output is correct
46 Correct 2104 ms 64476 KB Output is correct
47 Correct 1936 ms 64340 KB Output is correct
48 Correct 2108 ms 64632 KB Output is correct
49 Correct 2107 ms 64704 KB Output is correct
50 Correct 1886 ms 64416 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 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 1 ms 324 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 332 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 328 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 6 ms 980 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 5 ms 980 KB Output is correct
22 Correct 21 ms 3752 KB Output is correct
23 Correct 22 ms 1896 KB Output is correct
24 Correct 33 ms 3760 KB Output is correct
25 Correct 28 ms 3888 KB Output is correct
26 Correct 31 ms 3756 KB Output is correct
27 Correct 209 ms 31352 KB Output is correct
28 Correct 243 ms 30288 KB Output is correct
29 Correct 221 ms 29472 KB Output is correct
30 Correct 208 ms 30400 KB Output is correct
31 Correct 422 ms 35264 KB Output is correct
32 Execution timed out 3083 ms 51568 KB Time limit exceeded
33 Halted 0 ms 0 KB -