Submission #47687

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
47687	2018-05-06 09:46:45	tieunhi	Vještica (COCI16_vjestica)	C++14	160 / 160	369 ms	3140 KiB

vjestica

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define N 16
using namespace std;
int n, a[N][26], sz[N];
int dp[(1 << N)];
int solve(int mask)
{
    if (dp[mask] != -1)
        return dp[mask];
    if (mask == 0)
        return (dp[mask] = 0);
    if (__builtin_popcount(mask) == 1)
    {
        for (int i = 0; i < n; i++)
            if ((mask >> i) & 1)
                return (dp[mask] = sz[i]);
    }
    int common = 0;
    for (int j = 0; j < 26; j++)
    {
        int x = 1e9;
        for (int i = 0; i < n; i++)
            if ((mask >> i) & 1)
                x = min(x, a[i][j]);
        common += x;
    }
    dp[mask] = 1e9;
    for (int i = (mask-1)&mask; i; i = (i-1)&mask)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 160 / 160