Submission #59342

#	Time	Username	Problem	Language	Result	Execution time	Memory
59342		Benq	Vještica (COCI16_vjestica)	C++14	160 / 160	811 ms	3500 KiB

vjestica

#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;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n,dp[1<<16],num[1<<16];
array<int,26> cor[16];

void search(int ind, int nex, array<int,26> z) {
    if (nex == n) {
        int ans = 0;
        F0R(i,26) ans += z[i];
        num[ind] = ans;
        return;
    }
    search(ind,nex+1,z);
    F0R(i,26) z[i] = min(z[i],cor[nex][i]);
    search(ind^(1<<nex),nex+1,z);
}

void init() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    F0R(i,n) {
        string s; cin >> s;
        for (char c: s) cor[i][c-'a'] ++;
    }
    array<int,26> z; F0R(i,26) z[i] = MOD;
    search(0,0,z);
}

void search(int x, int nex, int cur) {
    if (nex == n) {
        if (cur == 0 || cur == x) return;
        dp[x] = min(dp[x],dp[cur]+dp[cur^x]);
        return;
    }
    search(x,nex+1,cur);
    if (x&(1<<nex)) search(x,nex+1,cur^(1<<nex));
}

int main() {
    init();
    FOR(i,1,1<<n) {
        if (__builtin_popcount(i) == 1) dp[i] = num[i];
        else {
            dp[i] = MOD;
            search(i,0,0);
            dp[i] -= num[i];
        }
    }
    cout << dp[(1<<n)-1]+1;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

• Subtask 1: 160 / 160