oj.uz

답안 #260438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260438 2020-08-10T09:13:04 Z Kastanda 원 고르기 (APIO18_circle_selection) C++11
38 / 100
 2332 ms 398312 KB 
// M
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 300005;
int n, X[N], Y[N], R[N], M[N];
vector < int > UX;
vector < pair < int , int > > V[N * 2];
set < pair < int , int > > ST[N * 2];
inline int GetId(int a)
{
        return (int)(lower_bound(UX.begin(), UX.end(), a) - UX.begin());
}
inline bool Check(int i, int j)
{
        return ((ll)(X[i] - X[j]) * (ll)(X[i] - X[j]) + (ll)(Y[i] - Y[j]) * (ll)(Y[i] - Y[j]) <= (ll)(R[i] + R[j]) * (ll)(R[i] + R[j]));
}
inline void Get(int l, int r, int le, int ri, int i)
{
        l += (int)UX.size();
        r += (int)UX.size();
        for (; l < r; l >>= 1, r >>= 1)
        {
                if (l & 1)
                {
                        auto it = ST[l].lower_bound({le, -1});
                        while (it != ST[l].end() && it->first < ri)
                        {
                                if (M[it->second])
                                        it = ST[l].erase(it);
                                else if (Check(i, it->second))
                                        M[it->second] = i, it = ST[l].erase(it);
                                else
                                        it ++;
                        }
                        l ++;
                }
                if (r & 1)
                {
                        r --;
                        auto it = ST[r].lower_bound({le, -1});
                        while (it != ST[r].end() && it->first < ri)
                        {
                                if (M[it->second])
                                        it = ST[r].erase(it);
                                else if (Check(i, it->second))
                                        M[it->second] = i, it = ST[r].erase(it);
                                else
                                        it ++;
                        }
                }
        }
}
inline void Do(int i)
{
        M[i] = i;

        int lx = GetId(X[i] - R[i] * 3);
        int rx = GetId(X[i] + R[i] * 3 + 1);
        int ly = Y[i] - R[i] * 3;
        int ry = Y[i] + R[i] * 3 + 1;

        Get(lx, rx, ly, ry, i);
}
int main()
{
        scanf("%d", &n);
        for (int i = 1; i <= n; i ++)
                scanf("%d%d%d", &X[i], &Y[i], &R[i]), UX.push_back(X[i]);
        sort(UX.begin(), UX.end());
        UX.resize(unique(UX.begin(), UX.end()) - UX.begin());
        for (int i = 1; i <= n; i ++)
        {
                int x = GetId(X[i]);
                V[x + (int)UX.size()].push_back({Y[i], i});
        }
        for (int i = (int)UX.size(); i < (int)UX.size() * 2; i ++)
                sort(V[i].begin(), V[i].end());
        for (int i = (int)UX.size() - 1; i; i --)
                merge(V[i << 1].begin(), V[i << 1].end(), V[i << 1 ^ 1].begin(), V[i << 1 ^ 1].end(), back_inserter(V[i]));
        for (int i = 0; i < (int)UX.size() * 2; i ++)
                ST[i] = set < pair < int , int > > (V[i].begin(), V[i].end());
        set < pair < int , int > > TS;
        for (int i = 1; i <= n; i ++)
                TS.insert({-R[i], i});
        while (TS.size())
        {
                while (TS.size() && M[TS.begin()->second])
                        TS.erase(TS.begin());
                if (!TS.size())
                        break;
                int i = TS.begin()->second;
                TS.erase(TS.begin());
                Do(i);
        }
        for (int i = 1; i <= n; i ++)
                printf("%d ", M[i]);
        printf("\n");
        return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:67:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &n);
         ~~~~~^~~~~~~~~~
circle_selection.cpp:69:53: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf("%d%d%d", &X[i], &Y[i], &R[i]), UX.push_back(X[i]);
                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 42624 KB Output is correct
2 Correct 26 ms 42616 KB Output is correct
3 Correct 26 ms 42616 KB Output is correct
4 Correct 25 ms 42624 KB Output is correct
5 Correct 25 ms 42624 KB Output is correct
6 Incorrect 25 ms 42624 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1380 ms 394432 KB Output is correct
2 Correct 1416 ms 394080 KB Output is correct
3 Correct 1379 ms 394496 KB Output is correct
4 Incorrect 1391 ms 394036 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 42744 KB Output is correct
2 Correct 578 ms 150868 KB Output is correct
3 Correct 1914 ms 393568 KB Output is correct
4 Correct 1956 ms 393512 KB Output is correct
5 Correct 2330 ms 383620 KB Output is correct
6 Correct 912 ms 217700 KB Output is correct
7 Correct 437 ms 130540 KB Output is correct
8 Correct 88 ms 58484 KB Output is correct
9 Correct 2243 ms 394208 KB Output is correct
10 Correct 2332 ms 394336 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1648 ms 394920 KB Output is correct
2 Correct 1531 ms 398312 KB Output is correct
3 Correct 1561 ms 393800 KB Output is correct
4 Correct 1483 ms 394228 KB Output is correct
5 Correct 1449 ms 394016 KB Output is correct
6 Correct 1389 ms 395272 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 42624 KB Output is correct
2 Correct 26 ms 42616 KB Output is correct
3 Correct 26 ms 42616 KB Output is correct
4 Correct 25 ms 42624 KB Output is correct
5 Correct 25 ms 42624 KB Output is correct
6 Incorrect 25 ms 42624 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 42624 KB Output is correct
2 Correct 26 ms 42616 KB Output is correct
3 Correct 26 ms 42616 KB Output is correct
4 Correct 25 ms 42624 KB Output is correct
5 Correct 25 ms 42624 KB Output is correct
6 Incorrect 25 ms 42624 KB Output isn't correct
7 Halted 0 ms 0 KB -