oj.uz

답안 #365265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365265 2021-02-11T10:49:40 Z FatihSolak Vještica (COCI16_vjestica) C++17
160 / 160
 122 ms 1132 KB 
#include <bits/stdc++.h>
#define N 16
using namespace std;
int n;
int dp[(1<<N)];
int arr[N][26];
int main(){
	cin >> n;
	for(int i=0;i<n;i++){
		string s;
		cin >> s;
		for(auto u:s){
			arr[i][u-'a']++;
		}
	}
	for(int i=1;i<(1<<n);i++){
		dp[i] = 1e9;	
	}
	dp[0] = 0;
	for(int i=0;i<n;i++){
	    dp[1<<i] = 0;
		for(int j=0;j<26;j++)dp[1<<i]+=arr[i][j];
	}
	for(int i=1;i<(1<<n);i++){
		for(int m = i;m;m=(m-1)&i){
			dp[i] = min(dp[i],dp[m]+dp[i-m]);
		}
		for(int j=0;j<26;j++){
			int mini = 1e9;
			int cnt =0;
			for(int c = 0;c<n;c++){
				if((1<<c)&i){
					mini = min(mini,arr[c][j]);
					cnt++;
				}
			}
			if(cnt != 1)
				dp[i] -= mini;
		}
	}
	cout <<dp[(1<<n) - 1] + 1;
}

Subtask #1
160.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 108 ms 620 KB Output is correct
5 Correct 110 ms 748 KB Output is correct
6 Correct 119 ms 876 KB Output is correct
7 Correct 121 ms 1132 KB Output is correct
8 Correct 119 ms 1132 KB Output is correct
9 Correct 118 ms 1132 KB Output is correct
10 Correct 122 ms 1132 KB Output is correct