oj.uz

Submission #712399

# Submission time Handle Problem Language Result Execution time Memory
712399 2023-03-18T18:12:45 Z Ahmed57 Vještica (COCI16_vjestica) C++14
0 / 160
 21 ms 1576 KB 
#include<bits/stdc++.h>
using namespace std;
long long dp[(1<<16)];
long long c[16][26] = {0};
long long com[(1<<16)];
long long solve(int mask){
    if(dp[mask]!=-1)return dp[mask];
    if(__builtin_popcount(mask)==1)return 0;
    long long ans = 1e18;
    for(long long s = mask&(mask-1);s;s=s&(s-1)){
        ans = min(ans,solve(s)+solve(mask^s)+((-2)*com[mask]+com[s]+com[(mask^s)]));
    }
    return dp[mask] = ans;
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;cin>>n;
    for(int i = 0;i<n;i++){
        string s;cin>>s;
        for(auto j:s){
            c[i][j-'a']++;
        }
    }
    memset(dp,-1,sizeof dp);
    for(int mask = 0;mask<(1<<n);mask++){
        long long ch[26] = {0};
        for(int j = 0;j<26;j++)ch[j] = 1e9;
        for(int j = 0;j<n;j++){
            if(mask&(1<<j)){
            for(int k = 0;k<26;k++)ch[k]= min(ch[k],c[j][k]);
            }
        }
        for(int j = 0;j<26;j++){
            com[mask]+=ch[j];
        }
    }
    cout<<solve((1<<n)-1)+1+com[(1<<n)-1]<<endl;
}

Subtask #1
0 / 160.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 724 KB Output isn't correct
2 Incorrect 1 ms 724 KB Output isn't correct
3 Incorrect 1 ms 724 KB Output isn't correct
4 Incorrect 17 ms 1236 KB Output isn't correct
5 Incorrect 19 ms 1364 KB Output isn't correct
6 Incorrect 21 ms 1428 KB Output isn't correct
7 Incorrect 20 ms 1488 KB Output isn't correct
8 Incorrect 21 ms 1576 KB Output isn't correct
9 Incorrect 20 ms 1484 KB Output isn't correct
10 Incorrect 20 ms 1484 KB Output isn't correct