Submission #26488623

---

Source Code Expand

#ifndef __VECTOR_UTIL_H__
#define __VECTOR_UTIL_H__

/* updated: 2021-08-14 */

#include <cassert>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <limits>

template <class T>
std::vector<T> inputVector(int size, std::istream& ist = std::cin);
template <class T>
std::vector<T> inputVector(int size, bool one_based, std::istream& ist = std::cin);
template <class T>
std::vector<std::vector<T>> inputVector2D(int height, int width, std::istream& ist = std::cin);
template <class T>
std::vector<std::vector<T>> inputVector2D(int height, int width, bool one_based, std::istream& ist = std::cin);
template <class T>
void outputVector(const std::vector<T>& vec, bool one_based = false, const std::string& delimiter = " ", std::ostream& ost = std::cout);
template <class T>
std::vector<T> makeVector(int size, const T& value);
template <class T>
std::vector<T> makeIota(int size, const T& initial_value = T());

template <class T, class Func>
void apply(std::vector<T>& vec, Func func);
template <class T, class BinaryFunc>
std::vector<T> elementwise(std::vector<T>& a, std::vector<T>& b, BinaryFunc func);
template <class T, class Pred>
void sortAndUnique(std::vector<T>& vec, Pred pred, bool use_pred_to_check_equivalence = false);
template <class T>
void sortAndUnique(std::vector<T>& vec);
template <class T>
int mex(const std::vector<T>& vec);
template <class T, class Pred>
std::vector<int> sortWithOriginalPositions(std::vector<T>& vec, Pred pred);
template <class T>
std::vector<int> sortWithOriginalPositions(std::vector<T>& vec);
template <class T, class Pred>
std::vector<int> sortWithDestinations(std::vector<T>& vec, Pred pred);
template <class T>
std::vector<int> sortWithDestinations(std::vector<T>& vec);

template <class T>
T maxOf(const std::vector<T>& vec);
template <class T>
T minOf(const std::vector<T>& vec);
template <class T>
T sumOf(const std::vector<T>& vec);
template <class T, class U>
U sumOf(const std::vector<T>& vec, const U& initial_value);

template <class T>
void sortVector(std::vector<T>& vec);
template <class T, class Pred>
void sortVector(std::vector<T>& vec, Pred pred);
template <class T>
void reverseVector(std::vector<T>& vec);

/* 標準入力から値を受け取り vector を生成 */
template <class T>
std::vector<T> inputVector(int size, std::istream& ist) {
	std::vector<T> ret(size);
	for (int i = 0; i < size; ++i) {
		ist >> ret[i];
	}
	return ret;
}

/* inputVector の one-based 用 (operator-- が存在しない型でも呼べるよう別関数にしている) */
template<class T>
std::vector<T> inputVector(int size, bool one_based, std::istream& ist) {
	std::vector<T> ret(size);
	for (int i = 0; i < size; ++i) {
		ist >> ret[i];
		if (one_based) {
			--ret[i];
		}
	}
	return ret;
}

/* 標準入力から値を受け取り2次元 vector を生成 */
template <class T>
std::vector<std::vector<T>> inputVector2D(int height, int width, std::istream& ist) {
	std::vector<std::vector<T>> ret(height, std::vector<T>(width));
	for (int i = 0; i < height; ++i) {
		for (int j = 0; j < width; ++j) {
			ist >> ret[i][j];
		}
	}
	return ret;
}

/* inputVector2D の one-based 用 (operator-- が存在しない型でも呼べるよう別関数にしている) */
template <class T>
std::vector<std::vector<T>> inputVector2D(int height, int width, bool one_based, std::istream& ist) {
	std::vector<std::vector<T>> ret(height, std::vector<T>(width));
	for (int i = 0; i < height; ++i) {
		for (int j = 0; j < width; ++j) {
			ist >> ret[i][j];
			if (one_based) {
				--ret[i][j];
			}
		}
	}
	return ret;
}

/* vector の内容を delimiter 区切りで出力 */
template <class T>
void outputVector(const std::vector<T>& vec, bool one_based, const std::string& delimiter, std::ostream& ost) {
	if (vec.empty()) {
		ost << std::endl;
		return;
	}

	int size = vec.size();
	for (int i = 0; i < size; ++i) {
		T value = vec[i];
		if (one_based) {
			++value;
		}

		ost << value;
		if (i == size - 1) {
			ost << std::endl;
		} else {
			ost << delimiter;
		}
	}
}

/* vector 生成のヘルパー関数(主に多次元配列用) */
template <class T>
std::vector<T> makeVector(int size, const T& value) {
	return std::vector<T>(size, value);
}

template <class T>
std::vector<T> makeIota(int size, const T& initial_value) {
	std::vector<T> ret(size);
	std::iota(ret.begin(), ret.end(), initial_value);
	return ret;
}

/* vector の各要素に関数を適用する */
template <class T, class Func>
void apply(std::vector<T>& vec, Func func) {
	std::transform(vec.begin(), vec.end(), vec.begin(), func);
}

/* 2つの vector に対して要素ごとの演算を行って1つの vector を生成する */
template <class T, class BinaryFunc>
std::vector<T> elementwise(std::vector<T>& a, std::vector<T>& b, BinaryFunc func) {
	assert(a.size() == b.size());
	
	const int size = a.size();
	std::vector<T> ret(size);
	for (int i = 0; i < size; ++i) {
		ret[i] = func(a[i], b[i]);
	}
	return ret;
}

/* sort + unique O(n log n) */
/* use_pred_to_check_equivalence が true の場合, !pred(a, b) && !pred(b, a) により等値性を判断する */
/* そうでない場合, operator== により等値性を判断する */
template <class T, class Pred>
void sortAndUnique(std::vector<T>& vec, Pred pred, bool use_pred_to_check_equivalence) {
	std::sort(vec.begin(), vec.end(), pred);
	typename std::vector<T>::iterator it;
	if (use_pred_to_check_equivalence) {
		auto is_equal_to = [&pred](const T& a, const T& b) {
			return !pred(a, b) && !pred(b, a);
		};
		it = std::unique(vec.begin(), vec.end(), is_equal_to);
	} else {
		it = std::unique(vec.begin(), vec.end());
	}
	vec.erase(it, vec.end());
}

/* sort + unique O(n log n) */
template <class T>
void sortAndUnique(std::vector<T>& vec) {
	sortAndUnique(vec, std::less<T>());
}

/* vector に含まれない非負整数のうち、最小のもの (minimum excluded) を得る O(n log n) */
/* template である必要ないかも */
template <class T>
int mex(const std::vector<T>& vec) {
	std::vector<int> copied(vec);
	sortAndUnique(copied);
	
	int value = 0;
	while (value < copied.size() && copied[value] == value) {
		++value;
	}
	return value;
}

/* ソート + 復元用の配列を生成 O(n log n) */
/* vector を破壊的ソート + ソート後の各要素についてもともとの位置を格納した配列を返す */
template <class T, class Pred>
std::vector<int> sortWithOriginalPositions(std::vector<T>& vec, Pred pred) {
	std::vector<int> order(vec.size());
	std::iota(order.begin(), order.end(), 0);

	std::sort(order.begin(), order.end(), [&vec, pred](int i, int j) {
		return pred(vec[i], vec[j]);
	});

	std::sort(vec.begin(), vec.end(), pred);
	return order;
}

/* 比較関数なし版 O(n log n) */
template <class T>
std::vector<int> sortWithOriginalPositions(std::vector<T>& vec) {
	return sortWithOriginalPositions(vec, std::less<T>());
}

/* ソート + 復元用の配列を生成 O(n log n) */
/* vector を破壊的ソート + ソート前の各要素について移動先を格納した配列を返す */
/* 戻り値は sortWithOriginalPositions の戻り値の逆写像になる */
template <class T, class Pred>
std::vector<int> sortWithDestinations(std::vector<T>& vec, Pred pred) {
	const int size = vec.size();
	std::vector<int> positions = sortWithOriginalPositions(vec, pred);
	std::vector<int> ret(size);
	for (int i = 0; i < size; ++i) {
		ret[positions[i]] = i;
	}
	return ret;
}

/* 比較関数なし版 O(n log n) */
template <class T>
std::vector<int> sortWithDestinations(std::vector<T>& vec) {
	return sortWithDestinations(vec, std::less<T>());
}

/* 最大値を取得, vector が空の場合は numeric_limits<T>::lowest を返す O(n) */
template <class T>
T maxOf(const std::vector<T>& vec) {
	T ret = std::numeric_limits<T>::lowest();
	for (const T& element : vec) {
		ret = std::max(ret, element);
	}
	return ret;
}

/* 最小値を取得, vector が空の場合は numeric_limits<T>::max を返す O(n) */
template <class T>
T minOf(const std::vector<T>& vec) {
	T ret = std::numeric_limits<T>::max();
	for (const T& element : vec) {
		ret = std::min(ret, element);
	}
	return ret;
}

/* 合計を取得, 戻り値の型は要素の型 O(n) */
template <class T>
T sumOf(const std::vector<T>& vec) {
	T ret = T();
	for (const T& element : vec) {
		ret += element;
	}
	return ret;
}

/* 合計を取得, 戻り値の型が要素の型と異なるときのための関数 O(n) */
template <class T, class U>
U sumOf(const std::vector<T>& vec, const U& initial_value) {
	U ret(initial_value);
	for (const T& element : vec) {
		ret += element;
	}
	return ret;
}

template<class T>
void sortVector(std::vector<T>& vec) {
	std::sort(vec.begin(), vec.end());
}

template<class T, class Pred>
void sortVector(std::vector<T>& vec, Pred pred) {
	std::sort(vec.begin(), vec.end(), pred);
}

template<class T>
void reverseVector(std::vector<T>& vec) {
	std::reverse(vec.begin(), vec.end());
}

#endif

#ifndef __MINMAX_H__
#define __MINMAX_H__

/* updated: 2020-08-02 */

#include <algorithm>
#include <functional>

/* 
// 最小値と最大値をビット演算の演算子オーバーロードで表記できるようにするクラス
// 演算子 | が max, 演算子 & が min を表す
// (扱うときは暗黙の型変換とオーバーロード解決に注意)
*/
template <class T, class Pred = std::less<T>>
class MinMax {
	T value_ = T();

public:
	MinMax() = default;
	MinMax(const T& value);
	MinMax(const MinMax<T, Pred>& other) = default;

	MinMax<T, Pred>& operator=(const T& value);
	MinMax<T, Pred>& operator=(const MinMax<T, Pred>& other) = default;

	MinMax<T, Pred>& operator|=(const T& other);
	MinMax<T, Pred>& operator&=(const T& other);

	operator T() const;
};

template <class T, class Pred>
MinMax<T, Pred> operator|(const MinMax<T, Pred>& a, const MinMax<T, Pred>& b);
template <class T, class Pred>
MinMax<T, Pred> operator&(const MinMax<T, Pred>& a, const MinMax<T, Pred>& b);
template <class T, class Pred, class U>
MinMax<T, Pred> operator|(const MinMax<T, Pred>& a, const U& b);
template <class T, class Pred, class U>
MinMax<T, Pred> operator&(const MinMax<T, Pred>& a, const U& b);
template <class T, class Pred, class U>
MinMax<T, Pred> operator|(const U& a, const MinMax<T, Pred>& b);
template <class T, class Pred, class U>
MinMax<T, Pred> operator&(const U& a, const MinMax<T, Pred>& b);

template<class T, class Pred>
MinMax<T, Pred>::MinMax(const T& value)
	: value_(value) {
}

template<class T, class Pred>
MinMax<T, Pred>& MinMax<T, Pred>::operator=(const T& value) {
	value_ = value;
	return *this;
}

template<class T, class Pred>
MinMax<T, Pred>& MinMax<T, Pred>::operator|=(const T& other) {
	value_ = std::max(value_, other, Pred());
	return *this;
}

template<class T, class Pred>
MinMax<T, Pred>& MinMax<T, Pred>::operator&=(const T& other) {
	value_ = std::min(value_, other, Pred());
	return *this;
}

template<class T, class Pred>
MinMax<T, Pred>::operator T() const {
	return value_;
}

template<class T, class Pred>
MinMax<T, Pred> operator|(const MinMax<T, Pred>& a, const MinMax<T, Pred>& b) {
	MinMax<T, Pred> ret(a);
	ret |= b;
	return ret;
}

template<class T, class Pred>
MinMax<T, Pred> operator&(const MinMax<T, Pred>& a, const MinMax<T, Pred>& b) {
	MinMax<T, Pred> ret(a);
	ret &= b;
	return ret;
}

template<class T, class Pred, class U>
MinMax<T, Pred> operator|(const MinMax<T, Pred>& a, const U& b) {
	return a | MinMax<T, Pred>(b);
}

template<class T, class Pred, class U>
MinMax<T, Pred> operator&(const MinMax<T, Pred>& a, const U& b) {
	return a & MinMax<T, Pred>(b);
}

template<class T, class Pred, class U>
MinMax<T, Pred> operator|(const U& a, const MinMax<T, Pred>& b) {
	return MinMax<T, Pred>(a) | b;
}

template<class T, class Pred, class U>
MinMax<T, Pred> operator&(const U& a, const MinMax<T, Pred>& b) {
	return MinMax<T, Pred>(a) & b;
}

using MMInt = MinMax<int>;
using MMLL = MinMax<long long int>;
using MMDouble = MinMax<double>;

#endif
#ifndef __MAIN_H__
#define __MAIN_H__

#ifndef ONLY_MY_ENVIR
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
#endif

#ifdef ONLY_MY_ENVIR
#include "Includes.h"
#endif

using namespace std;
using uint = std::uint32_t;
using LL = std::int64_t;
using ULL = std::uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h&& j >= 0 && j < w; }
void pL() { std::cout << std::endl; }
template <class Head> void pL(Head&& head) { std::cout << head << std::endl; }
template <class Head, class... Tail> void pL(Head&& head, Tail&&... tail) { std::cout << head << ' '; pL(std::forward<Tail>(tail)...); }

#ifdef __GNUC__
using LLL = __int128;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#else
using LLL = LL;
#endif

#endif
#ifdef ONLY_MY_ENVIR
#include "Main.h"
#endif


#ifdef ONLY_MY_ENVIR
ifstream input_stream("ain.txt");
ofstream output_stream("aout.txt");
#define cin input_stream
#define cout output_stream
#endif

const int di[] = { 0, 1, 0, -1 };
const int dj[] = { 1, 0, -1, 0 };

struct Omino {
	int h;
	int w;
	int c;
	vector<PP> qs;
};

int n, m, b;
vector<PP> ps;
vector<Omino> os;
void input() {
	cin >> n >> m >> b;
	REP(l, 0, m) {
		int i, j;
		cin >> i >> j;
		ps.emplace_back(i, j);
	}

	REP(k, 0, b) {
		Omino o;
		cin >> o.h >> o.w >> o.c;
		REP(x, 0, o.h) {
			string s;
			cin >> s;
			REP(y, 0, o.w) {
				if (s[y] == '#') {
					o.qs.emplace_back(x, y);
				}
			}
		}
		os.push_back(o);
	}
}

using Dist = vector<MMInt>;

// ds[k][i][j] -> Dist
vector<vector<vector<Dist>>> dmats;
void pre() {
	REP(k, 0, b) {
		int h = os[k].h;
		int w = os[k].w; 
		auto dmat = makeVector(n - h + 1, makeVector(n - w + 1, Dist(m - 1, MMInt(INF))));
		REP(i, 0, n - h + 1) {
			REP(j, 0, n - w + 1) {
				for (auto&& p : os[k].qs) {
					int x = p.first;
					int y = p.second;
					REP(l, 1, m) {
						int ni = i + x;
						int nj = j + y;
						dmat[i][j][l - 1] &= abs(ni - ps[l].first) + abs(nj - ps[l].second);
					}
				}
			}
		}
		dmats.push_back(move(dmat));
	}
}

struct Op {
	int k, i, j;
	Op() = default;
	Op(int k, int i, int j) :
		k(k), i(i), j(j) {
	}
};

struct State {
	vector<vector<bool>> f = vector<vector<bool>>(n, vector<bool>(n));
	int c = 0;
	Dist d = Dist(m - 1, INF);
	vector<Op> ops;
	double sc = INF;

	bool operator<(const State& r) const {
		return sc < r.sc;
	}
	bool operator>(const State& r) const {
		return sc > r.sc;
	}
};

double calcSc(const Dist& d, int c) {
	double sum = 0;
	for (int v : d) {
		if (v == 0) continue;
		sum += 5000 * (10 + std::sqrt(v));
	}
	sum += c;
	return sum;
}

vector<priority_queue<State>> ques(1);
void solveB() {
	input();
	pre();

	const int width = 7;
	State best;
	ques[0].push(State());
	int cost = 0;
	while (true) {
		cerr << cost << endl;
		while (!ques[cost].empty()) {
			auto s = ques[cost].top();
			ques[cost].pop();

			if (s.d == Dist(m - 1, 0)) {
				best = s;
				goto end;
			}

			auto&& f = s.f;
			REP(si, 0, n) {
				REP(sj, 0, n) {
					if (f[si][sj]) continue;
					bool ok = false;
					REP(k, 0, 4) {
						int ni = si + di[k];
						int nj = sj + dj[k];
						if (!Inside(ni, nj, n, n)) continue;
						if (f[ni][nj]) {
							ok = true;
							break;
						}
					}

					if (s.ops.empty()) {
						if (si != ps[0].first || sj != ps[0].second) continue;
					} else {
						if (!ok) continue;
					}

					REP(k, 0, b) {
						int h = os[k].h;
						int w = os[k].w;
						for (auto&& p : os[k].qs) {
							int i = si - p.first;
							int j = sj - p.second;
							if (!Inside(i, j, n - h + 1, n - w + 1)) continue;
							bool ok = true;
							for (auto&& q : os[k].qs) {
								int x = q.first;
								int y = q.second;
								int ni = i + x;
								int nj = j + y;
								if (f[ni][nj]) {
									ok = false;
									break;
								}
							}
							if (!ok) continue;
							
							// 枝刈り
							auto&& d = dmats[k][i][j];
							bool changed = false;
							REP(l, 0, m - 1) {
								if (d[l] < s.d[l]) {
									changed = true;
									break;
								}
							}
							if (!changed) continue;

							// 置ける！！
							Dist nd = s.d;
							REP(l, 0, m - 1) {
								nd[l] &= d[l];
							}
							int nc = s.c + os[k].c;
							double nsc = calcSc(nd, nc);
							
							int index = nc / 11;
							if (index < ques.size()) {
								if (ques[index].size() == width) {
									if (nsc > ques[index].top().sc) {
										continue;
									}
								}
							}

							// 実際に構築
							State ns(s);
							ns.ops.emplace_back(k, i, j);
							for (auto&& q : os[k].qs) {
								int x = q.first;
								int y = q.second;
								int ni = i + x;
								int nj = j + y;
								ns.f[ni][nj] = true;
							}
							ns.c = nc;
							ns.d = move(nd);
							ns.sc = nsc;

							if (ques.size() <= index) {
								ques.resize(index + 1);
							}
							if (ques[index].size() == width) {
								ques[index].pop();
							}
							ques[index].push(move(ns));
						}
					}
				}
			}
		}
		++cost;
	}

end:
	cout << best.ops.size() << endl;
	for (auto&& op : best.ops) {
		cout << op.k + 1 << ' ' << op.i << ' ' << op.j << endl;
	}
	cerr << int(1e8 / best.c) << endl;
}

void problemB() {
	solveB();
}

void problemC() {
	solveB();
}

int main() {
	problemB();
	return 0;
}

// Included Files: 
//   * VectorUtil.h
//   * MinMax.h
//   * Main.h
//   * Main.cpp

Submission Info

Compile Error

./Main.cpp:465:10: warning: unused variable 'INFLL' [-Wunused-const-variable]
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
         ^
./Main.cpp:466:14: warning: unused variable 'INFD' [-Wunused-const-variable]
const double INFD = 1.0e+308;
             ^
./Main.cpp:467:14: warning: unused variable 'EPS' [-Wunused-const-variable]
const double EPS = 1.0e-9;
             ^
3 warnings generated.

Judge Result