#50869 (C++11) No.145 yukiover

• 問題: No.145 yukiover
• ユーザー: masa
• 提出日時: 2015-09-24 16:10:59
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 4 ms / 5,000 ms
• コード長: 1,634 bytes
• コンパイル時間: 558 ms
• コンパイル使用メモリ: 63,460 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-19 08:59:52
• 合計ジャッジ時間: 1,226 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 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	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	4 ms; 5,376 KB
testcase_12	AC	3 ms; 5,376 KB
testcase_13	AC	3 ms; 5,376 KB
testcase_14	AC	3 ms; 5,376 KB
testcase_15	AC	3 ms; 5,376 KB
testcase_16	AC	3 ms; 5,376 KB
testcase_17	AC	3 ms; 5,376 KB
testcase_18	AC	3 ms; 5,376 KB
testcase_19	AC	3 ms; 5,376 KB
testcase_20	AC	3 ms; 5,376 KB
testcase_21	AC	3 ms; 5,376 KB
testcase_22	AC	3 ms; 5,376 KB
testcase_23	AC	3 ms; 5,376 KB

ソースコード

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>

using namespace std;

int main() {
	int n;
	string s;
	vector<int> chars(255, 0);

	cin >> n >> s;

	for (int i = 0; i < n; i++) {
		chars[s[i]]++;
	}

	int ans = 0;
	int val;

	// yukia - yukih
	for (char c = 'a'; c < 'i'; c++) {
		val = min({chars['y'], chars['u'], chars['k'], chars['i'], chars[c]});
		ans += val;
		chars['y'] -= val;
		chars['u'] -= val;
		chars['k'] -= val;
		chars['i'] -= val;
		chars[c] -= val;
	}

	// yukii
	val = min({chars['y'], chars['u'], chars['k'], chars['i'] / 2});
	ans += val;
	chars['y'] -= val;
	chars['u'] -= val;
	chars['k'] -= val;
	chars['i'] -= val * 2;

	// yukj
	for (char c = 'j'; c < 'k'; c++) {

		val = min({chars['y'], chars['u'], chars['k'], chars[c]});
		ans += val;
		chars['y'] -= val;
		chars['u'] -= val;
		chars['k'] -= val;
		chars[c] -= val;
	}

	// yukk
	val = min({chars['y'], chars['u'], chars['k'] / 2});
	ans += val;
	chars['y'] -= val;
	chars['u'] -= val;
	chars['k'] -= val * 2;

	// yul - yut
	for (char c = 'l'; c < 'u'; c++) {
		val = min({chars['y'], chars['u'], chars[c]});
		ans += val;
		chars['y'] -= val;
		chars['u'] -= val;
		chars[c] -= val;
	}

	// yuu
	val = min(chars['y'], chars['u'] / 2);
	ans += val;
	chars['y'] -= val;
	chars['u'] -= val * 2;

	// yv - yx
	for (char c = 'v'; c < 'y'; c++) {
		val = min(chars['y'], chars[c]);
		ans += val;
		chars['y'] -= val;
		chars[c] -= val;
	}

	// yy
	val = chars['y'] / 2;
	ans += val;
	chars['y'] -= val * 2;

	// z
	ans += chars['z'];
	chars['z'] = 0;

	cout << ans << endl;
	return 0;
}