# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168370 | rzbt | Vještica (COCI16_vjestica) | C++14 | 114 ms | 800 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 17
typedef long long ll;
using namespace std;
int n;
char s[1000006];
int svi[MAXN][28];
int dp[(1<<MAXN)+5];
vector<int> tren;
int main()
{
scanf("%d", &n);
for(int i=0;i<n;i++){
scanf("%s",s);
int len=strlen(s);
for(int j=0;j<len;j++)
svi[i][s[j]-'a']++;
dp[1<<i]=len;
}
for(int i=1;i<(1<<n);i++){
if(__builtin_popcount(i)==1)continue;
dp[i]=INT_MAX;
tren.clear();
int zajed=0,kolko=0;
for(int j=0;j<n;j++){
if((1<<j)&i)tren.pb(j);
}
kolko=(1<<tren.size())-1;
for(int j=0;j<26;j++){
int kek=22;
for(auto x:tren)kek=min(kek,svi[x][j]);
zajed+=kek;
}
for(int j = (i - 1) & i; j > 0; j = (j - 1) & i){
//printf(" %d %d %d %d\n",prvi,drugi,j,i);
dp[i]=min(dp[i],dp[j]+dp[i^j]-zajed);
}
}
printf("%d",1+dp[(1<<n)-1]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |