oj.uz

Submission #658334

# Submission time Handle Problem Language Result Execution time Memory
658334 2022-11-12T19:53:43 Z Richem Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 94236 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{
    unsigned int 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 = (long long)cercle[cur].xCentre / tailleGrille;
                int yGrille = cercle[cur].yCentre / tailleGrille;
                
                grille[(xGrille << 32) + yGrille].push_back(cur);
            }
        }
 
        long long xGrille = (long long)cercle[grand].xCentre / tailleGrille, yGrille = (long long)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 = (long long)cercle[grand].xCentre - cercle[autre].xCentre, yDist = (long long)cercle[grand].yCentre - cercle[autre].yCentre;
                        long long rDist = (long long)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 = (long long)cercle[nouveau].xCentre / tailleGrille;
            int 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 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 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 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 2 ms 468 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 3 ms 468 KB Output is correct
22 Correct 22 ms 1584 KB Output is correct
23 Correct 16 ms 1644 KB Output is correct
24 Correct 42 ms 1584 KB Output is correct
25 Correct 25 ms 1644 KB Output is correct
26 Correct 40 ms 1760 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 9360 KB Output is correct
2 Correct 131 ms 8624 KB Output is correct
3 Correct 127 ms 9320 KB Output is correct
4 Correct 121 ms 8740 KB Output is correct
5 Correct 169 ms 10800 KB Output is correct
6 Correct 1053 ms 26024 KB Output is correct
7 Correct 1823 ms 11536 KB Output is correct
8 Correct 281 ms 16596 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 501 ms 22404 KB Output is correct
3 Correct 2167 ms 82984 KB Output is correct
4 Correct 2244 ms 82876 KB Output is correct
5 Correct 1433 ms 47220 KB Output is correct
6 Correct 487 ms 23928 KB Output is correct
7 Correct 369 ms 12224 KB Output is correct
8 Correct 36 ms 2960 KB Output is correct
9 Correct 1801 ms 94236 KB Output is correct
10 Correct 1022 ms 47384 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1672 ms 83892 KB Output is correct
2 Correct 1681 ms 83908 KB Output is correct
3 Correct 252 ms 17192 KB Output is correct
4 Correct 1690 ms 83704 KB Output is correct
5 Correct 1695 ms 83964 KB Output is correct
6 Correct 177 ms 10816 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 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 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 2 ms 468 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 3 ms 468 KB Output is correct
22 Correct 22 ms 1584 KB Output is correct
23 Correct 16 ms 1644 KB Output is correct
24 Correct 42 ms 1584 KB Output is correct
25 Correct 25 ms 1644 KB Output is correct
26 Correct 40 ms 1760 KB Output is correct
27 Correct 5 ms 596 KB Output is correct
28 Correct 4 ms 596 KB Output is correct
29 Correct 4 ms 596 KB Output is correct
30 Correct 42 ms 2924 KB Output is correct
31 Correct 36 ms 2972 KB Output is correct
32 Correct 63 ms 3052 KB Output is correct
33 Correct 44 ms 3144 KB Output is correct
34 Correct 45 ms 3028 KB Output is correct
35 Correct 47 ms 3352 KB Output is correct
36 Correct 535 ms 22376 KB Output is correct
37 Correct 456 ms 22416 KB Output is correct
38 Correct 568 ms 22412 KB Output is correct
39 Correct 448 ms 21896 KB Output is correct
40 Correct 467 ms 21928 KB Output is correct
41 Correct 474 ms 21904 KB Output is correct
42 Correct 119 ms 12040 KB Output is correct
43 Correct 770 ms 21924 KB Output is correct
44 Correct 760 ms 22008 KB Output is correct
45 Correct 714 ms 21956 KB Output is correct
46 Correct 717 ms 21880 KB Output is correct
47 Correct 789 ms 21952 KB Output is correct
48 Correct 768 ms 21888 KB Output is correct
49 Correct 783 ms 21876 KB Output is correct
50 Correct 780 ms 21884 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 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 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 2 ms 468 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 3 ms 468 KB Output is correct
22 Correct 22 ms 1584 KB Output is correct
23 Correct 16 ms 1644 KB Output is correct
24 Correct 42 ms 1584 KB Output is correct
25 Correct 25 ms 1644 KB Output is correct
26 Correct 40 ms 1760 KB Output is correct
27 Correct 129 ms 9360 KB Output is correct
28 Correct 131 ms 8624 KB Output is correct
29 Correct 127 ms 9320 KB Output is correct
30 Correct 121 ms 8740 KB Output is correct
31 Correct 169 ms 10800 KB Output is correct
32 Correct 1053 ms 26024 KB Output is correct
33 Correct 1823 ms 11536 KB Output is correct
34 Correct 281 ms 16596 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 501 ms 22404 KB Output is correct
37 Correct 2167 ms 82984 KB Output is correct
38 Correct 2244 ms 82876 KB Output is correct
39 Correct 1433 ms 47220 KB Output is correct
40 Correct 487 ms 23928 KB Output is correct
41 Correct 369 ms 12224 KB Output is correct
42 Correct 36 ms 2960 KB Output is correct
43 Correct 1801 ms 94236 KB Output is correct
44 Correct 1022 ms 47384 KB Output is correct
45 Correct 1672 ms 83892 KB Output is correct
46 Correct 1681 ms 83908 KB Output is correct
47 Correct 252 ms 17192 KB Output is correct
48 Correct 1690 ms 83704 KB Output is correct
49 Correct 1695 ms 83964 KB Output is correct
50 Correct 177 ms 10816 KB Output is correct
51 Correct 5 ms 596 KB Output is correct
52 Correct 4 ms 596 KB Output is correct
53 Correct 4 ms 596 KB Output is correct
54 Correct 42 ms 2924 KB Output is correct
55 Correct 36 ms 2972 KB Output is correct
56 Correct 63 ms 3052 KB Output is correct
57 Correct 44 ms 3144 KB Output is correct
58 Correct 45 ms 3028 KB Output is correct
59 Correct 47 ms 3352 KB Output is correct
60 Correct 535 ms 22376 KB Output is correct
61 Correct 456 ms 22416 KB Output is correct
62 Correct 568 ms 22412 KB Output is correct
63 Correct 448 ms 21896 KB Output is correct
64 Correct 467 ms 21928 KB Output is correct
65 Correct 474 ms 21904 KB Output is correct
66 Correct 119 ms 12040 KB Output is correct
67 Correct 770 ms 21924 KB Output is correct
68 Correct 760 ms 22008 KB Output is correct
69 Correct 714 ms 21956 KB Output is correct
70 Correct 717 ms 21880 KB Output is correct
71 Correct 789 ms 21952 KB Output is correct
72 Correct 768 ms 21888 KB Output is correct
73 Correct 783 ms 21876 KB Output is correct
74 Correct 780 ms 21884 KB Output is correct
75 Correct 149 ms 9124 KB Output is correct
76 Correct 150 ms 8696 KB Output is correct
77 Correct 138 ms 9136 KB Output is correct
78 Correct 132 ms 8480 KB Output is correct
79 Correct 236 ms 9864 KB Output is correct
80 Correct 128 ms 8416 KB Output is correct
81 Correct 1713 ms 89524 KB Output is correct
82 Correct 1720 ms 83004 KB Output is correct
83 Correct 2455 ms 83048 KB Output is correct
84 Correct 2117 ms 84284 KB Output is correct
85 Correct 1933 ms 84476 KB Output is correct
86 Correct 1730 ms 84012 KB Output is correct
87 Correct 2136 ms 84320 KB Output is correct
88 Correct 1506 ms 45512 KB Output is correct
89 Correct 1551 ms 45468 KB Output is correct
90 Correct 1560 ms 45496 KB Output is correct
91 Correct 1531 ms 45416 KB Output is correct
92 Correct 1575 ms 45676 KB Output is correct
93 Execution timed out 3082 ms 84152 KB Time limit exceeded
94 Halted 0 ms 0 KB -