Tickets
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 2 Accepted Submission(s) : 2
Problem Description
Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as possible.
A good approach, reducing the total time of tickets selling, is let adjacent people buy tickets together. As the restriction of the Ticket Seller Machine, Joe can sell a single ticket or two adjacent tickets at a time.
Since you are the great JESUS, you know exactly how much time needed for every person to buy a single ticket or two tickets for him/her. Could you so kind to tell poor Joe at what time could he go back home as early as possible? If so, I guess Joe would full of appreciation for your help.
A good approach, reducing the total time of tickets selling, is let adjacent people buy tickets together. As the restriction of the Ticket Seller Machine, Joe can sell a single ticket or two adjacent tickets at a time.
Since you are the great JESUS, you know exactly how much time needed for every person to buy a single ticket or two tickets for him/her. Could you so kind to tell poor Joe at what time could he go back home as early as possible? If so, I guess Joe would full of appreciation for your help.
Input
There are N(1<=N<=10) different scenarios, each scenario consists of 3 lines: 1) An integer K(1<=K<=2000) representing the total number of people; 2) K integer numbers(0s<=Si<=25s) representing the time consumed to buy a ticket for each person; 3) (K-1) integer numbers(0s<=Di<=50s) representing the time needed for two adjacent people to buy two tickets together.
Output
For every scenario, please tell Joe at what time could he go back home as early as possible. Every day Joe started his work at 08:00:00 am. The format of time is HH:MM:SS am|pm.
Sample Input
2 2 20 25 40 1 8
Sample Output
08:00:40 am 08:00:08 am
Source
浙江工业大学第四届大学生程序设计竞赛
说的是 n个人排队买票,要么 一个一个来,要么每两个结合成一个来但是时间会变 求最快的时间 早上八点开始上班,附代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int num[110000],dp[110000],i,j,k,l,m,n,p,cnt[110000],help[110000],cmt;
int main()
{
scanf("%d",&p);
while(p--)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&num[i]);
for(i=2;i<=n;i++)
scanf("%d",&cnt[i]);
memset(help,0,sizeof(help));
dp[1]=num[1];
for(i=2;i<=n;i++)
dp[i]=min(dp[i-1]+num[i],dp[i-2]+cnt[i]);
// k=-k;
int hour=dp[n]/3600;
int minute=dp[n]/60-hour*60;
int scend=dp[n]%60;
printf("%02d:%02d:%02d %s\n",hour+8,minute,scend,(hour+8)%24>12?"pm":"am");
}
}