/**
____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N_MAX = 100000;
const int G_MAX = 15;
int G, N;
int group[N_MAX];
vector <int> inGroup[G_MAX];
int pref[N_MAX][G_MAX];
int suff[N_MAX][G_MAX];
void input () {
string S;
cin >> S;
N = (int) S.size();
bool occ[26];
fill(occ, occ + 26, false);
for (int i = 0; i < N; i++) {
group[i] = (int) (S[i] - 'A');
occ[group[i]] = true;
}
int id[26];
for (int g = 0; g < 26; g++) {
if (occ[g] == true) {
id[g] = G++;
}
}
for (int i = 0; i < N; i++) {
group[i] = id[group[i]];
inGroup[group[i]].push_back(i);
}
pref[0][group[0]] = 1;
for (int i = 1; i < N; i++) {
for (int g = 0; g < G; g++) {
pref[i][g] = pref[i - 1][g];
}
pref[i][group[i]]++;
}
suff[N - 1][group[N - 1]] = 1;
for (int i = N - 2; i >= 0; i--) {
for (int g = 0; g < G; g++) {
suff[i][g] = suff[i + 1][g];
}
suff[i][group[i]]++;
}
}
ll minEV[1 << G_MAX];
void update (ll &x, const ll &y) {
if (y < x) {
x = y;
}
}
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(4);
input();
// cout << N << " " << G << "\n";
// for (int i = 0; i < N; i++) {
// cout << group[i] << " ";
// }
// cout << "\n";
fill(minEV, minEV + (1 << G), LLONG_MAX);
minEV[0] = 0;
for (int mask = 0; mask < (1 << G) - 1; mask++) {
for (int g = 0; g < G; g++) {
if (((mask >> g) & 1) == 0) {
for (int cntL = 0; cntL <= (int) inGroup[g].size(); cntL++) {
ll add = 0;
for (int i = 0; i < cntL; i++) {
add += i;
for (int h = 0; h < G; h++) {
if ((mask >> h) & 1) {
add += 2 * pref[inGroup[g][i]][h];
}
}
}
for (int i = cntL; i < (int) inGroup[g].size(); i++) {
add += ((int) inGroup[g].size() - 1 - i);
for (int h = 0; h < G; h++) {
if ((mask >> h) & 1) {
add += 2 * suff[inGroup[g][i]][h];
}
}
}
update(minEV[mask | (1 << g)], minEV[mask] + add);
}
}
}
}
ll answer = minEV[(1 << G) - 1];
if (answer % 2 == 0) {
cout << answer / 2 << "\n";
} else {
cout << answer / 2 << ".5\n";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
456 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
3 ms |
468 KB |
Output is correct |
| 6 |
Execution timed out |
2079 ms |
10512 KB |
Time limit exceeded |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
2 ms |
340 KB |
Output is correct |
| 4 |
Correct |
3 ms |
340 KB |
Output is correct |
| 5 |
Correct |
8 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
2 ms |
336 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
340 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
336 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
2 ms |
340 KB |
Output is correct |
| 4 |
Correct |
3 ms |
340 KB |
Output is correct |
| 5 |
Correct |
8 ms |
332 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
2 ms |
336 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
340 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
336 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Correct |
1 ms |
332 KB |
Output is correct |
| 19 |
Correct |
1 ms |
304 KB |
Output is correct |
| 20 |
Correct |
2 ms |
336 KB |
Output is correct |
| 21 |
Correct |
2 ms |
336 KB |
Output is correct |
| 22 |
Correct |
7 ms |
356 KB |
Output is correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Correct |
1 ms |
340 KB |
Output is correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Correct |
1 ms |
340 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
1 ms |
340 KB |
Output is correct |
| 29 |
Correct |
1 ms |
332 KB |
Output is correct |
| 30 |
Correct |
1 ms |
340 KB |
Output is correct |
| 31 |
Correct |
1 ms |
340 KB |
Output is correct |
| 32 |
Correct |
1 ms |
340 KB |
Output is correct |
| 33 |
Correct |
1 ms |
336 KB |
Output is correct |
| 34 |
Correct |
1 ms |
340 KB |
Output is correct |
| 35 |
Correct |
122 ms |
1680 KB |
Output is correct |
| 36 |
Correct |
174 ms |
1676 KB |
Output is correct |
| 37 |
Execution timed out |
2062 ms |
1620 KB |
Time limit exceeded |
| 38 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
456 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
3 ms |
468 KB |
Output is correct |
| 6 |
Execution timed out |
2079 ms |
10512 KB |
Time limit exceeded |
| 7 |
Halted |
0 ms |
0 KB |
- |
