oj.uz

답안 #658302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658302 2022-11-12T19:16:42 Z Richem 원 고르기 (APIO18_circle_selection) C++14
87 / 100
 3000 ms 106424 KB 
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <vector>
#include <time.h>
#pragma once
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

struct uint64_hash {
  static inline uint64_t rotr(uint64_t x, unsigned k) {
    return (x >> k) | (x << (8U * sizeof(uint64_t) - k));
  }
 
  static inline uint64_t hash_int(uint64_t x) noexcept {
    auto h1 = x * (uint64_t)(0xA24BAED4963EE407);
    auto h2 = rotr(x, 32U) * (uint64_t)(0x9FB21C651E98DF25);
    auto h = rotr(h1 + h2, 32U);
    return h;
  }
 
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM = std::chrono::steady_clock::now().time_since_epoch().count();
    return hash_int(x + FIXED_RANDOM);
  }
};

template <typename K, typename V, typename Hash = uint64_hash>
using hash_map = __gnu_pbds::gp_hash_table<K, V, Hash>;
template <typename K, typename Hash = uint64_hash>
using hash_set = hash_map<K, __gnu_pbds::null_type, Hash>;
template <typename T>
using ordered_set = __gnu_pbds::tree<T, __gnu_pbds::null_type, std::less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;

using namespace std;

const int MAX_CERCLE = 3e5+42, INF = 1e9;

struct Cercle{
    long long xCentre, yCentre, rayon, id;

    bool operator<(Cercle autre) {
        if(rayon == autre.rayon)
            return id < autre.id;
        return rayon > autre.rayon;
    }
};

int nbCercle;
Cercle cercle[MAX_CERCLE];

void input() {
    cin >> nbCercle;

    for(int idCercle = 0; idCercle < nbCercle; idCercle++) {
        cin >> cercle[idCercle].xCentre >> cercle[idCercle].yCentre >> cercle[idCercle].rayon;
        cercle[idCercle].xCentre += INF;
        cercle[idCercle].yCentre += INF;
        cercle[idCercle].id = idCercle;
    }
    sort(cercle, cercle + nbCercle);
}

hash_map<long long, vector<int>> grille;
bool enleve[MAX_CERCLE] = {0};

int quiEnleve[MAX_CERCLE];

long long tailleGrille = (1e12);

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    input();

    for(int grand = 0; grand < nbCercle; grand++) {
        if(enleve[grand])
            continue;

        bool change = 0;
        while(tailleGrille/2 > cercle[grand].rayon) {
            tailleGrille /= 2;
            change = 1;
        }

        if(change) {
            grille.clear();
            for(int cur = 0; cur < nbCercle; cur++) {
                if(enleve[cur])
                    continue;
                long long xGrille = cercle[cur].xCentre / tailleGrille, yGrille = cercle[cur].yCentre / tailleGrille;
                
                grille[(xGrille << 32) + yGrille].push_back(cur);
            }
        }

        long long xGrille = cercle[grand].xCentre / tailleGrille, yGrille = cercle[grand].yCentre / tailleGrille;

        vector<int> quiReste;
        for(int type = 0; type < 2; type++) {
            for(int deltaX = -2; deltaX <= 2; deltaX++) {
                for(int deltaY = -2; deltaY <= 2; deltaY++) {
                    long long nouvX = xGrille + deltaX, nouvY = yGrille + deltaY;

                    if(type == 1) {
                        grille.erase((nouvX << 32) + nouvY);
                        continue;
                    }

                    for(auto autre : grille[(nouvX << 32) + nouvY]) {
                        long long xDist = cercle[grand].xCentre - cercle[autre].xCentre, yDist = cercle[grand].yCentre - cercle[autre].yCentre;
                        long long rDist = cercle[grand].rayon + cercle[autre].rayon;

                        if(xDist * xDist + yDist * yDist <= rDist * rDist && !enleve[autre]) {
                            enleve[autre] = 1;
                            quiEnleve[cercle[autre].id] = cercle[grand].id;
                        }
                        if(xDist * xDist + yDist * yDist > rDist * rDist) {
                            quiReste.push_back(autre);
                        }
                    }
                }
            }
        }

        for(auto nouveau : quiReste) {
            if(enleve[nouveau])
                continue;
            long long xGrille = cercle[nouveau].xCentre / tailleGrille, yGrille = cercle[nouveau].yCentre / tailleGrille;
            
            grille[(xGrille << 32) + yGrille].push_back(nouveau);
        }
    }

    for(int cur = 0; cur < nbCercle; cur++) {
        cout << quiEnleve[cur]+1 << " ";
    }
}

Compilation message

circle_selection.cpp:6:9: warning: #pragma once in main file
    6 | #pragma once
      |         ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 608 KB Output is correct
22 Correct 19 ms 1712 KB Output is correct
23 Correct 15 ms 1752 KB Output is correct
24 Correct 25 ms 1712 KB Output is correct
25 Correct 23 ms 1712 KB Output is correct
26 Correct 69 ms 1636 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 132 ms 13496 KB Output is correct
2 Correct 147 ms 14972 KB Output is correct
3 Correct 143 ms 14024 KB Output is correct
4 Correct 128 ms 13780 KB Output is correct
5 Correct 195 ms 15404 KB Output is correct
6 Correct 1532 ms 30600 KB Output is correct
7 Correct 2711 ms 16132 KB Output is correct
8 Correct 305 ms 21328 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 470 ms 23952 KB Output is correct
3 Correct 2043 ms 88348 KB Output is correct
4 Correct 2000 ms 95708 KB Output is correct
5 Correct 1476 ms 59828 KB Output is correct
6 Correct 646 ms 30704 KB Output is correct
7 Correct 262 ms 15688 KB Output is correct
8 Correct 59 ms 3808 KB Output is correct
9 Correct 1665 ms 106424 KB Output is correct
10 Correct 1140 ms 60496 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1709 ms 88744 KB Output is correct
2 Correct 1683 ms 88584 KB Output is correct
3 Correct 295 ms 30964 KB Output is correct
4 Correct 1734 ms 88516 KB Output is correct
5 Correct 1781 ms 88488 KB Output is correct
6 Correct 206 ms 15572 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 608 KB Output is correct
22 Correct 19 ms 1712 KB Output is correct
23 Correct 15 ms 1752 KB Output is correct
24 Correct 25 ms 1712 KB Output is correct
25 Correct 23 ms 1712 KB Output is correct
26 Correct 69 ms 1636 KB Output is correct
27 Correct 6 ms 832 KB Output is correct
28 Correct 7 ms 812 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 39 ms 3148 KB Output is correct
31 Correct 32 ms 3220 KB Output is correct
32 Correct 49 ms 3052 KB Output is correct
33 Correct 50 ms 5304 KB Output is correct
34 Correct 53 ms 5340 KB Output is correct
35 Correct 60 ms 4868 KB Output is correct
36 Correct 515 ms 23964 KB Output is correct
37 Correct 471 ms 23920 KB Output is correct
38 Correct 520 ms 23916 KB Output is correct
39 Correct 543 ms 13892 KB Output is correct
40 Correct 519 ms 13804 KB Output is correct
41 Correct 530 ms 13812 KB Output is correct
42 Correct 167 ms 23312 KB Output is correct
43 Correct 830 ms 23568 KB Output is correct
44 Correct 835 ms 23440 KB Output is correct
45 Correct 796 ms 23452 KB Output is correct
46 Correct 759 ms 23444 KB Output is correct
47 Correct 834 ms 23440 KB Output is correct
48 Correct 796 ms 23448 KB Output is correct
49 Correct 840 ms 23372 KB Output is correct
50 Correct 842 ms 23328 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 608 KB Output is correct
22 Correct 19 ms 1712 KB Output is correct
23 Correct 15 ms 1752 KB Output is correct
24 Correct 25 ms 1712 KB Output is correct
25 Correct 23 ms 1712 KB Output is correct
26 Correct 69 ms 1636 KB Output is correct
27 Correct 132 ms 13496 KB Output is correct
28 Correct 147 ms 14972 KB Output is correct
29 Correct 143 ms 14024 KB Output is correct
30 Correct 128 ms 13780 KB Output is correct
31 Correct 195 ms 15404 KB Output is correct
32 Correct 1532 ms 30600 KB Output is correct
33 Correct 2711 ms 16132 KB Output is correct
34 Correct 305 ms 21328 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 470 ms 23952 KB Output is correct
37 Correct 2043 ms 88348 KB Output is correct
38 Correct 2000 ms 95708 KB Output is correct
39 Correct 1476 ms 59828 KB Output is correct
40 Correct 646 ms 30704 KB Output is correct
41 Correct 262 ms 15688 KB Output is correct
42 Correct 59 ms 3808 KB Output is correct
43 Correct 1665 ms 106424 KB Output is correct
44 Correct 1140 ms 60496 KB Output is correct
45 Correct 1709 ms 88744 KB Output is correct
46 Correct 1683 ms 88584 KB Output is correct
47 Correct 295 ms 30964 KB Output is correct
48 Correct 1734 ms 88516 KB Output is correct
49 Correct 1781 ms 88488 KB Output is correct
50 Correct 206 ms 15572 KB Output is correct
51 Correct 6 ms 832 KB Output is correct
52 Correct 7 ms 812 KB Output is correct
53 Correct 5 ms 852 KB Output is correct
54 Correct 39 ms 3148 KB Output is correct
55 Correct 32 ms 3220 KB Output is correct
56 Correct 49 ms 3052 KB Output is correct
57 Correct 50 ms 5304 KB Output is correct
58 Correct 53 ms 5340 KB Output is correct
59 Correct 60 ms 4868 KB Output is correct
60 Correct 515 ms 23964 KB Output is correct
61 Correct 471 ms 23920 KB Output is correct
62 Correct 520 ms 23916 KB Output is correct
63 Correct 543 ms 13892 KB Output is correct
64 Correct 519 ms 13804 KB Output is correct
65 Correct 530 ms 13812 KB Output is correct
66 Correct 167 ms 23312 KB Output is correct
67 Correct 830 ms 23568 KB Output is correct
68 Correct 835 ms 23440 KB Output is correct
69 Correct 796 ms 23452 KB Output is correct
70 Correct 759 ms 23444 KB Output is correct
71 Correct 834 ms 23440 KB Output is correct
72 Correct 796 ms 23448 KB Output is correct
73 Correct 840 ms 23372 KB Output is correct
74 Correct 842 ms 23328 KB Output is correct
75 Correct 174 ms 23224 KB Output is correct
76 Correct 165 ms 22804 KB Output is correct
77 Correct 167 ms 22876 KB Output is correct
78 Correct 157 ms 24384 KB Output is correct
79 Correct 297 ms 23328 KB Output is correct
80 Correct 176 ms 24300 KB Output is correct
81 Execution timed out 3046 ms 95748 KB Time limit exceeded
82 Halted 0 ms 0 KB -