【Codeforces】-366A- Dima and Guards
来源:互联网 发布:ssuggest软件下载 编辑:程序博客网 时间:2024/05/16 13:51
点击打开题目
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<cmath>#include<algorithm>using namespace std;int main(){int m;int e[5][5];int y1,y2;int y[5];int num=0;scanf("%d",&m);for(int i=1;i<=4;i++){scanf("%d %d %d %d",&e[i][1],&e[i][2],&e[i][3],&e[i][4]);y1=min(e[i][1],e[i][2]);y2=min(e[i][3],e[i][4]);y[i]=y1+y2;}for(int i=1;i<=4;i++){if(y[i]<=m){printf("%d %d %d\n",i,min(e[i][1],e[i][2]),m-min(e[i][1],e[i][2]));break;}elsenum++;}if(num==4)printf("-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(水题)
- CodeForces 366A Dima and Guards (暑期小练习)
- opencv 处理视频并使用Qt窗口作为输出
- Android中Intent介绍
- 数据库案例中创建连接池以及连接
- Java记事
- 修改win10和ubuntu16.04双系统启动顺序
- 【Codeforces】-366A- Dima and Guards
- Python 文件和目录的操作
- 腾讯云一键搭建WordPress博客网站
- 详解网络传输中的三张表,MAC地址表、ARP缓存表以及路由表
- 349. Intersection of Two Arrays
- 多级分类的树形展示
- BFS
- Android Studio 问题汇总目录
- 正则表达式