oj.uz

답안 #107631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107631 2019-04-25T10:43:22 Z Milki Vještica (COCI16_vjestica) C++14
160 / 160
 349 ms 2936 KB 
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define sz(x) ((int) x.size())
#define pb(x) push_back(x)
#define TRACE(x) cerr << #x << " = " << x << endl

typedef long long ll;
typedef pair<int, int> point;

const int MAXN = 17, MAX = 1 << 17, ABC = 27, inf = 1e9;

int n;
int dp[MAX], let[MAXN][ABC];

int get(int mask){
  int tmp[26];
  REP(i, 26)
    tmp[i] = inf;
  REP(i, n){
    if( (mask & (1 << i)) == 0) continue;
    REP(j, 26)
      tmp[j] = min(tmp[j], let[i][j]);
  }
  int ret = 0;
  REP(i, 26)
    ret += tmp[i];
  return ret;
}

int rek(int mask){
  if(dp[mask]) return dp[mask];
  if(__builtin_popcount(mask) == 1) return dp[mask] = get(mask);

  int ret = inf, sub = get(mask);
  for (int newMask = mask - 1; newMask > 0; newMask = (newMask - 1) & mask)
    ret = min(ret, rek(newMask) + rek(newMask ^ mask) - sub);
  return dp[mask] = ret;
}

int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);

  cin >> n;
  REP(i, n){
    string s; cin >> s;
    REP(j, sz(s))
      let[i][s[j] - 'a'] ++;
  }
  cout << rek((1 << n) - 1) + 1;
}

Subtask #1
160.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 300 ms 2708 KB Output is correct
5 Correct 349 ms 2832 KB Output is correct
6 Correct 324 ms 2680 KB Output is correct
7 Correct 298 ms 2804 KB Output is correct
8 Correct 322 ms 2936 KB Output is correct
9 Correct 287 ms 2872 KB Output is correct
10 Correct 332 ms 2832 KB Output is correct