#208772 (C++11) No.351 市松スライドパズル

• 問題: No.351 市松スライドパズル
• ユーザー: komori3
• 提出日時: 2017-10-10 00:29:18
• 言語: C++11 (gcc 11.4.0)
• 結果: TLE
• 実行時間: -
• コード長: 2,609 bytes
• コンパイル時間: 628 ms
• コンパイル使用メモリ: 80,520 KB
• 実行使用メモリ: 107,808 KB
• 最終ジャッジ日時: 2024-04-28 14:31:53
• 合計ジャッジ時間: 6,369 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	218 ms; 10,624 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	TLE	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-
testcase_20	--	-

ソースコード

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr;	} cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define all(x) (x).begin(), (x).end()



#define SIZE 10000

bool mp[SIZE][SIZE];
int H, W;

void move(char RC, int line)
{
	bool tmp;
	switch (RC)
	{
	case 'R':	// 行
		tmp = mp[line][W - 1];
		for (int j = W - 1; j > 0; j--) mp[line][j] = mp[line][j - 1];
		mp[line][0] = tmp;
		break;
	case 'C':
		tmp = mp[H - 1][line];
		for (int i = H - 1; i > 0; i--) mp[i][line] = mp[i - 1][line];
		mp[0][line] = tmp;
		break;
	default:
		break;
	}
}

int yuki0351()
{
	cin >> H >> W;

	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			mp[i][j] = ((i + j) & 1 ? 0 : 1);
		}
	}

	int N;
	cin >> N;

	char RC;
	int line;

	for (int i = 0; i < N; i++) {
		cin >> RC >> line;
		move(RC, line);
	}

	cout << (mp[0][0] ? "white" : "black") << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0351();
	
	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}