语法
2016-07-05 22:58
429 查看
暑期(二)
984:35:36
1200:00:00
Overview
Problem
Status
Rank (45)
A B C D E F G H I J K L M N O P Q R S T
K - K
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
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
Output
Input
Output
Input
Output
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.
输入原来还可以不用输入完 好神奇
代码真好
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
int main(int argc,char *argv[])
{
int i,j,a,b,c,d,n;
scanf("%d",&n);
for(i=1;i<=4;++i)
{
scanf("%d %d %d %d",&a,&b,&c,&d);
if(a>b)
{
a=b;
}
if(c>d)
{
c=d;
}
if(n>=a+c)
{
printf("%d %d %d\n",i,a,n-a);
return 0;
}
}
printf("-1\n");
return 0;
}
984:35:36
1200:00:00
Overview
Problem
Status
Rank (45)
A B C D E F G H I J K L M N O P Q R S T
K - K
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
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.
输入原来还可以不用输入完 好神奇
代码真好
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
int main(int argc,char *argv[])
{
int i,j,a,b,c,d,n;
scanf("%d",&n);
for(i=1;i<=4;++i)
{
scanf("%d %d %d %d",&a,&b,&c,&d);
if(a>b)
{
a=b;
}
if(c>d)
{
c=d;
}
if(n>=a+c)
{
printf("%d %d %d\n",i,a,n-a);
return 0;
}
}
printf("-1\n");
return 0;
}
相关文章推荐
- 2016/07/05 zend optimizer
- kvm虚似机监控
- Codeforces Round #359 (Div. 2) C DFS
- PHP开发中最常见的10个错误
- 优化MySQL中的分页
- HotSpot虚拟机发起内存回收
- LA-4064(极角排序)
- bit、byte、位、字节、字符串等概念
- 上传伪技术~很多人都以为判断了后缀,判断了ContentType,判断了头文件就真的安全了。是吗?
- Python MySQL操作
- 看完后,搞懂ARP的工作原理,其实并不难!
- Spring Data JPA学习
- 学习JAVA回调方法(一)
- JavaScript 遍历DOM
- JavaScript 遍历DOM
- Spark RDD中cache和persist的区别
- 软工课设第二周第二天 7.5
- c traps and pitfalls reading note(1)
- android 数据存储操作之SQLite
- 查看一些特定sql需求的书写