oj.uz

Submission #579110

# Submission time Handle Problem Language Result Execution time Memory
579110 2022-06-18T11:37:35 Z noedit Circle selection (APIO18_circle_selection) C++17
72 / 100
 3000 ms 248488 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 301010
#define INF 1000000010
pair<pair<int, int>, pair<int, int>> in[MAX];
int X[MAX];
int Y[MAX];
int R[MAX];
int ind[MAX];
int ri[MAX];
int ans[MAX];
inline ll sq(ll x)
{
    return x * x;
}
inline bool chk(int i, int j)
{
    return sq(X[i] - X[j]) + sq(Y[i] - Y[j]) <= sq(R[i] + R[j]);
}
bool isrange(int x, int y)
{
    if (x < 0 || y < 0)
    {
        return false;
    }
    return true;
}
inline ll trans(int x, int y)
{
    return ((ll)x * (ll)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;

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, y;
            x = X[i] >>k;
            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] && chk(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;
}

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 0 ms 340 KB Output is correct
6 Correct 0 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 2 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 4 ms 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 17 ms 4764 KB Output is correct
23 Correct 22 ms 4784 KB Output is correct
24 Correct 19 ms 4796 KB Output is correct
25 Correct 17 ms 4784 KB Output is correct
26 Correct 31 ms 4792 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 22152 KB Output is correct
2 Correct 226 ms 22324 KB Output is correct
3 Correct 208 ms 22292 KB Output is correct
4 Correct 214 ms 21828 KB Output is correct
5 Correct 315 ms 33728 KB Output is correct
6 Correct 1565 ms 65204 KB Output is correct
7 Correct 389 ms 32204 KB Output is correct
8 Correct 606 ms 40056 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1027 ms 84444 KB Output is correct
3 Correct 2838 ms 247204 KB Output is correct
4 Correct 2822 ms 247256 KB Output is correct
5 Execution timed out 3032 ms 163164 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1387 ms 248320 KB Output is correct
2 Correct 1429 ms 248488 KB Output is correct
3 Correct 516 ms 37240 KB Output is correct
4 Correct 1378 ms 248472 KB Output is correct
5 Correct 1390 ms 248340 KB Output is correct
6 Correct 296 ms 32004 KB Output is correct

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 0 ms 340 KB Output is correct
6 Correct 0 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 2 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 4 ms 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 17 ms 4764 KB Output is correct
23 Correct 22 ms 4784 KB Output is correct
24 Correct 19 ms 4796 KB Output is correct
25 Correct 17 ms 4784 KB Output is correct
26 Correct 31 ms 4792 KB Output is correct
27 Correct 7 ms 1236 KB Output is correct
28 Correct 8 ms 1236 KB Output is correct
29 Correct 9 ms 1264 KB Output is correct
30 Correct 44 ms 9260 KB Output is correct
31 Correct 53 ms 9340 KB Output is correct
32 Correct 42 ms 9280 KB Output is correct
33 Correct 67 ms 7532 KB Output is correct
34 Correct 67 ms 7548 KB Output is correct
35 Correct 70 ms 7852 KB Output is correct
36 Correct 949 ms 86532 KB Output is correct
37 Correct 913 ms 86656 KB Output is correct
38 Correct 1020 ms 86444 KB Output is correct
39 Correct 648 ms 17692 KB Output is correct
40 Correct 695 ms 17840 KB Output is correct
41 Correct 707 ms 17796 KB Output is correct
42 Correct 165 ms 15236 KB Output is correct
43 Correct 459 ms 81732 KB Output is correct
44 Correct 663 ms 81844 KB Output is correct
45 Correct 478 ms 81768 KB Output is correct
46 Correct 464 ms 81744 KB Output is correct
47 Correct 455 ms 81760 KB Output is correct
48 Correct 451 ms 81760 KB Output is correct
49 Correct 446 ms 81904 KB Output is correct
50 Correct 485 ms 81748 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 0 ms 340 KB Output is correct
6 Correct 0 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 2 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 4 ms 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 17 ms 4764 KB Output is correct
23 Correct 22 ms 4784 KB Output is correct
24 Correct 19 ms 4796 KB Output is correct
25 Correct 17 ms 4784 KB Output is correct
26 Correct 31 ms 4792 KB Output is correct
27 Correct 232 ms 22152 KB Output is correct
28 Correct 226 ms 22324 KB Output is correct
29 Correct 208 ms 22292 KB Output is correct
30 Correct 214 ms 21828 KB Output is correct
31 Correct 315 ms 33728 KB Output is correct
32 Correct 1565 ms 65204 KB Output is correct
33 Correct 389 ms 32204 KB Output is correct
34 Correct 606 ms 40056 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1027 ms 84444 KB Output is correct
37 Correct 2838 ms 247204 KB Output is correct
38 Correct 2822 ms 247256 KB Output is correct
39 Execution timed out 3032 ms 163164 KB Time limit exceeded
40 Halted 0 ms 0 KB -