oj.uz

Submission #658349

# Submission time Handle Problem Language Result Execution time Memory
658349 2022-11-12T21:05:05 Z hugo_pm Circle selection (APIO18_circle_selection) C++17
7 / 100
 119 ms 27892 KB 
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <vector>
#include <time.h>
#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);
}

// simulate hash_map<K, stack<V>>
template<typename K, typename V>
struct map2d {
    hash_map<K, V> to_last;
    vector<V> content, prev;
    map2d() { clear(); }

    void push(K key, V value) {
        int location = content.size();
        content.push_back(value);
        prev[location] = to_last[key];
        to_last[key] = location;
    }
    
    bool pop(K key, V& popped) {
        int location = to_last[key];
        if (!location) return false;
        popped = content[to_last[key]];
        to_last[key] = prev[location];
        return true;
    }

    bool empty(K key) {
        return to_last[key] == 0;
    }
    void erase(K key) {
        to_last[key] = 0;
    }
    void clear() {
        to_last.clear();
        content.resize(1);
        prev.resize(1);
    }
};
map2d<long long, 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.push((xGrille << 32) + yGrille, 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;
                    }

                    int autre;
                    while (grille.pop((nouvX << 32) + nouvY, autre)) {
                        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.push((xGrille << 32) + yGrille, nouveau);
        }
    }
    
    for(int cur = 0; cur < nbCercle; cur++) {
        cout << quiEnleve[cur]+1 << " ";
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 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 0 ms 344 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 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 512 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 4 ms 732 KB Output is correct
20 Correct 4 ms 736 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 16 ms 5360 KB Output is correct
23 Correct 15 ms 6132 KB Output is correct
24 Correct 17 ms 5484 KB Output is correct
25 Correct 16 ms 5356 KB Output is correct
26 Correct 15 ms 6148 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 111 ms 20804 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 53 ms 15072 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 119 ms 27892 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 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 0 ms 344 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 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 512 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 4 ms 732 KB Output is correct
20 Correct 4 ms 736 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 16 ms 5360 KB Output is correct
23 Correct 15 ms 6132 KB Output is correct
24 Correct 17 ms 5484 KB Output is correct
25 Correct 16 ms 5356 KB Output is correct
26 Correct 15 ms 6148 KB Output is correct
27 Correct 6 ms 980 KB Output is correct
28 Correct 6 ms 1020 KB Output is correct
29 Correct 6 ms 1008 KB Output is correct
30 Correct 34 ms 12524 KB Output is correct
31 Correct 33 ms 11740 KB Output is correct
32 Correct 34 ms 10256 KB Output is correct
33 Runtime error 44 ms 8088 KB Execution killed with signal 6
34 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 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 0 ms 344 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 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 512 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 4 ms 732 KB Output is correct
20 Correct 4 ms 736 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 16 ms 5360 KB Output is correct
23 Correct 15 ms 6132 KB Output is correct
24 Correct 17 ms 5484 KB Output is correct
25 Correct 16 ms 5356 KB Output is correct
26 Correct 15 ms 6148 KB Output is correct
27 Runtime error 111 ms 20804 KB Execution killed with signal 6
28 Halted 0 ms 0 KB -