oj.uz

답안 #696238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
696238 2023-02-06T04:03:01 Z bachhoangxuan Vještica (COCI16_vjestica) C++17
160 / 160
 87 ms 1056 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e9;
const int mod=998244353;
const int mod2=1e9+7;
const int maxn=35;
const int maxq=500005;
const int maxl=20;
const int maxa=1000005;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
int n,num[maxn][maxn],dp[(1<<16)+5],Min[maxn];
void solve(){
    cin >> n;
    for(int i=0;i<n;i++){
        string s;cin >> s;
        for(char c:s) num[i][c-'a']++;
        dp[(1<<i)]=(int)s.length();
    }
    for(int mask=1;mask<(1<<n);mask++){
        if(__builtin_popcount(mask)==1) continue;
        for(int i=0;i<26;i++) Min[i]=inf;
        for(int i=0;i<n;i++){
            if(mask&(1<<i)){
                for(int j=0;j<26;j++) Min[j]=min(Min[j],num[i][j]);
            }
        }
        dp[mask]=inf;
        for(int i=mask;i;i=(i-1)&mask){
            if(i==mask) continue;
            dp[mask]=min(dp[mask],dp[i]+dp[mask^i]);
        }
        for(int j=0;j<26;j++) dp[mask]-=Min[j];
    }
    cout << dp[(1<<n)-1]+1 << '\n';
}
signed main(){
    //freopen("TRIE.INP","r",stdin);
    //freopen("TRIE.OUT","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
160.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 86 ms 508 KB Output is correct
5 Correct 83 ms 688 KB Output is correct
6 Correct 84 ms 884 KB Output is correct
7 Correct 83 ms 1056 KB Output is correct
8 Correct 81 ms 1056 KB Output is correct
9 Correct 83 ms 972 KB Output is correct
10 Correct 87 ms 1044 KB Output is correct