hdu 5360 Hiking(2015 Multi-University Training Contest 6)
来源:互联网 发布:nginx安装ssl模块 编辑:程序博客网 时间:2024/05/18 00:03
Hiking
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 126 Accepted Submission(s): 75
Special Judge
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
Source
2015 Multi-University Training Contest 6
题目大意:
soda邀请一些人,当同意的人数在li~ri区间内,他就会同意,求该如何询问,会让同意的人尽可能多。
解题思路:
将在当前可能同意的区间内选右区间最小的。
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;const int maxn=100000+1000;struct node{ int l,r,cur; bool operator < (const node& a) const { return r>a.r; }} a[maxn];int vis[maxn];int pre[maxn];bool cmp(node x,node y){ return x.l<y.l;}int main(){ int t; scanf("%d",&t); while(t--) { int n,ans; scanf("%d",&n); for(int i=0; i<n; i++) { scanf("%d",&a[i].l); a[i].cur=i+1; } for(int i=0; i<n; i++) { scanf("%d",&a[i].r); } sort(a,a+n,cmp); priority_queue<node> q; memset(vis,0,sizeof(vis)); ans=0; for(int i=0; i<n;) { if(a[i].l<=ans) { q.push(a[i]); // cout<<i<<endl; i++; } else { if(q.empty()) break; else { while(!q.empty()) { node p=q.top(); q.pop(); // cout<<p.r<<" "<<ans<<endl; if(p.r>=ans) { pre[++ans]=p.cur; vis[p.cur]=1; break; } } } } } while(!q.empty()) { node p=q.top(); q.pop(); if(p.r>=ans) { pre[++ans]=p.cur; vis[p.cur]=1; } } printf("%d\n",ans); if(ans>0) { printf("%d",pre[1]); for(int i=2; i<=ans; i++) { printf(" %d",pre[i]); } for(int i=1; i<=n; i++) { if(!vis[i]) printf(" %d",i); } printf("\n"); } else { printf("1"); for(int i=2; i<=n; i++) printf(" %d",i); printf("\n"); } } return 0;}
0 0
- hdu 5360 Hiking(2015 Multi-University Training Contest 6)
- HDU 5360 Hiking(优先队列)2015 Multi-University Training Contest 6
- hdu 5306 Hiking || 2015 Multi-University Training Contest 6 (优先队列 为小疯子而生)
- hdu 5353 Average(2015 Multi-University Training Contest 6)
- HDU-- 2015 Multi-University Training Contest 6 Cake
- HDU 5358 First One( 2015 Multi-University Training Contest 6)
- 2015 Multi-University Training Contest 6
- 2015 Multi-University Training Contest 6
- 2015 Multi-University Training Contest 6(HDOJ5353)
- 2015 Multi-University Training Contest 6
- 2015 Multi-University Training Contest 6 Cake
- hdu 5294 Tricks Device 2015 Multi-University Training Contest 1
- hdu 5289 Assignment 2015 Multi-University Training Contest 1
- 2015 Multi-University Training Contest 1 Hdu 5289 Assignment
- 2015 Multi-University Training Contest 1 Hdu 5292 Pocket Cube
- 2015 Multi-University Training Contest 1 Hdu 5297 Y sequence
- HDU 5289 Assignment (2015 Multi-University Training Contest 1)
- hdu 5291 Candy Distribution 2015 Multi-University Training Contest 1
- 使用html5获取当前手机的经纬度,并接入百度地图API,查询出当前位置
- HDU 5363 Key Set
- java和javac编译运行java程序
- 冒泡排序 选择排序 快速排序(C语言)
- dark
- hdu 5360 Hiking(2015 Multi-University Training Contest 6)
- error:“1”: 宏形参表中的意外
- 仿Android L 长按Home键显示最近使用应用信息及清理
- Android布局优化
- iOS统一设置状态栏的样式,交给代理AppDelegate
- 经典排序算法之简单选择排序
- Android中的布局优化方法
- HDOJ 题目4251The Famous ICPC Team Again(划分树)
- CSS学习笔记