#206799 (C++11) No.197 手品

提出ソース

結果

問題	No.197 手品
ユーザー	komori3
提出日時	2017-09-28 07:42:51
言語	C++11 (gcc 11.4.0)
結果	WA
実行時間	-
コード長	4,088 bytes
コンパイル時間	994 ms
コンパイル使用メモリ	99,528 KB
実行使用メモリ	4,380 KB
最終ジャッジ日時	2023-09-09 21:22:29
合計ジャッジ時間	2,663 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

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

テストケース

テストケース表示

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

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

ソースコード

raw source code

#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 "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; }
#define PI 3.14159265358979323846
#define EPS 1e-6
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define all(x) (x).begin(), (x).end()



int yuki0197()
{
	map<string, int> mp;
	mp["xxx"] = 0; mp["xxo"] = 1; mp["xox"] = 2; mp["xoo"] = 3;
	mp["oxx"] = 4; mp["oxo"] = 5; mp["oox"] = 6; mp["ooo"] = 7;

	int shuffle;
	string SB, SA;
	cin >> SB >> shuffle >> SA;

	int s = mp[SB];

	bool success;

	switch (s)
	{
	case 0:
		if (SA != SB) success = true;
		else success = false;
		break;
	case 1:
		if (shuffle == 0) {
			if (SA != SB) success = true;
			else success = false;
		}
		else if (shuffle == 1) {
			if (mp[SA] != 1 && mp[SA] != 2) success = true;
			else success = false;
		}
		else {
			if (mp[SA] != 1 && mp[SA] != 2 && mp[SA] != 4) success = true;
			else success = false;
		}
		break;
	case 2:
		if (shuffle == 0) {
			if (SA != SB) success = true;
			else success = false;
		}
		else if (shuffle == 1) {
			if (mp[SA] != 1 && mp[SA] != 4) success = true;
			else success = false;
		}
		else {
			if (mp[SA] != 1 && mp[SA] != 2 && mp[SA] != 4) success = true;
			else success = false;
		}
		break;
	case 4:
		if (shuffle == 0) {
			if (SA != SB) success = true;
			else success = false;
		}
		else if (shuffle == 1) {
			if (mp[SA] != 2 && mp[SA] != 4) success = true;
			else success = false;
		}
		else {
			if (mp[SA] != 1 && mp[SA] != 2 && mp[SA] != 4) success = true;
			else success = false;
		}
		break;
	case 3:
		if (shuffle == 0) {
			if (SA != SB) success = true;
			else success = false;
		}
		else if (shuffle == 1) {
			if (mp[SA] != 3 && mp[SA] != 5) success = true;
			else success = false;
		}
		else {
			if (mp[SA] != 3 && mp[SA] != 5 && mp[SA] != 6) success = true;
			else success = false;
		}
		break;
	case 5:
		if (shuffle == 0) {
			if (SA != SB) success = true;
			else success = false;
		}
		else if (shuffle == 1) {
			if (mp[SA] != 3 && mp[SA] != 6) success = true;
			else success = false;
		}
		else {
			if (mp[SA] != 3 && mp[SA] != 5 && mp[SA] != 6) success = true;
			else success = false;
		}
		break;
	case 6:
		if (shuffle == 0) {
			if (SA != SB) success = true;
			else success = false;
		}
		else if (shuffle == 1) {
			if (mp[SA] != 3 && mp[SA] != 5) success = true;
			else success = false;
		}
		else {
			if (mp[SA] != 3 && mp[SA] != 5 && mp[SA] != 6) success = true;
			else success = false;
		}
		break;
	case 7:
		if (SA != SB) success = true;
		else success = false;
		break;
	default:
		break;
	}

	cout << (success ? "SUCCESS" : "FAILURE") << endl;

	return 0;
}

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

	yuki0197();

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

	return 0;
}

yukicoder

結果

テストケース

ソースコード