Submission #1482253


Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N,K;
	cin >> N >> K;
	vector<int> hist(26,0);
	for(int i=0;i<N;++i){
		string str;
		cin >> str;
		hist[ str[0]-'A' ]++;
	}
	
	int ans = 0;
	while(1){
		sort(ALL(hist));
		int res = hist[26-K];
		if( res ){
			for(int i= 26-K;i<26;++i){
				hist[i] -= res;
			}
			ans += res;
		}else{
			cout << ans << endl;
			return;
		}
	}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()

Submission Info

Submission Time
Task B - Problem Committee
User akarin55
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1656 Byte
Status WA
Exec Time 4 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 13
WA × 19
Set Name Test Cases
All 00_sample.txt, 01_sample.txt, corner_case_20.txt, corner_case_21.txt, corner_case_22.txt, corner_case_23.txt, corner_case_24.txt, corner_case_25.txt, corner_case_26.txt, corner_case_27.txt, corner_case_28.txt, corner_case_29.txt, random_case_00.txt, random_case_01.txt, random_case_02.txt, random_case_03.txt, random_case_04.txt, random_case_05.txt, random_case_06.txt, random_case_07.txt, random_case_08.txt, random_case_09.txt, random_case_10.txt, random_case_11.txt, random_case_12.txt, random_case_13.txt, random_case_14.txt, random_case_15.txt, random_case_16.txt, random_case_17.txt, random_case_18.txt, random_case_19.txt
Case Name Status Exec Time Memory
00_sample.txt AC 1 ms 256 KB
01_sample.txt AC 1 ms 256 KB
corner_case_20.txt AC 1 ms 256 KB
corner_case_21.txt AC 1 ms 256 KB
corner_case_22.txt AC 1 ms 256 KB
corner_case_23.txt AC 1 ms 256 KB
corner_case_24.txt AC 3 ms 256 KB
corner_case_25.txt AC 3 ms 256 KB
corner_case_26.txt AC 3 ms 256 KB
corner_case_27.txt AC 3 ms 256 KB
corner_case_28.txt AC 3 ms 256 KB
corner_case_29.txt AC 3 ms 256 KB
random_case_00.txt WA 3 ms 256 KB
random_case_01.txt WA 3 ms 256 KB
random_case_02.txt AC 3 ms 256 KB
random_case_03.txt WA 3 ms 256 KB
random_case_04.txt WA 3 ms 256 KB
random_case_05.txt WA 3 ms 256 KB
random_case_06.txt WA 3 ms 256 KB
random_case_07.txt WA 3 ms 256 KB
random_case_08.txt WA 3 ms 256 KB
random_case_09.txt WA 3 ms 256 KB
random_case_10.txt WA 3 ms 256 KB
random_case_11.txt WA 3 ms 256 KB
random_case_12.txt WA 3 ms 256 KB
random_case_13.txt WA 3 ms 256 KB
random_case_14.txt WA 3 ms 256 KB
random_case_15.txt WA 3 ms 256 KB
random_case_16.txt WA 3 ms 256 KB
random_case_17.txt WA 4 ms 256 KB
random_case_18.txt WA 3 ms 256 KB
random_case_19.txt WA 3 ms 256 KB