【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) A】Palindrome Dance

【链接】我是链接,点我呀:)
【题意】

在这里输入题意

【题解】

i从1..n/2循环一波。
保证a[i]和a[n-i+1]就好。
如果都是2的话填上min(a,b)*2就好
其他情况跟随非2的。

【代码】

#include <bits/stdc++.h>
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define lson l,mid,rt<<1
#define ri(x) scanf("%d",&x)
#define rl(x) scanf("%lld",&x)
#define rs(x) scanf("%s",x)
#define rson mid+1,r,rt<<1|1
using namespace std;const double pi = acos(-1);
const int dx[4] = {0,0,1,-1};
const int dy[4] = {1,-1,0,0};const int N = 20;int n,a,b,cost[2];
int c[N+10];int main(){#ifdef LOCAL_DEFINEfreopen("rush_in.txt", "r", stdin);#endifscanf("%d%d%d",&n,&a,&b);cost[0] = a,cost[1] = b;rep1(i,1,n) scanf("%d",&c[i]);int ans = 0;rep1(i,1,n/2){int l = i,r = n-i+1;if (c[l]==2 && c[r]==2){ans+=min(a,b)*2;}else{if (c[l]==2){ans+=cost[c[r]];}else if (c[r]==2){ans+=cost[c[l]];}else if (c[l]!=c[r]){cout<<-1<<endl;return 0;}}}if (n&1){if (c[n/2+1]==2){ans+=min(a,b);}}printf("%d\n",ans);return 0;
}

转载于:https://www.cnblogs.com/AWCXV/p/9597251.html

【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) A】Palindrome Dance相关推荐

【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) B】Shashlik Cooking
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 翻转一次最多影响2k+1个地方. 如果n<=k+1 那么放在1的位置就ok.因为能覆盖1..k+1 如果n<=2k+1 ...
Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)
A. Fraction 题目链接:http://codeforces.com/contest/854/problem/A 题目意思:给出一个数n,求两个数a+b=n,且a/b不可约分,如果存在多组满足 ...
【Codeforces Round #565 (Div. 3) A B C D E F】解题报告
Codeforces 565 失踪人口回归 cf 565 A 题意你可以把一个偶数变成 n/2 , 可以把一个3的倍数变成 n2/3, 可以把一个5的倍数变成 n4/5 问你最少通过多少步可以变成1 ...
Codeforces Round #507 (Div. 1) D. You Are Given a Tree 根号分治 + dp
传送门题意: 有一颗nnn个节点的树,其中一个简单路径集合被称为kkk合法当且仅当: 树的每个节点至多属于一条路径,且每条路径恰好包含kkk个点. 对于k∈[1,n]k\in [1,n]k∈[1,n ...
【Codeforces Round #767 (Div. 2)】 C. Meximum Array 题解
[Codeforces Round #767 (Div. 2) ]C. Meximum Array 题解 1629C: Meximum Array 题解 [Codeforces Round #767 ...
Codeforces Round #740 (Div. 2, based on VK Cup 2021 - Final (Engine))
Codeforces Round #740 (Div. 2, based on VK Cup 2021 - Final (Engine)) 题号题目知识点 A Simply Strange Sor ...
Codeforces Round #740 (Div. 2, based on VK Cup 2021 - Final (Engine)) A-F全题解
Codeforces Round #740 (Div. 2, based on VK Cup 2021 - Final (Engine)) 文章目录 A. Simply Strange Sort B. ...
C. Tyler and Strings（组合数学,树状数组维护前缀和）(Codeforces Round #775 (Div. 1, based on Moscow Open Olympiad i)
对我来说比较困难的一题了,尝试着自己写了一下,调不出来遂放弃. Codeforces Round #775 (Div. 1, based on Moscow Open Olympiad in Info ...
Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics）简训
Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics)简训导语涉及的知识点题目 A Game B ...

【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) A】Palindrome Dance

【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) A】Palindrome Dance相关推荐

最新文章

热门文章