oj.uz

Submission #935291

# Submission time Handle Problem Language Result Execution time Memory
935291 2024-02-29T03:07:30 Z Sharky Park (BOI16_park) C++17
0 / 100
 321 ms 71876 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
const int N = 2010;
using ld = long double;
 
struct pr {
    int i, j;
    ld di;
    bool operator < (const pr& o) const {
        return di < o.di;
    }
};
 
vector<pr> a;
 
int x[N], y[N], r[N], p[N];
vector<bool> ans[100005];
vector<array<int, 3>> qry;
 
int find(int u) {
    return p[u] == u ? u : p[u] = find(p[u]);
}
 
void merge(int u, int v) {
    p[find(v)] = find(u);
}
 
bool same_set(int u, int v) {
    return find(u) == find(v);
}
 
ld dist(int i, int j) {
    return sqrt(1.0 * (x[j] - x[i]) * (x[j] - x[i]) + 1.0 * (y[j] - y[i]) * (y[j] - y[i])) - 1.0 * r[i] - 1.0 * r[j];
}
 
int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m, w, h;
    cin >> n >> m >> w >> h;
    for (int i = 1; i <= n; i++) cin >> x[i] >> y[i] >> r[i];
    for (int i = 1; i <= n + 4; i++) p[i] = i;
    for (int i = 1; i <= m; i++) {
        int ra, e;
        cin >> ra >> e;
        qry.push_back({ra, e, i});
    }
    sort(qry.begin(), qry.end());
    for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) a.push_back((pr) {i, j, dist(i, j)});
    int UP = n + 1;
    int LEFT = n + 2;
    int RIGHT = n + 3;
    int DOWN = n + 4;
    for (int i = 1; i <= n; i++) {
        a.push_back({i, UP, (ld) (h - (y[i] + r[i]))});
        a.push_back({i, LEFT, (ld) (x[i] - r[i])});
        a.push_back({i, RIGHT, (ld) (w - (x[i] + r[i]))});
        a.push_back({i, DOWN, (ld) (y[i] - r[i])});
    }
    sort(a.begin(), a.end());
    int pt = 0;
    for (auto& [ra, e, idx] : qry) {
        while (pt < a.size() && 2 * ra > a[pt].di) {
            merge(a[pt].i, a[pt].j);
            pt++;
        }
        vector<bool> can(5, 0);
        if (e == 1) {
            can[1] = 1;
            can[2] = !(same_set(UP, DOWN) || same_set(LEFT, DOWN) || same_set(RIGHT, DOWN));
            can[3] = !(same_set(LEFT, RIGHT) || same_set(LEFT, DOWN) || same_set(UP, DOWN) || same_set(UP, RIGHT));
            can[4] = !(same_set(LEFT, RIGHT) || same_set(LEFT, DOWN) || same_set(LEFT, UP));
        } else if (e == 2) {
            can[1] = !(same_set(UP, DOWN) || same_set(LEFT, DOWN) || same_set(RIGHT, DOWN));
            can[2] = 1;
            can[3] = !(same_set(RIGHT, LEFT) || same_set(RIGHT, UP) || same_set(RIGHT, DOWN));
            can[4] = !(same_set(UP, DOWN) || same_set(LEFT, RIGHT) || same_set(RIGHT, DOWN) || same_set(LEFT, UP));
        } else if (e == 3) {
            can[1] = !(same_set(LEFT, RIGHT) || same_set(LEFT, DOWN) || same_set(UP, DOWN) || same_set(UP, RIGHT));
            can[2] = !(same_set(RIGHT, LEFT) || same_set(RIGHT, UP) || same_set(RIGHT, DOWN));
            can[3] = 1;
            can[4] = !(same_set(UP, LEFT) || same_set(UP, DOWN) || same_set(UP, RIGHT));
        } else {
            can[1] = !(same_set(LEFT, RIGHT) || same_set(LEFT, DOWN) || same_set(LEFT, UP));
            can[2] = !(same_set(UP, DOWN) || same_set(LEFT, RIGHT) || same_set(RIGHT, DOWN) || same_set(LEFT, UP));
            can[3] = !(same_set(UP, LEFT) || same_set(UP, DOWN) || same_set(UP, RIGHT));
            can[4] = 1;
        }
        ans[idx] = can;
    }
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= 4; j++) if (ans[i][j]) cout << j;
        cout << '\n';
    }
} 

/*
5 3
16 11
11 8 1
6 10 1
7 3 2
10 4 1
15 5 1
1 1
2 2
2 1
*/

Compilation message

park.cpp: In function 'int32_t main()':
park.cpp:64:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<pr>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         while (pt < a.size() && 2 * ra > a[pt].di) {
      |                ~~~^~~~~~~~~~

Subtask #1
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 71080 KB Output is correct
2 Correct 319 ms 71096 KB Output is correct
3 Correct 317 ms 70828 KB Output is correct
4 Correct 321 ms 71876 KB Output is correct
5 Correct 320 ms 71872 KB Output is correct
6 Correct 319 ms 71384 KB Output is correct
7 Correct 301 ms 71144 KB Output is correct
8 Correct 292 ms 71852 KB Output is correct
9 Correct 2 ms 4372 KB Output is correct
10 Incorrect 2 ms 4188 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 10892 KB Output is correct
2 Correct 49 ms 10700 KB Output is correct
3 Correct 53 ms 10680 KB Output is correct
4 Correct 48 ms 10960 KB Output is correct
5 Correct 48 ms 11200 KB Output is correct
6 Correct 53 ms 10684 KB Output is correct
7 Incorrect 44 ms 11200 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 71080 KB Output is correct
2 Correct 319 ms 71096 KB Output is correct
3 Correct 317 ms 70828 KB Output is correct
4 Correct 321 ms 71876 KB Output is correct
5 Correct 320 ms 71872 KB Output is correct
6 Correct 319 ms 71384 KB Output is correct
7 Correct 301 ms 71144 KB Output is correct
8 Correct 292 ms 71852 KB Output is correct
9 Correct 2 ms 4372 KB Output is correct
10 Incorrect 2 ms 4188 KB Output isn't correct
11 Halted 0 ms 0 KB -