oj.uz

Submission #217763

# Submission time Handle Problem Language Result Execution time Memory
217763 2020-03-30T16:58:26 Z Vimmer Circle selection (APIO18_circle_selection) C++14
7 / 100
 3000 ms 60220 KB 
#include <bits/stdc++.h>

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 300005
#define M ll(998244353)

using namespace std;

typedef long double ld;
typedef long long ll;
typedef short int si;


int ans[N];

set <pair <int, int> > se, sl, sr;

int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    for (int i = 0; i < n; i++) ans[i] = -1;

    ld x[n], y[n], r[n];

    bool f = 1;

    for (int i = 0; i < n; i++) {int X, Y, R; cin >> X >> Y >> R; if (Y != 0) f = 0; x[i] = X; y[i] = Y; r[i] = R;}

    if (f)
    {
        for (int i = 0; i < n; i++) {se.insert({r[i], i}); sl.insert({x[i] - r[i], i}); sr.insert({x[i] + r[i], i});}

        while (sz(se) > 0)
        {
            pair <int, int> pt = *se.rbegin();

            auto it = sl.lower_bound({x[pt.S] - r[pt.S], -1e9});

            vector <int> del; del.clear();

            while (it != sl.end())
            {
                if ((*it).F > x[pt.S] + r[pt.S]) break;

                del.pb((*it).S);

                it++;
            }

            auto itr = sr.upper_bound({x[pt.S] + r[pt.S], -1e9});

            if (itr != sr.begin())
            {
                itr--;

                while (itr != sr.begin())
                {
                    if ((*itr).F < x[pt.S] - r[pt.S]) break;

                    del.pb((*itr).S);

                    itr--;
                }
            }

            for (auto it : del)
            {
                ans[it] = pt.S + 1;

                se.erase({r[it], it});

                sl.erase({x[it] - r[it], it});

                sr.erase({x[it] + r[it], it});
            }
        }

        for (int i = 0; i < n; i++) cout << ans[i] << " ";

        exit(0);
    }

    int s = n;

    while (s > 0)
    {
        int nm = -1;

        for (int i = 0; i < n; i++)
        {
            if (ans[i] != -1) continue;

            if (nm == -1 || r[nm] < r[i]) nm = i;
        }

        for (int i = 0; i < n; i++)
        {
            if (ans[i] != -1) continue;

            ld rst = sqrt(pow(abs(x[nm] - x[i]), 2) + pow(abs(y[nm] - y[i]), 2));

            if (r[nm] + r[i] >= rst) {ans[i] = nm + 1; s--;}
        }
    }

    for (int i = 0; i < n; i++) cout << ans[i] << " ";
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 7 ms 640 KB Output is correct
20 Correct 7 ms 640 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 298 ms 640 KB Output is correct
23 Correct 326 ms 640 KB Output is correct
24 Correct 306 ms 640 KB Output is correct
25 Correct 306 ms 640 KB Output is correct
26 Correct 316 ms 640 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1647 ms 60220 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Execution timed out 3087 ms 5496 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 7 ms 640 KB Output is correct
20 Correct 7 ms 640 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 298 ms 640 KB Output is correct
23 Correct 326 ms 640 KB Output is correct
24 Correct 306 ms 640 KB Output is correct
25 Correct 306 ms 640 KB Output is correct
26 Correct 316 ms 640 KB Output is correct
27 Correct 10 ms 896 KB Output is correct
28 Correct 9 ms 896 KB Output is correct
29 Correct 10 ms 896 KB Output is correct
30 Correct 1301 ms 1016 KB Output is correct
31 Correct 1307 ms 896 KB Output is correct
32 Correct 1317 ms 1024 KB Output is correct
33 Correct 59 ms 6008 KB Output is correct
34 Correct 58 ms 6008 KB Output is correct
35 Correct 68 ms 6008 KB Output is correct
36 Execution timed out 3054 ms 5504 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 7 ms 640 KB Output is correct
20 Correct 7 ms 640 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 298 ms 640 KB Output is correct
23 Correct 326 ms 640 KB Output is correct
24 Correct 306 ms 640 KB Output is correct
25 Correct 306 ms 640 KB Output is correct
26 Correct 316 ms 640 KB Output is correct
27 Incorrect 1647 ms 60220 KB Output isn't correct
28 Halted 0 ms 0 KB -