HDU 5360 Hiking
来源:互联网 发布:遗传算法求解tsp 编辑:程序博客网 时间:2024/05/22 17:34
Problem Description
There are n soda conveniently labeled by 1,2,…,n . beta, their best friends, wants to invite some soda to go hiking. The i -th soda will go hiking if the total number of soda that go hiking except him is no less than li and no larger than ri . beta will follow the rules below to invite soda one by one:
1. he selects a soda not invited before;
2. he tells soda the number of soda who agree to go hiking by now;
3. soda will agree or disagree according to the number he hears.
Note: beta will always tell the truth and soda will agree if and only if the number he hears is no less thanli and no larger than ri , otherwise he will disagree. Once soda agrees to go hiking he will not regret even if the final total number fails to meet some soda's will.
Help beta design an invitation order that the number of soda who agree to go hiking is maximum.
1. he selects a soda not invited before;
2. he tells soda the number of soda who agree to go hiking by now;
3. soda will agree or disagree according to the number he hears.
Note: beta will always tell the truth and soda will agree if and only if the number he hears is no less than
Help beta design an invitation order that the number of soda who agree to go hiking is maximum.
Input
There are multiple test cases. The first line of input contains an integer T , indicating the number of test cases. For each test case:
The first contains an integern (1≤n≤105) , the number of soda. The second line constains n integers l1,l2,…,ln . The third line constains n integers r1,r2,…,rn . (0≤li≤ri≤n)
It is guaranteed that the total number of soda in the input doesn't exceed 1000000. The number of test cases in the input doesn't exceed 600.
The first contains an integer
It is guaranteed that the total number of soda in the input doesn't exceed 1000000. The number of test cases in the input doesn't exceed 600.
Output
For each test case, output the maximum number of soda. Then in the second line output a permutation of 1,2,…,n denoting the invitation order. If there are multiple solutions, print any of them.
Sample Input
484 1 3 2 2 1 0 35 3 6 4 2 1 7 683 3 2 0 5 0 3 64 5 2 7 7 6 7 682 2 3 3 3 0 0 27 4 3 6 3 2 2 585 6 5 3 3 1 2 46 7 7 6 5 4 3 5
Sample Output
71 7 6 5 2 4 3 884 6 3 1 2 5 8 773 6 7 1 5 2 8 401 2 3 4 5 6 7 8优先级队列,按右端排序,然后剩下的随便搞。
#include<cstdio>#include<cmath>#include<iostream>#include<queue>#include<vector>#include<cstring>#include<algorithm>using namespace std;typedef long long ll;const ll maxn=100005;int T,n,m,l[maxn],r[maxn],ans[maxn],tot,f[maxn];struct lr{ int l,r,id; lr(int l,int r,int id):l(l),r(r),id(id){}; bool operator <(const lr& a)const { if (r==a.r) return l>a.l; return r>a.r; }};vector<lr> p[maxn];int main(){ scanf("%d",&T); while (T--) { scanf("%d",&n); tot=0; for (int i=1;i<=n;i++) scanf("%d",&l[i]); for (int i=1;i<=n;i++) scanf("%d",&r[i]); for (int i=0;i<=n;i++) p[i].clear(); for (int i=1;i<=n;i++) p[l[i]].push_back(lr(l[i],r[i],i)); priority_queue<lr> que; for (int i=0;i<=n;) { for (int j=0;j<p[i].size();j++) que.push(lr(p[i][j])); while (!que.empty()&&que.top().r<i) que.pop(); if (!que.empty()) {ans[tot++]=que.top().id; que.pop(); i++;} else break; } printf("%d\n",tot); if (tot) { memset(f,0,sizeof(f)); printf("%d",ans[0]); for (int i=1;i<tot;i++) printf(" %d",ans[i]); for (int i=0;i<tot;i++) f[ans[i]]=1; for (int i=1;i<=n;i++) if (!f[i]) printf(" %d",i); } else for (int i=1;i<=n;i++) { if (i>1) printf(" "); printf("%d",i); } printf("\n"); } return 0;}
0 0
- HDU 5360 Hiking
- HDU 5360 Hiking
- hdu 5360 Hiking
- hdu 5360 Hiking
- HDU 5360 Hiking
- hdu 5360 Hiking
- hdu 5360 Hiking
- HDU 5360 Hiking
- hdu 5360 Hiking(贪心)
- HDU 5360 Hiking 优先队列
- hdu(5360)——Hiking
- HDU 5360 Hiking(STL优先队列)
- HDU 5360 Hiking(线段树)
- hdu 5360 Hiking(优先队列+贪心)
- HDU 5360 Hiking(优先队列)
- HDU 5360 Hiking (贪心+优先队列)
- hdu 5360 Hiking (优先队列+贪心)
- hdu 5360 Hiking 多校6 优先队列
- App数据重点分析的4个方面
- 错误No Persistence provider for EntityManager named
- C# 如何通过委托进行窗口传值
- C 将一个整数输出为内存中的存储形式
- 2015.7.30 第五堂(补)delegate 三部曲理解之二(使用协议)
- HDU 5360 Hiking
- HDU 5355 Cake(原先错误的代码已更新)
- 从别人手上转过来的工作,都是雷该如何是好,求解答
- iOS访问相册以及拍照保存至相册的实现
- nprogress页面加载进度条使用
- Android中 View not attached to window manager错误的解决办法
- Microsoft C#基础知识复习
- EventBus实例教程(二)
- hdu1599