CodeForces 366A:Dima and Guards【水】
来源:互联网 发布:linux 移动非空目录 编辑:程序博客网 时间:2024/05/17 02:22
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.
AC-code:
#include<cstdio>#include<algorithm>#define min(a,b) a>b?b:ausing namespace std;struct node{int a,b,c,d,sum;}s[4];int main(){int n,max,a,b,i,flag;scanf("%d",&n);max=100005;for(i=0;i<4;i++){scanf("%d%d%d%d",&s[i].a,&s[i].b,&s[i].c,&s[i].d);a=min(s[i].a,s[i].b);b=min(s[i].c,s[i].d);s[i].sum=a+b;if(s[i].sum<max){flag=i;max=s[i].sum;}}if(max>n)printf("-1\n");else{int k=min(s[flag].a,s[flag].b);printf("%d %d %d\n",flag+1,k,n-k);}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 (暑期小练习)
- 回来看看
- PHP学习必看的一些书
- IOS 网络浅析-(九 NSURLSession代理简介)
- yii2 window下安装 不用composer
- 码农小汪剑指Offer之35-数字在排序数组中出现的次数 暴力 二分查找的运用
- CodeForces 366A:Dima and Guards【水】
- 神器phpstorm功能详解
- WPF 分别管理ListView列表中每一行数据
- 面向对象介绍以及封装
- Andriod 仿支付宝密码输入框
- 多线程之临界区、互斥锁
- 11g单机对dataguard实施
- hdu1160 FatMouse's Speed 【最长下降子序列+输出】
- 基于s3c2440的alsa-lib及alsa-utils成功移植