General
 
 
# Author Problem Lang Verdict Time Memory Sent Judged  
44673884 Virtual:
MIT -1: xyz111, ecnerwala, ksun48#
1070J - 29 GNU C++14 Accepted 108 ms 1244 KB 2018-10-22 04:07:02 2018-10-22 04:07:02
 
 
→ Source
#include <bits/stdc++.h>
using namespace std;

#define N 210000

int n, m, k, ss[N];
bool ok[N];
char S[N];

void doit() {
	for (int i = 0; i <= k; i++)
		ok[i] = false;
	ok[0] = true;
	for (int i = 0; i < 26; i++)
		for (int j = k; j >= ss[i]; j--)
			ok[j] |= ok[j - ss[i]];
}

int main() {
	int _;
	scanf("%d", &_);
	while (_--) {
		scanf("%d%d%d", &n, &m, &k);
		for (int i = 0; i < 26; i++)
			ss[i] = 0;
		scanf("%s", S);
		for (int i = 0; i < k; i++)
			ss[S[i] - 'A']++;
		doit();
		int ans = 1e9;
		for (int i = n; i <= k - m; i++)
			if (ok[i])
				ans = 0;

		for (int i = 0; i < 26; i++) {
			int tmp = ss[i];
			ss[i] = 0;
			doit();
			ss[i] = tmp;
			for (int j = 0; j <= n; j++)
				if (ok[j] && k - ss[i] - j <= m)
					ans = min(0LL + ans, 1LL * (n - j) * (m - (k - ss[i] - j)));
		}
		printf("%d\n", ans);
	}
}
 
 
?
Time: ? ms, memory: ? KB
Verdict: ?
Input
?
Participant's output
?
Jury's answer
?
Checker comment
?
Diagnostics
?
Click to see test details