제출 #1017618

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1017618		n3rm1n	휴가 (IOI14_holiday)	C++17	0 / 100	30 ms	65536 KiB

holiday

#include <bits/stdc++.h>
#include "holiday.h"

using namespace std;
const int MAXN = 21, MAXMASK = (1 << 21) + 10;
int dp[MAXN][MAXMASK];
long long sum[MAXMASK];
long long int findMaxAttraction(int n, int start, int d, int attraction[])
{
    //cout << MAXN << " " << MAXMASK << endl;
    int inf = 1e9;
    for (int i = 0; i < n; ++ i)
    {
        for (int mask = 0; mask <= (1 << (n-1)); ++ mask)
        {
            dp[i][mask] = inf;
        }
    }
    for (int mask = 0; mask <= (1 << (n-1)); ++ mask)
    {
        for (int v = 0; v < n; ++ v)
        {
            if(((1 << v) & mask))sum[mask] += 1LL * attraction[v];
        }
    }
    dp[start][0] = 0;
    long long ans = 0;
    for (int mask = 0; mask <= (1 << (n-1)); ++ mask)
    {
        for (int v = 0; v < n; ++ v)
        {
            if(dp[v][mask] == inf)continue;
            for (int add = 0; add < n; ++ add)
                if(!(mask & (1 << add)))dp[add][(mask | (1 << add))] = min(dp[add][(mask | (1 << add))], dp[v][mask] + abs(v - add) + 1);
            if(dp[v][mask] <= d)ans = max(ans, sum[mask]);
        }
    }
    return ans;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53