oj.uz

Submission #658316

# Submission time Handle Problem Language Result Execution time Memory
658316 2022-11-12T19:30:24 Z Richem Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 99388 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];

unsigned int tailleGrille = (1 << 31);

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 deltaX = -2; deltaX <= 2; deltaX++) {
            for(int deltaY = -2; deltaY <= 2; deltaY++) {
                long long nouvX = xGrille + deltaX, nouvY = yGrille + deltaY;
                auto &v = grille[(nouvX << 32) + nouvY];

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

                    for(auto autre : v) {
                        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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 2 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 504 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 25 ms 1712 KB Output is correct
23 Correct 19 ms 1756 KB Output is correct
24 Correct 39 ms 1712 KB Output is correct
25 Correct 28 ms 1712 KB Output is correct
26 Correct 37 ms 1712 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 14076 KB Output is correct
2 Correct 141 ms 14128 KB Output is correct
3 Correct 142 ms 14120 KB Output is correct
4 Correct 150 ms 13488 KB Output is correct
5 Correct 200 ms 15384 KB Output is correct
6 Correct 1174 ms 30720 KB Output is correct
7 Correct 1981 ms 16204 KB Output is correct
8 Correct 323 ms 21352 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 491 ms 24016 KB Output is correct
3 Correct 2282 ms 87756 KB Output is correct
4 Correct 2418 ms 87640 KB Output is correct
5 Correct 1477 ms 52816 KB Output is correct
6 Correct 529 ms 26380 KB Output is correct
7 Correct 368 ms 13428 KB Output is correct
8 Correct 45 ms 3264 KB Output is correct
9 Correct 1927 ms 99388 KB Output is correct
10 Correct 1082 ms 52172 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1814 ms 88624 KB Output is correct
2 Correct 1814 ms 88484 KB Output is correct
3 Correct 285 ms 21916 KB Output is correct
4 Correct 1807 ms 88584 KB Output is correct
5 Correct 1783 ms 88492 KB Output is correct
6 Correct 203 ms 15636 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 2 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 504 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 25 ms 1712 KB Output is correct
23 Correct 19 ms 1756 KB Output is correct
24 Correct 39 ms 1712 KB Output is correct
25 Correct 28 ms 1712 KB Output is correct
26 Correct 37 ms 1712 KB Output is correct
27 Correct 5 ms 724 KB Output is correct
28 Correct 5 ms 724 KB Output is correct
29 Correct 5 ms 724 KB Output is correct
30 Correct 39 ms 3028 KB Output is correct
31 Correct 36 ms 3148 KB Output is correct
32 Correct 74 ms 3044 KB Output is correct
33 Correct 55 ms 4680 KB Output is correct
34 Correct 48 ms 4596 KB Output is correct
35 Correct 51 ms 4936 KB Output is correct
36 Correct 587 ms 24028 KB Output is correct
37 Correct 474 ms 23980 KB Output is correct
38 Correct 625 ms 23940 KB Output is correct
39 Correct 474 ms 23392 KB Output is correct
40 Correct 484 ms 23372 KB Output is correct
41 Correct 491 ms 23792 KB Output is correct
42 Correct 139 ms 13688 KB Output is correct
43 Correct 849 ms 23440 KB Output is correct
44 Correct 809 ms 23532 KB Output is correct
45 Correct 756 ms 23440 KB Output is correct
46 Correct 734 ms 23448 KB Output is correct
47 Correct 845 ms 23548 KB Output is correct
48 Correct 826 ms 23452 KB Output is correct
49 Correct 918 ms 23448 KB Output is correct
50 Correct 824 ms 23452 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 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 2 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 504 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 25 ms 1712 KB Output is correct
23 Correct 19 ms 1756 KB Output is correct
24 Correct 39 ms 1712 KB Output is correct
25 Correct 28 ms 1712 KB Output is correct
26 Correct 37 ms 1712 KB Output is correct
27 Correct 168 ms 14076 KB Output is correct
28 Correct 141 ms 14128 KB Output is correct
29 Correct 142 ms 14120 KB Output is correct
30 Correct 150 ms 13488 KB Output is correct
31 Correct 200 ms 15384 KB Output is correct
32 Correct 1174 ms 30720 KB Output is correct
33 Correct 1981 ms 16204 KB Output is correct
34 Correct 323 ms 21352 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 491 ms 24016 KB Output is correct
37 Correct 2282 ms 87756 KB Output is correct
38 Correct 2418 ms 87640 KB Output is correct
39 Correct 1477 ms 52816 KB Output is correct
40 Correct 529 ms 26380 KB Output is correct
41 Correct 368 ms 13428 KB Output is correct
42 Correct 45 ms 3264 KB Output is correct
43 Correct 1927 ms 99388 KB Output is correct
44 Correct 1082 ms 52172 KB Output is correct
45 Correct 1814 ms 88624 KB Output is correct
46 Correct 1814 ms 88484 KB Output is correct
47 Correct 285 ms 21916 KB Output is correct
48 Correct 1807 ms 88584 KB Output is correct
49 Correct 1783 ms 88492 KB Output is correct
50 Correct 203 ms 15636 KB Output is correct
51 Correct 5 ms 724 KB Output is correct
52 Correct 5 ms 724 KB Output is correct
53 Correct 5 ms 724 KB Output is correct
54 Correct 39 ms 3028 KB Output is correct
55 Correct 36 ms 3148 KB Output is correct
56 Correct 74 ms 3044 KB Output is correct
57 Correct 55 ms 4680 KB Output is correct
58 Correct 48 ms 4596 KB Output is correct
59 Correct 51 ms 4936 KB Output is correct
60 Correct 587 ms 24028 KB Output is correct
61 Correct 474 ms 23980 KB Output is correct
62 Correct 625 ms 23940 KB Output is correct
63 Correct 474 ms 23392 KB Output is correct
64 Correct 484 ms 23372 KB Output is correct
65 Correct 491 ms 23792 KB Output is correct
66 Correct 139 ms 13688 KB Output is correct
67 Correct 849 ms 23440 KB Output is correct
68 Correct 809 ms 23532 KB Output is correct
69 Correct 756 ms 23440 KB Output is correct
70 Correct 734 ms 23448 KB Output is correct
71 Correct 845 ms 23548 KB Output is correct
72 Correct 826 ms 23452 KB Output is correct
73 Correct 918 ms 23448 KB Output is correct
74 Correct 824 ms 23452 KB Output is correct
75 Correct 191 ms 14004 KB Output is correct
76 Correct 156 ms 13356 KB Output is correct
77 Correct 155 ms 14016 KB Output is correct
78 Correct 143 ms 13132 KB Output is correct
79 Correct 322 ms 14624 KB Output is correct
80 Correct 138 ms 13076 KB Output is correct
81 Correct 1813 ms 98780 KB Output is correct
82 Correct 1925 ms 95516 KB Output is correct
83 Correct 2642 ms 95552 KB Output is correct
84 Correct 2227 ms 96776 KB Output is correct
85 Correct 2029 ms 95812 KB Output is correct
86 Correct 1896 ms 95588 KB Output is correct
87 Correct 2258 ms 96796 KB Output is correct
88 Correct 1763 ms 53572 KB Output is correct
89 Correct 1873 ms 53536 KB Output is correct
90 Correct 1890 ms 53536 KB Output is correct
91 Correct 1854 ms 53532 KB Output is correct
92 Correct 1774 ms 53532 KB Output is correct
93 Execution timed out 3040 ms 95268 KB Time limit exceeded
94 Halted 0 ms 0 KB -