oj.uz

답안 #88131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
88131 2018-12-03T22:33:41 Z jasony123123 Vještica (COCI16_vjestica) C++11
160 / 160
 103 ms 3412 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const int INF = 1 << 20;
void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/*************************************************************************/

int N;
int cnt[16][26];
int dp[1 << 16];

int calcpref(int mask) {
	int mincnt[26];
	fill(mincnt, mincnt + 26, INF);
	FOR(b, 0, N)
		if (mask&(1 << b))
			FOR(c, 0, 26) minn(mincnt[c], cnt[b][c]);
	int ret = 0;
	FOR(c, 0, 26) ret += mincnt[c];
	return ret;
}

void input() {
	cin >> N;
	FOR(i, 0, N) {
		string s;
		cin >> s;
		for (char c : s)
			cnt[i][c - 'a']++;
	}
}

int main() {
	io();
	input();
	FOR(mask, 1, 1 << N) {
		int maxpref = calcpref(mask) + 1;
		if ((mask&-mask) == mask) {
			dp[mask] = maxpref;
			continue;
		}
		dp[mask] = INF;
		for (int sub = (mask - 1) & mask; sub > 0; sub = (sub - 1) & mask)
			minn(dp[mask], dp[sub] + dp[mask^sub] - maxpref);
	}
	cout << dp[(1 << N) - 1] << "\n";
	return 0;
}
/*
...
*/

Subtask #1
160.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 756 KB Output is correct
3 Correct 2 ms 924 KB Output is correct
4 Correct 103 ms 1100 KB Output is correct
5 Correct 100 ms 1368 KB Output is correct
6 Correct 101 ms 1732 KB Output is correct
7 Correct 102 ms 2076 KB Output is correct
8 Correct 103 ms 2424 KB Output is correct
9 Correct 102 ms 2900 KB Output is correct
10 Correct 101 ms 3412 KB Output is correct