hdu4122(单调队列)

hdu4122(单调队列)

 

处理题目中给的日期,然后用单调队列维护

Alice’s mooncake shop

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1925    Accepted Submission(s): 468

Problem Description
The Mid-Autumn Festival, also known as the Moon Festival or Zhongqiu Festival is a popular harvest festival celebrated by Chinese people, dating back over 3,000 years to moon worship in China’s Shang Dynasty. The Zhongqiu Festival is held on the 15th day of the eighth month in the Chinese calendar, which is in September or early October in the Gregorian calendar. It is a date that parallels the autumnal equinox of the solar calendar, when the moon is at its fullest and roundest. 



hdu4122(单调队列)


The traditional food of this festival is the mooncake. Chinese family members and friends will gather to admire the bright mid-autumn harvest moon, and eat mooncakes under the moon together. In Chinese, “round”(圆) also means something like “faultless” or “reuion”, so the roundest moon, and the round mooncakes make the Zhongqiu Festival a day of family reunion.

Alice has opened up a 24-hour mooncake shop. She always gets a lot of orders. Only when the time is K o’clock sharp( K = 0,1,2 …. 23) she can make mooncakes, and We assume that making cakes takes no time. Due to the fluctuation of the price of the ingredients, the cost of a mooncake varies from hour to hour. She can make mooncakes when the order comes,or she can make mooncakes earlier than needed and store them in a fridge. The cost to store a mooncake for an hour is S and the storage life of a mooncake is T hours. She now asks you for help to work out a plan to minimize the cost to fulfill the orders.

 

 

Input
The input contains no more than 10 test cases. 

For each test case:

The first line includes two integers N and M. N is the total number of orders. M is the number of hours the shop opens. 

The next N lines describe all the orders. Each line is in the following format:

month date year H R

It means that on a certain date, a customer orders R mooncakes at H o’clock. “month” is in the format of abbreviation, so it could be “Jan”, “Feb”, “Mar”, “Apr”, “May”, “Jun”, “Jul”, “Aug”, “Sep”, “Oct”, “Nov” or “Dec”. H and R are all integers. 

All the orders are sorted by the time in increasing order. 

The next line contains T and S meaning that the storage life of a mooncake is T hours and the cost to store a mooncake for an hour is S.

Finally, M lines follow. Among those M lines, the i
th line( i starts from 1) contains a integer indicating the cost to make a mooncake during the i
th hour . The cost is no more than 10000. Jan 1st 2000 0 o’clock belongs to the 1
st hour, Jan 1st 2000 1 o’clock belongs to the 2
nd hour, …… and so on.

(0<N <= 2500; 0 < M,T <=100000; 0<=S <= 200; R<=10000 ; 0<=H<24)

The input ends with N = 0 and M = 0.

 

 

Output
You should output one line for each test case: the minimum cost. 
 

 

Sample Input
1 10 Jan 1 2000 9 10 5 2 20 20 20 10 10 8 7 9 5 10 0 0

 

 

Sample Output
70

Hint

“Jan 1 2000 9 10” means in Jan 1st 2000 at 9 o’clock , there’s a consumer ordering 10 mooncakes. Maybe you should use 64-bit signed integers. The answer will fit into a 64-bit signed integer.

 

 

Source
 

 

Recommend
lcy
 

 

#include <stdio.h> #include <stdlib.h> #include <string.h> #include <algorithm> #include <math.h> #include <map> #include <queue> #include <sstream> #include <iostream> using namespace std; #define INF 0x3fffffff //#define __int64 long long int typedef __int64 LL; struct Day { int y,m,d,h,ned; }k[2555]; struct node { int time; LL key; }que[110000]; int n,mm; LL mark[110000]; int save[13]={ 0,31,28,31,30,31,30,31,31,30,31,30,31}; int t,c; int g[100100]; int change(string tmp) { if(tmp=="Jan") return 1; if(tmp=="Feb") return 2; if(tmp=="Mar") return 3; if(tmp=="Apr") return 4; if(tmp=="May") return 5; if(tmp=="Jun") return 6; if(tmp=="Jul") return 7; if(tmp=="Aug") return 8; if(tmp=="Sep") return 9; if(tmp=="Oct") return 10; if(tmp=="Nov") return 11; if(tmp=="Dec") return 12; } int main() { //freopen("//home//chen//Desktop//ACM//in.text","r",stdin); //freopen("//home//chen//Desktop//ACM//out.text","w",stdout); while(scanf("%d%d",&n,&mm)&&(n+mm)) { memset(mark,0,sizeof(mark)); for(int i=0;i<n;i++) { string tmp; cin>>tmp; scanf("%d%d%d%d",&k[i].d,&k[i].y,&k[i].h,&k[i].ned); k[i].m=change(tmp); } int y=2000,d=1,m=1,h=0; int cnt=0; int num=0; while(1) { cnt++; while(k[num].y==y&&k[num].h==h&&k[num].m==m&&k[num].d==d) { mark[cnt]+=k[num].ned; num++; } if(num==n) break; if( (y%400==0)||(y%4==0&&y%100!=0)) save[2]=29; h++; if(h>=24) { h=0; d++; } if(d>save[m]) { d=1; m++; } if(m>12) { m=1; y++; } save[2]=28; } /// scanf("%d%d",&t,&c); for(int i=1;i<=mm;i++) scanf("%d",g+i); LL sum=0; LL base=0; int qf=0,qd=0; /* for(int i=1;i<=t;i++) { base += c; LL cur=g[i]-base; while(qf>qd&&cur<que[qf-1].key) qf--; //入队 que[qf].key=cur; que[qf].time=i; qf++; if(mark[i]!=0) { sum += (que[qd].key+base)*(LL)mark[i]; } }*/ for(int i=1;i<=mm;i++) { base+=c; LL cur=g[i]-base; while(qf>qd && cur<que[qf-1].key) qf--; que[qf].key=cur; que[qf].time=i; qf++; ///// int k=i-t; k=max(1,k); while(qf>qd && que[qd].time<k ) qd++; if(mark[i]!=0) sum +=( (que[qd].key+base)*mark[i]); } cout<<sum<<endl; } return 0; }

 

版权声明:本文内容由互联网用户自发贡献,该文观点仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 举报,一经查实,本站将立刻删除。

发布者:全栈程序员-用户IM,转载请注明出处:https://javaforall.cn/110078.html原文链接:https://javaforall.cn

【正版授权,激活自己账号】: Jetbrains全家桶Ide使用,1年售后保障,每天仅需1毛

【官方授权 正版激活】: 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...

(0)
blank

相关推荐

  • pycharm安装后运行不了_pycharm上无法安装各种库

    pycharm安装后运行不了_pycharm上无法安装各种库原博客链接:http://blog.csdn.net/qingyuanluofeng/article/details/46501427问题:pycharm安装后不能执行python脚本。我的是执行后老是报错,但是之前在cpython中都是可以的。于是上网查询解决方法原因:pycharm没有设置解析器/解释器设置错误(我的就是因为这个之前设置错了,位置也是错的,结果导致程序不能正常运行出

  • Java 冒泡排序

    Java 冒泡排序Java冒泡排序冒泡排序是最为出名的排序算法之一,总共有八大排序!直接插入排序希尔排序简单选择排序堆排序冒泡排序快速排序归并排序基数排序冒泡排序还是比较简单的,两次循环吗,外层冒泡轮数,里层依次比较。上代码packageArrays;importjava.util.Arrays;/***冒泡排序*1.比较数组中,两个相邻的元素,如果第一个数比第二个大,我们就让它们交换位置*2.每一次比较,都会产生一个最大的,或者最小的数字*3.下

  • c++并发编程实战 豆瓣_c++11并发编程

    c++并发编程实战 豆瓣_c++11并发编程一个简单的线程程序#include <iostream>#include <thread>using namespace std;void hello(){ std::cout << “Hello Concurrent World\n”;}int main(){ thread t(hello); t.join();}…

  • php删除数组中指定的元素,php如何删除数组中指定的元素?

    php删除数组中指定的元素,php如何删除数组中指定的元素?php删除数组中指定元素的方法:1、使用【array_splice()】函数删除,代码为【$key=array_search(3,$arr1)】;2、使用【unset()】函数删除,代码为【unset($arr2[$key])】。php删除数组中指定元素的方法:方法一,使用array_splice()删除:代码如下:…

  • python从字符串中提取数字

    1、使用正则表达式,用法如下:##总结##^匹配字符串的开始。##$匹配字符串的结尾。##\b匹配一个单词的边界。##\d匹配任意数字。##\D匹配任意非数字字符。##x?匹配一个可选的x字符(换言之,它匹配1次或者0次x字符)。##x*匹配0次或者多次x字符。##x+匹配1次或者多次x字符。##x{n,m}匹配…

  • SpringBoot中的@ApiModelProperty注解

    @ApiModelProperty()注解用于方法、字段,表示对model属性的说明或者数据操作更改,以下是它的源码://IntelliJAPIDecompilerstubsourcegeneratedfromaclassfile//Implementationofmethodsisnotavailablepackageio.s…

发表回复

您的电子邮箱地址不会被公开。

关注全栈程序员社区公众号