Problem 250. Pillars
\n\u3002\u3002\u8981\u5728\u4e24\u9762\u5899\u4e4b\u95f4\u67b6\u4e00\u4e2a\u68af\u5b50\uff0c\u4e24\u9762\u5899\u9ad8\u5ea6\u7686\u4e3a\u6574\u6570\uff0c\u5747\u5300\u9009\u81ea [1, A] \u548c [1, B] \u4e4b\u95f4\u3002
\n\u3002\u4e2d\u95f4\u8ddd\u79bb\u4e3a w\uff0c\u95ee\u68af\u5b50\u671f\u671b\u7684\u957f\u5ea6\u3002
\n(\u3002\u30021 \u2264 A, B \u2264 100, 000 \u3002\u3002\u3002) <\/p>\n
Problem 500. RectangularSum
\n\u7ed9\u5b9a\u4e00\u4e2a\u9010\u884c\u9010\u5217\u4f9d\u6b21\u586b {0, 1, 2, 3, 4, … nm-1} \u7684 n \u00d7 m \u77e9\u9635\u3002\u3002
\n\u3002\u3002\u3002\u95ee\u6240\u6709\u548c\u7b49\u4e8e S \u7684\u5b50\u77e9\u9635\u4e2d\uff0c\u9762\u79ef\u6700\u5c0f\u7684\u662f\u591a\u5c11\u3002
\n(\u3002\u30021 \u2264 n, m \u2264 100, 000 \u3002\u3002\u30021 \u2264 S \u2264 100, 000, 000, 000\u3002\u3002\u3002) <\/p>\n
Problem 1000. MaximalTriangle
\n\u95ee\u6b63 n \u8fb9\u5f62\u7684\u4e09\u89d2\u5256\u5206\u4e2d\uff0c\u6709\u591a\u5c11\u79cd\u5256\u5206\u662f\u53ef\u4ee5\u4ea7\u751f\u4e00\u4e2a\u9762\u79ef\u6700\u5927\u7684\u5927\u4e09\u89d2\u5f62\u7684\u3002
\n(\u3002\u30023 \u2264 n \u2264 444 \u3002\u3002\u3002\uff09
\n<\/p>\n
Problem 250. Pillars
\n\u5206\u7ec4\u8ba1\u6570\uff0c\u679a\u4e3e\u9ad8\u5ea6\u5dee\u3002<\/p>\n
Problem 500. RectangularSum
\n\u3002\u3002\u8fd9\u9898\u7684\u96be\u70b9\u4e3b\u8981\u5728 O(1) \u65f6\u95f4\u5185\u5b9e\u73b0\u4e00\u4e2a\u540d\u4e3a bool check(x, y); \u7684\u51fd\u6570; \u6765\u5224\u65ad\u957f\u5bbd\u4e3a x, y \uff0c\u548c\u4e3a S \u7684\u5b50\u77e9\u9635\u662f\u5426\u5b58\u5728\u3002\u3002
\n\u8fd9\u4e2a\u5148\u628a\u6574\u4e2a\u5b50\u77e9\u9635\u79fb\u52a8\u5230\u6700\u4e0a\u89d2\u3002\u3002\u7136\u540e\u901a\u8fc7\u5224\u65ad\u4f4d\u79fb\u662f\u5426\u5408\u6cd5\u5c31\u884c\u4e86\u3002\u3002
\n\u3002\u3002\u3002\u7136\u540e\u5916\u56f4\u7528\u4e00\u4e2a\u5806\u3002\u3002\u7ef4\u62a4\u4e00\u5806\u4e0b\u6807\u3002\u3002\u8fd9\u6837\u8c8c\u4f3c\u590d\u6742\u5ea6\u662f O(n^2logn)\u3002\u3002\u7136\u540e\u968f\u4fbf\u52a0\u4e86\u70b9\u526a\u679d\u5c31\u8fc7\u6389\u4e86\u3002\u3002<\/p>\n
Problem 1000. MaximalTriangle
\n\u3002\u3002\u6ca1\u4ec0\u4e48\u597d\u7684\u60f3\u6cd5\u3002\u3002\u57fa\u672c\u601d\u60f3\u53ea\u80fd\u662f\u5148\u79bb\u6563\u5316\u4e09\u89d2\u5f62\u9762\u79ef\u3002\u7136\u540e\u679a\u4e3e\u4e2d\u95f4\u7684\u5927\u4e09\u89d2\u5f62\u3002\u3002\u7136\u540e\u4ea7\u751f\u4e09\u4e2a\u65b9\u5411\u7684\u9012\u5f52\uff1f\u3002\u3002
\n\u3002\u3002f(i, s) \u8868\u793a\u4e00\u4e2a i \u4e2a\u5b9a\u70b9\u7684\u5b50\u533a\u57df\u4e2d\uff0c\u6240\u6709\u4e0d\u5305\u542b\u9762\u79ef\u5927\u4e8e\u7b49\u4e8e s \u7684\u4e09\u89d2\u5f62\u7684\u5256\u5206\u6570\u3002\u3002\u3002\u3002\u3002\u3002
\n\u8c8c\u4f3c\u603b\u7684\u590d\u6742\u5ea6 O(n4) \u3002\u3002\uff08\u5171 O(n3) \u79cd\u72b6\u6001\u3002\u3002\u8f6c\u79fb\u3002O(n)\u3002\u3002\u3002\u3002
\n\uff08\u4e0d\u8fc7\u597d\u50cf\u5927\u5bb6\u90fd\u662f\u8fd9\u6837\u8fc7\u7684\u3002\u3002\u5c31\u662f\u52a0\u5e38\u6570\u4f18\u5316\u3002\u3002 \/$:o~o <\/p>\n
\r\nDB sqr(DB x){\r\n return x * x;\r\n}\r\n\r\nclass Pillars {\r\npublic:\r\n\tdouble getExpectedLength(int w, int x, int y) {\r\n\r\n DB q = min(x, y), p = w * q, pp, qq;\r\n \r\n REP_1_C(i, max(x, y)){\r\n qq = min(x, max(0, y - i)), pp = sqrt(sqr(w) + sqr(i)) * qq;\r\n p += pp, q += qq;\r\n qq = min(max(0, x - i), y), pp = sqrt(sqr(w) + sqr(i)) * qq;\r\n p += pp, q += qq;\r\n }\r\n \r\n return p \/ q;\r\n\t}\r\n};\r\n<\/pre>\n\r\nLL w, h, S; bool flag;\r\n\r\nbool check(LL x, LL y){\r\n\r\n flag = false;\r\n LL A = x * y, B = A * (y - 1), C = x*(x-1) * (y*w);\r\n LL S = ::S - B - C; if (S < 0) return false; flag = true;\r\n LL d = S \/ (A*2); if (d * (A*2) != S) return false;\r\n LL up = (h - x + 1) * w;\r\n return d < up && d % w <= w - y;\r\n}\r\n\r\nclass RectangularSum {\r\npublic:\r\n\tlong long minimalArea(LL h, LL w, LL S) {\r\n\t ::h = h, ::w = w, ::S = S, ::S <<= 1;\r\n\r\n\t\tpriority_queue<PLI, vector<PLI>, greater<PLI> > Q;\r\n\t\tREP_1(i, h) Q.push(MP((LL)i, i));\r\n\r\n#define s first\r\n#define x second\r\n\r\n\t\twhile (!Q.empty()){\r\n\t\t PLI cur = Q.top(); LL y = cur.s \/ cur.x; Q.pop();\r\n\t\t if (check(cur.x, y)) return cur.s;\r\n\t\t if (y < w && flag) Q.push(MP(cur.s + cur.x, cur.x));\r\n\t\t}\r\n\r\n\t\treturn -1;\r\n\t}\r\n};\r\n<\/pre>\n\r\n#define LOCAL\r\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 <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 ECH(it, A) for (typeof(A.begin()) it=A.begin(); it != A.end(); ++it)\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\/** 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\n\r\ntemplate<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){\r\n while (!Q.empty()) Q.pop();\r\n}\r\n\r\ntemplate<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){\r\n while (!Q.empty()) Q.pop();\r\n}\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\/** Add - On **\/\r\n\r\nint MOD = 1000000007;\r\nconst int INF = 0x3f3f3f3f;\r\nconst LL INF_64 = 0x3f3f3f3f3f3f3f3fLL;\r\nconst DB EPS = 1e-11;\r\nconst DB OO = 1e15;\r\nconst DB PI = 3.14159265358979323846264; \/\/M_PI;\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 min(T a, T b, T c, T d){return min(min(a, b), min(c, d));}\r\ntemplate<class T> inline T max(T a, T b, T c, T d){return max(min(a, b), max(c, d));}\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\ninline bool _1(int x, int i){return x & 1<<i;}\r\ninline bool _1(LL x, int i){return x & 1LL<<i;}\r\ninline LL _1(int i){return 1LL<<i;}\r\n\/\/inline int _1(int i){return 1<<i;}\r\ninline LL _U(int i){return _1(i) - 1;};\r\n\/\/inline int _U(int i){return _1(i) - 1;};\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\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\ninline int count_bits(LL x){\r\n x = (x & 0x5555555555555555LL) + ((x & 0xaaaaaaaaaaaaaaaaLL) >> 1);\r\n x = (x & 0x3333333333333333LL) + ((x & 0xccccccccccccccccLL) >> 2);\r\n x = (x & 0x0f0f0f0f0f0f0f0fLL) + ((x & 0xf0f0f0f0f0f0f0f0LL) >> 4);\r\n x = (x & 0x00ff00ff00ff00ffLL) + ((x & 0xff00ff00ff00ff00LL) >> 8);\r\n x = (x & 0x0000ffff0000ffffLL) + ((x & 0xffff0000ffff0000LL) >> 16);\r\n x = (x & 0x00000000ffffffffLL) + ((x & 0xffffffff00000000LL) >> 32);\r\n return x;\r\n}\r\n\r\nint reverse_bits(int x){\r\n x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa);\r\n x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc);\r\n x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0);\r\n x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00);\r\n x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000);\r\n return x;\r\n}\r\n\r\nLL reverse_bits(LL x){\r\n x = ((x >> 1) & 0x5555555555555555LL) | ((x << 1) & 0xaaaaaaaaaaaaaaaaLL);\r\n x = ((x >> 2) & 0x3333333333333333LL) | ((x << 2) & 0xccccccccccccccccLL);\r\n x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) | ((x << 4) & 0xf0f0f0f0f0f0f0f0LL);\r\n x = ((x >> 8) & 0x00ff00ff00ff00ffLL) | ((x << 8) & 0xff00ff00ff00ff00LL);\r\n x = ((x >>16) & 0x0000ffff0000ffffLL) | ((x <<16) & 0xffff0000ffff0000LL);\r\n x = ((x >>32) & 0x00000000ffffffffLL) | ((x <<32) & 0xffffffff00000000LL);\r\n return x;\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\ninline int pdt(int a, int b, int c){return pdt(pdt(a, b), c);}\r\ninline int sqr_M(int a){return pdt(a, a);}\r\n\r\ninline int pow(int a, int b){\r\n int c = 1;\r\n while (b) {\r\n if (b&1) MUL(c, a);\r\n MUL(a, a), b >>= 1;\r\n }\r\n return c;\r\n}\r\n\r\ntemplate<class T>\r\ninline int pow(T a, int b){\r\n T c(1);\r\n while (b) {\r\n if (b&1) MUL(c, a);\r\n MUL(a, a), b >>= 1;\r\n }\r\n return c;\r\n}\r\n\r\ninline int _I(int b){\r\n int a = MOD, x1 = 0, x2 = 1, q;\r\n while (true){\r\n q = a \/ b, a %= b;\r\n if (!a) return (x2 + MOD) % MOD;\r\n DEC(x1, pdt(q, x2));\r\n\r\n q = b \/ a, b %= a;\r\n if (!b) return (x1 + MOD) % MOD;\r\n DEC(x2, pdt(q, x1));\r\n }\r\n}\r\n\r\ninline void DIV(int &a, int b){MUL(a, _I(b));}\r\ninline int qtt(int a, int b){return pdt(a, _I(b));}\r\n\r\ninline int sum(int a, int b, int MOD){\r\n a += b; if (a >= MOD) a -= MOD;\r\n return a;\r\n}\r\n\r\ninline int phi(int n){\r\n int res = n;\r\n for (int i=2;sqr(i)<=n;++i) if (!(n%i)){\r\n DEC(res, qtt(res, i));\r\n do{n \/= i;} while(!(n%i));\r\n }\r\n if (n != 1)\r\n DEC(res, qtt(res, n));\r\n return res;\r\n}\r\n\r\n\/\/ <<= '9. Comutational Geometry .,\r\n\r\nstruct Po; struct Line; struct Seg;\r\n\r\ninline int sgn(DB x){return x < -EPS ? -1 : x > EPS;}\r\ninline int sgn(DB x, DB y){return sgn(x - y);}\r\ninline bool equ(DB x, DB y){return !sgn(x, y);}\r\n\r\nstruct Po{\r\n DB x, y;\r\n Po(DB _x = 0, DB _y = 0):x(_x), y(_y){}\r\n\r\n friend istream& operator >>(istream& in, Po &p){return in >> p.x >> p.y;}\r\n friend ostream& operator <<(ostream& out, Po p){return out << "(" << p.x << ", " << p.y << ")";}\r\n\r\n friend bool operator ==(Po, Po);\r\n friend bool operator !=(Po, Po);\r\n friend Po operator +(Po, Po);\r\n friend Po operator -(Po, Po);\r\n friend Po operator *(Po, DB);\r\n friend Po operator \/(Po, DB);\r\n\r\n bool operator < (const Po &rhs) const{return sgn(x, rhs.x) < 0 || sgn(x, rhs.x) == 0 && sgn(y, rhs.y) < 0;}\r\n Po operator-() const{return Po(-x, -y);}\r\n Po& operator +=(Po rhs){x += rhs.x, y += rhs.y; return *this;}\r\n Po& operator -=(Po rhs){x -= rhs.x, y -= rhs.y; return *this;}\r\n Po& operator *=(DB k){x *= k, y *= k; return *this;}\r\n Po& operator \/=(DB k){x \/= k, y \/= k; return *this;}\r\n\r\n DB length_sqr(){return sqr(x) + sqr(y);}\r\n DB length(){return sqrt(length_sqr());}\r\n\r\n DB atan(){\r\n return atan2(y, x);\r\n }\r\n\r\n void input(){\r\n scanf("%lf %lf", &x, &y);\r\n }\r\n};\r\n\r\nbool operator ==(Po a, Po b){return sgn(a.x - b.x) == 0 && sgn(a.y - b.y) == 0;}\r\nbool operator !=(Po a, Po b){return sgn(a.x - b.x) != 0 || sgn(a.y - b.y) != 0;}\r\nPo operator +(Po a, Po b){return Po(a.x + b.x, a.y + b.y);}\r\nPo operator -(Po a, Po b){return Po(a.x - b.x, a.y - b.y);}\r\nPo operator *(Po a, DB k){return Po(a.x * k, a.y * k);}\r\nPo operator *(DB k, Po a){return a * k;}\r\nPo operator \/(Po a, DB k){return Po(a.x \/ k, a.y \/ k);}\r\n\r\nstruct Line{\r\n Po a, b;\r\n Line(Po _a = Po(), Po _b = Po()):a(_a), b(_b){}\r\n Line(DB x0, DB y0, DB x1, DB y1):a(Po(x0, y0)), b(Po(x1, y1)){}\r\n Line(Seg);\r\n\r\n friend ostream& operator <<(ostream& out, Line p){return out << p.a << "-" << p.b;}\r\n};\r\n\r\nstruct Seg{\r\n Po a, b;\r\n Seg(Po _a = Po(), Po _b = Po()):a(_a), b(_b){}\r\n Seg(DB x0, DB y0, DB x1, DB y1):a(Po(x0, y0)), b(Po(x1, y1)){}\r\n Seg(Line l);\r\n\r\n friend ostream& operator <<(ostream& out, Seg p){return out << p.a << "-" << p.b;}\r\n DB length(){return (b - a).length();}\r\n};\r\n\r\nLine::Line(Seg l):a(l.a), b(l.b){}\r\nSeg::Seg(Line l):a(l.a), b(l.b){}\r\n\r\n#define innerProduct dot\r\n#define scalarProduct dot\r\n#define dotProduct dot\r\n#define outerProduct det\r\n#define crossProduct det\r\n\r\ninline DB dot(DB x1, DB y1, DB x2, DB y2){return x1 * x2 + y1 * y2;}\r\ninline DB dot(Po a, Po b){return dot(a.x, a.y, b.x, b.y);}\r\ninline DB dot(Po p0, Po p1, Po p2){return dot(p1 - p0, p2 - p0);}\r\ninline DB dot(Line l1, Line l2){return dot(l1.b - l1.a, l2.b - l2.a);}\r\ninline DB det(DB x1, DB y1, DB x2, DB y2){return x1 * y2 - x2 * y1;}\r\ninline DB det(Po a, Po b){return det(a.x, a.y, b.x, b.y);}\r\ninline DB det(Po p0, Po p1, Po p2){return det(p1 - p0, p2 - p0);}\r\ninline DB det(Line l1, Line l2){return det(l1.b - l1.a, l2.b - l2.a);}\r\n\r\ntemplate<class T1, class T2> inline DB dist(T1 x, T2 y){return sqrt(dist_sqr(x, y));}\r\n\r\ninline DB dist_sqr(Po a, Po b){return sqr(a.x - b.x) + sqr(a.y - b.y);}\r\ninline DB dist_sqr(Po p, Line l){Po v0 = l.b - l.a, v1 = p - l.a; return sqr(fabs(det(v0, v1))) \/ v0.length_sqr();}\r\ninline DB dist_sqr(Po p, Seg l){\r\n Po v0 = l.b - l.a, v1 = p - l.a, v2 = p - l.b;\r\n if (sgn(dot(v0, v1)) * sgn(dot(v0, v2)) <= 0) return dist_sqr(p, Line(l));\r\n else return min(v1.length_sqr(), v2.length_sqr());\r\n}\r\n\r\ninline DB dist_sqr(Line l, Po p){return dist_sqr(p, l);}\r\ninline DB dist_sqr(Seg l, Po p){return dist_sqr(p, l);}\r\n\r\ninline DB dist_sqr(Line l1, Line l2){\r\n if (sgn(det(l1, l2)) != 0) return 0;\r\n return dist_sqr(l1.a, l2);\r\n}\r\ninline DB dist_sqr(Line l1, Seg l2){\r\n Po v0 = l1.b - l1.a, v1 = l2.a - l1.a, v2 = l2.b - l1.a; DB c1 = det(v0, v1), c2 = det(v0, v2);\r\n return sgn(c1) != sgn(c2) ? 0 : sqr(min(fabs(c1), fabs(c2))) \/ v0.length_sqr();\r\n}\r\n\r\nbool isIntersect(Seg l1, Seg l2){\r\n\r\n \/\/if (l1.a == l2.a || l1.a == l2.b || l1.b == l2.a || l1.b == l2.b) return true;\r\n\r\n return\r\n min(l1.a.x, l1.b.x) <= max(l2.a.x, l2.b.x) &&\r\n min(l2.a.x, l2.b.x) <= max(l1.a.x, l1.b.x) &&\r\n min(l1.a.y, l1.b.y) <= max(l2.a.y, l2.b.y) &&\r\n min(l2.a.y, l2.b.y) <= max(l1.a.y, l1.b.y) &&\r\n sgn( det(l1.a, l2.a, l2.b) ) * sgn( det(l1.b, l2.a, l2.b) ) <= 0 &&\r\n sgn( det(l2.a, l1.a, l1.b) ) * sgn( det(l2.b, l1.a, l1.b) ) <= 0;\r\n\r\n}\r\n\r\ninline DB dist_sqr(Seg l1, Seg l2){\r\n if (isIntersect(l1, l2)) return 0;\r\n else return min(dist_sqr(l1.a, l2), dist_sqr(l1.b, l2), dist_sqr(l2.a, l1), dist_sqr(l2.b, l1));\r\n}\r\n\r\ninline bool isOnExtremePoint(const Po &p, const Seg &l){\r\n return p == l.a || p == l.b;\r\n}\r\n\r\ninline bool isOnseg(const Po &p, const Seg &l){\r\n\r\n \/\/if (p == l.a || p == l.b) return false;\r\n\r\n return sgn(det(p, l.a, l.b)) == 0 &&\r\n sgn(l.a.x, p.x) * sgn(l.b.x, p.x) <= 0 && sgn(l.a.y, p.y) * sgn(l.b.y, p.y) <= 0;\r\n}\r\n\r\ninline Po intersect(const Line &l1, const Line &l2){\r\n return l1.a + (l1.b - l1.a) * (det(l2.a, l1.a, l2.b) \/ det(l2, l1));\r\n}\r\n\r\n\/\/ perpendicular foot\r\ninline Po intersect(const Po & p, const Line &l){\r\n return intersect(Line(p, p + Po(l.a.y - l.b.y, l.b.x - l.a.x)), l);\r\n}\r\n\r\ninline Po rotate(Po p, DB alpha, Po o = Po()){\r\n p.x -= o.x, p.y -= o .y;\r\n return Po(p.x * cos(alpha) - p.y * sin(alpha), p.y * cos(alpha) + p.x * sin(alpha)) + o;\r\n}\r\n\r\n\/\/ <<= ' A. Random Event ..\r\n\r\ninline int rand32(){return (bool(rand() & 1) << 30) | (rand() << 15) + rand();}\r\ninline int random32(int l, int r){return rand32() % (r - l + 1) + l;}\r\ninline int random(int l, int r){return rand() % (r - l + 1) + l;}\r\nint dice(){return rand() % 6;}\r\nbool coin(){return rand() % 2;}\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\ntemplate<class T> inline void OT(const T &x){\r\n \/\/printf("%d\\n", x);\r\n cout << x << endl;\r\n}\r\n\r\n\/* .................................................................................................................................. *\/\r\n\r\nconst int N = 495, AN = 17000;\r\n\r\nPo P[N]; DB A[N][N]; int p[N][N]; VD L;\r\nint cp[N], dp[N][AN];\r\nint n;\r\n\r\nDB area(int _a, int _b, int _c){\r\n\r\n \/\/return abs(det(C[0], C[_a]) + det(C[_a], C[_b]) + det(C[_b], C[0]));\r\n\r\n DB a = dist(P[0], P[_a]), b = dist(P[0], P[_b]), c = dist(P[0], P[_c]);\r\n DB p = (a + b + c) \/ 2;\r\n return sqrt(p * (p - a) * (p - b) * (p - c));\r\n}\r\n\r\nint g(int len, int limit){\r\n\r\n if (len <= 1) return 1;\r\n\r\n int &res = dp[len][limit];\r\n\r\n if (res == -1){\r\n if (p[n-len][len\/2] < limit){\r\n res = cp[len - 1];\r\n }\r\n else {\r\n LL buf = 0; for (int i=1;2*i<=len&&p[n-len][i]<limit;++i){\r\n buf += (LL) g(i, limit) * g(len - i, limit);\r\n if (buf >= INF_64) buf %= MOD;\r\n }\r\n buf %= MOD, res = buf, INC(res, res);\r\n }\r\n }\r\n\r\n return res;\r\n}\r\n\r\nint f(int a, int b){\r\n return pdt(g(a, p[a][b]), g(b, p[a][b]), g(n-a-b, p[a][b]));\r\n}\r\n\r\nclass MaximalTriangle {\r\npublic:\r\n\tint howMany(int n, int z) {\r\n\r\n\t MOD = z, RST(cp), cp[0] = 1 % z; REP_1(i, n){\r\n\t REP_C(j, (i+1)\/2) INC(cp[i], pdt(cp[j], cp[i-1-j])); INC(cp[i], cp[i]);\r\n\t if (i&1) DEC(cp[i], sqr_M(cp[i\/2]));\r\n\t }\r\n\r\n\t ::n = n; REP(i, n) P[i] = Po(cos(2.0*PI*i\/n), sin(2.0*PI*i\/n));\r\n\r\n\t CLR(L); FOR(i, 1, n) FOR(j, 1, n-i){\r\n\t A[i][j] = area(i, j, n - i - j);\r\n\t L.PB(A[i][j]);\r\n }\r\n\r\n SRT(L); L.resize(unique(ALL(L), equ) - L.begin());\r\n\r\n RST(p); FOR(i, 1, n) FOR(j, 1, n - i)\r\n p[i][j] = lower_bound(ALL(L), A[i][j] - EPS) - L.begin();\r\n\r\n int t[] = {(n \/ 3) % MOD, n % MOD, (LL) 2 * n % MOD};\r\n FLC(dp, -1); int res = 0; REP(a, n) FOR_1_C(b, a, (n - a) \/ 2){\r\n INC(res, pdt(f(a, b), t[(a != b) + (b != n - a - b)]));\r\n }\r\n\r\n\t return res;\r\n\t}\r\n};\r\n\r\n\r\n\/\/ BEGIN CUT HERE\r\nnamespace moj_harness {\r\n\tint run_test_case(int);\r\n\tvoid run_test(int casenum = -1, bool quiet = false) {\r\n\t\tif (casenum != -1) {\r\n\t\t\tif (run_test_case(casenum) == -1 && !quiet) {\r\n\t\t\t\tcerr << "Illegal input! Test case " << casenum << " does not exist." << endl;\r\n\t\t\t}\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tint correct = 0, total = 0;\r\n\t\tfor (int i=0;; ++i) {\r\n\t\t\tint x = run_test_case(i);\r\n\t\t\tif (x == -1) {\r\n\t\t\t\tif (i >= 100) break;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tcorrect += x;\r\n\t\t\t++total;\r\n\t\t}\r\n\r\n\t\tif (total == 0) {\r\n\t\t\tcerr << "No test cases run." << endl;\r\n\t\t} else if (correct < total) {\r\n\t\t\tcerr << "Some cases FAILED (passed " << correct << " of " << total << ")." << endl;\r\n\t\t} else {\r\n\t\t\tcerr << "All " << total << " tests passed!" << endl;\r\n\t\t}\r\n\t}\r\n\r\n\tint verify_case(int casenum, const int &expected, const int &received, clock_t elapsed) {\r\n\t\tcerr << "Example " << casenum << "... ";\r\n\r\n\t\tstring verdict;\r\n\t\tvector<string> info;\r\n\t\tchar buf[100];\r\n\r\n\t\tif (elapsed > CLOCKS_PER_SEC \/ 200) {\r\n\t\t\tsprintf(buf, "time %.2fs", elapsed * (1.0\/CLOCKS_PER_SEC));\r\n\t\t\tinfo.push_back(buf);\r\n\t\t}\r\n\r\n\t\tif (expected == received) {\r\n\t\t\tverdict = "PASSED";\r\n\t\t} else {\r\n\t\t\tverdict = "FAILED";\r\n\t\t}\r\n\r\n\t\tcerr << verdict;\r\n\t\tif (!info.empty()) {\r\n\t\t\tcerr << " (";\r\n\t\t\tfor (int i=0; i<(int)info.size(); ++i) {\r\n\t\t\t\tif (i > 0) cerr << ", ";\r\n\t\t\t\tcerr << info[i];\r\n\t\t\t}\r\n\t\t\tcerr << ")";\r\n\t\t}\r\n\t\tcerr << endl;\r\n\r\n\t\tif (verdict == "FAILED") {\r\n\t\t\tcerr << " Expected: " << expected << endl;\r\n\t\t\tcerr << " Received: " << received << endl;\r\n\t\t}\r\n\r\n\t\treturn verdict == "PASSED";\r\n\t}\r\n\r\n\tint run_test_case(int casenum) {\r\n\t\tswitch (casenum) {\r\n\t\tcase 0: {\r\n\t\t\tint n = 428;\r\n\t\t\tint z = 900000005;\r\n\t\t\tint expected__ = 180276168;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = MaximalTriangle().howMany(n, z);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 1: {\r\n\t\t\tint n = 5;\r\n\t\t\tint z = 100;\r\n\t\t\tint expected__ = 5;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = MaximalTriangle().howMany(n, z);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 2: {\r\n\t\t\tint n = 6;\r\n\t\t\tint z = 1000003;\r\n\t\t\tint expected__ = 2;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = MaximalTriangle().howMany(n, z);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 3: {\r\n\t\t\tint n = 10;\r\n\t\t\tint z = 1000000000;\r\n\t\t\tint expected__ = 1010;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = MaximalTriangle().howMany(n, z);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 4: {\r\n\t\t\tint n = 15;\r\n\t\t\tint z = 1000000000;\r\n\t\t\tint expected__ = 714340;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = MaximalTriangle().howMany(n, z);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\t\tcase 5: {\r\n\t\t\tint n = 100;\r\n\t\t\tint z = 987654321;\r\n\t\t\tint expected__ = 308571232;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = MaximalTriangle().howMany(n, z);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}\r\n\r\n\t\t\/\/ custom cases\r\n\r\n\/* case 6: {\r\n\t\t\tint n = ;\r\n\t\t\tint z = ;\r\n\t\t\tint expected__ = ;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = MaximalTriangle().howMany(n, z);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}*\/\r\n\/* case 7: {\r\n\t\t\tint n = ;\r\n\t\t\tint z = ;\r\n\t\t\tint expected__ = ;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = MaximalTriangle().howMany(n, z);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}*\/\r\n\/* case 8: {\r\n\t\t\tint n = ;\r\n\t\t\tint z = ;\r\n\t\t\tint expected__ = ;\r\n\r\n\t\t\tclock_t start__ = clock();\r\n\t\t\tint received__ = MaximalTriangle().howMany(n, z);\r\n\t\t\treturn verify_case(casenum, expected__, received__, clock()-start__);\r\n\t\t}*\/\r\n\t\tdefault:\r\n\t\t\treturn -1;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nint main(int argc, char *argv[]) {\r\n\tif (argc == 1) {\r\n\t\tmoj_harness::run_test();\r\n\t} else {\r\n\t\tfor (int i=1; i<argc; ++i)\r\n\t\t\tmoj_harness::run_test(atoi(argv[i]));\r\n\t}\r\n}\r\n\/\/ END CUT HERE\r\n\r\n<\/pre>\nExternal link: <\/h3>\n
http:\/\/apps.topcoder.com\/wiki\/display\/tc\/SRM+547<\/a>
\nhttp:\/\/community.topcoder.com\/stat?c=coder_room_stats&rd=14739&cr=22727863<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"Brief description: Problem 250. Pillars \u3002\u3002\u8981\u5728\u4e24\u9762\u5899\u4e4b\u95f4\u67b6\u4e00\u4e2a\u68af\u5b50\uff0c\u4e24\u9762\u5899\u9ad8\u5ea6\u7686\u4e3a\u6574\u6570\uff0c\u5747\u5300\u9009\u81ea [1, A] \u548c [1, B] \u4e4b\u95f4\u3002 \u3002\u4e2d\u95f4\u8ddd\u79bb\u4e3a w\uff0c\u95ee\u68af\u5b50\u671f\u671b\u7684\u957f\u5ea6\u3002 (\u3002\u30021 \u2264 A, B \u2264 100, 000 \u3002\u3002\u3002) Problem 500. RectangularSum \u7ed9\u5b9a\u4e00\u4e2a\u9010\u884c\u9010\u5217\u4f9d\u6b21\u586b {0, 1, 2, 3, 4, … nm-1} \u7684 n \u00d7 m \u77e9\u9635\u3002\u3002 \u3002\u3002\u3002\u95ee\u6240\u6709\u548c\u7b49\u4e8e S \u7684\u5b50\u77e9\u9635\u4e2d\uff0c\u9762\u79ef\u6700\u5c0f\u7684\u662f\u591a\u5c11\u3002 (\u3002\u30021 \u2264 n, m \u2264 100, 000 \u3002\u3002\u30021 \u2264 S \u2264 100, 000, 000, […]<\/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":[17],"tags":[],"class_list":["post-274","post","type-post","status-publish","format-standard","hentry","category-topcoder"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-4q","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/274","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=274"}],"version-history":[{"count":1,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/274\/revisions"}],"predecessor-version":[{"id":284,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/274\/revisions\/284"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=274"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=274"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=274"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}