#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 11);
int n;
int a[100][30], s[20];
int dp[N], f[N];
int calc(int mask)
{
if(dp[mask] != -1) return dp[mask];
if(mask == 0) return 0;
if(__builtin_popcount(mask) == 1)
{
int i = 0;
for(i; i < n; i++)
if((mask >> i) & 1)break;
return s[i];
}
for(int j = 0;j < 26; j ++)
{
int x = 1e9 + 7;
for(int i = 0; i < n; i ++)
if((mask >> i) & 1)
x = min(a[i][j], x);
f[mask] += x;
}
int ans = 1e9 + 7;
for(int i = (mask - 1) & mask; i > 0; i = (i - 1) & mask)
ans = min(ans, calc(i) + calc(mask ^ i) - f[mask]);
return dp[mask] = ans;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
// freopen(".inp", "r", stdin);
// freopen(".out", "w", stdout);
memset(dp, -1, sizeof dp);
cin >> n;
for(int i = 0; i < n; i++)
{
string t;
cin >> t;
s[i] = t.size();
for(char c : t) a[i][c - 'a'] ++;
}
cout << calc((1 << n) - 1) + 1;
return 0;
}
Compilation message
vjestica.cpp: In function 'int calc(int)':
vjestica.cpp:17:7: warning: statement has no effect [-Wunused-value]
17 | for(i; i < n; i++)
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
600 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Runtime error |
1 ms |
600 KB |
Execution killed with signal 11 |
5 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
6 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
7 |
Runtime error |
1 ms |
856 KB |
Execution killed with signal 11 |
8 |
Runtime error |
1 ms |
860 KB |
Execution killed with signal 11 |
9 |
Runtime error |
1 ms |
852 KB |
Execution killed with signal 11 |
10 |
Runtime error |
1 ms |
860 KB |
Execution killed with signal 11 |