oj.uz

답안 #658262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658262 2022-11-12T18:28:00 Z Richem 원 고르기 (APIO18_circle_selection) C++14
49 / 100
 2561 ms 1048576 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;
    }

    bool intersecte(Cercle autre) {
        long long xDist = xCentre - autre.xCentre, yDist = yCentre - autre.yCentre;
        long long rDist = rayon + autre.rayon;

        return xDist * xDist + yDist * yDist <= rDist * rDist;
    }
};

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};

void ajoutCercleGrille(int idCercle, long long taille) {
    if(enleve[idCercle])
        return;
    long long xGrille = cercle[idCercle].xCentre / taille, yGrille = cercle[idCercle].yCentre / taille;
    
    grille[(xGrille << 32) + yGrille].push_back(idCercle);
}

void calcGrille(long long taille) {
    for(int cur = 0; cur < nbCercle; cur++) {
        ajoutCercleGrille(cur, taille);
    }
}

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;

        while(tailleGrille/2 > cercle[grand].rayon) {
            tailleGrille /= 2;
            calcGrille(tailleGrille);
        }

        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[(nouvX << 32) + nouvY].clear();
                        grille[(nouvX << 32) + nouvY].shrink_to_fit();
                        continue;
                    }

                    for(auto autre : grille[(nouvX << 32) + nouvY]) {
                        if(cercle[grand].intersecte(cercle[autre]) && !enleve[autre]) {
                            enleve[autre] = 1;
                            quiEnleve[cercle[autre].id] = cercle[grand].id;
                        }
                        if(!cercle[grand].intersecte(cercle[autre])) {
                            quiReste.push_back(autre);
                        }
                    }
                }
            }
        }

        for(auto nouveau : quiReste) {
            ajoutCercleGrille(nouveau, tailleGrille);
        }
    }

    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 1 ms 388 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 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 1 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 980 KB Output is correct
12 Correct 2 ms 976 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 980 KB Output is correct
15 Correct 2 ms 972 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 984 KB Output is correct
20 Correct 4 ms 920 KB Output is correct
21 Correct 5 ms 1016 KB Output is correct
22 Correct 74 ms 34440 KB Output is correct
23 Correct 76 ms 34484 KB Output is correct
24 Correct 68 ms 34400 KB Output is correct
25 Correct 76 ms 35440 KB Output is correct
26 Correct 73 ms 34700 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 45464 KB Output is correct
2 Correct 293 ms 55868 KB Output is correct
3 Correct 227 ms 42384 KB Output is correct
4 Correct 206 ms 37288 KB Output is correct
5 Correct 548 ms 116888 KB Output is correct
6 Correct 1500 ms 350112 KB Output is correct
7 Correct 600 ms 131080 KB Output is correct
8 Correct 774 ms 167112 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1408 ms 538764 KB Output is correct
3 Runtime error 2458 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2561 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 388 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 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 1 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 980 KB Output is correct
12 Correct 2 ms 976 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 980 KB Output is correct
15 Correct 2 ms 972 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 984 KB Output is correct
20 Correct 4 ms 920 KB Output is correct
21 Correct 5 ms 1016 KB Output is correct
22 Correct 74 ms 34440 KB Output is correct
23 Correct 76 ms 34484 KB Output is correct
24 Correct 68 ms 34400 KB Output is correct
25 Correct 76 ms 35440 KB Output is correct
26 Correct 73 ms 34700 KB Output is correct
27 Correct 8 ms 1940 KB Output is correct
28 Correct 8 ms 1952 KB Output is correct
29 Correct 8 ms 1940 KB Output is correct
30 Correct 149 ms 68392 KB Output is correct
31 Correct 182 ms 68336 KB Output is correct
32 Correct 156 ms 69192 KB Output is correct
33 Correct 74 ms 15264 KB Output is correct
34 Correct 75 ms 15268 KB Output is correct
35 Correct 96 ms 17356 KB Output is correct
36 Correct 1788 ms 557560 KB Output is correct
37 Correct 1570 ms 561220 KB Output is correct
38 Correct 1513 ms 551504 KB Output is correct
39 Correct 747 ms 44808 KB Output is correct
40 Correct 804 ms 44956 KB Output is correct
41 Correct 727 ms 42864 KB Output is correct
42 Correct 272 ms 48224 KB Output is correct
43 Correct 1407 ms 543748 KB Output is correct
44 Correct 1364 ms 543704 KB Output is correct
45 Correct 1395 ms 543868 KB Output is correct
46 Correct 1403 ms 543796 KB Output is correct
47 Correct 1378 ms 543856 KB Output is correct
48 Correct 1363 ms 543776 KB Output is correct
49 Correct 1385 ms 544132 KB Output is correct
50 Correct 1474 ms 543780 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 388 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 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 1 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 980 KB Output is correct
12 Correct 2 ms 976 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 2 ms 980 KB Output is correct
15 Correct 2 ms 972 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 4 ms 984 KB Output is correct
20 Correct 4 ms 920 KB Output is correct
21 Correct 5 ms 1016 KB Output is correct
22 Correct 74 ms 34440 KB Output is correct
23 Correct 76 ms 34484 KB Output is correct
24 Correct 68 ms 34400 KB Output is correct
25 Correct 76 ms 35440 KB Output is correct
26 Correct 73 ms 34700 KB Output is correct
27 Correct 246 ms 45464 KB Output is correct
28 Correct 293 ms 55868 KB Output is correct
29 Correct 227 ms 42384 KB Output is correct
30 Correct 206 ms 37288 KB Output is correct
31 Correct 548 ms 116888 KB Output is correct
32 Correct 1500 ms 350112 KB Output is correct
33 Correct 600 ms 131080 KB Output is correct
34 Correct 774 ms 167112 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1408 ms 538764 KB Output is correct
37 Runtime error 2458 ms 1048576 KB Execution killed with signal 9
38 Halted 0 ms 0 KB -