#648911 (C++17) No.1479 Matrix Eraser

提出ソース

結果

問題	No.1479 Matrix Eraser
ユーザー	Kite_kuma
提出日時	2021-04-16 22:28:48
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	176 ms / 3,000 ms
コード長	14,841 bytes
コンパイル時間	3,101 ms
コンパイル使用メモリ	226,848 KB
実行使用メモリ	23,988 KB
最終ジャッジ日時	2023-09-16 01:23:28
合計ジャッジ時間	8,410 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	7 ms 14,996 KB
testcase_01	AC	8 ms 15,084 KB
testcase_02	AC	8 ms 15,024 KB
testcase_03	AC	7 ms 15,284 KB
testcase_04	AC	7 ms 15,136 KB
testcase_05	AC	8 ms 15,052 KB
testcase_06	AC	7 ms 15,068 KB
testcase_07	AC	27 ms 16,120 KB
testcase_08	AC	42 ms 17,004 KB
testcase_09	AC	83 ms 18,484 KB
testcase_10	AC	147 ms 21,156 KB
testcase_11	AC	94 ms 19,104 KB
testcase_12	AC	32 ms 16,416 KB
testcase_13	AC	42 ms 17,012 KB
testcase_14	AC	33 ms 16,628 KB
testcase_15	AC	12 ms 15,288 KB
testcase_16	AC	37 ms 16,788 KB
testcase_17	AC	174 ms 22,392 KB
testcase_18	AC	174 ms 22,288 KB
testcase_19	AC	175 ms 22,360 KB
testcase_20	AC	176 ms 22,352 KB
testcase_21	AC	176 ms 22,312 KB
testcase_22	AC	174 ms 22,452 KB
testcase_23	AC	174 ms 22,312 KB
testcase_24	AC	176 ms 22,324 KB
testcase_25	AC	174 ms 22,400 KB
testcase_26	AC	175 ms 22,380 KB
testcase_27	AC	101 ms 19,240 KB
testcase_28	AC	101 ms 19,216 KB
testcase_29	AC	101 ms 19,104 KB
testcase_30	AC	102 ms 19,152 KB
testcase_31	AC	102 ms 19,336 KB
testcase_32	AC	61 ms 19,808 KB
testcase_33	AC	62 ms 20,188 KB
testcase_34	AC	62 ms 19,628 KB
testcase_35	AC	62 ms 20,420 KB
testcase_36	AC	61 ms 19,748 KB
testcase_37	AC	24 ms 18,324 KB
testcase_38	AC	92 ms 18,216 KB
testcase_39	AC	158 ms 23,988 KB
testcase_40	AC	7 ms 15,108 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/*	author:  Kite_kuma
	created: 2021.04.16 19:58:45 */

// #ifdef LOCAL
// #define _GLIBCXX_DEBUG
// #endif
#include <bits/stdc++.h>
using namespace std;

#pragma region macros

#define foa(s, v) for(auto &s : v)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcnt(n) __builtin_popcountll((long long)n)

#define REPname(a, b, c, d, e, ...) e
#define rep(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define REP0(x) for(int Counter_in_rep_macro = 0; Counter_in_rep_macro < (x); ++Counter_in_rep_macro)
#define REP1(i, x) for(int i = 0; i < (x); ++i)
#define REP2(i, l, r) for(int i = (l); i < (r); ++i)
#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))

#define DREPname(a, b, c, d, e, ...) e
#define drep(...) DREPname(__VA_ARGS__, DREP3, DREP2, DREP1)(__VA_ARGS__)
#define DREP1(i, x) for(int i = (x)-1; i >= 0; --i)
#define DREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)
#define DREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))

#pragma endregion

#pragma region aliases

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<int>>;
using vvvi = std::vector<std::vector<std::vector<int>>>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
template <class T = ll>
using V = std::vector<T>;
template <class T = ll>
using VV = V<V<T>>;
template <class T = ll>
using VVV = V<V<V<T>>>;
template <class T = ll>
using pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T = ll>
using pqdn = std::priority_queue<T>;

#pragma endregion

#pragma region constants

const int inf = 1e9;
const long long INF = 1e18;
const long double pi = acos(-1);
const char dl = '\n';
const char sp = ' ';
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};

const int mod_1000000007 = 1000000007;
const int mod_998244353 = 998244353;

#pragma endregion

#pragma region basic_operation

template <class T0, class T1, class T2>
inline bool in_range(T0 x, T1 lef, T2 rig) {
	return ((lef <= x) && (x < rig));
}

template <class T>
inline bool chmin(T &a, T b) {
	if(a > b) {
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b) {
	if(a < b) {
		a = b;
		return true;
	}
	return false;
}

void Yes(bool f = 1) { std::cout << (f ? "Yes" : "No") << '\n'; }
void No() { std::cout << "No\n"; }
void YES(bool f = 1) { std::cout << (f ? "YES" : "NO") << '\n'; }
void NO() { std::cout << "NO\n"; }

template <class T>
void drop(T answer) {
	std::cout << answer << '\n';
	exit(0);
}

void err(bool flag = true) {
	if(!flag) return;
	std::cout << -1 << '\n';
	exit(0);
}

template <class T>
void vout(std::vector<T> const &v, bool vertically = 0) {
	if(vertically) {
		for(auto const &a : v) {
			std::cout << a << '\n';
		}
		return;
	}
	for(auto it = v.begin(); it != v.end(); it++) {
		std::cout << (*it);
		if(it != v.end() - 1) {
			std::cout << ' ';
		}
	}
	std::cout << '\n';
	return;
}

inline void print() { std::cout << '\n'; }
template <class T>
inline void print(T x) {
	std::cout << x << '\n';
	return;
}
template <typename Head, typename... Tail>
void print(Head H, Tail... T) {
	std::cout << H << " ";
	print(T...);
}

template <class T>
void add(std::vector<T> &v, T val) {
	for(auto &a : v) a += val;
	return;
}

template <class T>
T dup(T a, T b) {
	assert(b != 0);
	return (a + b - 1) / b;
}

template <class T>
T greatest_lower_multiple(T x, T d) {
	if(d == 0) return 0;
	if(d < 0) d *= -1;
	T y = x % d;
	if(y < 0) y += d;
	return x - y;
}

template <class T>
T least_upper_multiple(T x, T d) {
	return -greatest_lower_multiple(-x, d);
}

long long POW(long long a, long long n) {
	long long res = 1;
	while(n > 0) {
		if(n & 1) res = res * a;
		a = a * a;
		n >>= 1;
	}
	return res;
}

long long modpow(long long a, long long n, long long mod) {	 // a^n mod
	assert(n >= 0 && mod);
	if(mod == 1) return 0LL;
	long long res = 1;
	while(n > 0) {
		if(n & 1) res = res * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return res < 0 ? res + mod : res;
}

// return x which satisfies a * x % mod == gcd(a, mod)
// not (mod | a)
long long modinv(long long a, long long mod) {
	long long b = mod, u = 1, v = 0;
	while(b) {
		long long t = a / b;
		a -= t * b;
		std::swap(a, b);
		u -= t * v;
		std::swap(u, v);
	}
	u %= mod;
	if(u < 0) u += mod;
	return u;
}

template <class T>
int lb(const std::vector<T> &a, const T x) {
	return std::distance(a.begin(), std::lower_bound(a.begin(), a.end(), x));
}
template <class T>
int ub(const std::vector<T> &a, const T x) {
	return std::distance(a.begin(), std::upper_bound(a.begin(), a.end(), x));
}
template <class T>
void unq_sort(std::vector<T> &a) {
	std::sort(a.begin(), a.end());
	a.erase(std::unique(a.begin(), a.end()), a.end());
}
template <class T>
std::vector<int> press(std::vector<T> &a) {
	auto vec = a;
	unq_sort(vec);
	std::vector<int> ret;
	for(auto &v : a) ret.push_back(lb(vec, v));
	return ret;
}

#pragma endregion

#pragma region input
#define VEC(type, name, size) \
	vector<type> name(size);  \
	scanner::INPUT(name)
#define VVEC(type, name, h, w)                     \
	vector<vector<type>> name(h, vector<type>(w)); \
	scanner::INPUT(name)
#define INT(...)     \
	int __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define LL(...)            \
	long long __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define STR(...)        \
	string __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define CHR(...)      \
	char __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define DBL(...)        \
	double __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define LD(...)              \
	long double __VA_ARGS__; \
	scanner::INPUT(__VA_ARGS__)
#define TPL3(type0, type1, type2, name)   \
	std::tuple<type0, type1, type2> name; \
	scanner::INPUT(name);
#define TPL4(type0, type1, type2, type3, name)   \
	std::tuple<type0, type1, type2, type3> name; \
	scanner::INPUT(name);

namespace scanner {
template <class T>
void scan(T &a) {
	std::cin >> a;
}

template <class T, class L>
void scan(std::pair<T, L> &p) {
	scan(p.first);
	scan(p.second);
}

template <class T0, class T1, class T2>
void scan(std::tuple<T0, T1, T2> &p) {
	T0 t0;
	T1 t1;
	T2 t2;
	scan(t0);
	scan(t1);
	scan(t2);
	p = std::make_tuple(t0, t1, t2);
}

template <class T0, class T1, class T2, class T3>
void scan(std::tuple<T0, T1, T2, T3> &p) {
	T0 t0;
	T1 t1;
	T2 t2;
	T3 t3;
	scan(t0);
	scan(t1);
	scan(t2);
	scan(t3);
	p = std::make_tuple(t0, t1, t2, t3);
}

template <class T>
void scan(std::vector<T> &a) {
	for(auto &i : a) scan(i);
}

void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &...tail) {
	scan(head);
	INPUT(tail...);
}
}  // namespace scanner

template <typename T1, typename T2>
std::istream &operator>>(std::istream &is, std::pair<T1, T2> &p) {
	is >> p.first >> p.second;
	return is;
}
#pragma endregion

#pragma region debug

#pragma region output
template <typename T1, typename T2>
std::ostream &std::operator<<(std::ostream &os, const std::pair<T1, T2> &p) {
	os << p.first << " " << p.second;
	return os;
}
template <class T>
std::ostream &std::operator<<(std::ostream &os, const std::vector<T> &v) {
	for(int i = 0; i < (int)v.size(); i++) {
		if(i) os << " ";
		os << v[i];
	}
	return os;
}
#pragma endregion

#pragma region view

namespace viewer {
void view(const long long e) {
	if(e == INF)
		std::cerr << "INF";
	else if(e == -INF)
		std::cerr << "-INF";
	else
		std::cerr << e;
}

void view(const int e) {
	if(e == inf)
		std::cerr << "inf";
	else if(e == -inf)
		std::cerr << "-inf";
	else
		std::cerr << e;
}

template <typename T>
void view(const T e) {
	std::cerr << e;
}

template <typename T, typename U>
void view(const std::pair<T, U> &p) {
	std::cerr << "(";
	view(p.first);
	std::cerr << ", ";
	view(p.second);
	std::cerr << ")";
}

template <class T0, class T1, class T2>
void view(const std::tuple<T0, T1, T2> &p) {
	std::cerr << "(";
	view(std::get<0>(p));
	std::cerr << ", ";
	view(std::get<1>(p));
	std::cerr << ", ";
	view(std::get<2>(p));
	std::cerr << ")";
}

template <class T0, class T1, class T2, class T3>
void view(const std::tuple<T0, T1, T2, T3> &p) {
	std::cerr << "(";
	view(std::get<0>(p));
	std::cerr << ", ";
	view(std::get<1>(p));
	std::cerr << ", ";
	view(std::get<2>(p));
	std::cerr << ", ";
	view(std::get<3>(p));
	std::cerr << ")";
}

template <typename T>
void view(const std::set<T> &s) {
	if(s.empty()) {
		std::cerr << "{ }";
		return;
	}
	std::cerr << "{ ";
	for(auto &t : s) {
		view(t);
		std::cerr << ", ";
	}
	std::cerr << "\b\b }";
}

template <typename T>
void view(const std::unordered_set<T> &s) {
	if(s.empty()) {
		std::cerr << "{ }";
		return;
	}
	std::cerr << "{ ";
	for(auto &t : s) {
		view(t);
		std::cerr << ", ";
	}
	std::cerr << "\b\b }";
}

template <typename T>
void view(const std::vector<T> &v) {
	if(v.empty()) {
		std::cerr << "{ }";
		return;
	}
	std::cerr << "{ ";
	for(const auto &e : v) {
		view(e);
		std::cerr << ", ";
	}
	std::cerr << "\b\b }";
}

template <typename T>
void view(const std::vector<std::vector<T>> &vv) {
	std::cerr << "{\n";
	for(const auto &v : vv) {
		std::cerr << "\t";
		view(v);
		std::cerr << '\n';
	}
	std::cerr << "}";
}

template <typename T, typename U>
void view(const std::vector<std::pair<T, U>> &v) {
	std::cerr << "{\n";
	for(const auto &c : v) {
		std::cerr << "\t(";
		view(c.first);
		std::cerr << ", ";
		view(c.second);
		std::cerr << ")\n";
	}
	std::cerr << "}";
}

template <class T0, class T1, class T2>
void view(const std::vector<std::tuple<T0, T1, T2>> &v) {
	if(v.empty()) {
		std::cerr << "{ }";
		return;
	}
	std::cerr << '{';
	for(const auto &t : v) {
		std::cerr << "\n\t";
		view(t);
		std::cerr << ",";
	}
	std::cerr << "\n}";
}

template <class T0, class T1, class T2, class T3>
void view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {
	if(v.empty()) {
		std::cerr << "{ }";
		return;
	}
	std::cerr << '{';
	for(const auto &t : v) {
		std::cerr << "\n\t";
		view(t);
		std::cerr << ",";
	}
	std::cerr << "\n}";
}

template <typename T, typename U>
void view(const std::map<T, U> &m) {
	std::cerr << "{\n";
	for(const auto &t : m) {
		std::cerr << "\t[";
		view(t.first);
		std::cerr << "] : ";
		view(t.second);
		std::cerr << '\n';
	}
	std::cerr << "}";
}

template <typename T, typename U>
void view(const std::unordered_map<T, U> &m) {
	std::cerr << "{\n";
	for(const auto &t : m) {
		std::cerr << "\t[";
		view(t.first);
		std::cerr << "] : ";
		view(t.second);
		std::cerr << '\n';
	}
	std::cerr << "}";
}
}  // namespace viewer

#pragma endregion

// when debugging : g++ foo.cpp -DLOCAL
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	viewer::view(H);
	std::cerr << ", ";
	debug_out(T...);
}
#define debug(...)                                                \
	do {                                                          \
		std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
		debug_out(__VA_ARGS__);                                   \
		std::cerr << "\b\b]\n";                                   \
	} while(0)
#define dump(x)                                      \
	do {                                             \
		std::cerr << __LINE__ << " " << #x << " : "; \
		viewer::view(x);                             \
		std::cerr << '\n';                           \
	} while(0)

#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

#pragma endregion

#pragma region coordinate_compression
template <class T>
struct coordinate_compression {
   private:
	std::vector<T> val;
	std::unordered_map<T, int> idx;

   public:
	coordinate_compression() {}
	coordinate_compression(const std::vector<T> &data) : val(data) {}
	void add_value(T new_value) { val.push_back(new_value); }
	void add_value(std::vector<T> &new_values) {
		for(auto &component : new_values) add_value(component);
	}
	void build() {
		sort(val.begin(), val.end());
		val.erase(unique(val.begin(), val.end()), val.end());
		idx.clear();
		for(size_t i = 0; i < val.size(); i++) idx[val[i]] = i;
	}
	T value(int index) {
		assert(0 <= index && index < (int)size());
		return val[index];
	}
	int index(T value) {
		assert(idx.count(value));
		return idx[value];
	}
	size_t size() { return val.size(); }
	int lower_bound(T value) { return lower_bound(val.begin(), val.end(), value) - val.begin(); }
	int upper_bound(T value) { return upper_bound(val.begin(), val.end(), value) - val.begin(); }
};
#pragma endregion

struct Hopcroft_Karp {
	Hopcroft_Karp(int n, int m) : graph(n), match(m, -1), used(n) {}

	void add_edge(int u, int v) { graph[u].push_back(v); }

	int bipartite_matching() {
		int ret = 0;
		while(true) {
			bfs();
			vv.assign(graph.size(), false);
			int flow = 0;
			for(int i = 0; i < graph.size(); i++) {
				if(!used[i] && dfs(i)) ++flow;
			}
			if(flow == 0) return (ret);
			ret += flow;
		}
	}

	void output() {
		for(int i = 0; i < match.size(); i++) {
			if(~match[i]) {
				std::cout << match[i] << "-" << i << std::endl;
			}
		}
	}

   private:
	std::vector<std::vector<int>> graph;
	std::vector<int> dist, match;
	std::vector<bool> used, vv;

	void bfs() {
		dist.assign(graph.size(), -1);
		std::queue<int> que;
		for(int i = 0; i < graph.size(); i++) {
			if(!used[i]) {
				que.emplace(i);
				dist[i] = 0;
			}
		}
		while(!que.empty()) {
			int a = que.front();
			que.pop();
			for(auto &b : graph[a]) {
				int c = match[b];
				if(c >= 0 && dist[c] == -1) {
					dist[c] = dist[a] + 1;
					que.emplace(c);
				}
			}
		}
	}

	bool dfs(int a) {
		vv[a] = true;
		for(auto &b : graph[a]) {
			int c = match[b];
			if(c < 0 || (!vv[c] && dist[c] == dist[a] + 1 && dfs(c))) {
				match[b] = a;
				used[a] = true;
				return (true);
			}
		}
		return (false);
	}
};

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout << std::fixed << std::setprecision(15);
	srand((unsigned)time(NULL));

	INT(h, w);
	VVEC(int, a, h, w);

	const int a_max = 500012;
	vector<V<pair<int, int>>> p(a_max);
	rep(i, h) rep(j, w) { p[a[i][j]].emplace_back(i, j); }

	int res = 0;

	drep(i, 1, a_max) {
		if(p[i].empty()) continue;

		// coordinate_compression<int> xaxis, yaxis;
		vi b, c;
		for(auto [x, y] : p[i]) {
			// xaxis.add_value(x);
			// yaxis.add_value(y);
			b.push_back(x);
			c.push_back(y);
		}

		// xaxis.build();
		// yaxis.build();

		// debug(i);
		// debug(xaxis.size());
		// debug(yaxis.size());

		unq_sort(b);
		unq_sort(c);

		debug(b, c);

		Hopcroft_Karp hk(b.size(), c.size());

		for(auto [x, y] : p[i]) {
			hk.add_edge(lb(b, x), lb(c, y));
			debug(lb(b, x), lb(c, y));
		}

		res += hk.bipartite_matching();
	}

	drop(res);

	return 0;
}

yukicoder

結果

テストケース

ソースコード