【CodeForces】366A - Dima and Guards(思维)
来源:互联网 发布:360云盘网络访问失败 编辑:程序博客网 时间:2024/06/08 05:37
点击打开题目
Nothing has changed since the last round. Dima and Inna still love each other and want to be together. They've made a deal with Seryozha and now they need to make a deal with the dorm guards...
There are four guardposts in Dima's dorm. Each post contains two guards (in Russia they are usually elderly women). You can bribe a guard by a chocolate bar or a box of juice. For each guard you know the minimum price of the chocolate bar she can accept as a gift and the minimum price of the box of juice she can accept as a gift. If a chocolate bar for some guard costs less than the minimum chocolate bar price for this guard is, or if a box of juice for some guard costs less than the minimum box of juice price for this guard is, then the guard doesn't accept such a gift.
In order to pass through a guardpost, one needs to bribe both guards.
The shop has an unlimited amount of juice and chocolate of any price starting with 1. Dima wants to choose some guardpost, buy one gift for each guard from the guardpost and spend exactly n rubles on it.
Help him choose a post through which he can safely sneak Inna or otherwise say that this is impossible. Mind you, Inna would be very sorry to hear that!
The first line of the input contains integer n (1 ≤ n ≤ 105) — the money Dima wants to spend. Then follow four lines describing the guardposts. Each line contains four integers a, b, c, d (1 ≤ a, b, c, d ≤ 105) — the minimum price of the chocolate and the minimum price of the juice for the first guard and the minimum price of the chocolate and the minimum price of the juice for the second guard, correspondingly.
In a single line of the output print three space-separated integers: the number of the guardpost, the cost of the first present and the cost of the second present. If there is no guardpost Dima can sneak Inna through at such conditions, print -1 in a single line.
The guardposts are numbered from 1 to 4 according to the order given in the input.
If there are multiple solutions, you can print any of them.
105 6 5 66 6 7 75 8 6 69 9 9 9
1 5 5
106 6 6 67 7 7 74 4 4 48 8 8 8
3 4 6
53 3 3 33 3 3 33 3 3 33 3 3 3
-1
Explanation of the first example.
The only way to spend 10 rubles to buy the gifts that won't be less than the minimum prices is to buy two 5 ruble chocolates to both guards from the first guardpost.
Explanation of the second example.
Dima needs 12 rubles for the first guardpost, 14 for the second one, 16 for the fourth one. So the only guardpost we can sneak through is the third one. So, Dima can buy 4 ruble chocolate for the first guard and 6 ruble juice of the second guard.
长的英文题就是读题有点痛苦。
题意:一共有四组守卫(每组两个中年妇女),她们有各自的最低巧克力和果汁价格需求(底线),可以花的多但是不能少。
问是否能花规定的钱数(不多不少)贿赂一组守卫。
题解:把每组的最低消费算出来,如果小于预算的话就可以贿赂,第一个守卫给最低,然后把剩余的钱都给第二个守卫买东西就行了。
代码如下:
#include <cstdio>#include <algorithm>using namespace std;int main(){int n;int a,b,c,d;int mapp[5][4];while (~scanf ("%d",&n)){for (int i = 1 ; i <= 4 ; i++){scanf ("%d %d %d %d",&a,&b,&c,&d);mapp[i][1] = min(a,b);mapp[i][2] = min(c,d);mapp[i][3] = mapp[i][1] + mapp[i][2];}int k;for (k = 1 ; k <= 4 ; k++){if (mapp[k][3] <= n)break;}if (k != 5)printf ("%d %d %d\n",k,mapp[k][1],n-mapp[k][1]);elseprintf ("-1\n");}return 0;}
- 【CodeForces】366A - Dima and Guards(思维)
- CodeForces 366A - Dima and Guards
- CodeForces 366A Dima and Guards
- CodeForces - 366A Dima and Guards
- CodeForces 366A- Dima and Guards
- Codeforces 366A Dima and Guards 【水题】
- CodeForces 366A:Dima and Guards【水】
- CodeForces - 366A Dima and Guards (模拟)
- CodeForces 366A Dima and Guards
- Codeforces--366A--Dima and Guards
- 【CodeForces】[366A]Dima and Guards
- 【Codeforces】-366A- Dima and Guards
- 【codeforces 366A Dima and Guards】
- CodeForces 366A Dima and Guards
- Codeforces--366A--Dima and Guards(水题)
- CodeForces 366A Dima and Guards(结构体,数学)
- Codeforces 366A:Dima and Guards(水题)
- A. Dima and Guards 【思维 好题】
- 思考问题的6w原则
- 数据库总结2
- TimesTen 应用层数据库缓存学习:17. 全局数据缓存(cache grid)的高可用性
- [leetcode] 355. Design Twitter 解题报告
- openwrt用root编译
- 【CodeForces】366A - Dima and Guards(思维)
- 【LigntOj】-1008- Fibsieve`s Fantabulous Birthday
- Reverse Words in a String
- 规避网络游戏的外挂检测机制
- const,static,extern
- 对付DNF硬件断点的NtGetContextThread的写法
- 选择排序
- 对抗debugport清零的另一种方法
- 上拉,下拉刷新三方总结