Hdu4122 Alice's mooncake shop monotonous queue

Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 4122

Alice's mooncake shop Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission (s): 2908 Accepted Submission (s): 744


Problem DescriptionThe 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" (circle) 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 =, 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.
InputThe input contains no more than 10 test cases.
For each test case:
The first line between Des 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 cocould 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.
OutputYou shoshould 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 shoshould use 64-bit signed integers. the answer will fit into a 64-bit signed integer.

 
Source2011 Asia Fuzhou Regional Contest

A mooncake shop only works on the hour. You can make any number of moon cakes on the hour. However, the cost for making moon cakes at different times is different. And if a mooncake is ready for storage. S will be consumed per hour. However, the storage time cannot exceed T. The maximum time m is provided for the store. And n orders. Ask the minimum cost for completing the order.

Idea: A simple monotonous queue. After the date is processed as an hour, it is good to maintain the minimum value with a monotonous queue. The queue header is added to a new time point, and the end of the queue is deleted to expire. Note that there will be orders at the same time point.

/*** @ Author neko01 * // # pragma comment (linker, "/STACK: 102400000,102400000") # include <cstdio> # include <cstring> # include <string. h> # include <iostream> # include <algorithm> # include <queue> # include <vector> # include <cmath> # include <set> # include <map> using namespace std; typedef long LL; # define min3 (a, B, c) min (a, min (B, c) # define max3 (a, B, c) max (, max (B, c) # define pb push_back # define mp (a, B) make_p Air (a, B) # define clr (a) memset (a, 0, sizeof a) # define clr1 (a) memset (a,-1, sizeof) # define dbg (a) printf ("% d \ n", a) typedef pair <int, int> pp; const double eps = 1e-8; const double pi = acos (-1.0); const int INF = 0x7fffffff; const LL inf = (LL) 1) <61) + 5; char s [12] [5] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul ", "Aug", "Sep", "Oct", "Nov", "Dec"}; int day [12] = {31,28, 31,30, 31,30, 31,31, 30,31, 30,31}; struct node {int h, r;} [2555]; bool check (int y) {return (y % 4 = 0 & y % 100! = 0) | y % 400 = 0);} int input () {char str [5]; int d, y, h; scanf ("% s % d", str, & d, & y, & h); int t = 0, tmp = 0, m = 1; for (int I = 2000; I <y; I ++) {if (check (I) t + = 24*366; else t + = 24*365 ;} if (check (y) day [1] = 29; else day [1] = 28; for (int I = 0; I <12; I ++) {if (strcmp (s [I], str) = 0) {m = I + 1; break;} tmp + = day [I];} t = t + (tmp + D-1) * 24 + h + 1; return t;} int q [111111]; int p [111111]; int main () {int n, m; while (~ Scanf ("% d", & n, & m) {if (n = 0 & m = 0) break; for (int I = 0; I <n; I ++) {a [I]. h = input (); scanf ("% d", & a [I]. r); // printf ("% d \ n", a [I]. h) ;}int t, s; scanf ("% d", & t, & s); int front = 0, rear = 0, j = 0; LL ans = 0; for (int I = 1; I <= m; I ++) {scanf ("% d", & p [I]); while (front <rear & p [I] <= p [q [rear-1] + (I-q [rear-1]) * s) rear --; q [rear ++] = I; while (j <n & I = a [j]. h) {while (q [front] + t <a [j]. h) front ++; // expired ans + = a [j]. r * (p [q [front] + (I-q [front]) * s); j ++ ;}} printf ("% I64d \ n ", ans);} return 0 ;}

Hdu4122 Alice's mooncake shop monotonous queue