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

提出ソース

結果

問題	No.1427 Simplified Tetris
ユーザー	maroon_kuri
提出日時	2021-03-12 22:00:57
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	3 ms / 2,000 ms
コード長	6,884 bytes
コンパイル時間	2,765 ms
コンパイル使用メモリ	221,812 KB
実行使用メモリ	4,384 KB
最終ジャッジ日時	2023-08-04 15:18:32
合計ジャッジ時間	4,778 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

このコードへのチャレンジ（β）

テストケース

テストケース表示

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

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

ソースコード

raw source code

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

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

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

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

//sz: the size of the max matching
//VERIFY: yosupo
template<class E>
struct bipartitematching{
	int n,m;
	vvc<E> g;
	vi dist,vis;
	vi to,ot;
	int sz;
	bipartitematching(int nn,int mm):n(nn),m(mm),g(n),
	dist(n),vis(n),to(n,-1),ot(m,-1),sz(0){}
	void ae(int a,E e){
		g[a].pb(e);
	}
	void bfs(){
		fill(all(dist),-1);
		vi q;
		int h=0;
		auto rc=[&](int v,int d){
			if(v==-1||dist[v]!=-1)return;
			dist[v]=d;
			q.pb(v);
		};
		rep(i,n)if(to[i]==-1)rc(i,0);
		while(h<(int)q.size()){
			int v=q[h++];
			for(auto e:g[v])
				rc(ot[e],dist[v]+1);
		}
	}
	bool dfs(int v){
		if(vis[v])return 0;
		vis[v]=1;
		for(auto e:g[v]){
			if(ot[e]==-1||(dist[v]+1==dist[ot[e]]&&dfs(ot[e]))){
				to[v]=e;
				ot[e]=v;
				return 1;
			}
		}
		return 0;
	}
	void calc(){
		while(1){
			bfs();
			fill(all(vis),0);
			int f=0;
			rep(i,n)if(to[i]==-1)
				if(dfs(i))f++;
			if(f==0)break;
			sz+=f;
		}
	}
};

void sub(vc<string> ss){
	dmp(ss);
	int h=si(ss),w=si(ss[0]);
	vvc<int> idx(h,vi(w,-1));
	vc<pi> pos[2];
	int n=0,m=0;
	rep(i,h)rep(j,w)if(ss[i][j]=='#'){
		if((i+j)%2==0){
			idx[i][j]=n++;
			pos[0].eb(i,j);
		}else{
			idx[i][j]=m++;
			pos[1].eb(i,j);
		}
	}
	if(n!=m)return;
	bipartitematching<int> bm(n,m);
	const int dyx[]{-1,0,1,0,-1};
	rep(i,h)rep(j,w)if((i+j)%2==0&&idx[i][j]!=-1){
		int x=idx[i][j];
		rep(dir,4){
			int r=i+dyx[dir],c=j+dyx[dir+1];
			if(inc(0,r,h-1)&&inc(0,c,w-1)){
				int y=idx[r][c];
				if(y!=-1){
					bm.ae(x,y);
				}
			}
		}
	}
	bm.calc();
	if(bm.sz!=n)return;
	rep(i,n){
		int j=bm.to[i];
		char c=i<26?'a'+i:'A'+i-26;
		ss[pos[0][i].a][pos[0][i].b]=c;
		ss[pos[1][j].a][pos[1][j].b]=c;
	}
	yes(0);
	rep(i,h)print(ss[i]);
	exit(0);
}

void slv(){
	int h,w;cin>>h>>w;
	vc<string> ss(h);
	rep(i,h){
		ss[i]=readString();
		if(ss[i]==string(w,'#')){
			no();
		}
	}
	int f=h;
	rep(i,h)if(ss[i]!=string(w,'.')){
		chmin(f,i);
	}else{
		if(f!=h){
			no();
		}
	}
	int len=h-f;
	rng(z,len,h+1){
		rep(bit,1<<z){
			if(popcount(bit)==len){
				vc<string> tmp(h,string(w,'.'));
				int head=0;
				rep(i,z)if(bit&1<<i){
					tmp[h-1-i]=ss[h-1-(head++)];
				}else{
					tmp[h-1-i]=string(w,'#');
				}
				sub(tmp);
			}
		}
	}
	no();
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	//int t;cin>>t;rep(_,t)
	slv();
}

yukicoder

結果

テストケース

ソースコード