oj.uz

답안 #287443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
287443 2020-08-31T17:04:46 Z ACmachine 원 고르기 (APIO18_circle_selection) C++17
100 / 100
 2761 ms 71696 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 

const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}


struct circle{
    pii mid; 
    int r;
    int id;
    circle(pii _mid, int _r, int _id){
        mid = _mid; r = _r; id = _id;
    }
    bool intersect(circle &other){
        ll dist = (ll)(mid.ff - other.mid.ff)*(mid.ff - other.mid.ff) + (ll)(mid.ss - other.mid.ss)*(mid.ss - other.mid.ss);
        ll radsum = r + other.r;
        radsum *= radsum;
        return radsum >= dist;
    }
};

struct hash_pair{
    size_t operator()(const pair<int, int>& p) const
    {
        auto hsh1 = hash<int>{}(p.ff);
        auto hsh2 = hash<int>{}(p.ss);
        return hsh1 ^ hsh2;
    }
};
bool operator<(const circle &lhs, const circle &rhs){
    if(lhs.r == rhs.r) return lhs.id < rhs.id;
    return lhs.r > rhs.r; 
}
struct AcAutomaton{
    int n; 
    vi out;
    vector<circle> circles;
    map<pii, vi> grid;
    vector<bool> removed;
	void read_in(){
		cin >> n;
        out.rsz(n, -1);
        removed.rsz(n, false);
        REP(i, n){
            pii mid; int r; cin >> mid >> r;
            circles.pb(circle(mid, r, i));
        }
	}
    void rescale(int square_size){
        grid.clear();
        REP(i, n){
            if(!removed[i]){
                circle c = circles[i];
                pii newmid = mp(c.mid.ff / square_size, c.mid.ss / square_size);
                grid[newmid].pb(i);
            }
        }
    }
	void solve(){
		set<circle> pq;
        REP(i, circles.size()) pq.insert(circles[i]);
        int square_size = pq.begin()->r;
        rescale(square_size);
        vector<circle> circles_sorted = circles;
        sort(all(circles_sorted));
        for(circle c : circles_sorted){
            if(removed[c.id]) continue;
            if(c.r <= square_size / 2){
                square_size = c.r;
                rescale(square_size);
            }
            pii newmid = mp(c.mid.ff / square_size, c.mid.ss / square_size);
            vi toadd;
            FOR(i, newmid.ff - 2, newmid.ff + 3, 1){
                FOR(j, newmid.ss - 2, newmid.ss + 3, 1){
                    if(grid.find(mp(i, j)) == grid.end()) continue;
                    toadd.clear();
                    for(int c2id : grid[mp(i, j)]){
                        circle c2 = circles[c2id];
                        if(c.intersect(c2)){
                            out[c2.id] = c.id;
                            removed[c2.id] = true; 
                        }
                        else toadd.pb(c2id);
                    }
                    grid[mp(i, j)] = toadd; 
                }
            }
        }
        /* while(!pq.empty()){ */
        /*     circle c = *pq.begin(); */
        /*     if(c.r <= square_size/2) { */
        /*         square_size = c.r; */
        /*         rescale(square_size); */
        /*     } */
        /*     pii newmid = mp(c.mid.ff / square_size, c.mid.ss / square_size); */
        /*     FOR(i, newmid.ff - 2, newmid.ff + 3, 1){ */
        /*         FOR(j, newmid.ss - 2, newmid.ss + 3, 1){ */
        /*             if(grid.find(mp(i, j)) == grid.end()) continue; */
        /*             for(int c2id : grid[mp(i, j)]){ */
        /*                 if(removed[c2id]) continue; */
        /*                 circle c2 = circles[c2id]; */
        /*                 if(c.intersect(c2)){ */
        /*                     out[c2.id] = c.id; */
        /*                     removed[c2.id] = true; */
        /*                     pq.erase(c2); */
        /*                 } */
        /*             } */
        /*         } */
        /*     } */
        /* } */
        REP(i, n) cout << out[i]+1 << (i == n - 1 ? "\n" : " ");
	}
};
    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int tcase = 1;
	while(tcase--){
		AcAutomaton solver;
		solver.read_in();
		solver.solve();
	}
    return 0;
}

Compilation message

circle_selection.cpp: In member function 'void AcAutomaton::solve()':
circle_selection.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<circle>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
circle_selection.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
circle_selection.cpp:138:9: note: in expansion of macro 'REP'
  138 |         REP(i, circles.size()) pq.insert(circles[i]);
      |         ^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 5 ms 896 KB Output is correct
20 Correct 4 ms 896 KB Output is correct
21 Correct 5 ms 896 KB Output is correct
22 Correct 17 ms 1408 KB Output is correct
23 Correct 18 ms 1408 KB Output is correct
24 Correct 17 ms 1408 KB Output is correct
25 Correct 15 ms 1408 KB Output is correct
26 Correct 16 ms 1408 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 477 ms 35108 KB Output is correct
2 Correct 493 ms 34476 KB Output is correct
3 Correct 479 ms 33768 KB Output is correct
4 Correct 450 ms 35156 KB Output is correct
5 Correct 394 ms 34388 KB Output is correct
6 Correct 1016 ms 47956 KB Output is correct
7 Correct 451 ms 35756 KB Output is correct
8 Correct 568 ms 38076 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 648 ms 21752 KB Output is correct
3 Correct 2482 ms 64680 KB Output is correct
4 Correct 2479 ms 64640 KB Output is correct
5 Correct 2476 ms 57688 KB Output is correct
6 Correct 879 ms 29240 KB Output is correct
7 Correct 381 ms 15932 KB Output is correct
8 Correct 45 ms 3692 KB Output is correct
9 Correct 2754 ms 63712 KB Output is correct
10 Correct 2197 ms 56916 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1849 ms 64852 KB Output is correct
2 Correct 1398 ms 64652 KB Output is correct
3 Correct 694 ms 41428 KB Output is correct
4 Correct 1459 ms 64592 KB Output is correct
5 Correct 1436 ms 64564 KB Output is correct
6 Correct 397 ms 35044 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 5 ms 896 KB Output is correct
20 Correct 4 ms 896 KB Output is correct
21 Correct 5 ms 896 KB Output is correct
22 Correct 17 ms 1408 KB Output is correct
23 Correct 18 ms 1408 KB Output is correct
24 Correct 17 ms 1408 KB Output is correct
25 Correct 15 ms 1408 KB Output is correct
26 Correct 16 ms 1408 KB Output is correct
27 Correct 9 ms 1404 KB Output is correct
28 Correct 12 ms 1404 KB Output is correct
29 Correct 9 ms 1404 KB Output is correct
30 Correct 38 ms 2428 KB Output is correct
31 Correct 36 ms 2428 KB Output is correct
32 Correct 36 ms 2548 KB Output is correct
33 Correct 115 ms 11500 KB Output is correct
34 Correct 120 ms 11628 KB Output is correct
35 Correct 112 ms 11476 KB Output is correct
36 Correct 539 ms 21740 KB Output is correct
37 Correct 537 ms 21740 KB Output is correct
38 Correct 565 ms 21816 KB Output is correct
39 Correct 433 ms 20204 KB Output is correct
40 Correct 442 ms 20192 KB Output is correct
41 Correct 434 ms 20204 KB Output is correct
42 Correct 391 ms 21744 KB Output is correct
43 Correct 371 ms 21612 KB Output is correct
44 Correct 363 ms 21516 KB Output is correct
45 Correct 363 ms 21484 KB Output is correct
46 Correct 380 ms 21416 KB Output is correct
47 Correct 361 ms 21484 KB Output is correct
48 Correct 378 ms 21484 KB Output is correct
49 Correct 370 ms 21484 KB Output is correct
50 Correct 370 ms 21484 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 5 ms 896 KB Output is correct
20 Correct 4 ms 896 KB Output is correct
21 Correct 5 ms 896 KB Output is correct
22 Correct 17 ms 1408 KB Output is correct
23 Correct 18 ms 1408 KB Output is correct
24 Correct 17 ms 1408 KB Output is correct
25 Correct 15 ms 1408 KB Output is correct
26 Correct 16 ms 1408 KB Output is correct
27 Correct 477 ms 35108 KB Output is correct
28 Correct 493 ms 34476 KB Output is correct
29 Correct 479 ms 33768 KB Output is correct
30 Correct 450 ms 35156 KB Output is correct
31 Correct 394 ms 34388 KB Output is correct
32 Correct 1016 ms 47956 KB Output is correct
33 Correct 451 ms 35756 KB Output is correct
34 Correct 568 ms 38076 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 648 ms 21752 KB Output is correct
37 Correct 2482 ms 64680 KB Output is correct
38 Correct 2479 ms 64640 KB Output is correct
39 Correct 2476 ms 57688 KB Output is correct
40 Correct 879 ms 29240 KB Output is correct
41 Correct 381 ms 15932 KB Output is correct
42 Correct 45 ms 3692 KB Output is correct
43 Correct 2754 ms 63712 KB Output is correct
44 Correct 2197 ms 56916 KB Output is correct
45 Correct 1849 ms 64852 KB Output is correct
46 Correct 1398 ms 64652 KB Output is correct
47 Correct 694 ms 41428 KB Output is correct
48 Correct 1459 ms 64592 KB Output is correct
49 Correct 1436 ms 64564 KB Output is correct
50 Correct 397 ms 35044 KB Output is correct
51 Correct 9 ms 1404 KB Output is correct
52 Correct 12 ms 1404 KB Output is correct
53 Correct 9 ms 1404 KB Output is correct
54 Correct 38 ms 2428 KB Output is correct
55 Correct 36 ms 2428 KB Output is correct
56 Correct 36 ms 2548 KB Output is correct
57 Correct 115 ms 11500 KB Output is correct
58 Correct 120 ms 11628 KB Output is correct
59 Correct 112 ms 11476 KB Output is correct
60 Correct 539 ms 21740 KB Output is correct
61 Correct 537 ms 21740 KB Output is correct
62 Correct 565 ms 21816 KB Output is correct
63 Correct 433 ms 20204 KB Output is correct
64 Correct 442 ms 20192 KB Output is correct
65 Correct 434 ms 20204 KB Output is correct
66 Correct 391 ms 21744 KB Output is correct
67 Correct 371 ms 21612 KB Output is correct
68 Correct 363 ms 21516 KB Output is correct
69 Correct 363 ms 21484 KB Output is correct
70 Correct 380 ms 21416 KB Output is correct
71 Correct 361 ms 21484 KB Output is correct
72 Correct 378 ms 21484 KB Output is correct
73 Correct 370 ms 21484 KB Output is correct
74 Correct 370 ms 21484 KB Output is correct
75 Correct 417 ms 33548 KB Output is correct
76 Correct 424 ms 34644 KB Output is correct
77 Correct 444 ms 34216 KB Output is correct
78 Correct 431 ms 33848 KB Output is correct
79 Correct 467 ms 34264 KB Output is correct
80 Correct 466 ms 34772 KB Output is correct
81 Correct 2393 ms 64724 KB Output is correct
82 Correct 2299 ms 64596 KB Output is correct
83 Correct 2278 ms 64752 KB Output is correct
84 Correct 2485 ms 64596 KB Output is correct
85 Correct 2337 ms 64724 KB Output is correct
86 Correct 2237 ms 64596 KB Output is correct
87 Correct 2761 ms 64452 KB Output is correct
88 Correct 1600 ms 63168 KB Output is correct
89 Correct 1588 ms 63204 KB Output is correct
90 Correct 1643 ms 63336 KB Output is correct
91 Correct 1626 ms 63244 KB Output is correct
92 Correct 1634 ms 63196 KB Output is correct
93 Correct 1731 ms 71636 KB Output is correct
94 Correct 1846 ms 71696 KB Output is correct
95 Correct 1666 ms 71636 KB Output is correct
96 Correct 1730 ms 71636 KB Output is correct
97 Correct 2670 ms 71440 KB Output is correct
98 Correct 1304 ms 59900 KB Output is correct
99 Correct 1831 ms 71668 KB Output is correct
100 Correct 1630 ms 71460 KB Output is correct
101 Correct 1649 ms 65020 KB Output is correct
102 Correct 1705 ms 71128 KB Output is correct
103 Correct 2388 ms 71124 KB Output is correct
104 Correct 1687 ms 71380 KB Output is correct
105 Correct 1388 ms 69236 KB Output is correct
106 Correct 1326 ms 70228 KB Output is correct
107 Correct 1318 ms 70228 KB Output is correct
108 Correct 1340 ms 70332 KB Output is correct
109 Correct 1373 ms 70212 KB Output is correct
110 Correct 1247 ms 70228 KB Output is correct
111 Correct 1300 ms 70312 KB Output is correct
112 Correct 1301 ms 70176 KB Output is correct
113 Correct 1285 ms 70228 KB Output is correct
114 Correct 1360 ms 70228 KB Output is correct
115 Correct 1316 ms 70228 KB Output is correct
116 Correct 1293 ms 70248 KB Output is correct