oj.uz

Submission #243169

# Submission time Handle Problem Language Result Execution time Memory
243169 2020-06-30T13:22:59 Z kartel Vještica (COCI16_vjestica) C++14
160 / 160
 91 ms 1528 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +4005
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int f[1 << 20], ec[1 << 20];
int cnt[20][30], mn[30];
string s;
int i, j, n, mask, sub;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    //in("input.txt");
    //out("output.txt");

    cin >> n;
    for (i = 0; i < n; i++)
    {
        cin >> s;

        for (j = 0; j < sz(s); j++) cnt[i][s[j] - 'a']++;
    }

    for (mask = 0; mask < (1 << n); mask++)
        {
            for (i = 0; i < 26; i++) mn[i] = 1e9;

            for (i = 0; i < n; i++)
                if (mask & (1 << i))
            {
                for (j = 0; j < 26; j++) mn[j] = min(mn[j], cnt[i][j]);
            }

            for (i = 0; i < 26; i++)
                ec[mask] += mn[i];
        }

    for (mask = 1; mask < (1 << n); mask++)
    {
        int kol = __builtin_popcount(mask);

        if (kol == 1) {f[mask] = ec[mask]; continue;}

        f[mask] = 1e9;

        for (sub = ((mask - 1) & mask); sub > 0; sub = (sub - 1) & mask)
            f[mask] = min(f[mask], f[mask ^ sub] + f[sub] - ec[mask]);
    }

    cout << f[(1 << n) - 1] + 1;
}

//
//00000
//00110
//00111
//00011
//00000

Subtask #1
160.0 / 160.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 85 ms 1016 KB Output is correct
5 Correct 87 ms 1016 KB Output is correct
6 Correct 87 ms 1144 KB Output is correct
7 Correct 89 ms 1400 KB Output is correct
8 Correct 90 ms 1364 KB Output is correct
9 Correct 91 ms 1400 KB Output is correct
10 Correct 91 ms 1528 KB Output is correct