oj.uz

답안 #217785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217785 2020-03-30T18:12:19 Z Vimmer 원 고르기 (APIO18_circle_selection) C++14
19 / 100
 3000 ms 66656 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;

bool cmp(pair <int, int> x, pair <int, int> y)
{
    if (x.F != y.F) return x.F > y.F;

    return x.S < y.S;
}
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)
    {
        vector <pair <int, int> > vr; vr.clear();

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

        sort(vr.begin(), vr.end(), cmp);

        int j = 0;

        while (j < sz(vr))
        {
            pair <int, int> pt = vr[j];

            j++;

            if (ans[pt.S] != -1) continue;

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

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

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

            if (it != sl.begin())
            {
                it--;

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

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

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

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

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

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

                itr++;
            }

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

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

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

                itp++;
            }

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

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

                se.erase({x[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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 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 8 ms 640 KB Output is correct
22 Correct 304 ms 648 KB Output is correct
23 Correct 319 ms 760 KB Output is correct
24 Correct 303 ms 640 KB Output is correct
25 Correct 302 ms 640 KB Output is correct
26 Correct 305 ms 640 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1802 ms 66556 KB Output is correct
2 Correct 1773 ms 64036 KB Output is correct
3 Correct 1760 ms 66536 KB Output is correct
4 Correct 1843 ms 66656 KB Output is correct
5 Correct 1242 ms 62180 KB Output is correct
6 Correct 1224 ms 62704 KB Output is correct
7 Correct 1189 ms 62600 KB Output is correct
8 Correct 1145 ms 62656 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Execution timed out 3078 ms 5368 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3082 ms 15608 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 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 8 ms 640 KB Output is correct
22 Correct 304 ms 648 KB Output is correct
23 Correct 319 ms 760 KB Output is correct
24 Correct 303 ms 640 KB Output is correct
25 Correct 302 ms 640 KB Output is correct
26 Correct 305 ms 640 KB Output is correct
27 Correct 10 ms 896 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 10 ms 896 KB Output is correct
30 Correct 1260 ms 1016 KB Output is correct
31 Correct 1289 ms 1016 KB Output is correct
32 Correct 1306 ms 896 KB Output is correct
33 Correct 63 ms 6008 KB Output is correct
34 Correct 66 ms 6008 KB Output is correct
35 Correct 68 ms 6008 KB Output is correct
36 Execution timed out 3077 ms 5368 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 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 8 ms 640 KB Output is correct
22 Correct 304 ms 648 KB Output is correct
23 Correct 319 ms 760 KB Output is correct
24 Correct 303 ms 640 KB Output is correct
25 Correct 302 ms 640 KB Output is correct
26 Correct 305 ms 640 KB Output is correct
27 Correct 1802 ms 66556 KB Output is correct
28 Correct 1773 ms 64036 KB Output is correct
29 Correct 1760 ms 66536 KB Output is correct
30 Correct 1843 ms 66656 KB Output is correct
31 Correct 1242 ms 62180 KB Output is correct
32 Correct 1224 ms 62704 KB Output is correct
33 Correct 1189 ms 62600 KB Output is correct
34 Correct 1145 ms 62656 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Execution timed out 3078 ms 5368 KB Time limit exceeded
37 Halted 0 ms 0 KB -