oj.uz

답안 #579071

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579071 2022-06-18T11:12:11 Z noedit 원 고르기 (APIO18_circle_selection) C++14
37 / 100
 3000 ms 133548 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
#define INF 1000000010
#define MAXN 300000

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()
{

}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.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;
            }
            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]]] << ' ';
    }
    return 0;
}

Compilation message

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

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 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 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 2 ms 444 KB Output is correct
16 Correct 2 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 6 ms 852 KB Output is correct
21 Correct 5 ms 776 KB Output is correct
22 Correct 22 ms 3596 KB Output is correct
23 Correct 23 ms 1768 KB Output is correct
24 Correct 26 ms 3656 KB Output is correct
25 Correct 25 ms 3828 KB Output is correct
26 Correct 26 ms 3636 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 239 ms 24576 KB Output is correct
2 Correct 264 ms 23640 KB Output is correct
3 Correct 252 ms 22864 KB Output is correct
4 Correct 243 ms 23652 KB Output is correct
5 Correct 422 ms 33596 KB Output is correct
6 Execution timed out 3064 ms 46872 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 2256 ms 23136 KB Output is correct
3 Execution timed out 3099 ms 56796 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 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 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 2 ms 444 KB Output is correct
16 Correct 2 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 6 ms 852 KB Output is correct
21 Correct 5 ms 776 KB Output is correct
22 Correct 22 ms 3596 KB Output is correct
23 Correct 23 ms 1768 KB Output is correct
24 Correct 26 ms 3656 KB Output is correct
25 Correct 25 ms 3828 KB Output is correct
26 Correct 26 ms 3636 KB Output is correct
27 Correct 8 ms 1492 KB Output is correct
28 Correct 9 ms 1364 KB Output is correct
29 Correct 10 ms 1508 KB Output is correct
30 Correct 81 ms 5216 KB Output is correct
31 Correct 73 ms 6748 KB Output is correct
32 Correct 64 ms 6864 KB Output is correct
33 Correct 84 ms 8368 KB Output is correct
34 Correct 97 ms 8368 KB Output is correct
35 Correct 89 ms 8196 KB Output is correct
36 Correct 2738 ms 53876 KB Output is correct
37 Correct 2607 ms 53832 KB Output is correct
38 Correct 2560 ms 49564 KB Output is correct
39 Correct 1657 ms 12088 KB Output is correct
40 Correct 1639 ms 12204 KB Output is correct
41 Correct 1669 ms 12304 KB Output is correct
42 Correct 755 ms 10912 KB Output is correct
43 Correct 2749 ms 62244 KB Output is correct
44 Correct 2599 ms 62416 KB Output is correct
45 Correct 2678 ms 62476 KB Output is correct
46 Correct 2464 ms 62768 KB Output is correct
47 Correct 1962 ms 62608 KB Output is correct
48 Correct 2041 ms 62820 KB Output is correct
49 Correct 2172 ms 62804 KB Output is correct
50 Correct 2410 ms 62832 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 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 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 2 ms 444 KB Output is correct
16 Correct 2 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 6 ms 852 KB Output is correct
21 Correct 5 ms 776 KB Output is correct
22 Correct 22 ms 3596 KB Output is correct
23 Correct 23 ms 1768 KB Output is correct
24 Correct 26 ms 3656 KB Output is correct
25 Correct 25 ms 3828 KB Output is correct
26 Correct 26 ms 3636 KB Output is correct
27 Correct 239 ms 24576 KB Output is correct
28 Correct 264 ms 23640 KB Output is correct
29 Correct 252 ms 22864 KB Output is correct
30 Correct 243 ms 23652 KB Output is correct
31 Correct 422 ms 33596 KB Output is correct
32 Execution timed out 3064 ms 46872 KB Time limit exceeded
33 Halted 0 ms 0 KB -