Beautiful Sequence CodeForces - 1264B（暴力）

An integer sequence is called beautiful if the difference between any two consecutive numbers is equal to 1. More formally, a sequence s1,s2,…,sn is beautiful if |si−si+1|=1 for all 1≤i≤n−1.

Trans has a numbers 0, b numbers 1, c numbers 2 and d numbers 3. He wants to construct a beautiful sequence using all of these a+b+c+d numbers.

However, it turns out to be a non-trivial task, and Trans was not able to do it. Could you please help Trans?

Input
The only input line contains four non-negative integers a, b, c and d (0<a+b+c+d≤105).

Output
If it is impossible to construct a beautiful sequence satisfying the above constraints, print “NO” (without quotes) in one line.

Otherwise, print “YES” (without quotes) in the first line. Then in the second line print a+b+c+d integers, separated by spaces — a beautiful sequence. There should be a numbers equal to 0, b numbers equal to 1, c numbers equal to 2 and d numbers equal to 3.

If there are multiple answers, you can print any of them.

Examples
Input
2 2 2 1
Output
YES
0 1 0 1 2 3 2
Input
1 2 3 4
Output
NO
Input
2 2 2 3
Output
NO
Note
In the first test, it is easy to see, that the sequence is beautiful because the difference between any two consecutive numbers is equal to 1. Also, there are exactly two numbers, equal to 0, 1, 2 and exactly one number, equal to 3.

It can be proved, that it is impossible to construct beautiful sequences in the second and third tests.
思路：分别考虑两个数，三个数，四个数不为零的情况，然后if-else语句去写就可以了。这是我目前为止写的最长的if-else。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;int a,b,c,d;int main()
{scanf("%d%d%d%d",&a,&b,&c,&d);if(a&&!b&&!c&&!d) {if(a==1) cout<<"YES"<<endl<<0<<endl;else cout<<"NO"<<endl;}else if(!a&&b&&!c&&!d){if(b==1) cout<<"YES"<<endl<<1<<endl;else cout<<"NO"<<endl;}else if(!a&&!b&&c&&!d){if(c==1) cout<<"YES"<<endl<<2<<endl;else cout<<"NO"<<endl;}else if(!a&&!b&&!c&&d){if(d==1) cout<<"YES"<<endl<<3<<endl;else cout<<"NO"<<endl;}else if(a&&b&&!c&&!d){if(abs(a-b)>1) cout<<"NO"<<endl;else {if(a>b){cout<<"YES"<<endl<<0<<" ";while(b--) cout<<"1 0 ";cout<<endl;}else if(b>a){cout<<"YES"<<endl<<1<<" ";while(a--) cout<<"0 1 ";cout<<endl;}else{cout<<"YES"<<endl;while(a--) cout<<"0 1 ";cout<<endl;}}}else if(a&&!b&&c&&!d) cout<<"NO"<<endl;else if(a&&!b&&!c&&d) cout<<"NO"<<endl;else if(!a&&b&&c&&!d){if(abs(b-c)>1) cout<<"NO"<<endl;else{if(b>c) {cout<<"YES"<<endl<<1<<" ";while(c--) cout<<"2 1 ";cout<<endl;}else if(c>b){cout<<"YES"<<endl<<2<<" ";while(b--) cout<<"1 2 ";cout<<endl;}else{cout<<"YES"<<endl;while(b--) cout<<"1 2 ";cout<<endl;}}}else if(!a&&b&&!c&&d) cout<<"NO"<<endl;else if(!a&&!b&&c&&d){if(abs(c-d)>1) cout<<"NO"<<endl;else{if(c>d){cout<<"YES"<<endl<<2<<" ";while(d--) cout<<"3 2 ";cout<<endl; }else if(d>c){cout<<"YES"<<endl<<3<<" ";while(c--) cout<<"2 3 ";cout<<endl;}else {cout<<"YES"<<endl;while(c--) cout<<"3 2 ";cout<<endl;}}}else if(a&&b&&c&&!d){if(abs(a+c-b)>1) cout<<"NO"<<endl;else{if(b>a+c){cout<<"YES"<<endl<<1<<" ";b--;while(b){if(a) cout<<"0 1 ",a--;else if(c)cout<<"2 1 ",c--;b--;}cout<<endl;}else if(b<a+c){cout<<"YES"<<endl<<0<<" ";a--;while(b){if(a) cout<<"1 0 ",a--;else if(c)cout<<"1 2 ",c--;b--;}cout<<endl;}else{cout<<"YES"<<endl;while(b){if(a) cout<<"0 1 ",a--;else if(c)cout<<"2 1 ",c--;b--;}cout<<endl;}}}else if(a&&b&&!c&&d) cout<<"NO"<<endl;else if(!a&&b&&c&&d){if(abs(b+d-c)>1) cout<<"NO"<<endl;else{if(c>b+d){cout<<"YES"<<endl<<2<<endl;c--;while(c){if(b) cout<<"1 2 ",b--;else if(d)cout<<"3 2 ",d--;c--;}cout<<endl;}else if(c<b+d){cout<<"YES"<<endl<<1<<endl;b--;while(c){if(b) cout<<"2 1 ",b--;else if(d)cout<<"2 3 ",d--;c--;}cout<<endl;}else{cout<<"YES"<<endl;while(c){if(b) cout<<"1 2 ",b--;else if(d)cout<<"3 2 ",d--;c--;}cout<<endl;}}}else {if(a>b||d>c||abs(b+d-a-c)>1) cout<<"NO"<<endl;else{vector<int> p;if(a+c>=b+d) {for(int i=0;i<a+c;i++){if(i<a) p.push_back(0);else p.push_back(2);}cout<<"YES"<<endl;for(int i=0;i<p.size();i++){cout<<p[i]<<" ";if(b) cout<<1<<" ",b--;else if(d) cout<<3<<" ",d--;}cout<<endl;}else {for(int i=0;i<b+d;i++){if(i<b) p.push_back(1);else p.push_back(3);}cout<<"YES"<<endl;for(int i=0;i<p.size();i++){cout<<p[i]<<" ";if(a) cout<<"0 ",a--;else if(c) cout<<"2 ",c--;}cout<<endl;}}}return 0;
}

努力加油a啊，(^o)/~

Beautiful Sequence CodeForces - 1264B（暴力）相关推荐

枚举 ---- B. Power Sequence[Codeforces Round #666 (Div. 2)][暴力]
B. Power Sequence 有 n 个数,现在要求将这个数列变成一个等比数列的形式你可以将这 n 个数随意排列或者将任意一个数加一或者减一操作,每次此类操作都要花费 1,问最少花费是多少 ...
Codeforces Round #181 (Div. 2) C. Beautiful Numbers 排列组合暴力
C. Beautiful Numbers 题目连接: http://www.codeforces.com/contest/300/problem/C Description Vitaly is a v ...
CodeForces - 1265D Beautiful Sequence(贪心+构造+思维)
题目链接:点击查看题目大意:给出a个0,b个1,c个2,d个3,要求构造一种序列,使得数列两两之间绝对值之差等于1,若不能构造输出NO 题目分析:首先我们需要稍微讨论一下特殊情况,那就是对于两端的数 ...
(CodeForces 548B 暴力) Mike and Fun
http://codeforces.com/problemset/problem/548/B Mike and some bears are playing a game just for fun. ...
Vicious Keyboard CodeForces - 801A (暴力+模拟)
题目链接题意: 给定一个字符串,最多更改一个字符,问最多可以有多少个"VK"子串? 思路: 由于数据量很小,不妨尝试暴力写.首先算出不更改任何字符的情况下有多个VK字串,然后尝试 ...
Long Beautiful Integer CodeForces - 1268A（贪心构造）
You are given an integer x of n digits a1,a2,-,an, which make up its decimal notation in order from ...
CodeForces 1138B暴力+剪枝
[题目链接]Circus [题目分析]理解题意以后发现并没有什么思路,没有什么算法能用,这个时候就应该想到计算机解题的本质--暴力求解.相应的就要想到剪枝的条件,肯定不能盲目的暴力求解. 总共有四种人 ...
codeforces 574B 暴力+复杂度分析
题目: B. Bear and Three Musketeers time limit per test 2 seconds memory limit per test 256 megabytes i ...
Codeforces 769B 暴力
传送门:题目题意: 一开始,只要第一个学生知道消息,第一个学生想把消息传给所有人,只能点对点传输,而且每个人只能发送有限条消息,求方案,如果没法达成,输出-1 题解: 如果第一个学生可传达消息数不为 ...

Beautiful Sequence CodeForces - 1264B（暴力）

Beautiful Sequence CodeForces - 1264B（暴力）相关推荐

最新文章

热门文章