oj.uz

Submission #579069

# Submission time Handle Problem Language Result Execution time Memory
579069 2022-06-18T11:10:41 Z noedit Circle selection (APIO18_circle_selection) C++17
37 / 100
 3000 ms 133992 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

# Verdict Execution time Memory 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 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 324 KB Output is correct
11 Correct 1 ms 328 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 328 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 980 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 4 ms 976 KB Output is correct
22 Correct 22 ms 3692 KB Output is correct
23 Correct 21 ms 1896 KB Output is correct
24 Correct 24 ms 3760 KB Output is correct
25 Correct 23 ms 3972 KB Output is correct
26 Correct 26 ms 3776 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 24788 KB Output is correct
2 Correct 223 ms 23792 KB Output is correct
3 Correct 216 ms 23028 KB Output is correct
4 Correct 200 ms 23984 KB Output is correct
5 Correct 386 ms 33924 KB Output is correct
6 Execution timed out 3089 ms 47148 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1811 ms 23396 KB Output is correct
3 Execution timed out 3086 ms 56972 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 133992 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory 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 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 324 KB Output is correct
11 Correct 1 ms 328 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 328 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 980 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 4 ms 976 KB Output is correct
22 Correct 22 ms 3692 KB Output is correct
23 Correct 21 ms 1896 KB Output is correct
24 Correct 24 ms 3760 KB Output is correct
25 Correct 23 ms 3972 KB Output is correct
26 Correct 26 ms 3776 KB Output is correct
27 Correct 8 ms 1492 KB Output is correct
28 Correct 8 ms 1536 KB Output is correct
29 Correct 8 ms 1492 KB Output is correct
30 Correct 50 ms 5436 KB Output is correct
31 Correct 70 ms 6876 KB Output is correct
32 Correct 60 ms 7140 KB Output is correct
33 Correct 69 ms 8340 KB Output is correct
34 Correct 69 ms 8344 KB Output is correct
35 Correct 75 ms 8188 KB Output is correct
36 Correct 2021 ms 53964 KB Output is correct
37 Correct 2025 ms 53804 KB Output is correct
38 Correct 2047 ms 49420 KB Output is correct
39 Correct 1378 ms 12092 KB Output is correct
40 Correct 1423 ms 12136 KB Output is correct
41 Correct 1450 ms 12152 KB Output is correct
42 Correct 633 ms 10956 KB Output is correct
43 Correct 1918 ms 62144 KB Output is correct
44 Correct 1842 ms 61660 KB Output is correct
45 Correct 1941 ms 61576 KB Output is correct
46 Correct 2075 ms 61864 KB Output is correct
47 Correct 1970 ms 61720 KB Output is correct
48 Correct 2127 ms 61884 KB Output is correct
49 Correct 1954 ms 61992 KB Output is correct
50 Correct 1913 ms 61988 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory 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 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 324 KB Output is correct
11 Correct 1 ms 328 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 328 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 980 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 4 ms 976 KB Output is correct
22 Correct 22 ms 3692 KB Output is correct
23 Correct 21 ms 1896 KB Output is correct
24 Correct 24 ms 3760 KB Output is correct
25 Correct 23 ms 3972 KB Output is correct
26 Correct 26 ms 3776 KB Output is correct
27 Correct 204 ms 24788 KB Output is correct
28 Correct 223 ms 23792 KB Output is correct
29 Correct 216 ms 23028 KB Output is correct
30 Correct 200 ms 23984 KB Output is correct
31 Correct 386 ms 33924 KB Output is correct
32 Execution timed out 3089 ms 47148 KB Time limit exceeded
33 Halted 0 ms 0 KB -