\n\u8981\u6c42\u6ee1\u8db3\u9650\u5236\u6761\u4ef6 Fi <= Ci && Gi <= Ei.. \u5176\u4e2d Gi \u4e3a\u8986\u76d6\u3001\u67d0\u70b9\u7684\u6240\u6709 Fi \u7684\u6743\u503c\u548c\u3002\n\u6700\u5927\u5316 |F| \u3002\u3002\u3002\n\n
![\"\"](\"https:\/\/www.shuizilong.com\/house\/wp-content\/uploads\/2011\/09\/1.png\" "\\"1\\"")
<\/a><\/p>\n<\/p>\n
Analysis :<\/h3>\n
… \u8fd9\u9898\u9898\u76ee\u6bd4\u8f83\u957f\uff0c\u800c\u4e14\u6709\u5f88\u591a\u5360\u661f\u5b66\u672f\u8bed\u3002\u3002\u5f88\u591a\u62c9\u4e01\u8bed\u7684\u540d\u8bcd\u4e4b\u7c7b\u3002\u3002.. \uff08\u770b\u6765\u51fa\u9898\u4eba\u548c\u6211\u6709\u540c\u6837\u7684\u8da3\u5473\u3002\u3002\u3002\u4e48\uff1f\uff09 .. \u4e4b\u540e\u5c31\u62bd\u8c61\u6210\u4e86 Brief description \u4e2d\u6240\u8ff0\u7684\u56fe\u8bba\u95ee\u9898\uff0cyy \u4e86 30 \u5206\u949f\u5404\u79cd\u7f51\u7edc\u6d41\u5efa\u6a21\u4f46\u662f\u65e0\u679c\u3002\u3002\u4e8e\u662f\u3002\u3002\u3002 \u3002\u3002\uff08\u5f3a\u70c8\u819c\u62dc First Blood \u662f\u6570\u636e\u7ed3\u6784\u7684\u6570\u636e\u7ed3\u6784\u5e1d cwj \u3002\u3002\uff09\u3002\u3002<\/a><\/p>\n http:\/\/acmicpc.info\/archives\/383<\/a> .. . Brief description : \u7ed9\u5b9a\u4e00\u526f \u70b9\u6743 Ei\u3001\u8fb9\u6743 Ci \u7684\u65e0\u5411\u56fe\uff0c\u73b0\u5728\u8981\u6c42\u5bf9\u6bcf\u6761\u8fb9\uff0c\u5bf9\u5e94\u4e00\u4e2a\u6536\u76ca\u51fd\u6570 Fi\uff0c \u8981\u6c42\u6ee1\u8db3\u9650\u5236\u6761\u4ef6 Fi<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[34],"tags":[37,36],"class_list":["post-48","post","type-post","status-publish","format-standard","hentry","category-34","tag-37","tag-36"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-M","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/48","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=48"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/48\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=48"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=48"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=48"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\n\u53e6\u4e00\u65b9\u9762\uff0c\u4e00\u4e9b\u5e38\u89c1\u5355\u8bcd\u53ef\u80fd\u9700\u8981\u989d\u5916\u8fa8\u89c6\u3002\u3002\u4f8b\u5982\uff0c”aspect<\/a>” \u5728\u8fd9\u9898\u4e2d\u5f97\u542b\u4e49\u662f\uff1a
\n…
\n\u3010\u5929\u6587\u5b66\u3001\u5360\u661f\u672f\u3011<\/p>\n\n
\n\u6240\u4ee5\u9996\u5148\u8981\u628a\u9898\u610f\u68b3\u7406\u6e05\u695a\u3002\u3002\u3002\u503c\u5f97\u4e00\u9898\u7684\u662f\u8fd9\u9898\u4e2d\u5f97\u56fe\u3002\u3002\u753b\u7684\u975e\u5e38\u6f02\u4eae\uff01\u3002\u3002<\/p>\n<\/a><\/p>\n
\n\u3002\u3002\u641c\u7d22\u526a\u679d\u5427\u3002\u3002\u3002<\/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 <cstdio>\r\n#include <string>\r\n#include <vector>\r\n#include <bitset>\r\n#include <queue>\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\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\/** Add - On **\/\r\n\r\nconst int MOD = 360;\r\nconst int INF = 0x7fffffff;\r\nconst DB PI = acos(-1.0);\r\nconst DB EPS = 1e-6;\r\nconst DB OO = 1e15;\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 = (LL)a * b % MOD;}\r\ninline int pdt(int a, int b){return (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("%d\\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 int N = 10, M = N * N;\r\n\r\nmap<string, int> Star, Sign;\r\n\r\nstruct Vertex{\r\n int e, c, p;\r\n} V[N];\r\n\r\nstruct Edge{\r\n int x, y, c;\r\n int cc(){\r\n return min(c, V[x].e, V[y].e);\r\n }\r\n} E[M];\r\n\r\nint ans, cur;\r\nint m;\r\n\r\n\r\nvoid Init(){\r\n Star["Sun"] = 0, Star["Moon"] = 1, Star["Mercury"] = 2, Star["Venus"] = 3;\r\n Star["Mars"] = 4, Star["Jupiter"] = 5, Star["Saturn"] = 6, Star["Uranus"] = 7;\r\n Star["Neptune"] = 8, Star["Pluto"] = 9;\r\n\r\n Sign["Aries"] = 0, Sign["Taurus"] = 1, Sign["Gemini"] = 2, Sign["Cancer"] = 3,\r\n Sign["Leo"] = 4, Sign["Virgo"] = 5, Sign["Libra"] = 6, Sign["Scorpio"] = 7,\r\n Sign["Sagittarius"] = 8, Sign["Capricorn"] = 9, Sign["Aquarius"] = 10, Sign["Pisces"] = 11;\r\n}\r\n\r\nvoid Build_Graph(){\r\n\r\n string star, sign;\r\n int a, b, d;\r\n\r\n DO_C(N){\r\n cin >> star >> sign >> d; a = Star[star], b = Sign[sign];\r\n\r\n V[a].e = 5, V[a].c = 3, V[a].p = b * 30 + d;\r\n\r\n \/\/ Star State: Rise, Fall, Exalt && Debilitate\r\n\r\n#define Rise V[a].e += 3\r\n#define Fall V[a].e -= 3\r\n#define Exalt V[a].c += 2\r\n#define Debilitate V[a].c -= 2\r\n\r\n if (star == "Sun"){\r\n if (sign == "Leo") Rise;\r\n else if (sign == "Aquarius") Fall;\r\n else if (sign == "Aries") Exalt;\r\n else if (sign == "Libra") Debilitate;\r\n }\r\n else if (star == "Moon"){\r\n if (sign == "Cancer") Rise;\r\n else if (sign == "Capricorn") Fall;\r\n else if (sign == "Taurus") Exalt;\r\n else if (sign == "Scorpio") Debilitate;\r\n }\r\n else if (star == "Mercury"){\r\n if (sign == "Gemini" || sign == "Virgo") Rise;\r\n else if (sign == "Sagittarius" || sign == "Pisces") Fall;\r\n else if (sign == "Aquarius") Exalt;\r\n else if (sign == "Leo") Debilitate;\r\n }\r\n else if (star == "Venus"){\r\n if (sign == "Taurus" || sign == "Libra") Rise;\r\n else if (sign == "Scorpio" || sign == "Aries") Fall;\r\n else if (sign == "Pisces") Exalt;\r\n else if (sign == "Virgo") Debilitate;\r\n }\r\n else if (star == "Mars"){\r\n if (sign == "Aries" || sign == "Scorpio") Rise;\r\n else if (sign == "Libra" || sign == "Taurus") Fall;\r\n else if (sign == "Capricorn") Exalt;\r\n else if (sign == "Cancer") Debilitate;\r\n }\r\n else if (star == "Jupiter"){\r\n if (sign == "Sagittarius" || sign == "Pisces") Rise;\r\n else if (sign == "Gemini" || sign == "Virgo") Fall;\r\n else if (sign == "Cancer") Exalt;\r\n else if (sign == "Capricorn") Debilitate;\r\n }\r\n else if (star == "Saturn"){\r\n if (sign == "Capricorn" || sign == "Aquarius") Rise;\r\n else if (sign == "Cancer" || sign == "Leo") Fall;\r\n else if (sign == "Libra") Exalt;\r\n else if (sign == "Aries") Debilitate;\r\n }\r\n else if (star == "Uranus"){\r\n if (sign == "Aquarius") Rise;\r\n else if (sign == "Leo") Fall;\r\n else if (sign == "Scorpio") Exalt;\r\n else if (sign == "Taurus") Debilitate;\r\n }\r\n else if (star == "Neptune"){\r\n if (sign == "Pisces") Rise;\r\n else if (sign == "Virgo") Fall;\r\n else if (sign == "Sagittarius") Exalt;\r\n else if (sign == "Gemini") Debilitate;\r\n }\r\n else if (star == "Pluto"){\r\n if (sign == "Scorpio") Rise;\r\n else if (sign == "Taurus") Fall;\r\n else if (sign == "Virgo") Exalt;\r\n else if (sign == "Pisces") Debilitate;\r\n }\r\n }\r\n\r\n \/\/ Aspects: Sextile, Square, Trine && Opposite\r\n\r\n#define Conjunct (Diff <= 0 + 5)\r\n#define Sextile (60 - 3 <= Diff && Diff <= 60 + 3)\r\n#define Square (90 - 4 <= Diff && Diff <= 90 + 4)\r\n#define Trine (120 - 4 <= Diff && Diff <= 120 + 4)\r\n#define Opposite (180 - 3 <= Diff && Diff <= 180)\r\n\r\n REP(i, N) FOR(j, i+1, N){\r\n\r\n int Diff = V[i].p - V[j].p; if (Diff < 0) Diff = -Diff; if (Diff > 180) Diff = 360 - Diff;\r\n\r\n if (Sextile) V[i].c += 1, V[j].c += 1;\r\n else if (Square) V[i].c += 2, V[j].c += 2, V[i].e -= 3, V[j].e -= 3;\r\n else if (Trine) V[i].e += 3, V[j].e += 3, V[i].c -= 2, V[j].c -= 2;\r\n else if (Opposite) V[i].e -= 1, V[j].e -= 1;\r\n }\r\n\r\n REP(i, N) checkMax(V[i].e, 0);\r\n\r\n m = 0;\r\n\r\n REP(i, N) FOR(j, i+1, N){\r\n\r\n int Diff = V[i].p - V[j].p; if (Diff < 0) Diff = -Diff; if (Diff > 180) Diff = 360 - Diff;\r\n\r\n if (Conjunct) E[m].c = INF, E[m].x = i, E[m++].y = j;\r\n else if (Sextile || Square || Trine || Opposite){\r\n E[m].c = max(0, V[i].c + V[j].c + 2);\r\n if (E[m].c) E[m].x = i, E[m++].y = j;\r\n }\r\n }\r\n}\r\n\r\nvoid dfs(int s = 0){\r\n\r\n int t = 0; FOR(i, s, m) t += E[i].cc();\r\n if (cur + t <= ans) return;\r\n\r\n if (s == m){\r\n ans = cur;\r\n }\r\n else {\r\n\r\n DWN_1_C(f, E[s].cc(), 0){\r\n\r\n cur += f;\r\n\r\n V[E[s].x].e -= f, V[E[s].y].e -= f;\r\n\r\n dfs(s + 1);\r\n\r\n V[E[s].x].e += f, V[E[s].y].e += f;\r\n\r\n cur -= f;\r\n }\r\n }\r\n\r\n}\r\n\r\nint main(){\r\n\r\n \/\/freopen("in.txt", "r", stdin);\r\n \/\/freopen("out.txt", "w", stdout);\r\n \/\/ios::sync_with_stdio(false);\r\n\r\n Init(); Rush{\r\n Build_Graph(); cur = ans = 0; dfs();\r\n OT(ans * 2);\r\n }\r\n}\r\n\r\n<\/pre>\nExternal link: <\/h3>\n
\nhttp:\/\/acm.hdu.edu.cn\/showproblem.php?pid=4040<\/a>
\nhttp:\/\/boj.me\/onlinejudge\/newoj\/showProblem\/show_problem.php?problem_id=211<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"