HDOJ 4122 Alice's mooncake shop
来源:互联网 发布:java怎么做界面 编辑:程序博客网 时间:2024/06/05 11:11
用单调队列维护一个每天的最低单价。。。
Alice's mooncake shop
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2663 Accepted Submission(s): 645
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.
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.
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 ith line( i starts from 1) contains a integer indicating the cost to make a mooncake during the ith hour . The cost is no more than 10000. Jan 1st 2000 0 o'clock belongs to the 1st hour, Jan 1st 2000 1 o'clock belongs to the 2nd 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.
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 ith line( i starts from 1) contains a integer indicating the cost to make a mooncake during the ith hour . The cost is no more than 10000. Jan 1st 2000 0 o'clock belongs to the 1st hour, Jan 1st 2000 1 o'clock belongs to the 2nd 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 10Jan 1 2000 9 105 220 20 20 10 1087 9 5 100 0
Sample Output
70Hint“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
2011 Asia Fuzhou Regional Contest
#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <deque>#include <algorithm>using namespace std;int N,M,S,T,cost,pos;long long int ANS;int day[2][13]={{0,31,59,90,120,151,181,212,243,273,304,334,365},{0,31,60,91,121,152,182,213,244,274,305,335,366}};char month[13][5]={"xxx","Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov" , "Dec"};int isrun(int x){ if(x==2000||x==2004||x==2008||x==2012||x==2016) return 1; else return 0;}struct ORDER{ int nb,ti;}Or[3000];struct Unitprice{ int t,p;};int getTime(char* m,int d,int y,int h){ int ret=0; for(int i=1;i<=12;i++) if(strcmp(m,month[i])==0) ret+=day[isrun(y)][i-1]; for(int i=2000;i<y;i++) ret+= (isrun(i))? 366:365; ret=(ret+d-1)*24+h; return ret;}int main(){while(scanf("%d%d",&N,&M)!=EOF&&N&&M){ for(int i=0;i<N;i++) { int day,year,hour,nb; char mo[5]; scanf("%s%d%d%d%d",mo,&day,&year,&hour,&nb); Or[i].nb=nb;Or[i].ti=getTime(mo,day,year,hour); } scanf("%d%d",&T,&S); deque<Unitprice> dq; pos=0;ANS=0; for(int i=0;i<M;i++) { scanf("%d",&cost); while(!dq.empty()) { Unitprice u=dq.back(); if((i-u.t)*S+u.p>=cost) dq.pop_back(); else break; } dq.push_back((Unitprice){i,cost}); while(!dq.empty()) { if((i-dq.front().t)>T) dq.pop_front(); else break; } while(pos<N&&Or[pos].ti==i) { ANS+=(long long int)((dq.front().p+(Or[pos].ti-dq.front().t)*S)*Or[pos].nb); pos++; } } printf("%I64d\n",ANS);}return 0;}
1 0
- HDOJ 4122 Alice's mooncake shop
- HDU 4122 Alice's mooncake shop
- HDU 4122 Alice's mooncake shop
- Hdu 4122 Alice's mooncake shop
- hdu 4122 Alice's mooncake shop题解
- hdu1402 Alice's mooncake shop
- HDU4122-Alice's mooncake shop
- HDU 4122--Alice's mooncake shop(单调队列)
- 单调队列-Hdu-4122-Alice's mooncake shop
- hdu 4122Alice's mooncake shop(单调队列)
- hdu 4122 Alice's mooncake shop(单调队列)
- HDU 4122 Alice's mooncake shop(RMQ:动态最值)
- hdu 4122 Alice's mooncake shop (线段树)
- hdu 4122 Alice's mooncake shop(单调队列)
- HDU 4122 Alice's mooncake shop 优先队列
- hdu 4122 Alice's mooncake shop(线段树RMQ)
- HDU 4122 Alice's mooncake shop --RMQ
- HDU 4122 Alice's mooncake shop // RMQ 线段树
- PMIPv6 Win7/Win8 address of ipv6 configuration
- linux学习笔记一:linux的基础知识
- 网络编程的知识小结
- IP地址排序
- JSP基础---setProperty和getProperty
- HDOJ 4122 Alice's mooncake shop
- glViewport()函数和glOrtho()函数的理解(转)
- 利用RGB-D数据进行人体检测 People detection in RGB-D data
- JavaBean详解---JavaBean的保存范围和删除JavaBean
- 题目1174:查找第K小数
- 自适应不同屏幕的资源
- Android--多线程之Handler
- hdu 1203 I NEED A OFFER!(概率dp)
- drawable文件夹详解