結果
問題 | No.2696 Sign Creation |
ユーザー |
![]() |
提出日時 | 2024-03-22 22:40:18 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 98 ms / 2,500 ms |
コード長 | 3,376 bytes |
コンパイル時間 | 2,511 ms |
コンパイル使用メモリ | 214,564 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-12-20 12:12:08 |
合計ジャッジ時間 | 4,506 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
#include <bits/stdc++.h>#ifdef LOCAL#include "./debug.cpp"#else#define debug(...)#define print_line#endifusing namespace std;using ll = long long;struct disjoint_set_union {disjoint_set_union(int n) {par = vector<int>(n);sz = vector<int>(n);for (int i = 0; i < n; i++) {par[i] = i;sz[i] = 1;}}int find(int x) {if (par[x] == x) {return x;}par[x] = find(par[x]);return par[x];}void unite(int x, int y) {x = find(x);y = find(y);if (x == y) {return;}if (sz[x] < sz[y]) {swap(x, y);}par[y] = x;sz[x] += sz[y];}int size(int x) {return sz[find(x)];}bool is_united(int x, int y) {return find(x) == find(y);}private:vector<int> par, sz;};int main() {int H, W, N, D;cin >> H >> W >> N >> D;vector<int> X(N), Y(N);for (int i = 0; i < N; i++) {cin >> X[i] >> Y[i];X[i]--;Y[i]--;}vector<vector<int>> A(H, vector<int>(W, -1));for (int i = 0; i < N; i++) {A[X[i]][Y[i]] = i;}disjoint_set_union dsu(N);for (int i = 0; i < H; i++) {for (int j = 0; j < W; j++) {if (A[i][j] == -1) {continue;}for (int i2 = max(0, i - D); i2 <= min(H - 1, i + D); i2++) {for (int j2 = max(0, j - D); j2 <= min(W - 1, j + D); j2++) {if (abs(i - i2) + abs(j - j2) > D) {continue;}if (A[i2][j2] == -1) {continue;}dsu.unite(A[i][j], A[i2][j2]);}}}}int groupnum = 0;for (int i = 0; i < N; i++) {if (dsu.find(i) == i && dsu.size(i) > 1) {groupnum++;}}debug(groupnum);int ansmin = groupnum, ansmax = groupnum;for (int i = 0; i < H; i++) {for (int j = 0; j < W; j++) {if (A[i][j] != -1) {continue;}set<int> idxs;bool flag = true, flag2 = false;for (int i2 = max(0, i - D); i2 <= min(H - 1, i + D); i2++) {for (int j2 = max(0, j - D); j2 <= min(W - 1, j + D); j2++) {if (abs(i - i2) + abs(j - j2) > D) {continue;}if (A[i2][j2] == -1) {continue;}if (dsu.size(A[i2][j2]) > 1) {flag = false;idxs.insert(dsu.find(A[i2][j2]));} else {flag2 = true;continue;}}}if (flag && !flag2) {continue;}if (flag && flag2) {ansmax = max(ansmax, groupnum + 1);} else {ansmin = min(ansmin, groupnum - (int)idxs.size() + 1);ansmax = max(ansmax, groupnum - (int)idxs.size() + 1);}}}cout << ansmin << " " << ansmax << endl;}