oj.uz

답안 #477939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
477939 2021-10-04T17:09:25 Z Lobo Park (BOI16_park) C++17
100 / 100
 1649 ms 202260 KB 
#include <bits/stdc++.h>
 
using namespace std;

const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 2200

dbl w,h;
ll n, m, ds[maxn];
string ans[110000];

ii find(ii u) {
    if(u == ds[u]) return u;

    return ds[u] = find(ds[u]);
}

void join(ii u, ii v) {
    ds[v] = u;
}

bool alone(ii x) {
    if(x == 1) return find(3) == find(4);
    else if(x == 2) return find(2) == find(3);
    else if(x == 3) return find(1) == find(2);
    else return find(4) == find(1);
}

bool ver() {
    return find(1) != find(3);
}

bool hor() {
    return find(2) != find(4);
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    //freopen("in.in", "r", stdin);

    cin >> n >> m;
    cin >> w >> h;

    for(ii i = 1; i <= n+10; i++) {
        ds[i] = i;
    }

    priority_queue<pair<pair<dbl,ll>,pair<ll,ll>>, vector<pair<pair<dbl,ll>,pair<ll,ll>>>, greater<pair<pair<dbl,ll>,pair<ll,ll>>>> pq;

    vector<pair<dbl,pair<dbl,dbl>>> tree;
    for(ii i = 0; i < n; i++) {
        dbl x,y,r;
        cin >> x >> y >> r;
        tree.pb(mp(r,mp(x,y)));
    }

    for(ii i = 0; i < n; i++) {
        dbl x1 = tree[i].sc.fr;
        dbl y1 = tree[i].sc.sc;
        dbl r1 = tree[i].fr;

        pq.push(mp(mp(abs(h-y1-r1),1),mp(1,i+5)));
        pq.push(mp(mp(abs(w-x1-r1),1),mp(2,i+5)));
        pq.push(mp(mp(abs(y1-r1),1),mp(3,i+5)));
        pq.push(mp(mp(abs(x1-r1),1),mp(4,i+5)));

        for(ii j = i+1; j < n; j++) {
            dbl x2 = tree[j].sc.fr;
            dbl y2 = tree[j].sc.sc;
            dbl r2 = tree[j].fr;

            //cout << i+5 << " " << j+5 << " = " << sqrt(pow(x1-x2,2.0)+pow(y1-y2,2.0))-r1-r2 << endl;
            pq.push(mp(mp(sqrt(pow(x1-x2,2.0)+pow(y1-y2,2.0))-r1-r2,1),mp(i+5,j+5)));
        }
    }

    for(ii i = 0; i < m; i++) {
        dbl r;
        ll e;
        cin >> r >> e;

        pq.push(mp(mp(2*r,-i),mp(e,e)));
    }

    while(pq.size()) {
        if(pq.top().fr.sc == 1) {
            ll u = pq.top().sc.fr;
            ll v = pq.top().sc.sc;
            pq.pop();

            //cout << u << " com " << v << endl;
            u = find(u);
            v = find(v);
            //cout << " " << u << " - " << v << endl << endl;

            if(u != v) join(u,v);
        }
        else {
            ll id = -pq.top().fr.sc;
            ll e = pq.top().sc.fr;
            pq.pop();

            //cout << id << " " << e << endl;
            //cout << " 1 " << " " << find(1) << endl;
            //cout << " 2 " << " " << find(2) << endl;
            //cout << " 3 " << " " << find(3) << endl;
            //cout << " 4 " << " " << find(4) << endl;

            if(e == 1) {
                ans[id]+= '1';
                if(alone(e)) continue;
                if(ver() && !alone(2)) ans[id]+= '2';
                if(hor() && ver() && !alone(3)) ans[id]+= '3';
                if(hor() && !alone(4)) ans[id]+= '4';

                

            }
            else if(e == 2) {
                ans[id]+= '2';
                if(alone(e)) continue;
                if(ver() && !alone(1)) ans[id]+= '1';
                if(hor() && ver() && !alone(4)) ans[id]+= '4';
                if(hor() && !alone(3)) ans[id]+= '3';

            }
            else if(e == 3) {
                ans[id]+= '3';
                if(alone(e)) continue;
                if(ver() && !alone(4)) ans[id]+= '4';
                if(hor() && ver() && !alone(1)) ans[id]+= '1';
                if(hor() && !alone(2)) ans[id]+= '2';
            }
            else {
                ans[id]+= '4';
                if(alone(e)) continue;
                if(ver() && !alone(3)) ans[id]+= '3';
                if(hor() && ver() && !alone(2)) ans[id]+= '2';
                if(hor() && !alone(1)) ans[id]+= '1';
            }

            sort(all(ans[id]));

        }

    }

    for(ii i = 0; i < m; i++) {
        cout << ans[i] << endl;
    }





}

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1456 ms 102572 KB Output is correct
2 Correct 1536 ms 102532 KB Output is correct
3 Correct 1415 ms 102600 KB Output is correct
4 Correct 1428 ms 102564 KB Output is correct
5 Correct 1441 ms 102452 KB Output is correct
6 Correct 1412 ms 102560 KB Output is correct
7 Correct 1301 ms 102660 KB Output is correct
8 Correct 1404 ms 102540 KB Output is correct
9 Correct 2 ms 3660 KB Output is correct
10 Correct 2 ms 3660 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 10096 KB Output is correct
2 Correct 104 ms 10880 KB Output is correct
3 Correct 103 ms 10856 KB Output is correct
4 Correct 106 ms 11020 KB Output is correct
5 Correct 104 ms 10920 KB Output is correct
6 Correct 102 ms 11028 KB Output is correct
7 Correct 98 ms 11068 KB Output is correct
8 Correct 96 ms 11024 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1456 ms 102572 KB Output is correct
2 Correct 1536 ms 102532 KB Output is correct
3 Correct 1415 ms 102600 KB Output is correct
4 Correct 1428 ms 102564 KB Output is correct
5 Correct 1441 ms 102452 KB Output is correct
6 Correct 1412 ms 102560 KB Output is correct
7 Correct 1301 ms 102660 KB Output is correct
8 Correct 1404 ms 102540 KB Output is correct
9 Correct 2 ms 3660 KB Output is correct
10 Correct 2 ms 3660 KB Output is correct
11 Correct 103 ms 10096 KB Output is correct
12 Correct 104 ms 10880 KB Output is correct
13 Correct 103 ms 10856 KB Output is correct
14 Correct 106 ms 11020 KB Output is correct
15 Correct 104 ms 10920 KB Output is correct
16 Correct 102 ms 11028 KB Output is correct
17 Correct 98 ms 11068 KB Output is correct
18 Correct 96 ms 11024 KB Output is correct
19 Correct 1649 ms 202020 KB Output is correct
20 Correct 1598 ms 202068 KB Output is correct
21 Correct 1555 ms 202020 KB Output is correct
22 Correct 1545 ms 202260 KB Output is correct
23 Correct 1579 ms 202016 KB Output is correct
24 Correct 1518 ms 202060 KB Output is correct