{"id":557,"date":"2015-09-17T20:40:57","date_gmt":"2015-09-17T12:40:57","guid":{"rendered":"http:\/\/nike0good.jp1.rpvhost.net\/?p=509"},"modified":"2015-09-17T20:40:57","modified_gmt":"2015-09-17T12:40:57","slug":"codeforces-round-320-div-1-bayan-thanks-round-%e9%a2%98%e8%a7%a3","status":"publish","type":"post","link":"https:\/\/nike0good.com\/?p=557","title":{"rendered":"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3"},"content":{"rendered":"

A.<\/p>\n

There is a polyline going through points (0,\u20090)\u2009\u2013\u2009(x<\/i>,\u2009x<\/i>)\u2009\u2013\u2009(2x<\/i>,\u20090)\u2009\u2013\u2009(3x<\/i>,\u2009x<\/i>)\u2009\u2013\u2009(4x<\/i>,\u20090)\u2009\u2013\u2009...\u2009-\u2009(2kx<\/i>,\u20090)\u2009\u2013\u2009(2kx<\/i>\u2009+\u2009x<\/i>,\u2009x<\/i>)\u2009\u2013\u2009....<\/p>\n

We know that the polyline passes through the point (a<\/i>,\u2009b<\/i>). Find minimum positive value x<\/i> such that it is true or determine that there is no such x<\/i>.<\/p>\n

\u9898\u89e3\uff1a\u6240\u6709\u7ebf\u7684\u659c\u7387\u5747\u4e3a\\(k=\\pm1\\)<\/p>\n

#include
\n#include
\n#include
\n#include
\n#include
\n#include
\n#include
\n#include
\n#include
\nusing namespace std;
\n#define For(i,n) for(int i=1;i< =n;i++)\n#define Fork(i,k,n) for(int i=k;i<=n;i++)\n#define Rep(i,n) for(int i=0;i=0;i--)
\n#define Forp(x) for(int p=pre[x];p;p=next[p])
\n#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
\n#define Lson (x< <1)\n#define Rson ((x<<1)+1)\n#define MEM(a) memset(a,0,sizeof(a));\n#define MEMI(a) memset(a,127,sizeof(a));\n#define MEMi(a) memset(a,128,sizeof(a));\n#define INF (2139062143)\n#define eps (1e-10)\n#define F (100000007)\ntypedef long long ll;\ntypedef double ld;\nll mul(ll a,ll b){return (a*b)%F;}\nll add(ll a,ll b){return (a+b)%F;}\nll sub(ll a,ll b){return (a-b+llabs(a-b)\/F*F+F)%F;}\nvoid upd(ll &a,ll b){a=(a%F+b%F)%F;}\nld a,b;\nint main()\n{\n\/\/ freopen(\"A.in\",\"r\",stdin);\n\/\/ freopen(\".out\",\"w\",stdout);\n\n cin>>a>>b;
\n if (a<\/p>\n

B.\"Or\" Game<\/p>\n

\u5df2\u77e5n\u4e2a\u6570\uff0c\u6267\u884ck\u6b21\u64cd\u4f5c\uff1a\u5c06\u4efb\u610f\u4e00\u4e2a\u6570\u4e58x\uff0c\u6c42\u6700\u5927or\u548c<\/p>\n

(1\u2009≤\u2009n\u2009≤\u2009200\u2009000, 1\u2009≤\u2009k\u2009≤\u200910, 2\u2009≤\u2009x\u2009≤\u20098).<\/p>\n

\u89e3\u6cd5\uff1a\u7531\u4e8e \\(x\\geqslant2\\) \u6211\u4eec\u5e94\u8be5\u5c06\u4f4d\u6570\u6700\u5927\u7684\u90a3\u4e2a1\u632a\u5230\u5c3d\u53ef\u80fd\u9ad8\u4f4d\uff0c\u56e0\u6b64\uff0c\u5e94\u53cd\u590d\u4e58\u540c\u4e00\u4e2a\u6570<\/p>\n

\u7528\u7ebf\u6bb5\u6811\u9884\u5904\u7406\u533a\u95f4or\u548c\uff0c\u7136\u540e\u679a\u4e3e\u6267\u884c\u64cd\u4f5c\u7684\u6570\u5373\u53ef<\/p>\n

#include
\n#include
\n#include
\n#include
\n#include
\n#include
\n#include
\n#include
\n#include
\nusing namespace std;
\n#define For(i,n) for(int i=1;i< =n;i++)\n#define Fork(i,k,n) for(int i=k;i<=n;i++)\n#define Rep(i,n) for(int i=0;i=0;i--)
\n#define Forp(x) for(int p=pre[x];p;p=next[p])
\n#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
\n#define Lson (x< <1)\n#define Rson ((x<<1)+1)\n#define MEM(a) memset(a,0,sizeof(a));\n#define MEMI(a) memset(a,127,sizeof(a));\n#define MEMi(a) memset(a,128,sizeof(a));\n#define INF (2139062143)\n#define F (100000007)\n#define MAXN (200000+10)\ntypedef long long ll;\nll mul(ll a,ll b){return (a*b)%F;}\nll add(ll a,ll b){return (a+b)%F;}\nll sub(ll a,ll b){return (a-b+llabs(a-b)\/F*F+F)%F;}\nvoid upd(ll &a,ll b){a=(a%F+b%F)%F;}\nll a[MAXN],x;\nint n,k;\nclass SegmentTree\n{\n ll minv[MAXN*4];\n int n;\npublic:\n SegmentTree(){MEM(minv) }\n SegmentTree(int _n):n(_n){ MEM(minv) }\n void mem(int _n)\n {\n n=_n;\n MEM(minv)\n }\n void build(int x,int L,int R)\n {\n int M=(L+R)>>1;
\n if (L==R) {minv[x]=a[L];return;}
\n else
\n {
\n if (L< =M) build(Lson,L,M);\n if (Mql=ql,this->qr=qr;
\n if (ql>qr) return 0;
\n return _query_min(1,1,n);
\n }<\/p>\n

ll _query_min(int x,int L,int R)
\n {
\n if (ql< =L&&R<=qr) return minv[x];\n ll ans=0,M=(L+R)>>1;
\n if (ql< =M) ans|=_query_min(Lson,L,M);\n if (M< qr) ans|=_query_min(Rson,M+1,R);\n return ans;\n }\n\n}S;\nint main()\n{\n\/\/ freopen(\"B.in\",\"r\",stdin);\n\/\/ freopen(\".out\",\"w\",stdout);\n\n cin>>n>>k>>x;
\n For(i,n) scanf(\"%I64d\",&a[i]);
\n sort(a+1,a+1+n);<\/p>\n

S.mem(n);
\n S.build(1,1,n);<\/p>\n

ll e=0;
\n For(i,n)
\n {
\n ll ans=0;
\n ans|=S.query_min(1,i-1);
\n ans|=S.query_min(i+1,n);<\/p>\n

ll t=a[i];
\n For(i,k) t*=x;
\n ans|=t;
\n e=max(e,ans);
\n }
\n cout< <\/p>\n

 C .\u5df2\u77e5\u5e8f\u5217a<\/i>1,\u2009a<\/i>2,\u2009...,\u2009a<\/i>n<\/i> (|a<\/i>i<\/i>|\u2009≤\u200910\u2009000,1\u2009≤\u2009n<\/i>\u2009≤\u2009200\u2009000). \u6c42x,<\/p>\n

\u4f7f\u5e8f\u5217a<\/i>1\u2009-\u2009x<\/i>,\u2009a<\/i>2\u2009-\u2009x<\/i>,\u2009...,\u2009a<\/i>n<\/i>\u2009-\u2009x <\/i>\u7684\u5b50\u6bb5\u548c\u7684\u7edd\u5bf9\u503c\u6700\u5c0f.<\/p>\n

\u89e3\u6cd5\uff1a\u4e8c\u5206x\uff0c\u5982\u679c\u6700\u5927\u5b50\u6bb5\u548c\u4e0e\u6700\u5c0f\u5b50\u6bb5\u548c\u5e73\u5747\u503c\\(\\geqslant 0\\),\u5219\u8bf4\u660ex\u592a\u5927.<\/p>\n

#include
\n#include
\n#include
\n#include
\n#include
\n#include
\n#include
\n#include
\n#include
\nusing namespace std;
\n#define For(i,n) for(int i=1;i< =n;i++)\n#define Fork(i,k,n) for(int i=k;i<=n;i++)\n#define Rep(i,n) for(int i=0;i=0;i--)
\n#define Forp(x) for(int p=pre[x];p;p=next[p])
\n#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
\n#define Lson (x< <1)\n#define Rson ((x<<1)+1)\n#define MEM(a) memset(a,0,sizeof(a));\n#define MEMI(a) memset(a,127,sizeof(a));\n#define MEMi(a) memset(a,128,sizeof(a));\n#define INF (2139062143)\n#define F (100000007)\n#define eps (1e-8)\n#define MAXN (200000+10)\ntypedef long long ll;\nll mul(ll a,ll b){return (a*b)%F;}\nll add(ll a,ll b){return (a+b)%F;}\nll sub(ll a,ll b){return (a-b+llabs(a-b)\/F*F+F)%F;}\nvoid upd(ll &a,ll b){a=(a%F+b%F)%F;}\nint n;\ndouble a[MAXN];\ndouble ans;\nbool check(double x)\n{\n double mins=a[1]-x,maxs=a[1]-x;\n\n double t1=0,t2=0;\n For(i,n) {\n t1=max(t1+a[i]-x,a[i]-x);\n maxs=max(maxs,t1);\n t2=min(t2+a[i]-x,a[i]-x);\n mins=min(mins,t2);\n }\n ans=maxs;\n return (mins+maxs)\/2 <0;\n}\nint main()\n{\n\/\/ freopen(\"c.in\",\"r\",stdin);\n\/\/ freopen(\".out\",\"w\",stdout);\n\n cin>>n;
\n For(i,n) scanf(\"%lf\",&a[i]);<\/p>\n

double l=-2000000000,r=2000000000;
\n int k=150;
\n while (k--)
\n {
\n double m=(l+r)\/2;
\n if (check(m)) r=m;
\n else l=m;
\n }
\n check((l+r)\/2);
\n printf(\"%.7lf\\n\",ans);
\n return 0;
\n}
\n<\/ctime><\/cctype><\/cmath><\/iostream><\/functional><\/algorithm><\/cstdlib><\/cstring><\/cstdio><\/code><\/ctime><\/cctype><\/cmath><\/iostream><\/functional><\/algorithm><\/cstdlib><\/cstring><\/cstdio><\/code><\/b><\/ctime><\/cctype><\/cmath><\/iostream><\/functional><\/algorithm><\/cstdlib><\/cstring><\/cstdio><\/code><\/p>\n","protected":false},"excerpt":{"rendered":"

A. There is a polyline going through points (0,\u20090) […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_coblocks_attr":"","_coblocks_dimensions":"","_coblocks_responsive_height":"","_coblocks_accordion_ie_support":"","footnotes":""},"categories":[12],"tags":[],"class_list":["post-557","post","type-post","status-publish","format-standard","hentry","category-algorithm"],"yoast_head":"\nCodeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3 - nike0good<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/nike0good.com\/?p=557\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3 - nike0good\" \/>\n<meta property=\"og:description\" content=\"A. There is a polyline going through points (0,\u20090) […]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/nike0good.com\/?p=557\" \/>\n<meta property=\"og:site_name\" content=\"nike0good\" \/>\n<meta property=\"article:published_time\" content=\"2015-09-17T12:40:57+00:00\" \/>\n<meta name=\"author\" content=\"nike0good\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"nike0good\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/nike0good.com\\\/?p=557#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/nike0good.com\\\/?p=557\"},\"author\":{\"name\":\"nike0good\",\"@id\":\"https:\\\/\\\/nike0good.com\\\/#\\\/schema\\\/person\\\/4defa38da89de87e400861e73396baad\"},\"headline\":\"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3\",\"datePublished\":\"2015-09-17T12:40:57+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/nike0good.com\\\/?p=557\"},\"wordCount\":107,\"commentCount\":0,\"articleSection\":[\"\u7b97\u6cd5\"],\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/nike0good.com\\\/?p=557#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/nike0good.com\\\/?p=557\",\"url\":\"https:\\\/\\\/nike0good.com\\\/?p=557\",\"name\":\"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3 - nike0good\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/nike0good.com\\\/#website\"},\"datePublished\":\"2015-09-17T12:40:57+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/nike0good.com\\\/#\\\/schema\\\/person\\\/4defa38da89de87e400861e73396baad\"},\"breadcrumb\":{\"@id\":\"https:\\\/\\\/nike0good.com\\\/?p=557#breadcrumb\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/nike0good.com\\\/?p=557\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/nike0good.com\\\/?p=557#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/nike0good.com\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/nike0good.com\\\/#website\",\"url\":\"https:\\\/\\\/nike0good.com\\\/\",\"name\":\"nike0good\",\"description\":\"\u6709\u6240\u4f5c\u4e3a\u662f\u4eba\u751f\u7684\u6700\u9ad8\u5883\u754c\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/nike0good.com\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"zh-Hans\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/nike0good.com\\\/#\\\/schema\\\/person\\\/4defa38da89de87e400861e73396baad\",\"name\":\"nike0good\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/8e5fa08d5c367a1a6fb5ff13bb10ed5a331f981513256951290ae42322da6854?s=96&d=identicon&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/8e5fa08d5c367a1a6fb5ff13bb10ed5a331f981513256951290ae42322da6854?s=96&d=identicon&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/8e5fa08d5c367a1a6fb5ff13bb10ed5a331f981513256951290ae42322da6854?s=96&d=identicon&r=g\",\"caption\":\"nike0good\"},\"sameAs\":[\"https:\\\/\\\/nike0good.com\"],\"url\":\"https:\\\/\\\/nike0good.com\\\/?author=1\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3 - nike0good","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/nike0good.com\/?p=557","og_locale":"zh_CN","og_type":"article","og_title":"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3 - nike0good","og_description":"A. There is a polyline going through points (0,\u20090) […]","og_url":"https:\/\/nike0good.com\/?p=557","og_site_name":"nike0good","article_published_time":"2015-09-17T12:40:57+00:00","author":"nike0good","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"nike0good","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"1 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/nike0good.com\/?p=557#article","isPartOf":{"@id":"https:\/\/nike0good.com\/?p=557"},"author":{"name":"nike0good","@id":"https:\/\/nike0good.com\/#\/schema\/person\/4defa38da89de87e400861e73396baad"},"headline":"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3","datePublished":"2015-09-17T12:40:57+00:00","mainEntityOfPage":{"@id":"https:\/\/nike0good.com\/?p=557"},"wordCount":107,"commentCount":0,"articleSection":["\u7b97\u6cd5"],"inLanguage":"zh-Hans","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/nike0good.com\/?p=557#respond"]}]},{"@type":"WebPage","@id":"https:\/\/nike0good.com\/?p=557","url":"https:\/\/nike0good.com\/?p=557","name":"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3 - nike0good","isPartOf":{"@id":"https:\/\/nike0good.com\/#website"},"datePublished":"2015-09-17T12:40:57+00:00","author":{"@id":"https:\/\/nike0good.com\/#\/schema\/person\/4defa38da89de87e400861e73396baad"},"breadcrumb":{"@id":"https:\/\/nike0good.com\/?p=557#breadcrumb"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/nike0good.com\/?p=557"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/nike0good.com\/?p=557#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/nike0good.com\/"},{"@type":"ListItem","position":2,"name":"Codeforces Round #320 (Div. 1) [Bayan Thanks-Round] \u9898\u89e3"}]},{"@type":"WebSite","@id":"https:\/\/nike0good.com\/#website","url":"https:\/\/nike0good.com\/","name":"nike0good","description":"\u6709\u6240\u4f5c\u4e3a\u662f\u4eba\u751f\u7684\u6700\u9ad8\u5883\u754c","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/nike0good.com\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"zh-Hans"},{"@type":"Person","@id":"https:\/\/nike0good.com\/#\/schema\/person\/4defa38da89de87e400861e73396baad","name":"nike0good","image":{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/secure.gravatar.com\/avatar\/8e5fa08d5c367a1a6fb5ff13bb10ed5a331f981513256951290ae42322da6854?s=96&d=identicon&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/8e5fa08d5c367a1a6fb5ff13bb10ed5a331f981513256951290ae42322da6854?s=96&d=identicon&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/8e5fa08d5c367a1a6fb5ff13bb10ed5a331f981513256951290ae42322da6854?s=96&d=identicon&r=g","caption":"nike0good"},"sameAs":["https:\/\/nike0good.com"],"url":"https:\/\/nike0good.com\/?author=1"}]}},"_links":{"self":[{"href":"https:\/\/nike0good.com\/index.php?rest_route=\/wp\/v2\/posts\/557","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/nike0good.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/nike0good.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/nike0good.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/nike0good.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=557"}],"version-history":[{"count":0,"href":"https:\/\/nike0good.com\/index.php?rest_route=\/wp\/v2\/posts\/557\/revisions"}],"wp:attachment":[{"href":"https:\/\/nike0good.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=557"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/nike0good.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=557"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/nike0good.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=557"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}