Test/yukicoder/yuki2696.test.cpp

• View this file on GitHub
• Last update: 2024-03-23 18:46:51+09:00
• Problem: https://yukicoder.me/problems/no/2696

Depends on

• Union Find (Graph/dsu.hpp)

Code

#define PROBLEM "https://yukicoder.me/problems/no/2696"

#include <bits/stdc++.h>

#include "Graph/dsu.hpp"

using namespace std;
using ll = long long;

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--;
	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';
}

#line 1 "Test/yukicoder/yuki2696.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/2696"

#include <bits/stdc++.h>

#line 1 "Graph/dsu.hpp"
struct dsu {
    public:
    dsu() : _n(0) {}
    dsu(int n) : _n(n), num_component(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);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        num_component--;
        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() { 
        return num_component;
    }

    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, num_component;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};
#line 5 "Test/yukicoder/yuki2696.test.cpp"
using namespace std;
using ll = long long;

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--;
	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';
}

Back to top page