oj.uz

답안 #970407

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970407 2024-04-26T13:34:21 Z steveonalex 원 고르기 (APIO18_circle_selection) C++17
87 / 100
 3000 ms 63456 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 3e5 + 69;
const ll INF = 1e9;
int n; 
int ans[N];
vector<array<ll, 4>> a;

ll sqr(ll x){return x * x;}
ll block_sz;
map<pair<ll, ll>, vector<int>> grid;

pair<ll, ll> dumb_down(pair<ll, ll> a){
    return {a.first / block_sz, a.second / block_sz};
}

void set_up(ll arg){
    block_sz = arg;

    grid.clear();
    for(int i= 1; i<=n; ++i) if (ans[i] == 0){
        grid[dumb_down(make_pair(a[i][0], a[i][1]))].push_back(i);
    }
}

ll dis(pair<ll, ll> a, pair<ll, ll> b){return sqr(a.first - b.first) + sqr(a.second - b.second);}

bool check(pair<ll, ll> point, ll r, pair<ll, ll> des){
    if (des.first < 0 || des.second < 0) return false;
    for(int x = 0; x <= 1; ++x) for(int y = 0; y<=1; ++y){
        pair<ll, ll> ligma = {des.first * block_sz, des.second * block_sz};
        if (x) ligma.first += block_sz - 1;
        if (y) ligma.second += block_sz - 1;
        if ((abs(point.first - ligma.first) + abs(point.second - ligma.second)) * 2 > r * 3) continue;
        if (dis(point, ligma) <= sqr(r)) return true;
    }
    return false;
}

bool query(int i, int j){
    return sqr(a[i][0] - a[j][0]) + sqr(a[i][1] - a[j][1]) <= sqr(a[i][2] + a[j][2]);
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
    cin >> n;
    a.resize(n+1);
    for(int i = 1; i<=n; ++i) {
        for(int j = 0; j < 3; ++j) cin >> a[i][j];
        a[i][0] += INF; a[i][1] += INF;
        a[i][3] = i;
    }

    vector<array<ll, 4>> b = a;
    sort(1 + ALL(b), [](array<ll, 4> x, array<ll, 4> y){
        if (x[2] != y[2]) return x[2] > y[2];
        return x[3] < y[3];
    });

    set_up((b[1][2] + 1) / 2);
    for(int i = 1; i<=n; ++i) if (ans[b[i][3]] == 0){
        int _i = b[i][3];
        ans[_i] = _i;

        if (b[i][2] < block_sz)
            set_up((b[i][2] + 1) / 2);

        pair<ll, ll> cur = make_pair(b[i][0], b[i][1]);
        pair<ll, ll> magnifico = dumb_down(cur);
        const int EXTEND = 5;
        for(int x = -EXTEND; x <= EXTEND; ++x) for(int y = -EXTEND; y<=EXTEND; ++y) {
            pair<ll, ll> cu = make_pair(magnifico.first + x, magnifico.second + y);

            // bool bruh = check(cur, b[i][2] * 2, cu);
            // if (max(abs(x), abs(y)) == EXTEND && bruh) exit(1);

            if (!grid.count(cu)) continue;
            for(int j: grid[cu]){
                if (ans[j] == 0 && query(_i, j)) ans[j] = _i;
            }
        }
    }

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

    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 484 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 20 ms 1368 KB Output is correct
23 Correct 26 ms 1116 KB Output is correct
24 Correct 19 ms 1372 KB Output is correct
25 Correct 18 ms 1372 KB Output is correct
26 Correct 19 ms 1372 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 23032 KB Output is correct
2 Correct 117 ms 22508 KB Output is correct
3 Correct 116 ms 23480 KB Output is correct
4 Correct 109 ms 22600 KB Output is correct
5 Correct 181 ms 25684 KB Output is correct
6 Correct 845 ms 49236 KB Output is correct
7 Correct 259 ms 33008 KB Output is correct
8 Correct 389 ms 36708 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 668 ms 18508 KB Output is correct
3 Correct 2652 ms 55048 KB Output is correct
4 Correct 2556 ms 55072 KB Output is correct
5 Correct 2419 ms 51436 KB Output is correct
6 Correct 757 ms 26704 KB Output is correct
7 Correct 308 ms 14360 KB Output is correct
8 Correct 46 ms 3412 KB Output is correct
9 Correct 2731 ms 54760 KB Output is correct
10 Correct 1997 ms 51416 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2286 ms 55304 KB Output is correct
2 Correct 1500 ms 55172 KB Output is correct
3 Correct 648 ms 44372 KB Output is correct
4 Correct 1555 ms 55272 KB Output is correct
5 Correct 1527 ms 55188 KB Output is correct
6 Correct 256 ms 29784 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 484 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 20 ms 1368 KB Output is correct
23 Correct 26 ms 1116 KB Output is correct
24 Correct 19 ms 1372 KB Output is correct
25 Correct 18 ms 1372 KB Output is correct
26 Correct 19 ms 1372 KB Output is correct
27 Correct 4 ms 1112 KB Output is correct
28 Correct 4 ms 1368 KB Output is correct
29 Correct 4 ms 1112 KB Output is correct
30 Correct 53 ms 2244 KB Output is correct
31 Correct 43 ms 2136 KB Output is correct
32 Correct 43 ms 2136 KB Output is correct
33 Correct 39 ms 8072 KB Output is correct
34 Correct 41 ms 8144 KB Output is correct
35 Correct 45 ms 7636 KB Output is correct
36 Correct 549 ms 18508 KB Output is correct
37 Correct 545 ms 18804 KB Output is correct
38 Correct 597 ms 18836 KB Output is correct
39 Correct 513 ms 17048 KB Output is correct
40 Correct 536 ms 16972 KB Output is correct
41 Correct 538 ms 16996 KB Output is correct
42 Correct 284 ms 18340 KB Output is correct
43 Correct 408 ms 18484 KB Output is correct
44 Correct 395 ms 18468 KB Output is correct
45 Correct 396 ms 18460 KB Output is correct
46 Correct 412 ms 18512 KB Output is correct
47 Correct 393 ms 18512 KB Output is correct
48 Correct 405 ms 18708 KB Output is correct
49 Correct 399 ms 18512 KB Output is correct
50 Correct 411 ms 18712 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 484 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 20 ms 1368 KB Output is correct
23 Correct 26 ms 1116 KB Output is correct
24 Correct 19 ms 1372 KB Output is correct
25 Correct 18 ms 1372 KB Output is correct
26 Correct 19 ms 1372 KB Output is correct
27 Correct 114 ms 23032 KB Output is correct
28 Correct 117 ms 22508 KB Output is correct
29 Correct 116 ms 23480 KB Output is correct
30 Correct 109 ms 22600 KB Output is correct
31 Correct 181 ms 25684 KB Output is correct
32 Correct 845 ms 49236 KB Output is correct
33 Correct 259 ms 33008 KB Output is correct
34 Correct 389 ms 36708 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 668 ms 18508 KB Output is correct
37 Correct 2652 ms 55048 KB Output is correct
38 Correct 2556 ms 55072 KB Output is correct
39 Correct 2419 ms 51436 KB Output is correct
40 Correct 757 ms 26704 KB Output is correct
41 Correct 308 ms 14360 KB Output is correct
42 Correct 46 ms 3412 KB Output is correct
43 Correct 2731 ms 54760 KB Output is correct
44 Correct 1997 ms 51416 KB Output is correct
45 Correct 2286 ms 55304 KB Output is correct
46 Correct 1500 ms 55172 KB Output is correct
47 Correct 648 ms 44372 KB Output is correct
48 Correct 1555 ms 55272 KB Output is correct
49 Correct 1527 ms 55188 KB Output is correct
50 Correct 256 ms 29784 KB Output is correct
51 Correct 4 ms 1112 KB Output is correct
52 Correct 4 ms 1368 KB Output is correct
53 Correct 4 ms 1112 KB Output is correct
54 Correct 53 ms 2244 KB Output is correct
55 Correct 43 ms 2136 KB Output is correct
56 Correct 43 ms 2136 KB Output is correct
57 Correct 39 ms 8072 KB Output is correct
58 Correct 41 ms 8144 KB Output is correct
59 Correct 45 ms 7636 KB Output is correct
60 Correct 549 ms 18508 KB Output is correct
61 Correct 545 ms 18804 KB Output is correct
62 Correct 597 ms 18836 KB Output is correct
63 Correct 513 ms 17048 KB Output is correct
64 Correct 536 ms 16972 KB Output is correct
65 Correct 538 ms 16996 KB Output is correct
66 Correct 284 ms 18340 KB Output is correct
67 Correct 408 ms 18484 KB Output is correct
68 Correct 395 ms 18468 KB Output is correct
69 Correct 396 ms 18460 KB Output is correct
70 Correct 412 ms 18512 KB Output is correct
71 Correct 393 ms 18512 KB Output is correct
72 Correct 405 ms 18708 KB Output is correct
73 Correct 399 ms 18512 KB Output is correct
74 Correct 411 ms 18712 KB Output is correct
75 Correct 137 ms 31604 KB Output is correct
76 Correct 130 ms 31560 KB Output is correct
77 Correct 136 ms 32732 KB Output is correct
78 Correct 122 ms 32560 KB Output is correct
79 Correct 167 ms 31904 KB Output is correct
80 Correct 123 ms 32496 KB Output is correct
81 Correct 2446 ms 63232 KB Output is correct
82 Correct 2300 ms 62980 KB Output is correct
83 Correct 2314 ms 62928 KB Output is correct
84 Correct 2620 ms 63456 KB Output is correct
85 Correct 2366 ms 62992 KB Output is correct
86 Correct 2236 ms 63076 KB Output is correct
87 Execution timed out 3060 ms 61188 KB Time limit exceeded
88 Halted 0 ms 0 KB -