CodeForces 366A Dima and Guards

A. Dima and Guards
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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!

Input

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.

Output

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.

Sample test(s)
Input
10
5 6 5 6
6 6 7 7
5 8 6 6
9 9 9 9
Output
1 5 5
Input
10
6 6 6 6
7 7 7 7
4 4 4 4
8 8 8 8
Output
3 4 6
Input
5
3 3 3 3
3 3 3 3
3 3 3 3
3 3 3 3
Output
-1
Note

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<iostream>
using namespace std;

const int N=100010;
int a[N],b[N],c[N],d[N];

int main(){
    int n,i,mina,minb,x,y,flag;
    while(cin>>n){
        flag=0;
        mina=N;
        minb=N;
        for(i=0;i<4;i++){
            cin>>a[i]>>b[i]>>c[i]>>d[i];
        }
        for(i=0;i<4;i++){
            mina=min(a[i],b[i]);
            minb=min(c[i],d[i]);
            if(mina+minb<=n){
                flag=1;
                break;
            }
        }
        if(flag){
            cout<<i+1<<" "<<mina<<" "<<minb<<endl;
        }
        else{
            cout<<"-1"<<endl;
        }
    }
    return 0;
}


资源下载链接为: https://pan.quark.cn/s/a1799e63815c 《妙趣横生的算法(C语言实现)》是一本适合不同层次读者的书籍。对于算法初学者来说,它是入门教程;对于学过C语言程序设计的人,是进一步提升的读物;对于有经验的程序设计人员,可作为巩固和提高编程水平、查阅算法实现和数据结构知识的参考;对准备参加相关面试的读者,也能提供帮助。其最大特色是实例丰富、题材新颖有趣、实用性强,将理论融入实践,旨在帮助读者理解算法,提升C语言编程能力,培养编程兴趣,巩固C语言知识。 全书分两部分共10章。第一部分为基础篇,第1章介绍数据结构基础,包括顺序表、链表、栈、队列、树结构、图结构等的定义、操作及实例分析。第2章讲解常用的查找与排序方法,如顺序查找、折半查找、直接插入排序、选择排序等。第3章阐述常用的算法思想,如穷举法、递归与分治、贪心算法、回溯法、数值概率算法等。 第二部分为编程实例解析。第4章是编程基本功,涉及字符类型统计、ASCII码计算、嵌套if-else语句、switch语句译码器、闰年判断、指针变量作参数、矩阵运算、位运算、文件读写、程序运行时间记录、进制转化、特殊图案打印等内容。第5章和第6章为数学趣题,包括舍罕王的失算、最大公约数与最小公倍数、歌德巴赫猜想、三色球问题、百钱买百鸡问题、回文数字判断、填数字游戏求解、新郎和新娘、爱因斯坦的阶梯问题、水仙花数寻找、猴子吃桃问题、兔子产仔问题、质因数分解等。第7章是数据结构趣题,如顺序表就地逆置、动态数列排序、链表归并、约瑟夫环、进制转换器、回文字符串判定、括号匹配等。第8章为数值计算问题,包括递推化梯形法求定积分、低阶定积分求解、迭代法开平方、牛顿法解方程、欧拉方法求解微分方程等。第9章是综合题,如破碎的砝码、24点问题、马踏棋盘、0-1背包问题、八皇后问题求解、文件加密解密系统等。第10章为算法设
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值