oj.uz

답안 #713400

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
713400 2023-03-21T22:01:57 Z stevancv Park (BOI16_park) C++14
100 / 100
 277 ms 29564 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 2500 + 5;
const int M = 1e5 + 5;
const int inf = 1e9;
struct Dsu {
    int p[N];
    void Init(int n) {
        for (int i = 0; i < n; i++) p[i] = i;
    }
    int Find(int x) {
        if (x == p[x]) return x;
        return p[x] = Find(p[x]);
    }
    void Unite(int u, int v) {
        u = Find(u);
        v = Find(v);
        if (u == v) return;
        p[v] = u;
    }
    int Same(int u, int v) {
        return Find(u) == Find(v);
    }
}dsu;
int Dist(ll xa, ll ya, ll xb, ll yb) {
    ll o = (xa - xb) * (xa - xb) + (ya - yb) * (ya - yb);
    o = sqrt(o);
    return o;
}
int sol[M][4];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m, h, w;
    cin >> n >> m >> w >> h;
    vector<array<int, 3>> e;
    vector<int> X(n), Y(n), R(n);
    for (int i = 0; i < n; i++) {
        cin >> X[i] >> Y[i] >> R[i];
        int x = X[i]; int y = Y[i]; int r = R[i];
        e.push_back({i, n, max(0, y - r)});
        e.push_back({i, n + 1, max(0, w - x - r)});
        e.push_back({i, n + 2, max(0, h - y - r)});
        e.push_back({i, n + 3, max(0, x - r)});
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            e.push_back({i, j, max(0, Dist(X[i], Y[i], X[j], Y[j]) - R[i] - R[j])});
        }
    }
    sort(e.begin(), e.end(), [&] (array<int, 3> i, array<int, 3> j) {
        return i[2] < j[2];
    });
    vector<array<int, 3>> qq;
    for (int i = 0; i < m; i++) {
        int r, b;
        cin >> r >> b;
        b -= 1;
        qq.push_back({2 * r, b, i});
    }
    sort(qq.begin(), qq.end());
    int j = 0;
    dsu.Init(n + 4);
    for (auto u : qq) {
        int r = u[0]; int b = u[1]; int i = u[2];
        while (j < e.size() && e[j][2] < r) {
            dsu.Unite(e[j][0], e[j][1]);
            j += 1;
        }
        sol[i][b] = 1;
        int x = b + n; int y = (b + 1) % 4 + n; int z = (b + 2) % 4 + n; int w = (b + 3) % 4 + n;
        if (!dsu.Same(x, y) && !dsu.Same(x, z) && !dsu.Same(x, w)) sol[i][(b + 1) % 4] = 1;
        if (!dsu.Same(x, z) && !dsu.Same(x, w) && !dsu.Same(y, z) && !dsu.Same(y, w)) sol[i][(b + 2) % 4] = 1;
        if (!dsu.Same(x, w) && !dsu.Same(y, w) && !dsu.Same(z, w)) sol[i][(b + 3) % 4] = 1;
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < 4; j++) {
            if (sol[i][j]) cout << j + 1;
        }
        cout << en;
    }
    return 0;
}

Compilation message

park.cpp: In function 'int main()':
park.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         while (j < e.size() && e[j][2] < r) {
      |                ~~^~~~~~~~~~

Subtask #1
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 25140 KB Output is correct
2 Correct 222 ms 25148 KB Output is correct
3 Correct 233 ms 25064 KB Output is correct
4 Correct 231 ms 25140 KB Output is correct
5 Correct 219 ms 25140 KB Output is correct
6 Correct 223 ms 25140 KB Output is correct
7 Correct 221 ms 25140 KB Output is correct
8 Correct 200 ms 25140 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 4788 KB Output is correct
2 Correct 48 ms 4736 KB Output is correct
3 Correct 46 ms 4716 KB Output is correct
4 Correct 45 ms 4780 KB Output is correct
5 Correct 45 ms 4824 KB Output is correct
6 Correct 51 ms 4856 KB Output is correct
7 Correct 52 ms 4604 KB Output is correct
8 Correct 60 ms 4644 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 25140 KB Output is correct
2 Correct 222 ms 25148 KB Output is correct
3 Correct 233 ms 25064 KB Output is correct
4 Correct 231 ms 25140 KB Output is correct
5 Correct 219 ms 25140 KB Output is correct
6 Correct 223 ms 25140 KB Output is correct
7 Correct 221 ms 25140 KB Output is correct
8 Correct 200 ms 25140 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 62 ms 4788 KB Output is correct
12 Correct 48 ms 4736 KB Output is correct
13 Correct 46 ms 4716 KB Output is correct
14 Correct 45 ms 4780 KB Output is correct
15 Correct 45 ms 4824 KB Output is correct
16 Correct 51 ms 4856 KB Output is correct
17 Correct 52 ms 4604 KB Output is correct
18 Correct 60 ms 4644 KB Output is correct
19 Correct 257 ms 29532 KB Output is correct
20 Correct 277 ms 29532 KB Output is correct
21 Correct 271 ms 29564 KB Output is correct
22 Correct 271 ms 29528 KB Output is correct
23 Correct 273 ms 29480 KB Output is correct
24 Correct 262 ms 29528 KB Output is correct