#966129 (C++17) No.2696 Sign Creation

• 問題: No.2696 Sign Creation
• ユーザー: 00 Sakuda
• 提出日時: 2024-03-30 23:26:41
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 91 ms / 2,500 ms
• コード長: 1,462 bytes
• コンパイル時間: 2,459 ms
• コンパイル使用メモリ: 216,364 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-05-17 18:25:47
• 合計ジャッジ時間: 3,900 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	2 ms; 6,944 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	2 ms; 6,944 KB
testcase_08	AC	3 ms; 6,940 KB
testcase_09	AC	2 ms; 6,940 KB
testcase_10	AC	3 ms; 6,940 KB
testcase_11	AC	3 ms; 6,944 KB
testcase_12	AC	3 ms; 6,944 KB
testcase_13	AC	90 ms; 6,940 KB
testcase_14	AC	40 ms; 6,940 KB
testcase_15	AC	35 ms; 6,940 KB
testcase_16	AC	79 ms; 6,940 KB
testcase_17	AC	25 ms; 6,940 KB
testcase_18	AC	22 ms; 6,940 KB
testcase_19	AC	43 ms; 6,940 KB
testcase_20	AC	5 ms; 6,940 KB
testcase_21	AC	36 ms; 6,944 KB
testcase_22	AC	34 ms; 6,944 KB
testcase_23	AC	37 ms; 6,940 KB
testcase_24	AC	37 ms; 6,940 KB
testcase_25	AC	50 ms; 6,940 KB
testcase_26	AC	27 ms; 6,944 KB
testcase_27	AC	31 ms; 6,940 KB
testcase_28	AC	29 ms; 6,944 KB
testcase_29	AC	28 ms; 6,944 KB
testcase_30	AC	27 ms; 6,940 KB
testcase_31	AC	91 ms; 6,940 KB
testcase_32	AC	2 ms; 6,940 KB
testcase_33	AC	2 ms; 6,940 KB
testcase_34	AC	2 ms; 6,940 KB
testcase_35	AC	1 ms; 6,944 KB
testcase_36	AC	1 ms; 6,940 KB
testcase_37	AC	2 ms; 6,940 KB
testcase_38	AC	2 ms; 6,940 KB
testcase_39	AC	2 ms; 6,940 KB
testcase_40	AC	2 ms; 6,940 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
int main() {
	int H, W, N, D;cin >> H >> W >> N >> D;
	dsu uf(N);
	vector<vector<int>> to(H + 1, vector<int>(W+ 1, -1));
	for (int i = 0;i < N;i++) {
		int x, y;cin >> x >> y;
		to[x][y] = i;
	}
	for (int x = 1;x <= H;x++) for (int y = 1;y <= W;y++) {
		if (to[x][y] < 0) continue;
		int now = to[x][y];
		for (int dx = -5;dx <= 5;dx++) for (int dy = -5;dy <= 5;dy++) {
			if (abs(dx) + abs(dy) > D) continue;
			if (x + dx < 0 or x + dx > H) continue;
			if (y + dy < 0 or y + dy > W) continue;
			int p = to[x + dx][y + dy];
			if (p < 0) continue;
			uf.merge(now, p);
		}
	}
	int cp = 0;
	for (int v = 0;v < N;v++) if (uf.leader(v) == v and uf.size(v) >= 2) cp++;
	int mins = N + 100;int mx = 0;
	for (int x = 1;x <= H;x++) for (int y = 1;y <= W;y++) {
		if (to[x][y] >= 0) continue;
		set<pair<int, int>> cmp;
		for (int dx = -5;dx <= 5;dx++) for (int dy = -5;dy <= 5;dy++) {
			if (abs(dx) + abs(dy) > D) continue;
			if (x + dx < 0 or x + dx > H) continue;
			if (y + dy < 0 or y + dy > W) continue;
			if (to[x + dx][y + dy] >= 0) cmp.insert({uf.leader(to[x + dx][y + dy]), uf.size(to[x + dx][y + dy])});
		}
		if (cmp.empty()) {
			mins = min(mins, cp);
			mx = max(mx, cp);
			continue;
		}
		int now = cp + 1;
		for (auto cps : cmp) {
			if (cps.second >= 2) now--;
		}
		mins = min(mins, now);
		mx = max(mx, now);
	}
	cout << mins << " " << mx << endl;
}