\u4f60\u6709\u4e00\u4e2a\u751f\u4ea7\u6708\u997c\u7684\u5de5\u5382\u3001\u6bcf\u5929\u7684\u751f\u4ea7\u6210\u672c\u90fd\u4e0d\u540c\u3001\u673a\u5668\u6bcf\u5929\u53ef\u4ee5\u751f\u4ea7\u65e0\u9650\u591a\u6708\u997c\uff0c \u8f93\u5165 M \u4e2a\u5c0f\u65f6\u3001\u4ee5\u53ca\u8fd9 M \u4e2a\u5c0f\u65f6\u5185\u5fb7\u6210\u672c\u3002
\n\u6708\u997c\u7684\u4fdd\u8d28\u671f\u4e3a T \u3001\u6bcf\u5c0f\u65f6\u7684\u7ef4\u62a4\u8d39\u7528\u4e3a S\u3002\u4ee5\u53ca n \u4e2a\u8ba2\u5355\uff0c\u6bcf\u4e2a\u8ba2\u5355\u8868\u793a ti \u65f6\u523b\u9700\u8981 ri \u5757\u6708\u997c\u3001\u6700\u5c0f\u5316\u751f\u4ea7\u6210\u672c\u3002
\n(. .. N <= 2500 .. .) ..\n\n<\/p>\n
Tags: \u8d2a\u5fc3\u3001\u5355\u8c03\u961f\u5217<\/p>\n
\u4e3b\u8981\u6ce8\u610f\u5230\u6bcf\u5929\u53ef\u4ee5\u751f\u4ea7\u65e0\u9650\u591a\u6708\u997c\u3002\uff08\u5426\u5219\u7684\u8bdd\u3002\u3002\uff09\u3002
\n\u56e0\u6b64\u53ea\u8981\u5728\u4fdd\u8d28\u671f\u8303\u56f4\u5185\u627e\u5230\u4e00\u4e2a\u6700\u4f4e\u6210\u672c\u5373\u53ef\u3002\u3002<\/p>\n
\u3002\u3002\u56e0\u4e3a N \u6bd4\u8f83\u5c0f\u3002\u3002\u6240\u4ee5\u53ef\u4ee5\u5728\u7ebf\u5904\u7406\u6bcf\u4e2a\u8bf7\u6c42\u3002\u3002
\n\u6ce8\u610f\u5c3d\u7ba1\u52a0\u5165\u4e86\u526a\u679d\u3002\u3002\u4e0b\u9762\u7684\u7b97\u6cd5\u8fd8\u662f\u4f1a\u5728 S = 0\uff0c T = M \u7684\u60c5\u51b5\u4e0b\u9000\u5316\u3002
\n\uff08\u4f46\u4f3c\u4e4e\u53ef\u4ee5\u4e13\u4e3a\u8fd9\u79cd\u60c5\u51b5\u6253\u4e00\u4e2a\u8865\u4e01\u3002\u3002\uff09<\/p>\n
\r\n\/** ` Micro Mezzo Macro Flation -- Overheated Economy ., **\/\r\n\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <iomanip>\r\n#include <sstream>\r\n#include <cstring>\r\n#include <complex>\r\n#include <cstdio>\r\n#include <string>\r\n#include <vector>\r\n#include <bitset>\r\n#include <queue>\r\n#include <stack>\r\n#include <cmath>\r\n#include <ctime>\r\n#include <list>\r\n#include <set>\r\n#include <map>\r\n\r\nusing namespace std;\r\n\r\n#define REP(i, n) for (int i=0;i<int(n);++i)\r\n#define FOR(i, a, b) for (int i=int(a);i<int(b);++i)\r\n#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i)\r\n#define REP_1(i, n) for (int i=1;i<=int(n);++i)\r\n#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)\r\n#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i)\r\n#define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_N(i, n) for (i=0;i<int(n);++i)\r\n#define FOR_N(i, a, b) for (i=int(a);i<int(b);++i)\r\n#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i)\r\n#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i)\r\n#define REP_1_N(i, n) for (i=1;i<=int(n);++i)\r\n#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)\r\n#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i)\r\n#define REP_C_N(i, n) for (n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C_N(i, a, b) for (b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C_N(i, b, a) for (a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_1_C_N(i, n) for (n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C_N(i, a, b) for (b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C_N(i, b, a) for (a____=int(a),i=b;i>=a____;--i)\r\n\r\n#define DO(n) while(n--)\r\n#define DO_C(n) int n____ = n; while(n____--)\r\n#define TO(i, a, b) int s_=a<b?1:-1,b_=b+s_;for(int i=a;i!=b_;i+=s_)\r\n#define TO_1(i, a, b) int s_=a<b?1:-1,b_=b;for(int i=a;i!=b_;i+=s_)\r\n#define SQZ(i, j, a, b) for (int i=int(a),j=int(b)-1;i<j;++i,--j)\r\n#define SQZ_1(i, j, a, b) for (int i=int(a),j=int(b);i<=j;++i,--j)\r\n#define REP_2(i, j, n, m) REP(i, n) REP(j, m)\r\n#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)\r\n\r\n#define ALL(A) A.begin(), A.end()\r\n#define LLA(A) A.rbegin(), A.rend()\r\n#define CPY(A, B) memcpy(A, B, sizeof(A))\r\n#define INS(A, P, B) A.insert(A.begin() + P, B)\r\n#define ERS(A, P) A.erase(A.begin() + P)\r\n#define BSC(A, X) find(ALL(A), X) \/\/ != A.end()\r\n#define CTN(T, x) (T.find(x) != T.end())\r\n#define SZ(A) int(A.size())\r\n#define PB push_back\r\n#define MP(A, B) make_pair(A, B)\r\n\r\n#define Rush int T____; RD(T____); DO(T____)\r\n#pragma comment(linker, "\/STACK:36777216")\r\n#pragma GCC optimize ("O2")\r\n#define Ruby system("ruby main.rb")\r\n#define Haskell system("runghc main.hs")\r\n#define Pascal system("fpc main.pas")\r\n\r\ntypedef long long LL;\r\ntypedef double DB;\r\ntypedef unsigned UINT;\r\ntypedef unsigned long long ULL;\r\n\r\ntypedef vector<int> VI;\r\ntypedef vector<char> VC;\r\ntypedef vector<string> VS;\r\ntypedef vector<LL> VL;\r\ntypedef vector<DB> VD;\r\ntypedef set<int> SI;\r\ntypedef set<string> SS;\r\ntypedef set<LL> SL;\r\ntypedef set<DB> SD;\r\ntypedef map<int, int> MII;\r\ntypedef map<string, int> MSI;\r\ntypedef map<LL, int> MLI;\r\ntypedef map<DB, int> MDI;\r\ntypedef map<int, bool> MIB;\r\ntypedef map<string, bool> MSB;\r\ntypedef map<LL, bool> MLB;\r\ntypedef map<DB, bool> MDB;\r\ntypedef pair<int, int> PII;\r\ntypedef pair<int, bool> PIB;\r\ntypedef vector<PII> VII;\r\ntypedef vector<VI> VVI;\r\ntypedef vector<VII> VVII;\r\ntypedef set<PII> SII;\r\ntypedef map<PII, int> MPIII;\r\ntypedef map<PII, bool> MPIIB;\r\n\r\n\r\n\/** I\/O Accelerator **\/\r\n\r\n\/* ... :" We are I\/O Accelerator ... Use us at your own risk ;) ... " .. *\/\r\n\r\ntemplate<class T> inline void RD(T &);\r\ntemplate<class T> inline void OT(const T &);\r\n\r\ninline int RD(){ int x; RD(x); return x;}\r\ntemplate<class T> inline T& _RD(T &x){ RD(x); return x;}\r\ninline void RC(char &c){scanf(" %c", &c);}\r\ninline void RS(char *s){scanf("%s", s);}\r\n\r\ntemplate<class T0, class T1> inline void RD(T0 &x0, T1 &x1){RD(x0), RD(x1);}\r\ntemplate<class T0, class T1, class T2> inline void RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6);}\r\ntemplate<class T0, class T1> inline void OT(T0 &x0, T1 &x1){OT(x0), OT(x1);}\r\ntemplate<class T0, class T1, class T2> inline void OT(T0 &x0, T1 &x1, T2 &x2){OT(x0), OT(x1), OT(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}\r\n\r\ntemplate<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}\r\ntemplate<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}\r\ntemplate<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);}\r\n\r\ntemplate<class T> inline void CLR(T &A){A.clear();}\r\ntemplate<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}\r\ntemplate<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);}\r\ntemplate<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);}\r\ntemplate<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}\r\ntemplate<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);}\r\ntemplate<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2){FLC(A0), FLC(A1), FLC(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3){FLC(A0), FLC(A1), FLC(A2), FLC(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5), FLC(A6);}\r\n\r\ntemplate<class T> inline void SRT(T &A){sort(ALL(A));}\r\ntemplate<class T, class C> inline void SRT(T &A, C B){sort(ALL(A), B);}\r\n\r\n\r\n\r\n\r\n\/** Add - On **\/\r\n\r\nconst int MOD = 1000000007;\r\nconst int INF = 0x7fffffff;\r\nconst DB EPS = 1e-6;\r\nconst DB OO = 1e15;\r\nconst DB PI = acos(-1.0);\r\n\r\n\/\/ <<= ` 0. Daily Use .,\r\n\r\ntemplate<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}\r\ntemplate<class T> inline void checkMax(T &a,const T b){if (b>a) a=b;}\r\ntemplate <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}\r\ntemplate <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}\r\ntemplate<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}\r\ntemplate<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}\r\ntemplate<class T> inline T sqr(T a){return a*a;}\r\ntemplate<class T> inline T cub(T a){return a*a*a;}\r\nint Ceil(int x, int y){return (x - 1) \/ y + 1;}\r\n\r\n\/\/ <<= ` 1. Bitwise Operation .,\r\n\r\ninline bool _1(int x, int i){return x & 1<<i;}\r\ninline int _1(int i){return 1<<i;}\r\ninline int _U(int i){return _1(i) - 1;};\r\n\r\ninline int count_bits(int x){\r\n x = (x & 0x55555555) + ((x & 0xaaaaaaaa) >> 1);\r\n x = (x & 0x33333333) + ((x & 0xcccccccc) >> 2);\r\n x = (x & 0x0f0f0f0f) + ((x & 0xf0f0f0f0) >> 4);\r\n x = (x & 0x00ff00ff) + ((x & 0xff00ff00) >> 8);\r\n x = (x & 0x0000ffff) + ((x & 0xffff0000) >> 16);\r\n return x;\r\n}\r\n\r\ntemplate<class T> inline T low_bit(T x) {\r\n return x & -x;\r\n}\r\n\r\ntemplate<class T> inline T high_bit(T x) {\r\n T p = low_bit(x);\r\n while (p != x) x -= p, p = low_bit(x);\r\n return p;\r\n}\r\n\r\n\/\/ <<= ` 2. Modular Arithmetic Basic .,\r\n\r\ninline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;}\r\ninline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;}\r\ninline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;}\r\ninline int dff(int a, int b){a -= b; if (a < 0) a += MOD; return a;}\r\ninline void MUL(int &a, int b){a = int((LL)a * b % MOD);}\r\ninline int pdt(int a, int b){return int((LL)a * b % MOD);}\r\n\r\n\r\n\/\/ <<= ' 0. I\/O Accelerator interface .,\r\n\r\ntemplate<class T> inline void RD(T &x){\r\n \/\/cin >> x;\r\n scanf("%d", &x);\r\n \/\/char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';\r\n \/\/char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';\r\n\r\n}\r\n\r\nint ____Case;\r\ntemplate<class T> inline void OT(const T &x){\r\n \/\/cout << x << endl;\r\n printf("%.4lf\\n", x);\r\n \/\/printf("%.2lf\\n", x);\r\n \/\/printf("Case %d: %d\\n", ++____Case, x);\r\n}\r\n\r\n\r\n#define For_each(it, A) for (SII::iterator it = A.begin(); it != A.end(); ++it)\r\n\r\n\/* .................................................................................................................................. *\/\r\n\r\nconst char Month[12][4] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};\r\nconst int Days[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};\r\n\r\n\r\n\r\nconst int N = 2509, M = 100009;\r\n\r\nint c[M], t[N], r[N], T, S;\r\nint n, m;\r\n\r\nchar str[4]; int d, y;\r\n#define h t[x]\r\nint leap(int y){\r\n return y % 400 == 0 || y % 4 == 0 && y % 100 != 0;\r\n}\r\n\r\nvoid get_order(int x){\r\n RS(str); RD(d, y); RD(h, r[x]);\r\n\r\n FOR(i, 2000, y){\r\n if (leap(i)) h += 366 * 24;\r\n else h += 365 * 24;\r\n }\r\n\r\n REP(i, 12) {\r\n if (!strcmp(Month[i], str)) break;\r\n if (i == 1) h += 24 * (leap(y) ? 29 : 28);\r\n else h += 24 * Days[i];\r\n }\r\n\r\n h += 24 * (d - 1);\r\n}\r\n\r\nint main(){\r\n\r\n \/\/freopen("in.txt", "r", stdin);\r\n\r\n while (scanf("%d %d", &n, &m) != EOF && n){\r\n\r\n REP(i, n) get_order(i); RD(T, S); REP(i, m) RD(c[i]);\r\n\r\n LL ans = 0; REP(i, n){\r\n LL s = 0, cur = INF; DWN_1_C(j, t[i], max(0, t[i] - T)){\r\n if (s > cur) break; checkMin(cur, s + c[j]);\r\n s += S;\r\n }\r\n ans += cur * r[i];\r\n }\r\n\r\n cout << ans << endl;\r\n }\r\n}\r\n<\/pre>\nExternal link: <\/h3>\n