codeforces Round #259(div2) D解题报告

D. Little Pony and Harmony Chest

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Princess Twilight went to Celestia and Luna‘s old castle to research the chest from the Elements of Harmony.

A sequence of positive integers bi is
harmony if and only if for every two elements of the sequence their greatest common divisor equals 1. According to an ancient book, the key of the chest is a harmony sequence bi which
minimizes the following expression:

You are given sequence ai,
help Princess Twilight to find the key.

Input

The first line contains an integer n (1?≤?n?≤?100)
— the number of elements of the sequences a and b.
The next line contains n integersa1,?a2,?...,?an (1?≤?ai?≤?30).

Output

Output the key — sequence bi that
minimizes the sum described above. If there are multiple optimal sequences, you can output any of them.

Sample test(s)

input

5
1 1 1 1 1

output

1 1 1 1 1 

input

5
1 6 4 2 8

output

1 5 3 1 8 

题目大意:

给出N个数ai,求出另一个序列bi,要求sum |ai-bi|,最短,且所有的bi都互质。

解法:

这里题目给了几个很显眼的条件,ai限制在了1~30之间,由于可以bi无限选1这个数,那么|ai-bi| 最大就是29了,意味着bi < 59的。

要求所有的bi互质,可以化为所有的bi分解出来的质因数均不相同,bi < 59,有16个质数。这里我们很容易联想到状态压缩DP了。

用s表示当前阶段用了哪些质因数的状态,例如 s = 3 = 11 代表目前状态下使用了第一个和第二个质因数。

很快我们就可以写出状态转移方程:

f[i][s] = min(f[i-1][s^c[k]] + abs(a[i] - k))。    其中c[k]表示数字k使用了哪些质因数。

代码:

#include <cstdio>
#include <cmath>
#include <cstring>
#define M_max 60
#define N_max 123
#define inf 0x3f3f3f3f

using namespace std;

int p[N_max], c[M_max], a[N_max];
int f[N_max][1<<16], pre[N_max][1<<16][2];
int n, cnt, minnum, minpos;

void prime() {
	for (int i = 2; i <= M_max; i++) {
		bool flag = false;

		for (int j = 2; j <= sqrt(i); j++)
			if (i%j == 0) {
				flag = true;
				break;
			}

		if (!flag)  p[++cnt] = i;
	}

	for (int i = 1; i <= M_max; i++)
		for (int j = 1; j <= cnt; j++)
			if (i%p[j] == 0)
				c[i] |= 1 << (j-1);
}

void init() {
	prime();
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)  scanf("%d", &a[i]);
}

void print(int x, int pos) {
	if (x == 0)  return;
	print(x-1, pre[x][pos][0]);
	printf("%d ", pre[x][pos][1]);
}

void solve() {
	memset(f, inf, sizeof(f));
	memset(f[0], 0, sizeof(f[0]));
	minnum = inf;

	for (int i = 1; i <= n; i++)
		for (int s = 0; s < (1<<16); s++)
			for (int k = 1; k <= M_max; k++)
				if ((s&c[k]) == c[k]) {
					int tmp = f[i-1][s^c[k]] + abs(a[i]-k);

					if (tmp < f[i][s]) {
						f[i][s] = tmp;
						pre[i][s][0] = s^c[k];
						pre[i][s][1] = k;
					}
				}
	for (int s = 0; s < (1<<16); s++)
		if (f[n][s] < minnum) {
			minnum = f[n][s];
			minpos = s;
		}

	print(n, minpos);
}

int main() {
	init();
	solve();
}
时间: 2024-10-18 05:43:40

codeforces Round #259(div2) D解题报告的相关文章

codeforces Round #259(div2) B解题报告

B. Little Pony and Sort by Shift time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output One day, Twilight Sparkle is interested in how to sort a sequence of integers a1,?a2,?...,?an in non-decreas

codeforces Round #259(div2) C解题报告

C. Little Pony and Expected Maximum time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept

codeforces Round #259(div2) E解题报告

E. Little Pony and Summer Sun Celebration time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Twilight Sparkle learnt that the evil Nightmare Moon would return during the upcoming Summer Sun Ce

Codeforces Round #259 (Div. 2) 解题报告

终于重上DIV1了.... A:在正方形中输出一个菱形 解题代码: 1 // File Name: a.cpp 2 // Author: darkdream 3 // Created Time: 2014年08月01日 星期五 23时27分55秒 4 5 #include<vector> 6 #include<set> 7 #include<deque> 8 #include<stack> 9 #include<bitset> 10 #inclu

codeforces Round #260(div2) D解题报告

D. A Lot of Games time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Andrew, Fedor and Alex are inventive guys. Now they invent the game with strings for two players. Given a group of n non-em

codeforces Round #261(div2) D解题报告

D. Pashmak and Parmida's problem time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Parmida is a clever girl and she wants to participate in Olympiads this year. Of course she wants her partn

codeforces Round #261(div2) A解题报告

C. Pashmak and Buses time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Recently Pashmak has been employed in a transportation company. The company has k buses and has a contract with a school

codeforces Round #275(div2) D解题报告

D. Interesting Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output We'll call an array of n non-negative integers a[1],?a[2],?...,?a[n] interesting, if it meets m constraints. The i-th of

codeforces Round #258(div2) C解题报告

C. Predict Outcome of the Game time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There are n games in a football tournament. Three teams are participating in it. Currently k games had alread