oj.uz

답안 #921511

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921511 2024-02-04T03:52:01 Z Whisper Vještica (COCI16_vjestica) C++17
160 / 160
 169 ms 1768 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 16;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

int N;
int cnt[MAX][26];
int dp[MASK(16)];

int cost(int msk){
    //the maximum prefix of all string in mask
    vector<int> f(26, INF);
    int ans = 0;
    REP(i, N) if(BIT(msk, i)){
        for (int c = 0; c < 26; ++c){
            minimize(f[c], cnt[i][c]);
        }
    }
    REP(c, 26) ans += f[c];
    return ans;
}

//dp(msk) is the minimum nodes we can reach if we build the trie by the string which is in mask
int f(int msk){
    int &res = dp[msk];
    if(~res) return res;

    int max_prefix = cost(msk);
    if (__builtin_popcount(msk) == 1) return max_prefix;
    res = INF;
    for (int i = (msk - 1) & msk; i > 0; i = (i - 1) & msk){
        minimize(res, f(i) + f(msk ^ i) - max_prefix);
    }
    return res;
}
void Whisper(){
    cin >> N;
    REP(i, N){
        string t; cin >> t;
        REP(c, sz(t)) cnt[i][t[c] - 'a']++;
    }
    memset(dp, -1, sizeof dp);
    cout << f(MASK(N) - 1) + 1;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
160.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 145 ms 860 KB Output is correct
5 Correct 169 ms 1064 KB Output is correct
6 Correct 147 ms 1292 KB Output is correct
7 Correct 142 ms 1368 KB Output is correct
8 Correct 155 ms 1768 KB Output is correct
9 Correct 143 ms 1360 KB Output is correct
10 Correct 146 ms 1368 KB Output is correct