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

• 問題: No.197 手品
• ユーザー: nksk38
• 提出日時: 2017-07-12 16:22:30
• 言語: C++11 (gcc 11.4.0)
• 結果: WA
• 実行時間: -
• コード長: 1,397 bytes
• コンパイル時間: 616 ms
• コンパイル使用メモリ: 80,924 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-27 13:47:36
• 合計ジャッジ時間: 1,801 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

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

コンパイルメッセージ

main.cpp: In function ‘int main()’:
main.cpp:61:24: warning: ‘s_ind_aft’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   61 |                 if ((d == 0 || d == 2)) {
      |                      ~~^~~~
main.cpp:61:24: warning: ‘s_ind_bef’ may be used uninitialized in this function [-Wmaybe-uninitialized]

ソースコード

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int main()
{
	string s_before, s_after;
	ll N,o_num_b=0,o_num_a= 0,x_num_a = 0,x_num_b = 0;
	string ans;

	cin >> s_before >> N >> s_after;

	for (int i = 0; i < s_before.size(); i++) {
		if (s_before[i] == 'o')o_num_b++;
		else x_num_b++;
	}

	for (int i = 0; i < s_after.size(); i++) {
		if (s_after[i] == 'o')o_num_a++;
		else x_num_a++;
	}

	if (s_before == "ooo" && s_after == "ooo") {
		ans = "SUCCESS";
	}
	else if ((o_num_b != o_num_a) || (x_num_a != x_num_b)) {
		ans = "SUCCESS";
	}
	else {
		char c;
		if (o_num_b < x_num_a)c = 'o';
		else c = 'x';

		int s_ind_bef;
		for (int i = 0; i < s_before.size(); i++) {
			if (s_before[i] == c)s_ind_bef = i;
		}

		int s_ind_aft;
		for (int i = 0; i < s_after.size(); i++) {
			if (s_after[i] == c)s_ind_aft = i;
		}

		int d = abs(s_ind_bef - s_ind_aft);
		if ((d == 0 || d == 2)) {
			if (N != 0 && (N % 2 != 0))
				ans = "SUCCESS";
			else
				ans = "FAILURE";
		}
		else if ((d == 1) && (N % 2 == 0))
			ans = "SUCCESS";
		else
			ans = "FAILURE";
	}
	cout << ans << endl;
	
	return	0;
}