C - Preparing for the Contest

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d
& %I64u

Submit Status Practice CodeForces
377B

Description

Soon there will be held the world's largest programming contest, but the testing system still has m bugs. The contest organizer, a well-known university, has no choice
but to attract university students to fix all the bugs. The university has n students able to perform such work. The students realize that they are the only hope of the
organizers, so they don't want to work for free: the i-th student wants to getci 'passes'
in his subjects (regardless of the volume of his work).

Bugs, like students, are not the same: every bug is characterized by complexity aj, and every student has the level of his abilities bi.
Student i can fix a bug j only if the level of his abilities is not less than the
complexity of the bug: bi ≥ aj, and he does it in one day. Otherwise, the bug will have to be
fixed by another student. Of course, no student can work on a few bugs in one day. All bugs are not dependent on each other, so they can be corrected in any order, and different students can work simultaneously.

The university wants to fix all the bugs as quickly as possible, but giving the students the total of not more than s passes. Determine which students to use for that
and come up with the schedule of work saying which student should fix which bug.

Input

The first line contains three space-separated integers: nm and s (1 ≤ n, m ≤ 105, 0 ≤ s ≤ 109) —
the number of students, the number of bugs in the system and the maximum number of passes the university is ready to give the students.

The next line contains m space-separated integers a1a2, ..., am (1 ≤ ai ≤ 109) —
the bugs' complexities.

The next line contains n space-separated integers b1b2, ..., bn (1 ≤ bi ≤ 109) —
the levels of the students' abilities.

The next line contains n space-separated integers c1c2, ..., cn (0 ≤ ci ≤ 109) —
the numbers of the passes the students want to get for their help.

Output

If the university can't correct all bugs print "NO".

Otherwise, on the first line print "YES", and on the next line print m space-separated integers: the i-th
of these numbers should equal the number of the student who corrects the i-th bug in the optimal answer. The bugs should be corrected as quickly as possible (you must spend the minimum
number of days), and the total given passes mustn't exceed s. If there are multiple optimal answers, you can output any of them.

Sample Input

Input
3 4 9
1 3 1 2
2 1 3
4 3 6
Output
YES
2 3 2 3
Input
3 4 10
2 3 1 2
2 1 3
4 3 6
Output
YES
1 3 1 3
Input
3 4 9
2 3 1 2
2 1 3
4 3 6
Output
YES
3 3 2 3
Input
3 4 5
1 3 1 2
2 1 3
5 3 6
Output
NO

Hint

Consider the first sample.

The third student (with level 3) must fix the 2nd and 4th bugs (complexities 3 and 2 correspondingly) and the second student (with level 1) must fix the 1st and 3rd bugs (their complexity also equals 1). Fixing each bug takes one day for each student, so
it takes 2 days to fix all bugs (the students can work in parallel).

The second student wants 3 passes for his assistance, the third student wants 6 passes. It meets the university's capabilities as it is ready to give at most 9 passes.

题意给出m个bug,每一个bug有个复杂程度,有n个同学每一个同学有自己的能力值b,和想要的东西c,

假设雇佣第i个同学,那么能解决全部复杂程度小于等于b[i]的bug,每天一人仅仅能解决一个,学校要付出c,不论i攻克了几个bug

问,学校在付出不超过s,且最少的天数须要多少。

有两个限制,1.总和不能超过s,2.要求最少天数。

仅仅能限制一个,来求还有一个,假设求总和不能超过s,不好求,那么仅仅能求最少天数,二分枚举最少的天数,找出最小花费,得到最后的结果。

假设是时间为t,那么找出全部能力大于当前最大的bug的人,找出须要c最少的,使用优先队列维护,让找出的人工作t天,工作bug最大的t个,使得后面的bug能够找很多其它的人来修。

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define LL __int64
#define INF 0x3f3f3f3f
struct node
{
LL b , c , i ;
// bool operator < (const node &x) const {
// return c > x.c ;
// }
friend bool operator< (node n1, node n2) { return n1.c > n2.c; }
} p[200000] , q ;
priority_queue <node> que ;
struct node1
{
LL i , a ;
} bug[200000];
bool cmp(node x,node y)
{
return x.b > y.b ;
}
bool cmp1(node1 x,node1 y)
{
return x.a > y.a ;
}
LL last[110000] , now[110000 ] , n , m ,s ;
LL f(LL t)
{
while( !que.empty() ) que.pop();
LL i = 0 , j = 0 , ans = 0 , k ;
while(j < m)
{
while(i < n && p[i].b >= bug[j].a)
{
que.push( p[i] ) ;
i++ ;
}
if( que.empty() )
return s+1 ;
q = que.top();
que.pop();
ans += q.c ;
k = j+t ;
while(j < m && j < k)
{
now[ bug[j].i ] = q.i ;
j++ ;
}
}
return ans ;
}
int main()
{
LL i , j ;
memset(last,-1,sizeof(last));
scanf("%I64d %I64d %I64d", &n, &m, &s);
for(i = 0 ; i < m ; i++)
{
scanf("%I64d", &bug[i].a);
bug[i].i = i ;
}
sort(bug,bug+m,cmp1);
for(i = 0 ; i < n ; i++)
{
scanf("%I64d", &p[i].b);
p[i].i = i+1 ;
}
for(i = 0 ; i < n ; i++)
{
scanf("%I64d", &p[i].c);
}
sort(p,p+n,cmp);
LL low = 1 , mid , high = m , min1 ;
while( low <= high )
{
mid = (low+high)/2 ;
min1 = f(mid);
if( min1 <= s )
{
for(i = 0 ; i < m ; i++)
last[i] = now[i] ;
high = mid-1 ;
}
else
low = mid+1 ;
}
if( last[0] == -1 )
printf("NO\n");
else
{
printf("YES\n");
for(i = 0 ; i < m ; i++)
{
if(i == m)
printf("%d\n", last[i]);
else
printf("%d ", last[i]);
}
}
return 0;
}

CodeForces 377B---Preparing for the Contest(二分+贪心)的更多相关文章

  1. codeforces 377B Preparing for the Contest 二分+优先队列

    题目链接 给你m个bug, 每个bug都有一个复杂度.n个人, 每个人有两个值, 一个是能力值, 当能力值>=bug的复杂度时才可以修复这个bug, 另一个是雇佣他需要的钱,掏一次钱就可以永久雇 ...

  2. Codeforces Round #222 (Div. 1) B. Preparing for the Contest 二分+线段树

    B. Preparing for the Contest 题目连接: http://codeforces.com/contest/377/problem/B Description Soon ther ...

  3. Codeforces Gym 100231B Intervals 线段树+二分+贪心

    Intervals 题目连接: http://codeforces.com/gym/100231/attachments Description 给你n个区间,告诉你每个区间内都有ci个数 然后你需要 ...

  4. Codeforces 639E - Bear and Paradox(二分+贪心)

    Codeforces 题目传送门 & 洛谷题目传送门 原来 jxd 作业里也有我会做的题 i 了 i 了 首先这种题目的套路就是先考虑对于一个固定的 \(c\),怎样求出得分最高的策略,而类似 ...

  5. CodeForces - 847B Preparing for Merge Sort 二分

    http://codeforces.com/problemset/problem/847/B 题意:给你n个数(n<2e5)把它们分成若干组升序的子序列,一行输出一组.分的方法相当于不断找最长递 ...

  6. Ice Cream Tower(The 2016 ACM-ICPC Asia China-Final Contest 二分&贪心)

    题目: Mr. Panda likes ice cream very much especially the ice cream tower. An ice cream tower consists ...

  7. 【CF】222 Div.1 B Preparing for the Contest

    这样类似的题目不少,很多都是一堆优化条件求最优解,这个题的策略就是二分+贪心.对时间二分, 对费用采用贪心. /* 377B */ #include <iostream> #include ...

  8. 2016-2017 ACM-ICPC CHINA-Final Ice Cream Tower 二分+贪心

    /** 题目:2016-2017 ACM-ICPC CHINA-Final Ice Cream Tower 链接:http://codeforces.com/gym/101194 题意:给n个木块,堆 ...

  9. Codeforces_732D_(二分贪心)

    D. Exams time limit per test 1 second memory limit per test 256 megabytes input standard input outpu ...

随机推荐

  1. english: 遭遇

    遭遇 [zāo yù] 1 (碰上: 遇到) meet with; encounter; run up against meet with misfortune; have hard luck 遭遇不 ...

  2. Delphi 拖放文件编程(覆盖WM_DROPFILES消息)

    unit Unit1; interface usesWindows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,  ...

  3. CSS中的!important属性用法

    关于CSS的运用技巧有很多, 今天主要探讨一下CSS中 !important 这个属性的用法.在CSS的使用中,遇到最多的问题就是不同浏览器之间的兼容问题. 由于IE并不严格执行W3C标准, 而又几乎 ...

  4. java之redis篇(spring-data-redis整合) (转)

    redis的知识:官网 1,利用spring-data-redis整合 项目使用的pom.xml: <project xmlns="http://maven.apache.org/PO ...

  5. sum(case when then)(男女生的个数)

    判断类似一个班级的男生和女生的人数,用sum (cese when then ) select count(er.execute_result), sum(case er.execute_result ...

  6. 1.1.0-学习Opencv与MFC混合编程之---全屏截图,保存为BMP图像(并增加快捷键)

    源代码:http://download.csdn.net/detail/nuptboyzhb/3961677 Ø  添加全屏截图菜单项,菜单项的属性如下; Ø  为该菜单项建立类向导. 编辑消息处理函 ...

  7. 实现StatusBar的Flat风格

    效果见右图,OfficeXP里就是这样的风格,其实实现很简单,不必专门在网上找别人控件. 把StatusBar的SimplePanel设为False,点击Panels添加StatusPanel,把所有 ...

  8. clear、REFRESH、free区别

    clear可以清楚一个工作区或变量.但是如果该内表是带表头的,清空内表时需要在该内表后加[].例如:clear gt_tab[]. free可以清空带表头的内表但是不会清空这个带表头内表的表头,但是也 ...

  9. web前端优化手段

    web前端优化手段有很多,同种的优化方式或许在不同的网络协议会南辕北辙,下面就自己结合工作经验和学习总结的一些手段总结 1.合并文件减小请求数:sprite图片的合成.合并脚本与样式. 2.减小文件的 ...

  10. 很好用的一个类:TJvAppXMLFileStorage

    以前写软件的时候,在处理软件配置信息的时候,总是要写很多重复的代码,把配置信息写到Ini文件当中.昨天到网上查了一下,发现JVCL中提供了一个非常好用的类TJvAppXMLFileStorage,可以 ...