CodeForces 366A Dima and Guards
2016-01-15 15:50
267 查看
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
Output
Input
Output
Input
Output
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.
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 ,b ,c ,d ; 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; }
相关文章推荐
- Dynamics CRM 2016 Series: Overview
- 雅虎股票接口
- spring 定时任务的 执行时间设置规则
- mysql 导入、导出sql
- centos设置开机启动
- hdu1814Peaceful Commission【2-SAT】输出最小解
- 初探Backbone
- Android放大镜实现的两种方式
- zabbix 不能启动之非一般原因(配置的大意也可导致出错,也可以导致)
- 如何做优化,UITabelView才能更加顺滑
- js动画性能提升笔记
- 从MySQL获取数据
- MySQL事件的先后
- Android SlidingMenu 使用详解
- mysql查看执行计划
- (java)Evaluate Reverse Polish Notation
- mac上ide中无法获取环境变量的问题
- MTKandroid4.2.2编译环境OK
- Miku 修改背景音乐
- 使用fragment嵌套FragmentTabHost实现筛选切换框架