oj.uz

Submission #579093

# Submission time Handle Problem Language Result Execution time Memory
579093 2022-06-18T11:23:47 Z noedit Circle selection (APIO18_circle_selection) C++17
37 / 100
 3000 ms 133916 KB 
#include <bits/stdc++.h>
#define sz(x) (x.size())
using namespace std;
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;
}

inline 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;
}

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::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 = X[i] >> k;
            int 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] && 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:100:39: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
  100 |                     mp[(ll)xx << 31LL + yy].push_back(i);
      |                                  ~~~~~^~~~
circle_selection.cpp:122:44: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
  122 |                     ll t = ((ll)xx << 31LL + yy);
      |                                       ~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 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 2 ms 468 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 852 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 22 ms 3544 KB Output is correct
23 Correct 20 ms 1748 KB Output is correct
24 Correct 23 ms 3656 KB Output is correct
25 Correct 19 ms 3788 KB Output is correct
26 Correct 24 ms 3636 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 24460 KB Output is correct
2 Correct 224 ms 23504 KB Output is correct
3 Correct 229 ms 22772 KB Output is correct
4 Correct 216 ms 23688 KB Output is correct
5 Correct 402 ms 33600 KB Output is correct
6 Execution timed out 3081 ms 46896 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1727 ms 23452 KB Output is correct
3 Execution timed out 3063 ms 56880 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 3084 ms 133916 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 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 2 ms 468 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 852 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 22 ms 3544 KB Output is correct
23 Correct 20 ms 1748 KB Output is correct
24 Correct 23 ms 3656 KB Output is correct
25 Correct 19 ms 3788 KB Output is correct
26 Correct 24 ms 3636 KB Output is correct
27 Correct 8 ms 1236 KB Output is correct
28 Correct 7 ms 1272 KB Output is correct
29 Correct 7 ms 1236 KB Output is correct
30 Correct 50 ms 5076 KB Output is correct
31 Correct 77 ms 6628 KB Output is correct
32 Correct 70 ms 6748 KB Output is correct
33 Correct 76 ms 8108 KB Output is correct
34 Correct 68 ms 8084 KB Output is correct
35 Correct 76 ms 7980 KB Output is correct
36 Correct 2024 ms 53680 KB Output is correct
37 Correct 1781 ms 53688 KB Output is correct
38 Correct 2005 ms 49376 KB Output is correct
39 Correct 1377 ms 11844 KB Output is correct
40 Correct 1353 ms 11872 KB Output is correct
41 Correct 1341 ms 11956 KB Output is correct
42 Correct 587 ms 10700 KB Output is correct
43 Correct 1955 ms 61860 KB Output is correct
44 Correct 1891 ms 61652 KB Output is correct
45 Correct 1918 ms 61580 KB Output is correct
46 Correct 1802 ms 61892 KB Output is correct
47 Correct 1870 ms 61712 KB Output is correct
48 Correct 1945 ms 61880 KB Output is correct
49 Correct 1798 ms 62008 KB Output is correct
50 Correct 1844 ms 61800 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 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 2 ms 468 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 852 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 22 ms 3544 KB Output is correct
23 Correct 20 ms 1748 KB Output is correct
24 Correct 23 ms 3656 KB Output is correct
25 Correct 19 ms 3788 KB Output is correct
26 Correct 24 ms 3636 KB Output is correct
27 Correct 222 ms 24460 KB Output is correct
28 Correct 224 ms 23504 KB Output is correct
29 Correct 229 ms 22772 KB Output is correct
30 Correct 216 ms 23688 KB Output is correct
31 Correct 402 ms 33600 KB Output is correct
32 Execution timed out 3081 ms 46896 KB Time limit exceeded
33 Halted 0 ms 0 KB -