제출 #241198

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241198		crossing0ver	Roller Coaster Railroad (IOI16_railroad)	C++17	0 / 100	300 ms	276728 KiB

railroad

#include<bits/stdc++.h>
/*#pragma GCC optimize("03")
#pragma GCC target("avx,avx2")
#pragma GCC optimeze("unroll-loops") */
#define inf 10000000000000000  
#define ll long long 
#include "railroad.h"
using namespace std;
int n;
ll dp[16][16][1 << 16],cost[16][16];

ll plan_roller_coaster(std::vector<int> a, std::vector<int> b) {
	n = a.size();
	for (int i = 0; i < n; i++) {
	for (int j = 0;j < n; j++) {
		if (b[i] > a[j]) cost[i][j] = b[i] - a[j];
	fill(dp[i][j],dp[i][j] + (1 << n),inf);
	dp[i][i][1 << i] = 0;
	}
	}
	for (int mask = 1; mask < (1 << n); mask++) 
	for (int i = 0; i < n; i++) {
		if ((1 << i) & mask) {
			for (int j = 0; j < n; j++) {
				if ( (1 << j) & mask && j != i) {
					for (int e = 0; e < n; e++) {
						if (e != j && dp[i][j][mask] > dp[i][e][mask^(1<<j)] + cost[e][i])
						dp[i][j][mask] = dp[i][e][mask^(1<<j)] + cost[e][i];
					}
				}
			}
		}
	}
	ll ans = inf;
	for (int i = 0; i < n; i++)
	for (int j = 0; j < n; j++)
		ans = min(ans,dp[i][j][(1<<n)-1]);
	
    return ans;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36