Alice's mooncake shop
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3340 Accepted Submission(s): 843
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.
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.
Jan 1 2000 9 10
5 2
20
20
20
10
10
8
7
9
5
10
0 0
“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.
开始没读懂题意，后来闰年天数弄错了，再后来二月天数弄错了，最后没有清零，最终A的时候我也是醉了。。。
单调队列
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define ll long long
#define _cle(m, a) memset(m, a, sizeof(m))
#define repu(i, a, b) for(int i = a; i < b; i++)
#define repd(i, a, b) for(int i = b; i >= a; i--)
#define sfi(n) scanf("%d", &n)
#define sfl(n) scanf("%I64d", &n)
#define pfi(n) printf("%d\n", n)
#define pfl(n) printf("%I64d\n", n)
#define MAXN 1000005 string mon[] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
ll py[] = {, , , , , , , , , , , };
ll ny[] = {, , , , , , , , , , , };
ll ppy[];
ll nny[];
ll dy[MAXN];
map<string, ll> mh;
struct P{
ll hh, rr;
P(ll _h = , ll _w = ) : hh(_h), rr(_w) {}
bool operator < (const P& t) const
{
return hh > t.hh;
}
}order[];
struct W{
ll t, w;
W(ll _t = , ll _w = ) : t(_t), w(_w) {}
};
queue<P> O;
deque<W> T;
void get_np()
{
ppy[] = ;
repu(i, , ) ppy[i] = py[i - ] + ppy[i - ];
nny[] = ;
repu(i, , ) nny[i] = ny[i - ] + nny[i - ];
} void get_m()
{
for(int i = ; i < ; i++)
mh[mon[i]] = i + ;
} bool is_y(int year)
{
if(year % == ) return true;
if(year % == )
{
if(year % == ) return false;
else return true;
}
return false;
} void get_d()
{
dy[] = ;
for(int i = ; ; i++)
{
if(is_y(i)) dy[i - + ] = dy[i - ] + ;
else dy[i - + ] = dy[i - ] + ;
if(dy[i - + ] > ) return ;
//cout<<i - 2000 + 1<<" : "<<dy[i - 2000 + 1]<<endl;
}
} int main()
{
get_d();
get_m();
get_np();
ll n, m;
string s;
ll mm, yy, dd, hh, rr, tt;
ll life, cost;
while(sfl(n), sfl(m), n + m)
{
T.clear();
repu(i, , n)
{
tt = ;
cin>>s;
scanf("%I64d %I64d %I64d %I64d", &dd, &yy, &hh, &rr);
mm = mh[s];
tt += dy[yy - ];
if(is_y(yy))
tt += ppy[mm - ];
else tt += nny[mm - ];
tt += (dd - );
tt = tt * (ll)();
tt += (hh + );
O.push(P(tt, rr));
//cout<<tt<<"**************"<<rr<<endl;
}
sfl(life), sfl(cost);
ll x;
ll sum = ;
repu(i, , m + )
{
sfl(x);
while(!T.empty() && x <= T.back().w + (i - T.back().t) * cost)
T.pop_back();
T.push_back(W(i, x));
while(!O.empty() && O.front().hh == i)
{
while(!T.empty() && (i - T.front().t) > life)
T.pop_front();
sum += O.front().rr * (T.front().w + cost * (i - T.front().t));
O.pop();
}
}
pfl(sum);
}
return ;
}