<\/p>\n
\u5b89\u5168\u9a7e\u9a76\uff0c\u5c0f\u5fc3\u7ffb\u8f66\u3002
\nR1A\u7ffb\u8f66\u4e86\uff0cR1B\u518d\u8d70\u4e00\u904d\u3002<\/p>\n
T3\u5c45\u7136\u6ca1\u60f3\u51fa\u6765\uff0c\u96be\u8fc7\u3002<\/p>\n
\u968f\u4fbf\u7edf\u8ba1\u4e00\u4e0b\u5c31\u53ef\u4ee5\u4e86<\/p>\n
#include <bits\/stdc++.h>\nusing namespace std;\nint t, n, m;\nint a[100020];\nint b[100020];\nint main() {\n cin >> t;\n for (int tt = 1; tt <= t; tt++) {\n cin >> n >> m;\n int x, y;\n char c;\n for (int i = 0; i <= m; i++) {\n a[i] = 0;\n b[i] = 0;\n }\n for (int i = 0; i < n; i++) {\n cin >> x >> y >> c;\n if (c == 'W') {\n a[0]++;\n a[x]--;\n } else if (c == 'E') {\n a[x + 1]++;\n } else if (c == 'S') {\n b[0]++;\n b[y]--;\n } else if (c == 'N') {\n b[y + 1]++;\n }\n }\n for (int i = 1; i <= m; i++) {\n a[i] += a[i - 1];\n b[i] += b[i - 1];\n }\n int pa = max_element(a, a + m + 1) - a;\n int pb = max_element(b, b + m + 1) - b;\n printf(\"Case #%d: %d %d\\n\", tt, pa, pb);\n }\n return 0;\n}\n<\/code><\/pre>\nT2<\/h2>\n
\u5927\u6982\u5c31\u662f\u53ea\u80fd\u8be2\u95ee2\u6b21\uff0c\u505a\u6cd5\u662d\u7136\u82e5\u63ed\u3002<\/p>\n
#include <bits\/stdc++.h>\nusing namespace std;\nint t, w;\nint main() {\n cin >> t >> w;\n for (int tt = 0; tt < t; tt++) {\n cout << 200 << endl;\n fflush(stdout);\n long long x;\n cin >> x;\n int r4 = x >> 50 & 127;\n int r5 = x >> 40 & 127;\n int r6 = x >> 33 & 127;\n cout << 50 << endl;\n fflush(stdout);\n long long y;\n cin >> y;\n y -= r4 << (50 \/ 4);\n y -= r5 << (50 \/ 5);\n y -= r6 << (50 \/ 6);\n int r1 = y >> 50 & 127;\n int r2 = y >> 25 & 127;\n int r3 = y >> 16 & 127;\n cout << r1 << ' ' << r2 << ' ' << r3 << ' ' << r4 << ' ' << r5 << ' ' << r6 << endl;\n fflush(stdout);\n int z;\n cin >> z;\n }\n return 0;\n}\n<\/code><\/pre>\nT3<\/h2>\n
\u8fd9\u4e2a\u505a\u6cd5\u662f\u66b4\u529b\uff0c\u6b63\u89e3\u5f85\u8865\u2026\u2026<\/p>\n
#include <bits\/stdc++.h>\nusing namespace std;\nint t, n, m;\nint c[1020][1020];\nint d[1020][1020];\nint main() {\n cin >> t;\n for (int tt = 1; tt <= t; tt++) {\n cin >> n >> m;\n for (int i = 0; i < n; i++) {\n cin >> c[i][i];\n }\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n c[i][j] = max(c[i][j-1], c[j][j]);\n }\n }\n for (int i = 0; i < n; i++) {\n cin >> d[i][i];\n }\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n d[i][j] = max(d[i][j-1], d[j][j]);\n }\n }\n int ans = 0;\n for (int i = 0; i < n; i++) {\n for (int j = i; j < n; j++) {\n if (abs(c[i][j] - d[i][j]) <= m) {\n ans++;\n }\n }\n }\n printf(\"Case #%d: %d\\n\", tt, ans);\n }\n return 0;\n}\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-172","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/wwwwodddd.com\/wordpress\/wp-json\/wp\/v2\/posts\/172","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wwwwodddd.com\/wordpress\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wwwwodddd.com\/wordpress\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wwwwodddd.com\/wordpress\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wwwwodddd.com\/wordpress\/wp-json\/wp\/v2\/comments?post=172"}],"version-history":[{"count":0,"href":"https:\/\/wwwwodddd.com\/wordpress\/wp-json\/wp\/v2\/posts\/172\/revisions"}],"wp:attachment":[{"href":"https:\/\/wwwwodddd.com\/wordpress\/wp-json\/wp\/v2\/media?parent=172"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wwwwodddd.com\/wordpress\/wp-json\/wp\/v2\/categories?post=172"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wwwwodddd.com\/wordpress\/wp-json\/wp\/v2\/tags?post=172"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}