#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
int lcp (string& s, string& t) {
map<char,int> myMap1, myMap2;
for (char c: s) myMap1[c]++;
for (char c: t) myMap2[c]++;
int ans = 0;
for (char c = 'a'; c <= 'z'; c++) ans += min(myMap1[c], myMap2[c]);
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<string> vec(n); for (int i = 0; i < n; i++) cin >> vec[i];
int cnt[n][26];
for (int i = 0; i < n; i++) for (int j = 0; j < 26; j++) cnt[i][j] = 0;
sort(vec.begin(), vec.end());
int ans = 0;
for (int i = 0; i < n; i++) {
ans += vec[i].size();
for (int j = 0; j < vec[i].size(); j++) {
cnt[i][vec[i][j] - 'a']++;
}
}
int dp[(1 << n)];
int mn[(1 << n)][26];
for (int i = 0; i < (1 << n); i++) for (int j = 0; j < 26; j++) mn[i][j] = 0;
for (int i = 0; i < (1 << n); i++) {
for (int j = 0; j < 26; j++) {
mn[i][j] = INT_MAX;
for (int k = 0; k < n; k++) {
if (!(i & (1 << k))) continue;
mn[i][j] = min(mn[i ^ (1 << k)][j], cnt[k][j]);
}
}
}
int myMin[(1 << n)];
for (int i = 0; i < (1 << n); i++) {
myMin[i] = 0;
for (int j = 0; j < 26; j++) {
myMin[i] += mn[i][j];
}
}
for (int i = 0; i < (1 << n); i++) for (int j = 0; j < n; j++) dp[i] = 0;
for (int i = 0; i < n; i++) dp[(1 << i)] = 0;
for (int msk = 1; msk < (1 << n); msk++) {
if (__builtin_popcount(msk) == 1) continue;
dp[msk] = 0;
for (int sub_msk = msk; sub_msk; sub_msk = (sub_msk - 1) & msk) {
dp[msk] = max(dp[msk], dp[sub_msk] + dp[msk ^ sub_msk] + myMin[msk]);
}
}
cout << ans - dp[(1 << n) - 1];
}
Compilation message
vjestica.cpp:15: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
15 | #pragma GCC optimization ("O3")
|
vjestica.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
16 | #pragma GCC optimization ("unroll-loops")
|
vjestica.cpp: In function 'int main()':
vjestica.cpp:38:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
38 | for (int j = 0; j < vec[i].size(); j++) {
| ~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Incorrect |
102 ms |
7492 KB |
Output isn't correct |
| 5 |
Incorrect |
90 ms |
7452 KB |
Output isn't correct |
| 6 |
Incorrect |
93 ms |
7804 KB |
Output isn't correct |
| 7 |
Incorrect |
94 ms |
7968 KB |
Output isn't correct |
| 8 |
Incorrect |
91 ms |
7916 KB |
Output isn't correct |
| 9 |
Incorrect |
102 ms |
8016 KB |
Output isn't correct |
| 10 |
Incorrect |
97 ms |
8024 KB |
Output isn't correct |
