B. Preparing for the Contest

题目连接:

http://codeforces.com/contest/377/problem/B

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 get ci '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

3 4 9

1 3 1 2

2 1 3

4 3 6

Sample Output

YES

2 3 2 3

Hint

题意

有一个学校,有m个bug,有n个大学生,每个大学生的能力值是b[i],bug的能力值是a[i],如果b[i]>=a[j],那么第i个人能够修复j bug

现在每个大学生你需要支付c[i]元,支付给他之后,他可以每天修复一个能力值小于等于他能力值的bug

你需要尽量少的天数,以及在花费小于s的情况下,修复这些bug

问你怎么去做?

题解:

如果能在T天修复完,那么显然也能够在T+1天内修复完,所以这个是具备二分性的

然后我们就二分答案,那么我们找到一个最便宜的人去修复[m,m-T+1]的bug,再找一个人去修复[m-T,m-2T+1],等等等

这样就好了

然后我们用一个线段树去维护这个玩意儿就好了

代码

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5 + 15;

struct Person{
int cost , val , idx ;
friend bool operator < (const Person & a , const Person & b){
return a.val < b.val;
}
}p[maxn];
int N , M , S , maxv , ans[maxn]; pair < int , int > a[maxn]; bool cmp( const pair < int , int > & x , const pair < int , int > & y){
return x.first > y.first;
} struct Sgtree{ struct node{
int l , r ;
int pos , minv;
}tree[maxn << 2]; void Maintain( int o ){
int lson = o << 1 , rson = o << 1 | 1;
if( tree[lson].minv < tree[rson].minv ) tree[o].minv = tree[lson].minv , tree[o].pos = tree[lson].pos;
else tree[o].minv = tree[rson].minv , tree[o].pos = tree[rson].pos;
} void Build( int l , int r , int o ){
tree[o].l = l , tree[o].r = r ;
if( r > l ){
int mid = l + r >> 1;
Build( l , mid , o << 1 );
Build( mid + 1 , r , o << 1 | 1 );
Maintain( o );
}else tree[o].pos = l , tree[o].minv = p[l].cost;
} void Modify( int p , int o ){
int l = tree[o].l , r = tree[o].r;
if( l == r ) tree[o].minv = 2e9;
else{
int mid = l + r >> 1;
if( p <= mid ) Modify( p , o << 1 );
else Modify( p , o << 1 | 1 );
Maintain( o );
}
} pair < int , int > ask( int ql , int o ){
int l = tree[o].l , r = tree[o].r;
if(ql <= l) return make_pair( tree[o].minv , tree[o].pos );
else{
int mid = l + r >> 1;
pair < int , int > ls , rs ;
ls.first = rs.first = 2e9;
if( ql <= mid ) ls = ask( ql , o << 1 );
rs = ask( ql , o << 1 | 1 );
if( ls.first < rs.first ) return ls;
return rs;
}
} }Sgtree; bool solve( int T ){
Sgtree.Build(1 , N , 1);
vector < int > vi;
int j = N , money = S;
for(int i = 1 ; i <= M ; i += T){
while( j >= 1 && p[j].val >= a[i].first ) -- j;
pair < int , int > rp = Sgtree.ask( j + 1 , 1 );
if( rp.first > money ) return false;
money -= rp.first;
Sgtree.Modify(rp.second , 1);
vi.push_back( p[rp.second].idx );
}
int lst = 0 , ptr = 0;
for(int i = 1 ; i <= M ; ++ i){
ans[a[i].second] = vi[ptr];
++ lst;
if( lst == T ) lst = 0 , ++ ptr;
}
return true;
} int main( int argc , char * argv[] ){
scanf("%d%d%d",&N,&M,&S);
for(int i = 1 ; i <= M ; ++ i){
scanf("%d" , &a[i].first);
a[i].second = i;
maxv = max( maxv , a[i].first );
}
int find = 0;
for(int i = 1 ; i <= N ; ++ i) scanf("%d" , &p[i].val);
for(int i = 1 ; i <= N ; ++ i){
scanf("%d" , &p[i].cost);
p[i].idx = i ;
if( p[i].val >= maxv && p[i].cost <= S ) find = 1;
}
if( find == 0 ) printf("NO\n");
else{
sort( a + 1 , a + M + 1 , cmp );
sort( p + 1 , p + N + 1 );
int l = 1 , r = max(N,M);
while( l < r ){
int mid = l + r >> 1;
if( solve( mid ) ) r = mid;
else l = mid + 1;
}
solve( l );
printf("YES\n");
for(int i = 1 ; i <= M ; ++ i) printf("%d ", ans[i]);
printf("\n");
}
return 0;
}

Codeforces Round #222 (Div. 1) B. Preparing for the Contest 二分+线段树的更多相关文章

  1. Codeforces Round #365 (Div. 2) D. Mishka and Interesting sum 离线+线段树

    题目链接: http://codeforces.com/contest/703/problem/D D. Mishka and Interesting sum time limit per test ...

  2. Codeforces Round #538 (Div. 2) F 欧拉函数 + 区间修改线段树

    https://codeforces.com/contest/1114/problem/F 欧拉函数 + 区间更新线段树 题意 对一个序列(n<=4e5,a[i]<=300)两种操作: 1 ...

  3. Codeforces Round #345 (Div. 1) D. Zip-line 上升子序列 离线 离散化 线段树

    D. Zip-line 题目连接: http://www.codeforces.com/contest/650/problem/D Description Vasya has decided to b ...

  4. Codeforces Round #370 (Div. 2) E. Memory and Casinos (数学&&概率&&线段树)

    题目链接: http://codeforces.com/contest/712/problem/E 题目大意: 一条直线上有n格,在第i格有pi的可能性向右走一格,1-pi的可能性向左走一格,有2中操 ...

  5. Codeforces Round #FF (Div. 2)__E. DZY Loves Fibonacci Numbers (CF447) 线段树

    http://codeforces.com/contest/447/problem/E 题意: 给定一个数组, m次操作, 1 l r 表示区间修改, 每次 a[i] +  Fibonacci[i-l ...

  6. Codeforces Round #250 (Div. 1) D. The Child and Sequence(线段树)

    D. The Child and Sequence time limit per test 4 seconds memory limit per test 256 megabytes input st ...

  7. DFS Codeforces Round #306 (Div. 2) B. Preparing Olympiad

    题目传送门 /* DFS: 排序后一个一个出发往后找,找到>r为止,比赛写了return : */ #include <cstdio> #include <iostream&g ...

  8. Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset (0/1-Trie树)

    Vasiliy's Multiset 题目链接: http://codeforces.com/contest/706/problem/D Description Author has gone out ...

  9. Codeforces Round #222 (Div. 1) (ABCDE)

    377A Maze 大意: 给定棋盘, 保证初始所有白格连通, 求将$k$个白格变为黑格, 使得白格仍然连通. $dfs$回溯时删除即可. #include <iostream> #inc ...

随机推荐

  1. gpio口、内核定时器使用

    /*申请gpio*/ int gpio_request(unsigned gpio, const char *label); /*设置gpio为输入状态,即设置如(GPH0CON)*/ int gpi ...

  2. C# 去除文件非法字符名

    string resultFileName = MD5Encrypt(NavigateUrl).Replace("=",string.Empty) + ".txt&quo ...

  3. 解决修改表结构,添加外键时出现“约束冲突”的错误

    由于表结构更改,使用新建表,现有部分表需要更改外键,将引用更改到新建表的相应字段.在更改过程中,部分表出现如下错误提示: ALTER TABLE 语句与 COLUMN FOREIGN KEY 约束 ' ...

  4. 【日记】NOIP2018

    day-2: 最后一次走出机房,刚下过几天的雨,感受到的是彻骨的寒意.下午离开教室,跟班主任请了接下来几天的假,班主任斜视了我一眼,哼了一声,确认了一下,不再理会我了.班里的同学或是忙着自己的作业,或 ...

  5. CSS锚伪类顺序需注意的几点

    CSS锚伪类有以下几种: a:link{color:pink} /*未访问的链接*/ a:visited{color:red} /*已访问的链接*/ a:hover{color:blue} /*鼠标移 ...

  6. 一种获取xml文件某个节点内容的shell方法

    配置文件 config.xml <xml> <server> <name>srv-01</name> </server> <serve ...

  7. RocketMQ使用

    RocketMQ是阿里巴巴在2012年开源的分布式消息中间件,目前已经捐赠给Apache基金会,并于2016年11月成为 Apache 孵化项目. 中间件是一类连接软件组件和应用的计算机软件,它包括一 ...

  8. 使用插件实现Jenkins参数化构建

    一.插件安装 1.打开插件管理,在此界面可以安装插件 二.参数化 1.在“可选插件”中查找如下两个插件然后安装,安装后重启Jenkins Build With Parameters 输入框式的参数 P ...

  9. 洛谷P1195口袋的天空

    传送门啦 一个裸的最小生成树,输出 $ No Answer $ 的情况只有 $ k < n $ 的时候. 开始令 $ num =n $ ,如果 $ num = k $ ,直接输出 $ 0 $ , ...

  10. Java读取本地文件(输入流)

    package cn.buaa; import java.io.File; import java.io.FileInputStream; import java.io.FileReader; imp ...