oj.uz

답안 #866686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866686 2023-10-26T17:23:23 Z efedmrlr Park (BOI16_park) C++17
100 / 100
 1421 ms 64644 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 4e6+500;
const int M = 2e3+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,w,h;
int curr;
vector<pair<array<int,2> , int> > tre;
vector<vector<int> > mxs;
struct DSU {
    vector<int> p, sz;
    void rsz() {
        p.resize(N); 
        sz.resize(N);
    }
    void reset() {
        for(int i = 0; i<n+20; i++) {
            make_set(i);
        }
    }
    void make_set(int x) {
        p[x] = x;
        sz[x] = 1;
    }
    int find_set(int x) {
        if(x == p[x]) return x;
        return p[x] = find_set(p[x]);
    }
    void union_set(int x, int y){
        x = find_set(x); y = find_set(y);
        
        if(x == y) return;
        
        if(sz[x] < sz[y]) swap(x,y);
        p[y] = x;
        sz[x] += sz[y];
    }
};
DSU ds;
int eucl_d(array<int,2> a, array<int,2> b) {
    array<int,2> c = {a[0] - b[0], a[1] - b[1]};
    return c[0]*c[0] + c[1]*c[1];
} 

bool is_in_dist(array<int,2> a, array<int,2> b, int dst) {
    return eucl_d(a,b) < (dst * dst);
}

void onion(int x, int y) {
    if(is_in_dist(tre[x].first, tre[y].first, tre[x].second + tre[y].second + curr)) {
        ds.union_set(x,y);
    }
}

bool is_valid(int r, int e1, int e2) {
    if(e1 > e2) swap(e1, e2);
    if(e1 == e2) return 1;
    ds.reset();
    r*=2;
    curr = r;
    // x = n   (floor)
    for(int i = 0; i<n; i++) {
        if(tre[i].first[1] - tre[i].second < curr) {
            ds.union_set(n, i);
        }
    }
    //x = n+1 (ceiling)
    for(int i = 0; i<n; i++) {
        if(h - (tre[i].first[1] + tre[i].second) < curr) {
            ds.union_set(n + 1, i);
        }
    }
    //x = n+2 (left)
    for(int i = 0; i<n; i++) {
        if(tre[i].first[0] - tre[i].second < curr) {
            ds.union_set(n + 2, i);
        }
    }
    //x = n+3 (right)
    for(int i = 0; i<n; i++) {
        if(w - (tre[i].first[0] + tre[i].second) < curr) {
            ds.union_set(n + 3, i);
        }
    }
    for(int i = 0; i<n; i++) {
        for(int j = i + 1; j<n; j++) {
            onion(i,j);
        }
    }



    if(e1 == 1 && e2 == 2) {
        if(ds.find_set(n) == ds.find_set(n+1) || ds.find_set(n) == ds.find_set(n+2) || ds.find_set(n) == ds.find_set(n+3)) {
            return 0;
        }
        return 1;
    }
    if(e1 == 1 && e2 == 3) {
        if(ds.find_set(n) == ds.find_set(n+1) || ds.find_set(n) == ds.find_set(n+2) || ds.find_set(n+1) == ds.find_set(n+3) || ds.find_set(n+2) == ds.find_set(n+3)) {
            return 0;
        }
        return 1;
    }
    if(e1 == 1 && e2 == 4) {
        if(ds.find_set(n+2) == ds.find_set(n) || ds.find_set(n+2) == ds.find_set(n+1) || ds.find_set(n+2) == ds.find_set(n+3)) {
            return 0;
        }
        return 1;
    }
    if(e1 == 2 && e2 == 3) {
        if(ds.find_set(n+3) == ds.find_set(n) || ds.find_set(n+3) == ds.find_set(n+1) || ds.find_set(n+3) == ds.find_set(n+2)) {
            return 0;
        }
        return 1;
    }
    if(e1 == 2 && e2 == 4) {
        if(ds.find_set(n) == ds.find_set(n+3) || ds.find_set(n) == ds.find_set(n+1) || ds.find_set(n+2) == ds.find_set(n+3) || ds.find_set(n+1) == ds.find_set(n+2)) {
            return 0;
        }
        return 1;
    }
    if(e1 == 3 && e2 == 4) {
        if(ds.find_set(n+1) == ds.find_set(n) || ds.find_set(n+1) == ds.find_set(n+2) || ds.find_set(n+1) == ds.find_set(n+3)) {
            return 0;
        }
        return 1;
    }
    assert(0);
    return 0;
}   

int bsearch(int e1, int e2) {
    int l = 0, r = min(h,w);
    while(l < r) {
        int tm = (l + r) / 2;
        if(is_valid(tm, e1, e2)) {
            l = tm + 1;
        }   
        else {
            r = tm;
        }
    }
    if(is_valid(l, e1, e2)) {
        return l;
    }
    return l - 1;

}

inline void solve() {
    cin>>n>>m;
    cin>>w>>h;
    tre.resize(n);
    mxs.assign(5, vector<int>(5, 0));
    ds.rsz();
    for(int i = 0; i<n; i++) {
        cin>>tre[i].first[0]>>tre[i].first[1]>>tre[i].second;
    }

    for(int i = 1; i<=4; i++) {
        mxs[i][i] = max(h,w);
        for(int j = i + 1; j <= 4; j++) {
            mxs[j][i] = mxs[i][j] = bsearch(i, j);
            
        }
    }

    for(int i = 0; i<m; i++) {
        int r, e;
        cin>>r>>e;
        for(int e2 = 1; e2<=4; e2++) {
            if(r <= mxs[e][e2]) {
                cout<<e2;
            }
        }
        cout<<"\n";
    }
    
   

}



 
signed main() {
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

park.cpp: In function 'std::string to_string(std::string, int, int)':
park.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1004 ms 63064 KB Output is correct
2 Correct 1008 ms 63120 KB Output is correct
3 Correct 1008 ms 63320 KB Output is correct
4 Correct 1022 ms 63128 KB Output is correct
5 Correct 1012 ms 63124 KB Output is correct
6 Correct 1008 ms 63124 KB Output is correct
7 Correct 1385 ms 63128 KB Output is correct
8 Correct 1415 ms 63124 KB Output is correct
9 Correct 8 ms 63068 KB Output is correct
10 Correct 8 ms 63068 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 63284 KB Output is correct
2 Correct 41 ms 64344 KB Output is correct
3 Correct 40 ms 64428 KB Output is correct
4 Correct 41 ms 64248 KB Output is correct
5 Correct 41 ms 64340 KB Output is correct
6 Correct 47 ms 64340 KB Output is correct
7 Correct 32 ms 64524 KB Output is correct
8 Correct 30 ms 64336 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1004 ms 63064 KB Output is correct
2 Correct 1008 ms 63120 KB Output is correct
3 Correct 1008 ms 63320 KB Output is correct
4 Correct 1022 ms 63128 KB Output is correct
5 Correct 1012 ms 63124 KB Output is correct
6 Correct 1008 ms 63124 KB Output is correct
7 Correct 1385 ms 63128 KB Output is correct
8 Correct 1415 ms 63124 KB Output is correct
9 Correct 8 ms 63068 KB Output is correct
10 Correct 8 ms 63068 KB Output is correct
11 Correct 42 ms 63284 KB Output is correct
12 Correct 41 ms 64344 KB Output is correct
13 Correct 40 ms 64428 KB Output is correct
14 Correct 41 ms 64248 KB Output is correct
15 Correct 41 ms 64340 KB Output is correct
16 Correct 47 ms 64340 KB Output is correct
17 Correct 32 ms 64524 KB Output is correct
18 Correct 30 ms 64336 KB Output is correct
19 Correct 1028 ms 64592 KB Output is correct
20 Correct 983 ms 64384 KB Output is correct
21 Correct 1016 ms 64644 KB Output is correct
22 Correct 977 ms 64396 KB Output is correct
23 Correct 1014 ms 64408 KB Output is correct
24 Correct 1421 ms 64392 KB Output is correct