CodeForces 377B—Preparing for the Contest(二分+贪心)

CodeForces 377B—Preparing for the Contest(二分+贪心)

大家好,又见面了,我是全栈君,祝每个程序员都可以多学几门语言。

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: n, m 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 a1, a2, …, am (1 ≤ ai ≤ 109) — the bugs’ complexities.

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

The next line contains n space-separated integers c1, c2, …, 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;
}

 

版权声明:本文内容由互联网用户自发贡献,该文观点仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 举报,一经查实,本站将立刻删除。

发布者:全栈程序员-用户IM,转载请注明出处:https://javaforall.cn/118121.html原文链接:https://javaforall.cn

【正版授权,激活自己账号】: Jetbrains全家桶Ide使用,1年售后保障,每天仅需1毛

【官方授权 正版激活】: 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...

(0)


相关推荐

  • BPC 新建流程模板「建议收藏」

    BPC 新建流程模板「建议收藏」1、找到流程模板页签2、新建选择模型,维度和流程所有者3、新增新的活动

    2022年10月25日
  • finemolds模型_yolo模型训练

    finemolds模型_yolo模型训练在已有模型上finetune自己的数据训练一个模型1、准备训练数据和测试数据2、制作标签3、数据转换,将图片转为LMDB格式前三步的过程和如何利用自己的数据训练一个分类网络是一样的,参考处理即可。4、修改网络模型文件复制/caffe-root/models/finetune_flickr_style文件夹下面的deploy.prototxt…

  • 如何入门网络安全_网络安全自学

    如何入门网络安全_网络安全自学由于我之前写了不少网络安全技术相关的故事文章,不少读者朋友知道我是从事网络安全相关的工作,于是经常有人在微信里问我:我刚入门网络安全,该怎么学?要学哪些东西?有哪些方向?怎么选?不同于Java、C/C++等后端开发岗位有非常明晰的学习路线,网路安全更多是靠自己摸索,要学的东西又杂又多,难成体系。常读我文章的朋友知道,我的文章基本以故事为载体的技术输出为主,很少去谈到职场、面试这些方面的内容。主要是考虑到现在大家的压力已经很大,节奏很快,公众号上是让大家放松的地方,尽量写一些轻快的内容。不

    2022年10月21日
  • 谷歌chrome运行activeX控件

    谷歌chrome运行activeX控件在谷歌chrome浏览器下,安装IE_Tab_Multi_extension_1_0_0_1控件即可具体操作:将IE_Tab_Multi_extension_1_0_0_1拖入谷歌浏览器然后点击:添加即可谷歌浏览器不能直接用activeX原因:因为Activex是由微软开发,因而目前只支持原生态支持的IE,最新版Edge已经不再支持了。其他浏览器想要支持activex,需要额外做一些设置或安装补丁包,其中谷歌浏览器的话,需要安装IE-Tab-Multi控件IE_Tab_Multi_exte

  • 「数学」夹角公式_夹角公式cos

    「数学」夹角公式_夹角公式cos内容设直线$l_1$、$l_2$的斜率存在,分别为$k_1$、$k_2$,$l_1$与$l_2$的夹角为$\theta$,则$\tan\theta=\left|\fr

  • Oracle获取字符串的最后几位

    Oracle获取字符串的最后几位substr(字符串,-10)Oracle字符串函数substr(字符串,截取开始位置,截取长度)1.如果最后一个截取长度参数为空,则表示从截取开始位置起截到最末2.如果截取开始位置为大于0的数字,则表示从字符串左数几位开始3.如果截取开始位置为小于0的数字,则表示从字符串右数几位开始……

    2022年10月27日

发表回复

您的电子邮箱地址不会被公开。

关注全栈程序员社区公众号