Palindrome Dance

Palindrome Dance
A group of n dancers rehearses a performance for the closing ceremony. The dancers are arranged in a row, they’ve studied their dancing moves and can’t change positions. For some of them, a white dancing suit is already bought, for some of them — a black one, and for the rest the suit will be bought in the future.

On the day when the suits were to be bought, the director was told that the participants of the olympiad will be happy if the colors of the suits on the scene will form a palindrome. A palindrome is a sequence that is the same when read from left to right and when read from right to left. The director liked the idea, and she wants to buy suits so that the color of the leftmost dancer’s suit is the same as the color of the rightmost dancer’s suit, the 2nd left is the same as 2nd right, and so on.

The director knows how many burls it costs to buy a white suit, and how many burls to buy a black suit. You need to find out whether it is possible to buy suits to form a palindrome, and if it’s possible, what’s the minimal cost of doing so. Remember that dancers can not change positions, and due to bureaucratic reasons it is not allowed to buy new suits for the dancers who already have suits, even if it reduces the overall spending.

Input
The first line contains three integers n, a, and b (1≤n≤20, 1≤a,b≤100) — the number of dancers, the cost of a white suit, and the cost of a black suit.

The next line contains n numbers ci, i-th of which denotes the color of the suit of the i-th dancer. Number 0 denotes the white color, 1 — the black color, and 2 denotes that a suit for this dancer is still to be bought.

Output
If it is not possible to form a palindrome without swapping dancers and buying new suits for those who have one, then output -1. Otherwise, output the minimal price to get the desired visual effect.

首尾对应比较根据不同情况确认计入价格
特别注意n的奇偶性，i=n/2时，两边为2，应避免重复

Input
5 100 1
0 1 2 1 2
Output
101

Input
3 10 12
1 2 0
Output
-1

Input
3 12 1
0 1 0
Output
0

#include<iostream>
using namespace std;
int main()
{
	int n, w1, w2, p[25], i,min,sum=0;
	cin >> n >> w1 >> w2;
	min = (w1 < w2) ? w1 : w2;
	for (i = 0; i < n; i++)
	{
		cin >> p[i];
	}
	for (i = 0; i <= n / 2; i++)
	{
		if ((p[i] != p[n - i - 1]) && (p[i] != 2) && (p[n - i - 1] != 2)) break;//不能构成回文
		if ((p[i] == p[n - i - 1]) && (p[i] != 2) && (p[n - i - 1] != 2)) continue;//跳过非2且相等的项
		if (p[i] != 2 && p[n - i - 1] == 2) {                              //p【n-i-1】=2（仅1个）
			p[n - i - 1] = p[i];                                           
			if (p[i] == 1) sum += w2;
			else sum += w1;
		}
		else if (p[i] == 2 && p[n - i - 1] != 2) {                         //p【i】=2（仅1个）
			p[i] = p[n - i - 1];         
			if (p[i] == 1) sum += w2;
			else sum += w1;
		}
		else  {                                                           //两个都是2
			p[i] = p[n - i - 1] = 1;
			if ((n % 2 == 0) || (n % 2 != 0 && i != n / 2))               //n为奇数和偶数要进行区分
				sum += 2 * min;
			else
				sum += min;
		}	
	}
	if (i == n / 2 + 1) cout << sum;
	else cout << -1;
}