zoukankan      html  css  js  c++  java
  • Tickets

    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. 

    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

    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<queue>
    #include<algorithm>
    using namespace std;
    int a[10001];
    int b[10001];
    int dp[10001];
    int main()
    {
    	int t;
    	scanf("%d",&t);
    	while(t--)
    	{
    		int n;
    		scanf("%d",&n);
    		for(int i=1;i<=n;i++)
          	{
    		scanf("%d",&a[i]);
         	}
    	      for(int i=2;i<=n;i++)
    	     {
    	  		  	scanf("%d",&b[i]);
    	       }
    	     dp[0]=0;
    	    dp[1]=a[1];
    	    for(int i=2;i<=n;i++)
    	    {
    	    	dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i]);
    		}
    		int sum=dp[n];
    		int shi=sum/3600;
    		   sum=sum%3600;
    		   int fen=sum/60;
    		     int miao =sum%60;
    		   printf("%02d:%02d:%02d ",shi+8>12? shi+8-12:shi+8,fen,miao);
    		   printf("%s
    ",shi+8>12? "pm":"am");
    	}
    	return 0;
    }


  • 相关阅读:
    cento7快速修改主机名和修改root密码
    [goolegke]nginxingress建立测试
    filebeat安装读取nginx json日志
    MySQL索引背后的数据结构及算法原理
    Lua脚本在redis分布式锁场景的运用
    Sentinel实现限流
    java架构技术流程图
    mybatis数据加解密处理方案
    vue 自定义代码片段
    node项目vue 自动化部署之pm2
  • 原文地址:https://www.cnblogs.com/kingjordan/p/12027075.html
Copyright © 2011-2022 走看看