{"id":653,"date":"2025-05-11T12:28:38","date_gmt":"2025-05-11T04:28:38","guid":{"rendered":"http:\/\/47.121.202.229\/?p=653"},"modified":"2025-05-11T12:28:39","modified_gmt":"2025-05-11T04:28:39","slug":"2025-5-10","status":"publish","type":"post","link":"http:\/\/47.121.202.229\/?p=653","title":{"rendered":"2025.5.10"},"content":{"rendered":"\n

P1019 [NOIP 2000 \u63d0\u9ad8\u7ec4] \u5355\u8bcd\u63a5\u9f99<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint n, ans = 0;\nstring arr[25];\nint syb[25];\nchar c;\n\n\nvoid dfs(string cur, string front) {\n\tans = max(ans, int(cur.size()));\n\tfor (int i = 1; i <= n; i++) {\n\t\tif (syb[i] >= 2) {\n\t\t\tcontinue;\n\t\t}\n\t\tint cs = front.size();\n\n\t\tint fs = cur.size();\n\t\tint as = arr[i].size();\n\t\tint mxlen = min(fs, as) - 1;\n\t\tfor (int j = 1; j <= mxlen ; j++) {\n\t\t\tif (cur.substr(fs - j) == arr[i].substr(0, j)) {\n\t\t\t\tstring newcur = cur + arr[i].substr(j);\n\t\t\t\tsyb[i]++;\n\t\t\t\tdfs(newcur, arr[i]);\n\t\t\t\tsyb[i]--;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn;\n}\n\nint main() {\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++) {\n\t\tcin >> arr[i];\n\t}\n\tcin >> c;\n\tfor (int i = 1; i <= n; i++) {\n\t\tif (arr[i][0] == c) {\n\t\t\tsyb[i]++;\n\t\t\tdfs(arr[i], arr[i]);\n\t\t\tsyb[i]--;\n\t\t}\n\t}\n\tcout << ans;\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
P5194 [USACO05DEC] Scales S<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint n, c, arr[1005];\nll sum[1005];\nint ans = 0;\n\nvoid dfs(int sid, ll cal) {\n\n\tif (sid >= 1 && cal + sum[sid] <= c) {\n\t\tif (cal + sum[sid] > ans) {\n\t\t\tans = cal + sum[sid];\n\t\t}\n\t\treturn;\n\t}\n\tif (cal > ans) {\n\t\tans = cal;\n\t}\n\tfor (int i = sid; i >= 1; i--) {\n\t\tif (cal + arr[i] <= c) {\n\t\t\tdfs(i - 1, cal + arr[i]);\n\t\t}\n\t}\n}\n\nint main() {\n\tcin >> n >> c;\n\tfor (int i = 1; i <= n; i++) {\n\t\tcin >> arr[i];\n\t\tsum[i] = sum[i - 1] + arr[i];\n\t}\n\tdfs(n, 0);\n\tcout << ans;\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
P1378 \u6cb9\u6ef4\u6269\u5c55<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\n\n\nint n;\ndouble a1, b1, a2, b2;\nint ssyb[10];\ndouble ans;\npair<double, double> arr[10];\nvector<pair<pair<double, double>, double>> syb;\n\ndouble r(double x, double y) {\n\tdouble cr, temp1, temp2, temp3;\n\tvector<pair<pair<double, double>, double>> cur = syb;\n\ttemp1 = min(abs(x - a1), abs(x - a2));\n\ttemp2 = min(abs(y - b1), abs(y - b2));\n\tcr = min(temp1, temp2);\n\twhile (cur.size()) {\n\t\ttemp1 = cur.back().first.first;\n\t\ttemp2 = cur.back().first.second;\n\t\ttemp3 = cur.back().second;\n\t\tcur.pop_back();\n\t\tif ((x - temp1) * (x - temp1) + (y - temp2) * (y - temp2) <= temp3 * temp3) {\n\t\t\treturn 0;\n\t\t}\n\t\tcr = min(cr, sqrt((x - temp1) * (x - temp1) + (y - temp2) * (y - temp2)) - temp3);\n\t}\n\treturn cr;\n}\n\nvoid dfs(double sum, int cnt) {\n\tif (cnt >= n) {\n\t\tans = max(ans, sum);\n\t\treturn;\n\t}\n\n\tfor (int i = 1; i <= n; i++) {\n\t\tif (!ssyb[i]) {\n\t\t\tssyb[i] = 1;\n\t\t\tdouble rr = r(arr[i].first, arr[i].second);\n\t\t\tsyb.push_back({{arr[i].first, arr[i].second}, rr});\n\t\t\tdfs(sum + rr * rr, cnt + 1);\n\t\t\tssyb[i] = 0;\n\t\t\tsyb.pop_back();\n\t\t}\n\t}\n}\n\nint main() {\n\tcin >> n >> a1 >> b1 >> a2 >> b2;\n\tfor (int i = 1; i <= n; i++) {\n\t\tcin >> arr[i].first >> arr[i].second;\n\t}\n\tans = 0;\n\tdfs(0, 0);\n\n\tdouble tt = (abs(a1 - a2) * abs(b1 - b2)) - ans * M_PI;\n\tint ttt = (tt + 0.5) \/ 1;\n\n\tcout << ttt;\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
P3956 [NOIP 2017 \u666e\u53ca\u7ec4] \u68cb\u76d8<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint m, n, x, y, c, color[107][107], ans = 0x3f3f3f3f, opt[107][107];\nbool vis[107][107];\n\nvoid dfs(int x, int y, int p) {\n\tif (opt[x][y] && p >= opt[x][y]) {\n\t\treturn;\n\t}\n\topt[x][y] = p;\n\tif (x == m && y == m) {\n\t\tans = min(ans, p);\n\t\treturn;\n\t}\n\tif (((x == m - 1 && y == m) || (x == m && y == m - 1)) && color[m][m] == 0) {\n\t\tans = min(ans, p + 2);\n\t\treturn;\n\t}\n\tvis[x][y] = 1;\n\t\/\/\u5411\u53f3\u4e00\u683c\n\tif (!vis[x][y + 1] && color[x][y + 1]) {\n\t\tif (color[x][y] == color[x][y + 1]) {\n\t\t\tdfs(x, y + 1, p);\n\t\t} else {\n\t\t\tdfs(x, y + 1, p + 1);\n\t\t}\n\t}\n\t\/\/\u5411\u4e0b\u4e00\u683c\n\tif (!vis[x + 1][y] && color[x + 1][y]) {\n\t\tif (color[x][y] == color[x + 1][y]) {\n\t\t\tdfs(x + 1, y, p);\n\t\t} else {\n\t\t\tdfs(x + 1, y, p + 1);\n\t\t}\n\t}\n\t\/\/\u5411\u5de6\u4e00\u683c\n\tif (!vis[x][y - 1] && color[x][y - 1]) {\n\t\tif (color[x][y] == color[x][y - 1]) {\n\t\t\tdfs(x, y - 1, p);\n\t\t} else {\n\t\t\tdfs(x, y - 1, p + 1);\n\t\t}\n\t}\n\t\/\/\u5411\u4e0a\u4e00\u683c\n\tif (!vis[x - 1][y] && color[x - 1][y]) {\n\t\tif (color[x][y] == color[x - 1][y]) {\n\t\t\tdfs(x - 1, y, p);\n\t\t} else {\n\t\t\tdfs(x - 1, y, p + 1);\n\t\t}\n\t}\n\n\t\/\/\u5411\u53f3\u4e24\u683c\n\tif (!vis[x][y + 2] && color[x][y + 2]) {\n\t\tif (color[x][y] == color[x][y + 2]) {\n\t\t\tdfs(x, y + 2, p + 2);\n\t\t} else {\n\t\t\tdfs(x, y + 2, p + 3);\n\t\t}\n\t}\n\t\/\/\u5411\u53f3\u4e0b\u89d2\u4e00\u683c\n\tif (!vis[x + 1][y + 1] && color[x + 1][y + 1]) {\n\t\tif (color[x][y] == color[x + 1][y + 1]) {\n\t\t\tdfs(x + 1, y + 1, p + 2);\n\t\t} else {\n\t\t\tdfs(x + 1, y + 1, p + 3);\n\t\t}\n\t}\n\t\/\/\u5411\u4e0b\u4e24\u683c\n\tif (!vis[x + 2][y] && color[x + 2][y]) {\n\t\tif (color[x][y] == color[x + 2][y]) {\n\t\t\tdfs(x + 2, y, p + 2);\n\t\t} else {\n\t\t\tdfs(x + 2, y, p + 3);\n\t\t}\n\t}\n\t\/\/\u5411\u5de6\u4e0b\u89d2\u4e00\u683c\n\tif (!vis[x + 1][y - 1] && color[x + 1][y - 1]) {\n\t\tif (color[x][y] == color[x + 1][y - 1]) {\n\t\t\tdfs(x + 1, y - 1, p + 2);\n\t\t} else {\n\t\t\tdfs(x + 1, y - 1, p + 3);\n\t\t}\n\t}\n\t\/\/\u5411\u5de6\u4e24\u683c\n\tif (!vis[x][y - 2] && color[x][y - 2]) {\n\t\tif (color[x][y] == color[x][y - 2]) {\n\t\t\tdfs(x, y - 2, p + 2);\n\t\t} else {\n\t\t\tdfs(x, y - 2, p + 3);\n\t\t}\n\t}\n\t\/\/\u5411\u5de6\u4e0a\u89d2\u4e00\u683c\n\tif (!vis[x - 1][y - 1] && color[x - 1][y - 1]) {\n\t\tif (color[x][y] == color[x - 1][y - 1]) {\n\t\t\tdfs(x - 1, y - 1, p + 2);\n\t\t} else {\n\t\t\tdfs(x - 1, y - 1, p + 3);\n\t\t}\n\t}\n\t\/\/\u5411\u4e0a\u4e24\u683c\n\tif (!vis[x - 2][y] && color[x - 2][y]) {\n\t\tif (color[x][y] == color[x - 2][y]) {\n\t\t\tdfs(x - 2, y, p + 2);\n\t\t} else {\n\t\t\tdfs(x - 2, y, p + 3);\n\t\t}\n\t}\n\t\/\/\u5411\u53f3\u4e0a\u89d2\u4e00\u683c\n\tif (!vis[x - 1][y + 1] && color[x - 1][y + 1]) {\n\t\tif (color[x][y] == color[x - 1][y + 1]) {\n\t\t\tdfs(x - 1, y + 1, p + 2);\n\t\t} else {\n\t\t\tdfs(x - 1, y + 1, p + 3);\n\t\t}\n\t}\n\tvis[x][y] = 0;\n}\n\n\n\nint main() {\n\tcin >> m >> n;\n\n\tfor (int i = 1; i <= n; i++) {\n\t\tcin >> x >> y >> c;\n\t\tcolor[x][y] = c + 1;\n\t}\n\n\tdfs(1, 1, 0);\n\tif (ans == 0x3f3f3f3f) {\n\t\tcout << \"-1\" << endl;\n\t} else {\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
P1032 [NOIP 2002 \u63d0\u9ad8\u7ec4] \u5b57\u4e32\u53d8\u6362<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstring a, b;\nstring arr1[10], arr2[10];\nint ans = 0x3f3f3f3f;\nint n = 1;\n\nstruct node {\n\tstring s;\n\tint cnt;\n};\n\nmap<string, bool> vis;\n\nvoid bfs(node nd) {\n\tqueue<node> q;\n\tq.push(nd);\n\twhile (q.size()) {\n\t\tstring s = q.front().s;\n\t\tint cnt = q.front().cnt;\n\t\tq.pop();\n\t\tif (cnt > 10 || cnt >= ans) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (vis[s]) {\n\t\t\tcontinue;\n\t\t}\n\t\tvis[s] = true;\n\t\tif (s == b) {\n\t\t\tans = min(ans, cnt);\n\t\t\tcontinue;\n\t\t}\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tint sz = arr1[i].size();\n\t\t\tif (sz > s.size()) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 0; j <= s.size() - sz; j++) {\n\t\t\t\tif (s.substr(j, sz) == arr1[i]) {\n\t\t\t\t\tnode nnd;\n\t\t\t\t\tstring ns = s.substr(0, j) + arr2[i] + s.substr(j + sz);\n\t\t\t\t\tnnd.s = ns;\n\t\t\t\t\tnnd.cnt = cnt + 1;\n\t\t\t\t\tq.push(nnd);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nint main() {\n\tcin >> a >> b;\n\twhile (cin >> arr1[n] >> arr2[n]) {\n\t\tn++;\n\t}\n\tn--;\n\n\tnode nd;\n\tnd.s = a;\n\tnd.cnt = 0;\n\tbfs(nd);\n\tif (ans == 0x3f3f3f3f) {\n\t\tcout << \"NO ANSWER!\" << endl;\n\t} else {\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
P1126 \u673a\u5668\u4eba\u642c\u91cd\u7269<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\n\nint n, m, a1, b1, a2, b2, ans = 0x3f3f3f3f;\nint arr[55][55];\nint syb[55][55][5]; \/\/ x, y, direction\n\nint fxt[5][5] = {\n\t{0, 0, 0, 0, 0},\n\t{0, 0, 2, 1, 1}, \/\/ North\n\t{0, 2, 0, 1, 1}, \/\/ South\n\t{0, 1, 1, 0, 2}, \/\/ West\n\t{0, 1, 1, 2, 0}  \/\/ East\n};\n\nstruct Node {\n\tint time, x, y, dir;\n};\n\nconst int dx[] = {0, -1, 1, 0, 0}; \/\/ North, South, West, East\nconst int dy[] = {0, 0, 0, -1, 1};\n\nbool isValid(int x, int y) {\n\tif (x < 1 || y < 1 || x + 1 > n || y + 1 > m)\n\t\treturn false;\n\treturn !arr[x][y] && !arr[x][y + 1] && !arr[x + 1][y] && !arr[x + 1][y + 1];\n}\n\nvoid bfs(int start_dir) {\n\tmemset(syb, 0x3f, sizeof(syb));\n\tqueue<Node> q;\n\tq.push({0, a1, b1, start_dir});\n\tsyb[a1][b1][start_dir] = 0;\n\n\twhile (!q.empty()) {\n\t\tNode cur = q.front();\n\t\tq.pop();\n\n\t\t\/\/ \u5230\u8fbe\u7ec8\u70b9\n\t\tif (cur.x == a2 && cur.y == b2) {\n\t\t\tans = min(ans, cur.time);\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ \u526a\u679d\uff1a\u5f53\u524d\u8def\u5f84\u4e0d\u662f\u6700\u4f18\n\t\tif (cur.time > ans)\n\t\t\tcontinue;\n\t\tif (cur.time > syb[cur.x][cur.y][cur.dir])\n\t\t\tcontinue;\n\n\t\t\/\/ \u5c1d\u8bd5\u6240\u6709\u8f6c\u5411\n\t\tfor (int new_dir = 1; new_dir <= 4; ++new_dir) {\n\t\t\tif (new_dir == cur.dir)\n\t\t\t\tcontinue;\n\t\t\tint cost = fxt[cur.dir][new_dir];\n\t\t\tint new_time = cur.time + cost;\n\n\t\t\tif (new_time < syb[cur.x][cur.y][new_dir]) {\n\t\t\t\tsyb[cur.x][cur.y][new_dir] = new_time;\n\t\t\t\tq.push({new_time, cur.x, cur.y, new_dir});\n\t\t\t}\n\t\t}\n\n\t\t\/\/ \u5c1d\u8bd5\u79fb\u52a81-3\u6b65\n\t\tfor (int step = 1; step <= 3; ++step) {\n\t\t\tint nx = cur.x + dx[cur.dir] * step;\n\t\t\tint ny = cur.y + dy[cur.dir] * step;\n\n\t\t\t\/\/ \u68c0\u67e5\u8def\u5f84\u4e0a\u7684\u6bcf\u4e00\u6b65\u548c\u7ec8\u70b9\n\t\t\tbool canMove = true;\n\t\t\tfor (int s = 1; s <= step && canMove; ++s) {\n\t\t\t\tint tx = cur.x + dx[cur.dir] * s;\n\t\t\t\tint ty = cur.y + dy[cur.dir] * s;\n\t\t\t\tif (!isValid(tx, ty))\n\t\t\t\t\tcanMove = false;\n\t\t\t}\n\t\t\tif (!isValid(nx, ny))\n\t\t\t\tcanMove = false;\n\n\t\t\tif (canMove) {\n\t\t\t\tint new_time = cur.time + 1;\n\t\t\t\tif (new_time < syb[nx][ny][cur.dir]) {\n\t\t\t\t\tsyb[nx][ny][cur.dir] = new_time;\n\t\t\t\t\tq.push({new_time, nx, ny, cur.dir});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\tcin >> n >> m;\n\tfor (int i = 1; i <= n; ++i)\n\t\tfor (int j = 1; j <= m; ++j)\n\t\t\tcin >> arr[i][j];\n\n\tcin >> a1 >> b1 >> a2 >> b2;\n\tchar c;\n\tcin >> c;\n\n\tint dir;\n\tif (c == 'N')\n\t\tdir = 1;\n\telse if (c == 'S')\n\t\tdir = 2;\n\telse if (c == 'W')\n\t\tdir = 3;\n\telse\n\t\tdir = 4;\n\n\tbfs(dir);\n\n\tcout << (ans == 0x3f3f3f3f ? -1 : ans) << endl;\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
P1928 \u5916\u661f\u5bc6\u7801<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\nint num, n;\nstring s;\nstring temp;\nvector<int> arr;\n\nint main() {\n\tcin >> s;\n\tint l, r;\n\n\tint i = 0;\n\n\twhile (i < s.size()) {\n\t\tif (s[i] == '[') {\n\t\t\tarr.push_back(i);\n\t\t\ti++;\n\t\t} else if (s[i] == ']') {\n\t\t\tr = i;\n\t\t\tl = arr.back();\n\t\t\tarr.pop_back();\n\t\t\ttemp.clear();\n\t\t\tint n = l + 1;\n\t\t\tint num = 0;\n\t\t\twhile (isdigit(s[n])) {\n\t\t\t\tnum = num * 10 + s[n] - '0';\n\t\t\t\tn++;\n\t\t\t}\n\t\t\tn = n - l - 1;\n\t\t\tfor (int j = 1; j <= num; j++) {\n\t\t\t\ttemp += s.substr(l + n + 1, r - l - 1 - n);\n\t\t\t}\n\t\t\ts = s.substr(0, l) + temp + s.substr(r + 1);\n\t\t\ti = i - 1 - n + (r - l - 1 - n) * (num - 1);\n\t\t} else {\n\t\t\ti++;\n\t\t}\n\n\t}\n\tcout << s;\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
P1205 [USACO1.2] \u65b9\u5757\u8f6c\u6362 Transformations<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nchar arr[15][15];\nchar tar[15][15];\nchar fz[15][15];\nint n;\nbool can = false;\n\nint main() {\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tcin >> arr[i][j];\n\t\t}\n\t}\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tcin >> tar[i][j];\n\t\t}\n\t}\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tfz[i][j] = arr[i][n - j + 1];\n\t\t}\n\t}\n\t\/\/ 1\n\tcan = true;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tif (arr[i][j] != tar[j][n - i + 1]) {\n\t\t\t\tcan = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (can) {\n\t\tcout << 1;\n\t\treturn 0;\n\t}\n\t\/\/ 2\n\tcan = true;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tif (arr[i][j] != tar[n - i + 1][n - j + 1]) {\n\t\t\t\tcan = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (can) {\n\t\tcout << 2;\n\t\treturn 0;\n\t}\n\t\/\/ 3\n\tcan = true;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tif (arr[i][j] != tar[n - j + 1][i]) {\n\t\t\t\tcan = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (can) {\n\t\tcout << 3;\n\t\treturn 0;\n\t}\n\t\/\/ 4\n\tcan = true;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tif (fz[i][j] != tar[i][j]) {\n\t\t\t\tcan = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (can) {\n\t\tcout << 4;\n\t\treturn 0;\n\t}\n\n\n\t\/\/ 5\n\tcan = true;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tif (fz[i][j] != tar[j][n - i + 1]) {\n\t\t\t\tcan = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (can) {\n\t\tcout << 5;\n\t\treturn 0;\n\t}\n\n\tcan = true;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tif (fz[i][j] != tar[n - i + 1][n - j + 1]) {\n\t\t\t\tcan = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (can) {\n\t\tcout << 5;\n\t\treturn 0;\n\t}\n\n\tcan = true;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tif (fz[i][j] != tar[n - j + 1][i]) {\n\t\t\t\tcan = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (can) {\n\t\tcout << 5;\n\t\treturn 0;\n\t}\n\n\t\/\/ 6\n\tcan = true;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j <= n; j++) {\n\t\t\tif (arr[i][j] != tar[i][j]) {\n\t\t\t\tcan = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (can) {\n\t\tcout << 5;\n\t\treturn 0;\n\t}\n\tcout << 7;\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n
P5657 [CSP-S2019] \u683c\u96f7\u7801<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\nusing ull = unsigned long long;\n\nint main() {\n    int n;\n    ull k;\n    cin >> n >> k;\n    k++; \/\/ \u5c06\u8f93\u5165k\u8f6c\u6362\u4e3a1-based\u7d22\u5f15\n    string s;\n    for (int m = n; m >= 1; m--) {\n        ull mid = 1ULL << (m - 1); \/\/ \u4f7f\u7528\u4f4d\u8fd0\u7b97\u907f\u514d\u7cbe\u5ea6\u95ee\u9898\n        if (k > mid) {\n            s += '1';\n            k = (1ULL << m) - k + 1; \/\/ \u8c03\u6574k\u7684\u4f4d\u7f6e\n        } else {\n            s += '0';\n        }\n    }\n    cout << s;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
\u5361\u7247\u7ffb\u8f6c<\/h2>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
#include <bits\/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n\n\nconst int mod = 998244353;\nint n, arr1[200005], arr2[200005];\nint dp[200005][2];\n\nint main() {\n\tcin >> n;\n\tfor (int i = 1; i <= n; i++) {\n\t\tcin >> arr1[i] >> arr2[i];\n\t}\n\tdp[1][0] = 1;\n\tdp[1][1] = 1;\n\n\tfor (int i = 2; i <= n; i++) {\n\t\t\/\/\u5f53\u524d\u7684\u6b63\u9762\u548c\u524d\u4e00\u5f20\u7684\u4e24\u9762\u90fd\u76f8\u7b49\n\t\tif (arr1[i] == arr1[i - 1] && arr1[i] == arr2[i - 1]) {\n\t\t\tdp[i][0] = 0;\n\t\t} else if (arr1[i] == arr1[i - 1]) { \/\/\u5f53\u524d\u6b63\u9762\u548c\u524d\u9762\u6b63\u9762\u76f8\u7b49\n\t\t\tdp[i][0] = dp[i - 1][1] % mod;\n\t\t} else if (arr1[i] == arr2[i - 1]) { \/\/\u5f53\u524d\u6b63\u9762\u548c\u524d\u9762\u53cd\u9762\u76f8\u7b49\n\t\t\tdp[i][0] = dp[i - 1][0] % mod;\n\t\t} else { \/\/\u5f53\u524d\u6b63\u9762\u548c\u524d\u9762\u6b63\u53cd\u9762\u90fd\u4e0d\u76f8\u7b49\n\t\t\tdp[i][0] = (dp[i - 1][0] + dp[i - 1][1]) % mod;\n\t\t}\n\n\t\t\/\/\u5f53\u524d\u7684\u53cd\u9762\u548c\u524d\u4e00\u5f20\u7684\u4e24\u9762\u90fd\u76f8\u7b49\n\t\tif (arr2[i] == arr1[i - 1] && arr2[i] == arr2[i - 1]) {\n\t\t\tdp[i][1] = 0;\n\t\t} else if (arr2[i] == arr1[i - 1]) { \/\/\u5f53\u524d\u53cd\u9762\u548c\u524d\u9762\u6b63\u9762\u76f8\u7b49\n\t\t\tdp[i][1] = dp[i - 1][1] % mod;\n\t\t} else if (arr2[i] == arr2[i - 1]) { \/\/\u5f53\u524d\u53cd\u9762\u548c\u524d\u9762\u53cd\u9762\u76f8\u7b49\n\t\t\tdp[i][1] = dp[i - 1][0] % mod;\n\t\t} else { \/\/\u5f53\u524d\u53cd\u9762\u548c\u524d\u9762\u6b63\u53cd\u9762\u90fd\u4e0d\u76f8\u7b49\n\t\t\tdp[i][1] = (dp[i - 1][0] + dp[i - 1][1]) % mod;\n\t\t}\n\t}\n\tcout << (dp[n][0] + dp[n][1]) % mod;\n\n\treturn 0;\n}\n\n\n\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
P1019 [NOIP 2000 \u63d0\u9ad8\u7ec4] \u5355\u8bcd\u63a5\u9f99 P5194 [USACO05DEC] Scales S  […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[36,19,26],"tags":[],"class_list":["post-653","post","type-post","status-publish","format-standard","hentry","category-2025-5","category-data_learning","category-26"],"_links":{"self":[{"href":"http:\/\/47.121.202.229\/index.php?rest_route=\/wp\/v2\/posts\/653","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/47.121.202.229\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/47.121.202.229\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/47.121.202.229\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/47.121.202.229\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=653"}],"version-history":[{"count":2,"href":"http:\/\/47.121.202.229\/index.php?rest_route=\/wp\/v2\/posts\/653\/revisions"}],"predecessor-version":[{"id":666,"href":"http:\/\/47.121.202.229\/index.php?rest_route=\/wp\/v2\/posts\/653\/revisions\/666"}],"wp:attachment":[{"href":"http:\/\/47.121.202.229\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=653"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/47.121.202.229\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=653"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/47.121.202.229\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=653"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}