Codeforces 967 D. Resource Distribution

最新推荐文章于 2020-12-13 21:55:17 发布

maxdumbledore

最新推荐文章于 2020-12-13 21:55:17 发布

阅读量385

点赞数

分类专栏： Codeforces 文章标签： Codeforces

本文链接：https://blog.csdn.net/maxdumbledore/article/details/80152614

版权

Codeforces 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

One department of some software company has $n$ servers of different specifications. Servers are indexed with consecutive integers from $1$ to $n$ . Suppose that the specifications of the $j$ -th server may be expressed with a single integer number $c_{j}$ of artificial resource units.

In order for production to work, it is needed to deploy two services $S_{1}$ and $S_{2}$ to process incoming requests using the servers of the department. Processing of incoming requests of service $S_{i}$ takes $x_{i}$ resource units.

The described situation happens in an advanced company, that is why each service may be deployed using not only one server, but several servers simultaneously. If service $S_{i}$ is deployed using $k_{i}$ servers, then the load is divided equally between these servers and each server requires only $x_{i} / k_{i}$ (that may be a fractional number) resource units.

Each server may be left unused at all, or be used for deploying exactly one of the services (but not for two of them simultaneously). The service should not use more resources than the server provides.

Determine if it is possible to deploy both services using the given servers, and if yes, determine which servers should be used for deploying each of the services.

Input

The first line contains three integers $n$ , $x_{1}$ , $x_{2}$ ( $2 \leq n \leq 300000$ , $1 \leq x_{1}, x_{2} \leq 10^{9}$ ) — the number of servers that the department may use, and resource units requirements for each of the services.

The second line contains $n$ space-separated integers $c_{1}, c_{2}, \dots, c_{n}$ ( $1 \leq c_{i} \leq 10^{9}$ ) — the number of resource units provided by each of the servers.

Output

If it is impossible to deploy both services using the given servers, print the only word "No" (without the quotes).

Otherwise print the word "Yes" (without the quotes).

In the second line print two integers $k_{1}$ and $k_{2}$ ( $1 \leq k_{1}, k_{2} \leq n$ ) — the number of servers used for each of the services.

In the third line print $k_{1}$ integers, the indices of the servers that will be used for the first service.

In the fourth line print $k_{2}$ integers, the indices of the servers that will be used for the second service.

No index may appear twice among the indices you print in the last two lines. If there are several possible answers, it is allowed to print any of them.

   Examples 
 
     input 
    
      Copy 
    
6 8 16
3 5 2 9 8 7

     output 
    
      Copy 
    
Yes
3 2
1 2 6
5 4

     input 
    
      Copy 
    
4 20 32
21 11 11 12

     output 
    
      Copy 
    
Yes
1 3
1
2 3 4

     input 
    
      Copy 
    
4 11 32
5 5 16 16

     output 
    
      Copy 
    
No

     input 
    
      Copy 
    
5 12 20
7 8 4 11 9

     output 
    
      Copy 
    
No

Note

In the first sample test each of the servers 1, 2 and 6 will will provide $8 / 3 = 2. (6)$ resource units and each of the servers 5, 4 will provide $16 / 2 = 8$ resource units.

In the second sample test the first server will provide $20$ resource units and each of the remaining servers will provide $32 / 3 = 10. (6)$ resource units.

这道题目非常好，题意很清楚就不再翻译了。这样的题看第一眼就知道肯定有贪心的部分存在。先把数组排序（注意结构体记录位置）假设存在一个解法，让X1分配n个，为a1,a2,a3,a4……（表示下标，而且a1<a2<a3<a4……），X2分配m个，为b1，b2，……（意义相同）。那么假设an>bm，必有n+m<=an（取等号时1到an全部被分配任务），那么调整a让X1重新分配给an-n+1~an，调整b让X2重新分配给1~m，这样的调整方式必定存在，而且得到了一个新的解法。

那么我们就只需要判断这种新的解法是否可以存在，我们可以从小到大枚举n的大小，然后找到最大的对应的an（二分查找或者扫描指针），然后再在1~an-n中看是否存在t让m=t使得满足题意（这里的“是否存在”可以用预处理前缀bool量的办法O（1）判断）

注意这样做的假设建立在an>bm的基础上，如果an<bm怎么办呢，其实没关系，反着再来尝试一遍不久OK了吗？

代码太丑还是不放了，另外自己debug的能力还要加强，一些小错误太致命了，导致我赛场上没有写出这道题。