A. Dima and Guards 【思维 好题】

原创 2016年05月31日 19:11:00

 Dima and Guards

Description

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 exactlyn 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 Input

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

Hint

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.



嗯 理解题意很重要,再仔细一点

题意是四个方向有看守,每个方向两个看守人员,给出他们能接受的礼物的价值,并满足上面的要求,一个人想贿赂两个人,自己花费n元,要求输出,第几组数,两个礼物的价值。

总和知,是求min(a,b)+min(c,d)是否<=n.

代码有点麻烦了,,
#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    int n,a[5],b[5],c[5],d[5],minn,t,m,f;
    while(~scanf("%d",&n))
    {
        
        for(int i=1;i<=4;i++)
        {
            scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
        }
        for(int i=1;i<=4;i++)
        {
            minn=100001;      
            if(minn>a[i])
            {
                minn=a[i];
                t=i;
            }

            if(minn>b[i])
            {
                minn=b[i];
                t=i;
            }
        //}
        m=n-minn;
        f=0;
        //for(int i=1;i<=4;i++)
        //{
            if(c[i]<=m)
            {
                f=1; 
                break;
            }
            else if(d[i]<=m)
            {
                f=1;
                break;
            }
        }
        if(f)
        {
            printf("%d %d %d\n",t,minn,m);
        }
        else
            printf("-1\n");
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Codeforces 366A:Dima and Guards(水题)

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

Dima and Guards

Dima and Guards Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:262144KB  ...

Dima and Guards

Description Nothing has changed since the last round. Dima and Inna still love each other and w...

【codeforces 366A Dima and Guards】

Dima and GuardsDescription Nothing has changed since the last round. Dima and Inna still love each ...

CodeForces - 366A Dima and Guards (模拟)

SubmitStatus Description Nothing has changed since the last round. Dima and Inna still lov...

CodeForces 366A- Dima and Guards

Nothing has changed since the last round. Dima and Inna still love each other and want to be togethe...

【codeforces】Dima and Guards

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

Codeforces 460B Little Dima and Equation【思维+暴力】

B. Little Dima and Equation time limit per test 1 second memory limit per test 256 megabytes...

codeforces 358A Dima and Continuous Line(思维简单,做法暴力)

codeforces 358A  Dima and Continuous Line 题意理解: 给一出个n,然后输入n个数,表示一个一维数组上的坐标点,相连的两点有连线(首尾两点不相连)。为这...

CF223A题Sereja and Dima

这个题第一次理解错题意了。。 A. Sereja and Dima time limit per test 1 second memory limit per test 256 megabyt...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)