【CodeForces】297C - Splitting the Uniqueness(构造)
来源:互联网 发布:智百威软件800 编辑:程序博客网 时间:2024/06/10 13:06
题目链接:点击打开题目
Polar bears like unique arrays — that is, arrays without repeated elements.
You have got a unique array s with length n containing non-negative integers. Since you are good friends with Alice and Bob, you decide to split the array in two. Precisely, you need to construct two arrays a and b that are also of length n, with the following conditions for all i(1 ≤ i ≤ n):
- ai, bi are non-negative integers;
- si = ai + bi .
Ideally, a and b should also be unique arrays. However, life in the Arctic is hard and this is not always possible. Fortunately, Alice and Bob are still happy if their arrays are almost unique. We define an array of length n to be almost unique, if and only if it can be turned into a unique array by removing no more than entries.
For example, the array [1, 2, 1, 3, 2] is almost unique because after removing the first two entries, it becomes [1, 3, 2]. The array[1, 2, 1, 3, 1, 2] is not almost unique because we need to remove at least 3 entries to turn it into a unique array.
So, your task is to split the given unique array s into two almost unique arrays a and b.
The first line of the input contains integer n (1 ≤ n ≤ 105).
The second line contains n distinct integers s1, s2, ... sn (0 ≤ si ≤ 109).
If it is possible to make Alice and Bob happy (if you can split the given array), print "YES" (without quotes) in the first line. In the second line, print the array a. In the third line, print the array b. There may be more than one solution. Any of them will be accepted.
If it is impossible to split s into almost unique arrays a and b, print "NO" (without quotes) in the first line.
612 5 8 3 11 9
YES6 2 6 0 2 46 3 2 3 9 5
In the sample, we can remove the first two entries from a and the second entry from b to make them both unique.
第一次做构造题, 把数分为三段。
对于i=1…t a[i]=i -1
对于i=t+1…n-t b[i]=i-1
对于i=n-t+1…n b[i]=n-i
然后用S求另一个数组就行了。
代码如下:
#include <cstdio>#include <stack>#include <queue>#include <cmath>#include <vector>#include <cstring>#include <algorithm>using namespace std;#define CLR(a,b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define LL long longstruct node{int n,pos;}num[100000+11];bool cmp(node a,node b){return a.n < b.n;}int main(){int n;int a[100000+11];int b[100000+11];while (~scanf ("%d",&n)){for (int i = 1 ; i <= n ; i++)scanf ("%d",&num[i].n) , num[i].pos = i;sort(num+1,num+1+n,cmp);int t = (n + 2) / 3;for (int i = 1 ; i <= t ; i++){a[num[i].pos] = i-1;b[num[i].pos] = num[i].n - i + 1;}for (int i = t + 1 ; i <= t * 2 ; i++){b[num[i].pos] = i-1;a[num[i].pos] = num[i].n - i + 1;}for (int i = t * 2 + 1 ; i <= n ; i++){b[num[i].pos] = n - i;a[num[i].pos] = num[i].n - n + i;}puts("YES");for (int i = 1 ; i <= n ; i++)printf ("%d ",a[i]);puts("");for (int i = 1 ; i <= n ; i++)printf ("%d ",b[i]);puts("");}return 0;}
- codeforces -297c Splitting the Uniqueness【构造】
- 【CodeForces】297C - Splitting the Uniqueness(构造)
- 【Codeforces】-297C-Splitting the Uniqueness(构造)
- 【codeforces 297 C Splitting the Uniqueness】+ 数组构造
- codeforces 297C Splitting the Uniqueness
- [Codeforces297C]Splitting the Uniqueness(构造)
- 【codeforces】The Text Splitting
- Codeforces 872 C Maximum splitting(规律)
- C. Maximum splitting--codeforces
- CodeForces 612 A. The Text Splitting(水~)
- 【CodeForces】612A - The Text Splitting(枚举)
- Codeforces 612A: The Text Splitting(略水)
- 【Codeforces】-612A-The Text Splitting(数学)
- 【codeforces】A. The Text Splitting(思维题-水题)
- codeforces 870C Maximum splitting
- codeforces 870C. Maximum splitting
- CodeForces 872C Maximum splitting
- Codeforces Round #440 (Div. 2)C. Maximum splitting
- Unknown media type in type 'all/all'
- 面向对象_四种权限修饰符的测试
- javaScript基础
- Cocos2d-TestCpp之项目结构分析
- 配置jdk 1.7环境变量
- 【CodeForces】297C - Splitting the Uniqueness(构造)
- 日期计数器—C++实现
- 周易六十四卦——天风姤卦
- eclipse系列: Cannot change version of project facet Dynamic web的解决方法
- java基础
- python进行聚类(scikit-lean、scipy)
- SLAM 基础知识
- java中的String类型的存储原理和一些细节
- 第二本 第八章上机2制作带按钮的图片横幅广告