oj.uz

Submission #579115

# Submission time Handle Problem Language Result Execution time Memory
579115 2022-06-18T11:45:52 Z noedit Circle selection (APIO18_circle_selection) C++17
72 / 100
 3000 ms 248352 KB 
#include <bits/stdc++.h>
#define sz(x) (x.size())
using namespace std;
typedef long long ll;
//#define int long long
#define MAXN 301010
#define INF 1000000010
pair<pair<int, int>, pair<int, int>> in[MAXN];
int X[MAXN], Y[MAXN], R[MAXN];
int ind[MAXN];
int ri[MAXN];
int ans[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]);
}
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;
    for (int 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 (int 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 s, e;
    e = 0;
    for (int k = 30; k >= 0; k--)
    {
        int r = 1 << k;
        s = e + 1;
        if (R[s] < r / 2)
        {
            continue;
        }
        mp.clear();
        e = 0;
        for (int i = s; i <= n; i++)
        {
            if (ans[i])
            {
                continue;
            }
            int x = X[i] >> k;
            int 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 (int i = s; i <= e; i++)
        {
            if (ans[i])
            {
                continue;
            }
            ans[i] = i;
            int x, y;
            x = X[i] >> k;
            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 (int i = 1; i <= n; i++)
    {
        ri[ind[i]] = i;
    }
    for (int 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 1 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 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 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 5 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 18 ms 4784 KB Output is correct
23 Correct 20 ms 4728 KB Output is correct
24 Correct 19 ms 4792 KB Output is correct
25 Correct 19 ms 4756 KB Output is correct
26 Correct 26 ms 4836 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 22108 KB Output is correct
2 Correct 233 ms 22404 KB Output is correct
3 Correct 218 ms 22236 KB Output is correct
4 Correct 222 ms 21804 KB Output is correct
5 Correct 335 ms 33736 KB Output is correct
6 Correct 1570 ms 65084 KB Output is correct
7 Correct 362 ms 32208 KB Output is correct
8 Correct 633 ms 39936 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 997 ms 84544 KB Output is correct
3 Correct 2962 ms 247132 KB Output is correct
4 Correct 2882 ms 247184 KB Output is correct
5 Execution timed out 3087 ms 162956 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1438 ms 248324 KB Output is correct
2 Correct 1440 ms 248344 KB Output is correct
3 Correct 454 ms 37356 KB Output is correct
4 Correct 1453 ms 248352 KB Output is correct
5 Correct 1424 ms 248320 KB Output is correct
6 Correct 315 ms 31924 KB Output is correct

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 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 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 5 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 18 ms 4784 KB Output is correct
23 Correct 20 ms 4728 KB Output is correct
24 Correct 19 ms 4792 KB Output is correct
25 Correct 19 ms 4756 KB Output is correct
26 Correct 26 ms 4836 KB Output is correct
27 Correct 7 ms 1236 KB Output is correct
28 Correct 8 ms 1236 KB Output is correct
29 Correct 7 ms 1108 KB Output is correct
30 Correct 38 ms 9348 KB Output is correct
31 Correct 52 ms 9316 KB Output is correct
32 Correct 60 ms 9312 KB Output is correct
33 Correct 73 ms 7500 KB Output is correct
34 Correct 81 ms 7456 KB Output is correct
35 Correct 71 ms 7820 KB Output is correct
36 Correct 1032 ms 86524 KB Output is correct
37 Correct 901 ms 86584 KB Output is correct
38 Correct 1088 ms 86280 KB Output is correct
39 Correct 684 ms 17692 KB Output is correct
40 Correct 733 ms 17836 KB Output is correct
41 Correct 721 ms 17872 KB Output is correct
42 Correct 180 ms 15168 KB Output is correct
43 Correct 478 ms 81680 KB Output is correct
44 Correct 693 ms 81860 KB Output is correct
45 Correct 465 ms 81656 KB Output is correct
46 Correct 477 ms 81800 KB Output is correct
47 Correct 487 ms 81856 KB Output is correct
48 Correct 510 ms 81744 KB Output is correct
49 Correct 531 ms 81852 KB Output is correct
50 Correct 531 ms 81740 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 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 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 5 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 18 ms 4784 KB Output is correct
23 Correct 20 ms 4728 KB Output is correct
24 Correct 19 ms 4792 KB Output is correct
25 Correct 19 ms 4756 KB Output is correct
26 Correct 26 ms 4836 KB Output is correct
27 Correct 220 ms 22108 KB Output is correct
28 Correct 233 ms 22404 KB Output is correct
29 Correct 218 ms 22236 KB Output is correct
30 Correct 222 ms 21804 KB Output is correct
31 Correct 335 ms 33736 KB Output is correct
32 Correct 1570 ms 65084 KB Output is correct
33 Correct 362 ms 32208 KB Output is correct
34 Correct 633 ms 39936 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 997 ms 84544 KB Output is correct
37 Correct 2962 ms 247132 KB Output is correct
38 Correct 2882 ms 247184 KB Output is correct
39 Execution timed out 3087 ms 162956 KB Time limit exceeded
40 Halted 0 ms 0 KB -