oj.uz

Submission #579086

# Submission time Handle Problem Language Result Execution time Memory
579086 2022-06-18T11:20:08 Z noedit Circle selection (APIO18_circle_selection) C++17
37 / 100
 3000 ms 133592 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_base::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;
            }
            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:99:39: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   99 |                     mp[(ll)xx << 31LL + yy].push_back(i);
      |                                  ~~~~~^~~~
circle_selection.cpp:120:44: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
  120 |                     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 0 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 0 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 1 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 3 ms 852 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 23 ms 3632 KB Output is correct
23 Correct 19 ms 1748 KB Output is correct
24 Correct 21 ms 3672 KB Output is correct
25 Correct 21 ms 3888 KB Output is correct
26 Correct 23 ms 3652 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 24560 KB Output is correct
2 Correct 225 ms 23600 KB Output is correct
3 Correct 247 ms 22840 KB Output is correct
4 Correct 200 ms 23724 KB Output is correct
5 Correct 414 ms 33624 KB Output is correct
6 Execution timed out 3066 ms 47108 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 1747 ms 23120 KB Output is correct
3 Execution timed out 3074 ms 56964 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 3067 ms 133592 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 0 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 0 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 1 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 3 ms 852 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 23 ms 3632 KB Output is correct
23 Correct 19 ms 1748 KB Output is correct
24 Correct 21 ms 3672 KB Output is correct
25 Correct 21 ms 3888 KB Output is correct
26 Correct 23 ms 3652 KB Output is correct
27 Correct 10 ms 1236 KB Output is correct
28 Correct 7 ms 1236 KB Output is correct
29 Correct 7 ms 1268 KB Output is correct
30 Correct 48 ms 5076 KB Output is correct
31 Correct 58 ms 6632 KB Output is correct
32 Correct 59 ms 6732 KB Output is correct
33 Correct 79 ms 8100 KB Output is correct
34 Correct 70 ms 7988 KB Output is correct
35 Correct 74 ms 7944 KB Output is correct
36 Correct 2025 ms 53652 KB Output is correct
37 Correct 1834 ms 53556 KB Output is correct
38 Correct 2319 ms 49156 KB Output is correct
39 Correct 1323 ms 11844 KB Output is correct
40 Correct 1328 ms 12032 KB Output is correct
41 Correct 1336 ms 12052 KB Output is correct
42 Correct 580 ms 10660 KB Output is correct
43 Correct 1743 ms 61856 KB Output is correct
44 Correct 1830 ms 61632 KB Output is correct
45 Correct 1733 ms 61584 KB Output is correct
46 Correct 1725 ms 61876 KB Output is correct
47 Correct 1911 ms 61772 KB Output is correct
48 Correct 1977 ms 61872 KB Output is correct
49 Correct 1914 ms 61896 KB Output is correct
50 Correct 1880 ms 61808 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 0 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 0 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 1 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 3 ms 852 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 23 ms 3632 KB Output is correct
23 Correct 19 ms 1748 KB Output is correct
24 Correct 21 ms 3672 KB Output is correct
25 Correct 21 ms 3888 KB Output is correct
26 Correct 23 ms 3652 KB Output is correct
27 Correct 219 ms 24560 KB Output is correct
28 Correct 225 ms 23600 KB Output is correct
29 Correct 247 ms 22840 KB Output is correct
30 Correct 200 ms 23724 KB Output is correct
31 Correct 414 ms 33624 KB Output is correct
32 Execution timed out 3066 ms 47108 KB Time limit exceeded
33 Halted 0 ms 0 KB -