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

• 問題: No.2696 Sign Creation
• ユーザー: t98slider
• 提出日時: 2024-03-22 22:07:34
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 91 ms / 2,500 ms
• コード長: 3,202 bytes
• コンパイル時間: 2,582 ms
• コンパイル使用メモリ: 227,476 KB
• 実行使用メモリ: 8,576 KB
• 最終ジャッジ日時: 2024-03-27 17:58:03
• 合計ジャッジ時間: 4,358 ms
• ジャッジサーバーID （参考情報）: judge12 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	2 ms; 6,676 KB
testcase_04	AC	2 ms; 6,676 KB
testcase_05	AC	2 ms; 6,676 KB
testcase_06	AC	2 ms; 6,676 KB
testcase_07	AC	2 ms; 6,676 KB
testcase_08	AC	3 ms; 6,676 KB
testcase_09	AC	2 ms; 6,676 KB
testcase_10	AC	3 ms; 6,676 KB
testcase_11	AC	3 ms; 6,676 KB
testcase_12	AC	3 ms; 6,676 KB
testcase_13	AC	91 ms; 6,676 KB
testcase_14	AC	32 ms; 6,676 KB
testcase_15	AC	29 ms; 6,676 KB
testcase_16	AC	78 ms; 6,676 KB
testcase_17	AC	22 ms; 6,676 KB
testcase_18	AC	15 ms; 6,676 KB
testcase_19	AC	38 ms; 6,676 KB
testcase_20	AC	4 ms; 6,676 KB
testcase_21	AC	24 ms; 6,676 KB
testcase_22	AC	29 ms; 6,676 KB
testcase_23	AC	30 ms; 6,676 KB
testcase_24	AC	28 ms; 6,676 KB
testcase_25	AC	50 ms; 6,676 KB
testcase_26	AC	23 ms; 6,676 KB
testcase_27	AC	30 ms; 6,676 KB
testcase_28	AC	23 ms; 6,676 KB
testcase_29	AC	24 ms; 6,676 KB
testcase_30	AC	24 ms; 6,676 KB
testcase_31	AC	87 ms; 8,576 KB
testcase_32	AC	2 ms; 6,676 KB
testcase_33	AC	2 ms; 6,676 KB
testcase_34	AC	2 ms; 6,676 KB
testcase_35	AC	2 ms; 6,676 KB
testcase_36	AC	2 ms; 6,676 KB
testcase_37	AC	2 ms; 6,676 KB
testcase_38	AC	1 ms; 6,676 KB
testcase_39	AC	2 ms; 6,676 KB
testcase_40	AC	2 ms; 6,676 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct dsu {
	public:
	int csz;
	dsu() : _n(0) {}
	dsu(int n) : _n(n), csz(n), parent_or_size(n, -1) {}

	int merge(int a, int b) {
		assert(0 <= a && a < _n);
		assert(0 <= b && b < _n);
		int x = leader(a), y = leader(b);
		if (x == y) return x;
		if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
		csz--;
		parent_or_size[x] += parent_or_size[y];
		parent_or_size[y] = x;
		return x;
	}

	bool same(int a, int b) {
		assert(0 <= a && a < _n);
		assert(0 <= b && b < _n);
		return leader(a) == leader(b);
	}

	int leader(int a) {
		assert(0 <= a && a < _n);
		if (parent_or_size[a] < 0) return a;
		return parent_or_size[a] = leader(parent_or_size[a]);
	}

	int size(int a) {
		assert(0 <= a && a < _n);
		return -parent_or_size[leader(a)];
	}

	std::vector<std::vector<int>> groups() {
		std::vector<int> leader_buf(_n), group_size(_n);
		for (int i = 0; i < _n; i++) {
			leader_buf[i] = leader(i);
			group_size[leader_buf[i]]++;
		}
		std::vector<std::vector<int>> result(_n);
		for (int i = 0; i < _n; i++) {
			result[i].reserve(group_size[i]);
		}
		for (int i = 0; i < _n; i++) {
			result[leader_buf[i]].push_back(i);
		}
		result.erase(
			std::remove_if(result.begin(), result.end(),
						   [&](const std::vector<int>& v) { return v.empty(); }),
			result.end());
		return result;
	}

	private:
	int _n;
	// root node: -1 * component size
	// otherwise: parent
	std::vector<int> parent_or_size;
};

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	vector<vector<pair<int,int>>> dir(6);
	for(int y = -5; y <= 5; y++){
		for(int x = -5; x <= 5; x++){
			int d = abs(x) + abs(y);
			if(d <= 5) dir[d].emplace_back(y, x);
		}
	}
	int h, w, n, d;
	cin >> h >> w >> n >> d;
	vector<pair<int,int>> a(n);
	for(auto &&[y, x] : a) cin >> y >> x, y--, x--;
	sort(a.begin(), a.end());
	vector<vector<int>> A(h, vector<int>(w, -1));
	for(int i = 0; i < n; i++){
		A[a[i].first][a[i].second] = i;
	}
	dsu uf(n);
	for(int y = 0; y < h; y++){
		for(int x = 0; x < w; x++){
			if(A[y][x] == -1) continue;
			for(int di = 1; di <= d; di++){
				for(auto [ny, nx] : dir[di]){
					ny += y, nx += x;
					if(ny < 0 || nx < 0 || ny >= h || nx >= w) continue;
					if(A[ny][nx] == -1) continue;
					uf.merge(A[y][x], A[ny][nx]);
				}
			}
		}
	}
	int v = 0;
	vector<int> cnt(n);
	for(auto &&G : uf.groups()){
		int u = uf.leader(G[0]);
		cnt[u] = G.size();
		v += G.size() >= 2;
	}
	int mn = v, mx = v;

	for(int y = 0; y < h; y++){
		for(int x = 0; x < w; x++){
			if(A[y][x] != -1) continue;
			vector<int> S;
			for(int di = 1; di <= d; di++){
				for(auto [ny, nx] : dir[di]){
					ny += y, nx += x;
					if(ny < 0 || nx < 0 || ny >= h || nx >= w) continue;
					if(A[ny][nx] == -1) continue;
					S.push_back(uf.leader(A[ny][nx]));
				}
			}
			sort(S.begin(), S.end());
			S.erase(unique(S.begin(), S.end()), S.end());
			int add = 0, num = 1;
			for(auto &&v : S){
				if(num == 1){
					num += cnt[v];
					if(cnt[v] == 1) add++;
				}else{
					num += cnt[v];
					if(cnt[v] == 1) continue;
					add--;
				}
			}
			mx = max(mx, v + add);
			mn = min(mn, v + add);
		}
	}
	cout << mn << " " << mx << '\n';
}