{"id":381,"date":"2016-04-06T14:25:58","date_gmt":"2016-04-06T06:25:58","guid":{"rendered":"https:\/\/blog.dimension.moe\/?p=381"},"modified":"2016-07-15T14:32:11","modified_gmt":"2016-07-15T06:32:11","slug":"codeforces-aim-tech-round-div-2","status":"publish","type":"post","link":"https:\/\/archive.ntzyz.io\/2016\/04\/06\/codeforces-aim-tech-round-div-2\/","title":{"rendered":"[CodeForces] AIM Tech Round (Div. 2)"},"content":{"rendered":"

\u867d\u7136\u5df2\u7ecf\u5f03\u5751 ACM \u4e86\uff0c\u4f46\u662f\u51fa\u4e8e\u67d0\u4e9b\u539f\u56e0\uff0c\u6700\u8fd1\u6709\u590d\u4e60\u7b97\u6cd5\u548cA\u9898\u7684\u5fc5\u8981\u2026\u2026<\/p>\n

\"DLKH87K{KLY8(_FR()OSE]9\"<\/p>\n

\u663e\u7136\u56e0\u4e3a\u597d\u4e45\u6ca1\u5e72\u8fd9\u79cd\u4e8b\u513f\u4e86\uff0c\u6211\u7684\u6253\u7b97\u662f\u5148\u627e\u4ee5\u524d\u7684 CodeForces Div2 \u7684 ABC \u9898\u7ec3\u7ec3\u624b\uff0c\u7136\u540e\u518d\u5f00\u59cb\u770b\u4e66\uff0c\u9488\u5bf9\u6027\u7ec3\u4e60\u3002<\/p>\n

\u8fd9\u6b21\u7684\u9898\u76ee\u94fe\u63a5\uff1aAIM Tech Round (Div. 2)<\/a><\/p>\n

<\/p>\n

\n

\u7b2c\u4e00\u9898<\/h2>\n

\u53ef\u4ee5\u8bf4\u524d\u4e24\u9898\u7b49\u4e8e\u6c34\u9898\u662f CodeForces \u7684\u51fa\u9898\u5957\u8def\u4e86\uff0c\u7b2c\u4e00\u9898\u7684\u9898\u610f\u5f88\u7b80\u5355\uff0cLuke Skywalker \u88ab\u56f0\u5728\u4e00\u4e2a\u4e24\u9762\u5899\u58c1\u50cf\u4e2d\u95f4\u903c\u8fd1\u7684\u623f\u95f4\u91cc\uff0c\u9898\u76ee\u7ed9\u51fa\u4e86\u623f\u95f4\u8ddd\u79bb\u548c\u5899\u7684\u79fb\u52a8\u901f\u5ea6\uff0c\u4ee5\u53ca Luke Skywalker \u81ea\u8eab\u7684\u5bbd\u5ea6\uff0c\u8981\u6c42\u4f60\u6c42\u51fa\u4ed6\u8fd8\u6709\u591a\u5c11\u65f6\u95f4\u7684\u751f\u547d\uff08<\/p>\n

\u968f\u624b\u7cca\u4e00\u6bb5\u4ee3\u7801\u54af\uff1a<\/p>\n

#include \r\n\r\nusing namespace std;\r\n\r\nint main() {\r\n    double a, b, c, d;\r\n    cin >> a >> b >> c >> d;\r\n    cout << (b - a) \/ (c + d);\r\n    return 0;\r\n}<\/pre>\n
\u7ed3\u679c\u2026\u2026\u4ed6\u6302\u4e86\u2026\u2026<\/p>\n
Input\r\n1 9 1 2\r\n\r\nOutput\r\n2.66667\r\n\r\nAnswer\r\n2.66666666666666650000\r\n\r\nChecker Log\r\nwrong answer 1st numbers differ - expected: '2.6666667', found: '2.6666700', error = '0.0000013'<\/pre>\n
\u55ef\u2026\u2026\u5f88\u6109\u5feb\u7684\u8fdb\u5ea6\u8bef\u5dee\u2026\u2026\u90a3\u5c31\u6539\u4e00\u4e0b\u54af\uff1a<\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\nint main() {\r\n    double a, b, c, d;\r\n    cin >> a >> b >> c >> d;\r\n    printf(\"%.18f\", (b - a) \/ (c + d));\r\n    return 0;\r\n}<\/pre>\n
\u8fd9\u4efd\u4ee3\u7801\u5f88\u6109\u5feb\u7684\u8fc7\u4e86\u70b9\uff0c\u8017\u65f6 15ms\uff0c\u5185\u5b58\u5360\u7528 2200KB\uff0c\u4e2d\u89c4\u4e2d\u77e9\u3002<\/p>\n
\n
\u7b2c\u4e8c\u9898<\/h2>\n
\u9898\u76ee\u6bd4\u8f83\u77ed\uff0c\u8981\u6c42\u4f60\u7528\u5b57\u6bcd\u8868\u7684\u524d n \u4e2a\u5b57\u6bcd\uff0c\u751f\u6210\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0c\u8981\u6c42\u6bcf\u4e2a\u5b57\u6bcd\u51fa\u73b0\u7684\u6b21\u6570\u5b8c\u5168\u4e0d\u4e00\u6837\uff0c\u540c\u65f6\u518d\u7ed9\u5b9a\u4e00\u4e2a\u5e8f\u5217\uff0c\u5bf9\u5e94\u4f4d\u7f6e\u7684\u5b57\u6bcd\u51fa\u73b0\u7684\u6b21\u6570\u4e0d\u5f97\u8d85\u8fc7\u5e8f\u5217\u4e2d\u5bf9\u5e94\u4f4d\u7f6e\u7684\u503c\uff0c\u6700\u540e\u8981\u6c42\u80fd\u751f\u6210\u7684\u6700\u957f\u7684\u5b57\u7b26\u4e32\u957f\u5ea6\u3002\u6bd4\u5982\u8fd9\u7ec4\u8f93\u5165\u6570\u636e\uff1a<\/p>\n
3\r\n2 5 5<\/pre>\n
\u5c31\u662f\u4f7f\u7528 a, b, c \u8fd9\u4e09\u4e2a\u5b57\u6bcd\u751f\u6210\u4e00\u4e2a\u5b57\u7b26\u4e32\uff0ca \u51fa\u73b0\u6b21\u6570\u4e0d\u80fd\u8d85\u8fc7 2 \u6b21, b \u548c c \u5404\u81ea\u51fa\u73b0\u7684\u6b21\u6570\u4e0d\u80fd\u8d85\u8fc7 5 \u6b21\uff0c\u4ed6\u7684\u7ed3\u679c\u5c31\u662f 11\u3002
\n\u6700\u76f4\u63a5\u7684\u60f3\u6cd5\u5c31\u662f\uff0c\u6bcf\u4e2a\u51fa\u73b0\u7684\u90fd\u8981\u5c3d\u53ef\u80fd\u591a\uff0c\u540c\u65f6\u4e5f\u8981\u4e0d\u91cd\u590d\uff0c\u90a3\u4e48\u4e0a\u9762\u8fd9\u4e2a\u4f8b\u5b50\u7684\u6700\u4f18\u89e3\u663e\u7136\u4e3a a \u51fa\u73b0 2 \u6b21\uff0cb\u3001c \u4e2d\u4e00\u4e2a\u4e3a 5 \u6b21\uff0c\u53e6\u4e00\u4e2a\u4e3a 4 \u6b21\uff0c\u5c06\u51fa\u73b0\u7684\u6b21\u6570\u52a0\u8d77\u6765\u5c31\u5f97\u5230\u4e86\u6837\u4f8b\u8f93\u51fa\u7684\u7ed3\u679c\uff1a 11\u3002
\n\u60f3\u6cd5\u6709\u4e86\u5c31\u662f\u7f16\u7801\u4e86\uff0c\u8fd9\u9898\u7528 STL \u4e2d\u63d0\u4f9b\u7684 set \u5c31\u80fd\u5f88\u5bb9\u6613\u7684\u89e3\u51b3\uff1a<\/p>\n
#include \r\n\r\nusing namespace std;\r\n\r\nint main() {\r\n    ios::sync_with_stdio(false);\r\n    int n;\r\n    cin >> n;\r\n    set iset;\r\n    for (int i = 0; i != n; ++i) {\r\n        int temp;\r\n        cin >> temp;\r\n        while (iset.find(temp) != iset.end())\r\n            temp--;\r\n        if (!temp) continue;\r\n        iset.insert(temp);\r\n    }\r\n    int res = 0;\r\n    for (auto it = iset.begin(); it != iset.end(); ++it) {\r\n        res += *it;\r\n    }\r\n    cout << res << endl;\r\n    return 0;\r\n}<\/pre>\n
\u55ef\uff0c\u7136\u540e\u53c8\u6302\u4e86\u2026\u2026<\/p>\n
Input\r\n26\r\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\r\n\r\nOutput\r\n230195899\r\n\r\nAnswer\r\n25999999675\r\n\r\nChecker Log\r\nwrong answer 1st numbers differ - expected: '25999999675', found: '230195899'<\/pre>\n
\u6b38\u4e24\u6b21\u7838\u5728\u4e86\u7cbe\u5ea6(?)\u3002\u6240\u4ee5\u54af\uff0c\u628a\u6570\u636e\u7c7b\u578b\u6539\u7528 uint64_t \u4f30\u8ba1\u5c31\u6ca1\u95ee\u9898\u4e86\uff1a<\/p>\n
#include \r\n\r\nusing namespace std;\r\nint main() {\r\n    ios::sync_with_stdio(false);\r\n    int n;\r\n    cin >> n;\r\n    set iset;\r\n    for (int i = 0; i != n; ++i) {\r\n        int temp;\r\n        cin >> temp;\r\n        while (iset.find(temp) != iset.end())\r\n            temp--;\r\n        if (!temp) continue;\r\n        iset.insert(temp);\r\n    }\r\n    uint64_t res = 0;\r\n    for (auto it = iset.begin(); it != iset.end(); ++it) {\r\n        res += *it;\r\n    }\r\n    cout << res << endl;\r\n    return 0;\r\n}<\/pre>\n
Accepted, \u5185\u5b58\u6d88\u8017\u548c\u65f6\u95f4\u5360\u7528\u540c\u7b2c\u4e00\u9898\u3002<\/p>\n
\n
\u7b2c\u4e09\u9898<\/h2>\n
\u53bb\u62ff\u5feb\u9012\u4e86\u2026\u2026\u7136\u540e\u4e0a\u8bfe\u2026\u2026\u56de\u6765\u518d\u505a\uff08<\/p>\n","protected":false},"excerpt":{"rendered":"
\u867d\u7136\u5df2\u7ecf\u5f03\u5751 ACM \u4e86\uff0c\u4f46\u662f\u51fa\u4e8e\u67d0\u4e9b\u539f\u56e0\uff0c\u6700\u8fd1\u6709\u590d\u4e60\u7b97\u6cd5\u548cA\u9898\u7684\u5fc5\u8981\u2026\u2026 \u663e\u7136\u56e0\u4e3a\u597d\u4e45\u6ca1\u5e72\u8fd9\u79cd\u4e8b\u513f\u4e86\uff0c\u6211\u7684\u6253 … \u7ee7\u7eed\u9605\u8bfb[CodeForces] AIM Tech Round (Div. 2)<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[38],"tags":[21],"_links":{"self":[{"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/posts\/381"}],"collection":[{"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/comments?post=381"}],"version-history":[{"count":10,"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/posts\/381\/revisions"}],"predecessor-version":[{"id":644,"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/posts\/381\/revisions\/644"}],"wp:attachment":[{"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/media?parent=381"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/categories?post=381"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/archive.ntzyz.io\/wp-json\/wp\/v2\/tags?post=381"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}