#907327 (C++17) No.1427 Simplified Tetris

提出ソース

結果

問題	No.1427 Simplified Tetris
ユーザー	FF256grhy
提出日時	2023-08-24 19:57:41
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	11 ms / 2,000 ms
コード長	8,472 bytes
コンパイル時間	3,762 ms
コンパイル使用メモリ	228,928 KB
実行使用メモリ	4,388 KB
最終ジャッジ日時	2023-08-24 19:57:48
合計ジャッジ時間	6,621 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	AC	4 ms 4,388 KB
testcase_03	AC	1 ms 4,380 KB
testcase_04	AC	2 ms 4,384 KB
testcase_05	AC	2 ms 4,384 KB
testcase_06	AC	1 ms 4,384 KB
testcase_07	AC	2 ms 4,384 KB
testcase_08	AC	1 ms 4,380 KB
testcase_09	AC	2 ms 4,384 KB
testcase_10	AC	2 ms 4,380 KB
testcase_11	AC	4 ms 4,384 KB
testcase_12	AC	2 ms 4,380 KB
testcase_13	AC	2 ms 4,380 KB
testcase_14	AC	2 ms 4,384 KB
testcase_15	AC	1 ms 4,384 KB
testcase_16	AC	1 ms 4,384 KB
testcase_17	AC	1 ms 4,380 KB
testcase_18	AC	1 ms 4,384 KB
testcase_19	AC	3 ms 4,380 KB
testcase_20	AC	1 ms 4,384 KB
testcase_21	AC	1 ms 4,380 KB
testcase_22	AC	2 ms 4,380 KB
testcase_23	AC	1 ms 4,380 KB
testcase_24	AC	2 ms 4,380 KB
testcase_25	AC	2 ms 4,384 KB
testcase_26	AC	2 ms 4,380 KB
testcase_27	AC	1 ms 4,388 KB
testcase_28	AC	2 ms 4,384 KB
testcase_29	AC	1 ms 4,380 KB
testcase_30	AC	1 ms 4,384 KB
testcase_31	AC	2 ms 4,384 KB
testcase_32	AC	11 ms 4,380 KB
testcase_33	AC	3 ms 4,384 KB
testcase_34	AC	1 ms 4,380 KB
testcase_35	AC	2 ms 4,384 KB
testcase_36	AC	2 ms 4,380 KB
testcase_37	AC	2 ms 4,380 KB
testcase_38	AC	1 ms 4,384 KB
testcase_39	AC	1 ms 4,384 KB
testcase_40	AC	2 ms 4,380 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define incII(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };
auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a <  r); };
auto inXI = [](auto a, auto l, auto r) -> bool { return (l <  a && a <= r); };
auto inXX = [](auto a, auto l, auto r) -> bool { return (l <  a && a <  r); };
auto setmin   = [](auto & a, auto b) -> bool { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) -> bool { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };
using LL = long long int;
using LD = long double;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define RV(a) reverse(ALL(a))
#define ST(a) sort(ALL(a))
#define RST(a) sort(RALL(a))
#define SC static_cast
#define SI(a) SC<int>(a.size())
#define SL(a) SC<LL>(a.size())
#define RF(e, ...) for(auto && e: __VA_ARGS__)
#define SF(a, ...) for(auto && [__VA_ARGS__]: a)
#define until(...) while(not(__VA_ARGS__))
#define if_not(...) if(not(__VA_ARGS__))
#define ef else if
#define UR assert(false)
template<typename A>             istream & operator>>(istream & is, vector<A>          & v);
template<typename A>             ostream & operator<<(ostream & os, vector<A>    const & v);
template<typename A, size_t N>   istream & operator>>(istream & is, array<A, N>        & a);
template<typename A, size_t N>   ostream & operator<<(ostream & os, array<A, N>  const & a);
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>         & p);
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B>   const & p);
template<typename ... A>         istream & operator>>(istream & is, tuple<A ...>       & t);
template<typename ... A>         ostream & operator<<(ostream & os, tuple<A ...> const & t);
template<int I = 0, typename T> void tin_ (istream & is, T       & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } }
template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }
template<typename A>             istream & operator>>(istream & is, vector<A>          & v) { for(auto && e: v) { is >> e; } return is; }
template<typename A>             ostream & operator<<(ostream & os, vector<A>    const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }
template<typename A, size_t N>   istream & operator>>(istream & is, array<A, N>        & a) { for(auto && e: a) { is >> e; } return is; }
template<typename A, size_t N>   ostream & operator<<(ostream & os, array<A, N>  const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; }
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>         & p) { return is >> p.first >> p.second; }
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B>   const & p) { return os << p.first << " " << p.second; }
template<typename ... A>         istream & operator>>(istream & is, tuple<A ...>       & t) { tin_ (is, t); return is; }
template<typename ... A>         ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }
auto * IS = & cin;
auto * OS = & cout;
template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }
#define IN(...) __VA_ARGS__; in(__VA_ARGS__)
template<typename A                > auto make_v(A a) { return a; }
template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }
template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }
void                                      out_([[maybe_unused]] string const & s) { }
template<typename A                > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }
template<typename A, typename ... B> void out_(                 string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }
auto outF  = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; };
auto outN  = [](auto const & ... a) { outF(""  , ""  , a ...); };
auto outS  = [](auto const & ... a) { outF(" " , " " , a ...); };
auto outL  = [](auto const & ... a) { outF("\n", "\n", a ...); };
auto outSN = [](auto const & ... a) { outF(" " , ""  , a ...); };
auto outNL = [](auto const & ... a) { outF(""  , "\n", a ...); };
auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); };
auto out   = outSL;
template<typename A                > void disp_(A const & a) { * OS << a; }
template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } }
auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };
auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };
auto dispL = [](auto const & a,                 auto const & ... t) { dispT(a, "\n", t ...); };
struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;

// ---- ----

#include <atcoder/maxflow>
using namespace atcoder;

auto dd = [](int h, int w, int i, int j, int k) -> tuple<bool, int, int> {
	vector<int> di = { +1,  0, -1,  0, +1, +1, -1, -1, 0 };
	vector<int> dj = {  0, +1,  0, -1, +1, -1, +1, -1, 0 };
	int ii = i + di.at(k);
	int jj = j + dj.at(k);
	return { inIX(ii, 0, h) && inIX(jj, 0, w), ii, jj };
};

int main() {
	auto solve = [](auto s) -> optional<vector<string>> {
		int x = 0;
		RF(ss, s) { x += count(ALL(ss), '#'); }
		if(x % 2 != 0) { return {}; }
		
		int h = SI(s), w = SI(s[0]);
		auto id = [&](int i, int j) { return w * i + j; };
		auto pos = [&](int x) -> pair<int, int> { return { x / w, x % w }; };
		
		mf_graph<int> g(h * w + 2);
		int S = h * w, T = S + 1;
		inc(i, h) {
		inc(j, w) {
			if_not(s[i][j] == '#') { continue; }
			if((i + j) % 2 == 0) {
				g.add_edge(S, id(i, j), 1);
			} else {
				g.add_edge(id(i, j), T, 1);
			}
			inc(k, 4) {
				auto [f, ii, jj] = dd(h, w, i, j, k);
				if_not(f && s[ii][jj] == '#') { continue; }
				if((i + j) % 2 == 0) {
					g.add_edge(id(i, j), id(ii, jj), 1);
				} else {
					g.add_edge(id(ii, jj), id(i, j), 1);
				}
			}
		}
		}
		
		if(g.flow(S, T) != x / 2) { return {}; }
		
		auto ans = g.edges();
		string ord;
		inc(i, 26) { ord += 'A' + i; }
		inc(i, 26) { ord += 'a' + i; }
		int c = 0;
		SF(ans, a, b, c_, f) {
			if(a == S || b == T || f == 0) { continue; }
			auto [ai, aj] = pos(a);
			auto [bi, bj] = pos(b);
			s[ai][aj] = ord[c];
			s[bi][bj] = ord[c];
			c++;
		}
		return s;
	};
	
	auto no = [] { out("No"); exit(0); };
	
	int IN(h, w);
	auto s = read_v<string>(h);
	RV(s);
	
	string filled(w, '#'), empty(w, '.');
	
	int ec = 0;
	RF(ss, s) {
		if(ss == filled) { no(); }
		if(ss == empty) { ec++; } else { if(ec != 0) { no(); } }
	}
	
	incII(f, 0, ec) {
		vector<int> p(h - ec);
		inc(i, f) { p.PB(1); }
		do {
			vector<string> v;
			int c = 0;
			RF(pp, p) { v.PB(pp == 0 ? s[c++] : filled); }
			until(SI(v) == h) { v.PB(empty); }
			auto ans = solve(v);
			if(ans) {
				RV(ans.value());
				out("Yes");
				dispL(ans.value());
				exit(0);
			}
		} while(next_permutation(ALL(p)));
	}
	no();
}

yukicoder

結果

テストケース

ソースコード