#25471 (C++11) No.204 ゴールデン・ウィーク(2)

• 問題: No.204 ゴールデン・ウィーク(2)
• ユーザー: よっか
• 提出日時: 2015-05-08 23:16:54
• 言語: C++11 (gcc 11.4.0)
• 結果: WA
• 実行時間: -
• コード長: 2,290 bytes
• コンパイル時間: 779 ms
• コンパイル使用メモリ: 93,256 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-10-13 11:50:56
• 合計ジャッジ時間: 4,655 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

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

ソースコード

#include <iostream>
#include <vector>
#include <deque>
#include <stack>
#include <memory>
#include <functional>
#include <algorithm>
#include <map>
#include <list>
#include <complex>
#include <string>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <array>
using namespace std;
typedef std::pair<int, int> pii;
typedef long long int ll;

#define pb push_back

template < class BidirectionalIterator >
bool next_combination(BidirectionalIterator first1,
	BidirectionalIterator last1,
	BidirectionalIterator first2,
	BidirectionalIterator last2)
{
	if ((first1 == last1) || (first2 == last2)) {
		return false;
	}
	BidirectionalIterator m1 = last1;
	BidirectionalIterator m2 = last2; --m2;
	while (--m1 != first1 && !(*m1 < *m2)){
	}
	bool result = (m1 == first1) && !(*first1 < *m2);
	if (!result) {

		while (first2 != m2 && !(*m1 < *first2)) {
			++first2;
		}
		first1 = m1;
		std::iter_swap(first1, first2);
		++first1;
		++first2;
	}
	if ((first1 != last1) && (first2 != last2)) {

		m1 = last1; m2 = first2;
		while ((m1 != first1) && (m2 != last2)) {
			std::iter_swap(--m1, m2);
			++m2;
		}

		std::reverse(first1, m1);
		std::reverse(first1, last1);
		std::reverse(m2, last2);
		std::reverse(first2, last2);
	}
	return !result;
}

template < class BidirectionalIterator >
bool next_combination(BidirectionalIterator first,
	BidirectionalIterator middle,
	BidirectionalIterator last)
{
	return next_combination(first, middle, middle, last);
}

int main(){

	std::vector<char> data;
	std::vector<int> x;
	const int N = 14;

	int D;
	cin >> D;


	int result = 0;
	int count1 = 0;
	char c;
	for (int i = 0; i < N; ++i){
		cin >> c;
		data.push_back(c);
		if(c == 'o'){
			count1++;
		}else{
			count1 = 0;
		}
		result = max(result, count1);
		if(c == 'x'){
			x.pb(i);
		}
	}


	if(!x.empty()){
		do{
			std::vector<char> tmp;
			for (int i = 0; i < data.size(); ++i) {
				tmp.pb(data[i]);
			}
			for (int i = 0; i < D; ++i) {
				tmp[x[i]] = 'o';
			}

			int count = 0;
			for (int i = 0; i < N; ++i) {
				if(tmp[i] == 'o'){
					count++;
				}else{
					count = 0;
				}
				result = max(result, count);
			}
		} while (next_combination(x.begin(), x.begin() + D, x.end()));
	}
	std::cout << result << std::endl;

	return 0;
}