oj.uz

Submission #1097822

# Submission time Handle Problem Language Result Execution time Memory
1097822 2024-10-08T09:52:05 Z pemguimn Park (BOI16_park) C++14
27 / 100
 235 ms 72384 KB 
#include <bits/stdc++.h>
#define int long long

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 long 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;
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> y[i] >> r[i];
    }
    vector<ev> events;
    for(int i = 1; i <= n; i++){
        events.push_back({1LL * y[i] - r[i], 1, i, n + 1});
        events.push_back({1LL * (w - x[i]) - r[i], 1, i, n + 2});
        events.push_back({1LL * (h - y[i]) - r[i], 1, i, n + 3});
        events.push_back({1LL * x[i] - r[i], 1, i, n + 4});
    }
    for(int i = 1; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            long long dx = x[i] - x[j];
            long long dy = y[i] - y[j];
            events.push_back({(long long) (sqrt(1LL * 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({2LL * R[i], 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)) go2 = go3 = 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;
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 71860 KB Output is correct
2 Correct 205 ms 72384 KB Output is correct
3 Correct 211 ms 70852 KB Output is correct
4 Correct 219 ms 70836 KB Output is correct
5 Correct 227 ms 71076 KB Output is correct
6 Correct 235 ms 71304 KB Output is correct
7 Correct 190 ms 71360 KB Output is correct
8 Correct 214 ms 71604 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct

Subtask #2
0 / 31.0

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

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 71860 KB Output is correct
2 Correct 205 ms 72384 KB Output is correct
3 Correct 211 ms 70852 KB Output is correct
4 Correct 219 ms 70836 KB Output is correct
5 Correct 227 ms 71076 KB Output is correct
6 Correct 235 ms 71304 KB Output is correct
7 Correct 190 ms 71360 KB Output is correct
8 Correct 214 ms 71604 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Incorrect 32 ms 10964 KB Output isn't correct
12 Halted 0 ms 0 KB -