CodeForces 471B
2016-01-14 10:48
429 查看
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Description
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are
n tasks for the day and each animal should do each of these tasks. For each task, they have evaluated its difficulty. Also animals decided to do the tasks in order of their difficulty. Unfortunately, some tasks can have
the same difficulty, so the order in which one can perform the tasks may vary.
Menshykov, Uslada and Horace ask you to deal with this nuisance and come up with individual plans for each of them. The plan is a sequence describing the order in which an animal should do all the
n tasks. Besides, each of them wants to have its own unique plan. Therefore three plans must form three different sequences. You are to find the required plans, or otherwise deliver the sad news to them by stating that
it is impossible to come up with three distinct plans for the given tasks.
Input
The first line contains integer n (1 ≤ n ≤ 2000) — the number of tasks. The second line contains
n integers h1, h2, ..., hn (1 ≤ hi ≤ 2000),
where hi is the difficulty of the
i-th task. The larger number
hi is, the more difficult the
i-th task is.
Output
In the first line print "YES" (without the quotes), if it is possible to come up with three distinct plans of doing the tasks. Otherwise print in the first line "NO" (without the
quotes). If three desired plans do exist, print in the second line
n distinct integers that represent the numbers of the tasks in the order they are done according to the first plan. In the third and fourth line print two remaining plans in the same form.
If there are multiple possible answers, you can print any of them.
Sample Input
Input
Output
Input
Output
Hint
In the first sample the difficulty of the tasks sets one limit: tasks 1 and 4 must be done before tasks 2 and 3. That gives the total of four possible sequences of doing tasks : [1, 4, 2, 3], [4, 1, 2, 3], [1, 4, 3, 2], [4, 1, 3, 2]. You can print any three
of them in the answer.
In the second sample there are only two sequences of tasks that meet the conditions — [3, 1, 2, 4, 5] and [3, 1, 4, 2, 5]. Consequently, it is impossible to make three distinct sequences of tasks.
& %I64u
#include<stdio.h> #include<iostream> #include<algorithm> using namespace std; int main() { pair<int,int> a[10005]; int n,p[2],k=0,i; cin>>n; for(i=0;i<n;i++) { cin>>a[i].first; a[i].second=i+1; } int cnt=0; sort(a,a+n); for(i=0;i<n-1 &&cnt<2;i++) { if(a[i].first==a[i+1].first) { cnt++; p[k++]=i; } } if(cnt==2) { cout<<"YES\n"; for(int j=0,k=0;j<3;j++,k++) { for(i=0;i<n;i++) { cout<<a[i].second<<" "; } cout<<"\n"; swap(a[p[k]].second,a[p[k]+1].second); } } else cout<<"NO"<<endl; return 0; }
Description
It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are
n tasks for the day and each animal should do each of these tasks. For each task, they have evaluated its difficulty. Also animals decided to do the tasks in order of their difficulty. Unfortunately, some tasks can have
the same difficulty, so the order in which one can perform the tasks may vary.
Menshykov, Uslada and Horace ask you to deal with this nuisance and come up with individual plans for each of them. The plan is a sequence describing the order in which an animal should do all the
n tasks. Besides, each of them wants to have its own unique plan. Therefore three plans must form three different sequences. You are to find the required plans, or otherwise deliver the sad news to them by stating that
it is impossible to come up with three distinct plans for the given tasks.
Input
The first line contains integer n (1 ≤ n ≤ 2000) — the number of tasks. The second line contains
n integers h1, h2, ..., hn (1 ≤ hi ≤ 2000),
where hi is the difficulty of the
i-th task. The larger number
hi is, the more difficult the
i-th task is.
Output
In the first line print "YES" (without the quotes), if it is possible to come up with three distinct plans of doing the tasks. Otherwise print in the first line "NO" (without the
quotes). If three desired plans do exist, print in the second line
n distinct integers that represent the numbers of the tasks in the order they are done according to the first plan. In the third and fourth line print two remaining plans in the same form.
If there are multiple possible answers, you can print any of them.
Sample Input
Input
4 1 3 3 1
Output
YES 1 4 2 3 4 1 2 3 4 1 3 2
Input
5 2 4 1 4 8
Output
NO
Hint
In the first sample the difficulty of the tasks sets one limit: tasks 1 and 4 must be done before tasks 2 and 3. That gives the total of four possible sequences of doing tasks : [1, 4, 2, 3], [4, 1, 2, 3], [1, 4, 3, 2], [4, 1, 3, 2]. You can print any three
of them in the answer.
In the second sample there are only two sequences of tasks that meet the conditions — [3, 1, 2, 4, 5] and [3, 1, 4, 2, 5]. Consequently, it is impossible to make three distinct sequences of tasks.
相关文章推荐
- java流与文件——java生成解压缩文件(夹)
- java中应该尽量使用notifyall而不是notify(容易发生死锁)
- html5多人在线游戏开发
- getContextPath和getRealPath的区别
- ListView--Adapter内的onItemClick监听器四个arg参数
- 每日一算法3--JAVA时间格式化处理
- 终于发布了一个app游戏
- boost学习2.2:时间与日期:timer类
- MongoDB 的基本操作
- C和C++控制小数点后的位数
- Servlet生命周期与工作原理
- Android中UI主线程与子线程
- Android HttpClient GET或者POST请求基本使用方法
- 伺服控制的三种模式
- tomcat 内存配置
- 使用angular封装echarts
- iOS edgesForExtendedLayout、extendedLayoutIncludesOpaqueBars、automaticallyAdjustsScrollViewInsets属性详解
- memcached session共享Timeout异常
- jQuery时间插件jquery.clock.js用法实例(5个示例)
- iOS中JavaScript和OC交互