#137502 (C++14) No.460 裏表ちわーわ

提出ソース

結果

問題	No.460 裏表ちわーわ
ユーザー	shimomire
提出日時	2016-12-11 01:58:48
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	67 ms / 2,000 ms
コード長	5,733 bytes
コンパイル時間	1,267 ms
コンパイル使用メモリ	128,340 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-11-29 02:55:22
合計ジャッジ時間	3,381 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	9 ms 6,816 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	65 ms 6,816 KB
testcase_06	AC	63 ms 6,816 KB
testcase_07	AC	62 ms 6,816 KB
testcase_08	AC	61 ms 6,816 KB
testcase_09	AC	2 ms 6,816 KB
testcase_10	AC	62 ms 6,816 KB
testcase_11	AC	65 ms 6,816 KB
testcase_12	AC	67 ms 6,820 KB
testcase_13	AC	65 ms 6,820 KB
testcase_14	AC	64 ms 6,816 KB
testcase_15	AC	65 ms 6,816 KB
testcase_16	AC	64 ms 6,816 KB
testcase_17	AC	64 ms 6,816 KB
testcase_18	AC	65 ms 6,820 KB
testcase_19	AC	64 ms 6,820 KB
testcase_20	AC	63 ms 6,820 KB
testcase_21	AC	63 ms 6,820 KB
testcase_22	AC	64 ms 6,820 KB
testcase_23	AC	63 ms 6,820 KB
testcase_24	AC	67 ms 6,820 KB
testcase_25	AC	2 ms 6,816 KB
testcase_26	AC	2 ms 6,816 KB
testcase_27	AC	2 ms 6,816 KB

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

ソースコード

raw source code

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());}
//debug
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<60;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};

// min{2^r | n < 2^r}
template<typename T> inline T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> inline T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}

class Main{
	public:
	void run(){
		int dx[8]={1,1,0,-1,-1,-1,0,1},dy[8]={0,1,1,1,0,-1,-1,-1};
		int H,W;cin >> H >> W;
		vector<vector<int>> board(H,vector<int>(W)); cin >> board;

		int mv = INF<int>();
		for(int xbit:range(1<<W)){
			for(int ybit:range(1<<H)){
				int c = 0;
				vector<vector<int>> b = board;
				for(int x:range(W))if(xbit&(1<<x)){
					c++;
					b[0][x] = 1 - b[0][x];
					for(int d:range(8)){
						int ny = 0 + dy[d],nx = x + dx[d];
						if(!IN(0,ny,H) || !IN(0,nx,W)) continue;
						b[ny][nx] = 1 - b[ny][nx];
					}
				}
				for(int y:range(1,H))if(ybit&(1<<y)){
					c++;
					b[y][0] = 1 - b[y][0];
					for(int d:range(8)){
						int ny = y + dy[d],nx = 0 + dx[d];
						if(!IN(0,ny,H) || !IN(0,nx,W)) continue;
						b[ny][nx] = 1 - b[ny][nx];
					}
				}

				for(int y:range(H))for(int x:range(W))if(b[y][x]==1 && y+1< H && x+1<W){
					c++;
					b[y+1][x+1] = 1 - b[y+1][x+1];
					for(int d:range(8)){
						int ny = (y+1) + dy[d],nx = (x+1) + dx[d];
						if(!IN(0,ny,H) || !IN(0,nx,W)) continue;
						b[ny][nx] = 1 - b[ny][nx];
					}
				}

				bool ok = true;
				for(int y:range(H))for(int x:range(W))ok &= b[y][x] == 0;

				if(!ok)continue;
				mv = min(mv,c);
			}
		}

		if(mv !=INF<int>()) cout << mv << endl;
		else cout <<"Impossible"<<endl;
	}
};

int main(){
	cout <<fixed<<setprecision(10);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}

yukicoder

結果

テストケース

ソースコード