oj.uz

Submission #1097795

# Submission time Handle Problem Language Result Execution time Memory
1097795 2024-10-08T09:37:32 Z pemguimn Park (BOI16_park) C++14
27 / 100
 412 ms 71364 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e3 + 10, M = 1e5 + 5;
int n, m, w, h, x[N], y[N], r[N], R[M], e[M], par[N], sz[N];
struct ev{
    long double dist;
    int t, x, y;
};

string res[M];

int root(int x){
    if(x == par[x]) return x;
    return par[x] = (root(par[x]));
}

void unite(int x, int y){
    x = root(x), y = root(y);
    if(x != y){
        if(sz[x] < sz[y]) swap(x, y);
        sz[x] += sz[y];
        par[y] = x;
    }
}

bool bound(int x, int y){
    return (root(x) == root(y));
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m >> w >> h;
    for(int i = 1; i <= n + 4; i++) par[i] = i, sz[i] = 1;
    swap(w, h);
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> y[i] >> r[i];
        swap(x[i], y[i]);
    }
    vector<ev> events;
    for(int i = 1; i <= n; i++){
        events.push_back({1.0L * x[i] - r[i], 1, i, n + 1});
        events.push_back({1.0L * (h - y[i]) - r[i], 1, i, n + 2});
        events.push_back({1.0L * (w - x[i]) - r[i], 1, i, n + 3});
        events.push_back({1.0L * y[i] - r[i], 1, i, n + 4});
    }
    for(int i = 1; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            long double dx = x[i] - x[j];
            long double dy = y[i] - y[j];
            events.push_back({sqrt(1.0L * dx * dx + dy * dy) - r[i] - r[j], 1, i, j});
        }
    }
    for(int i = 1; i <= m; i++){
        cin >> R[i] >> e[i];
        events.push_back({R[i] * 2, 0, i, 0});
    }
    sort(events.begin(), events.end(), [](ev x, ev y){
        return x.dist < y.dist || (x.dist == y.dist && x.t < y.t);
    });

    for(ev cur : events){
        if(cur.t == 1){
            unite(cur.x, cur.y);
        } else{
            string ans = "";
            bool go1 = true;
            bool go2 = true;
            bool go3 = true;
            bool go4 = true;

            if(e[cur.x] == 1){
                if(bound(n + 1, n + 3)) go2 = go3 = false;
                if(bound(n + 2, n + 4)) go4 = go3 = false;
                if(bound(n + 1, n + 2)) go2 = false;
                if(bound(n + 2, n + 3)) go3 = false;
                if(bound(n + 3, n + 4)) go4 = false;
            } else if(e[cur.x] == 2){
                // vertical
                if(bound(n + 1, n + 3)) go1 = go4 = false;
                // horizontal
                if(bound(n + 2, n + 4)) go4 = go3 = false;
                if(bound(n + 1, n + 4)) go1 = false;
                if(bound(n + 2, n + 3)) go3 = false;
                if(bound(n + 3, n + 4)) go4 = false;
            } else if(e[cur.x] == 3){
                if(bound(n + 1, n + 3)) go1 = go4 = false;
                if(bound(n + 2, n + 4)) go1 = go2 = false;
                if(bound(n + 1, n + 4)) go1 = false;
                if(bound(n + 1, n + 2)) go2 = false;
                if(bound(n + 3, n + 4)) go4 = false;
            } else{
                if(bound(n + 1, n + 3)) go1 = go4 = false;
                if(bound(n + 2, n + 4)) go1 = go2 = false;
                if(bound(n + 1, n + 4)) go1 = false;
                if(bound(n + 1, n + 2)) go2 = false;
                if(bound(n + 2, n + 3)) go3 = false;
            }

            if(go1) ans += "1";
            if(go2) ans += "2";
            if(go3) ans += "3";
            if(go4) ans += "4";
            res[cur.x] = ans;
        }
    }
    for(int i = 1; i <= m; i++) cout << res[i] << "\n";
    return 0;
}

Compilation message

park.cpp: In function 'int main()':
park.cpp:58:32: warning: narrowing conversion of '(R[i] * 2)' from 'int' to 'long double' [-Wnarrowing]
   58 |         events.push_back({R[i] * 2, 0, i, 0});
      |                           ~~~~~^~~

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 412 ms 70312 KB Output is correct
2 Correct 398 ms 70072 KB Output is correct
3 Correct 380 ms 70720 KB Output is correct
4 Correct 387 ms 69668 KB Output is correct
5 Correct 383 ms 69964 KB Output is correct
6 Correct 383 ms 69560 KB Output is correct
7 Correct 358 ms 71092 KB Output is correct
8 Correct 358 ms 71364 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 8636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 412 ms 70312 KB Output is correct
2 Correct 398 ms 70072 KB Output is correct
3 Correct 380 ms 70720 KB Output is correct
4 Correct 387 ms 69668 KB Output is correct
5 Correct 383 ms 69964 KB Output is correct
6 Correct 383 ms 69560 KB Output is correct
7 Correct 358 ms 71092 KB Output is correct
8 Correct 358 ms 71364 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Incorrect 44 ms 8636 KB Output isn't correct
12 Halted 0 ms 0 KB -