C++の練習を兼ねて, AtCoder Beginner Contest 232 の 問題C (Graph Isomorphism) ~ 問題D (Weak Takahashi) を解いてみた.
■感想.
1. 問題C, Dは, 方針を絞り込めたので, AC版に到達できたと思う.
2. 苦手な動的計画法の訓練を積めたので, 非常に良かったと思う.
3. 引き続き, 時間を見つけて, 過去問の学習を進めていきたいと思う.
本家のサイト AtCoder Beginner Contest 232 解説 の 各リンク を ご覧下さい.
■C++版プログラム(問題C/AC版).
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 |
// C++(GCC 9.2.1) #include <bits/stdc++.h> using namespace std; using P = pair<int, int>; using vp = vector<P>; using vi = vector<int>; #define repex(i, a, b, c) for(int i = a; i < b; i += c) #define repx(i, a, b) repex(i, a, b, 1) #define rep(i, n) repx(i, 0, n) #define repr(i, a, b) for(int i = a; i >= b; i--) #define pb push_back #define a first #define b second #define all(x) x.begin(), x.end() int main(){ // 1. 入力情報. int N, M; scanf("%d %d", &N, &M); vp v1, v2; rep(i, M){ int a, b; scanf("%d %d", &a, &b); a--, b--; v1.pb({a, b}); } rep(i, M){ int c, d; scanf("%d %d", &c, &d); c--, d--; v2.pb({c, d}); } // 2. sort. sort(all(v1)); // 3. 同じ形か? vi z(N); iota(all(z), 0); bool ok = false; do{ // 3-1. ある数列を対応させる. vp v; rep(i, M){ int zc = z[v2[i].a]; int zd = z[v2[i].b]; if(zc > zd) swap(zc, zd); v.pb({zc, zd}); } // 3-2. sort. sort(all(v)); // 3-3. 比較. if(v == v1){ ok = true; break; } }while(next_permutation(all(z))); // 4. 出力. printf("%s\n", ok ? "Yes" : "No"); return 0; } |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 |
[入力例] 4 4 1 2 1 3 1 4 3 4 1 3 1 4 2 3 3 4 [出力例] Yes ※AtCoderテストケースより [入力例] 5 6 1 2 1 3 1 4 3 4 3 5 4 5 1 2 1 3 1 4 1 5 3 5 4 5 [出力例] No ※AtCoderテストケースより [入力例] 8 0 [出力例] Yes ※AtCoderテストケースより [入力例] 5 6 1 2 1 4 2 4 1 3 1 5 3 5 1 2 2 3 2 5 3 5 3 4 4 5 [出力例] No [入力例] 8 9 1 4 1 3 1 2 4 5 3 5 3 4 5 8 3 6 3 7 1 2 1 3 1 9 7 8 2 8 2 3 3 4 2 5 2 6 [出力例] Yes [入力例] 10 12 1 2 1 3 1 4 2 5 3 5 3 6 4 6 4 7 2 7 5 9 7 10 6 8 1 2 1 6 1 7 2 3 2 10 7 10 4 7 4 8 8 10 8 9 5 6 4 6 [出力例] Yes ※ 整数 N が, 問題文の制約条件から範囲外であるケース. |
■C++版プログラム(問題D/AC版).
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 |
// C++(GCC 9.2.1) #include <bits/stdc++.h> using namespace std; #define repex(i, a, b, c) for(int i = a; i < b; i += c) #define repx(i, a, b) repex(i, a, b, 1) #define rep(i, n) repx(i, 0, n) #define repr(i, a, b) for(int i = a; i >= b; i--) int board[111][111], dp[111][111]; int main(){ // 1. 入力情報. int H, W; scanf("%d %d", &H, &W); rep(i, H){ char c[111]; scanf("%s", c); rep(j, W) if(c[j] == '.') board[i][j] = 1; } // 2. dp更新. int ans = 0; dp[0][0] = 1; rep(i, H){ rep(j, W){ // 移動可能な場合. if(board[i][j] && dp[i][j]){ // 下方向. if(i + 1 < H && board[i + 1][j]) dp[i + 1][j] = max(dp[i + 1][j], dp[i][j] + 1); // 右方向. if(j + 1 < W && board[i][j + 1]) dp[i][j + 1] = max(dp[i][j + 1], dp[i][j] + 1); } // 最大値更新. ans = max(ans, dp[i][j]); } } // 3. 出力. printf("%d\n", ans); return 0; } |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 |
[入力例] 3 4 .#.. ..#. ..## [出力例] 4 ※AtCoderテストケースより [入力例] 1 1 . [出力例] 1 ※AtCoderテストケースより [入力例] 5 5 ..... ..... ..... ..... ..... [出力例] 9 ※AtCoderテストケースより [入力例] 32 32 ..##..##..##.....#...####.##.##. #...#.#.##.#.##..#####.#.##.#..# ##.#.##.###..##########.#.##.#.. ##...#.#..######..#.###.####...# .......########.####...##.#.#### ..#..###...####.....#####...##.# #..#.....#.#..###.#.#.#.....##.. ..#.#.#.##..#.####..##.#.##.###. #....#...#.#.......##.###.##.#.# ..#...#...##.#..##.#.#...###..## .#..#.#.####.#.#.#...###.##.#.#. .....##.#######...##.#.##.#.##.. #.##..........###.##.##...#..### #.##.###...#####..###.#...##.... ###...##..##..####.#..#....#.##. .##.####..#..#.##.#..#.##.#.##.# ##..###...##...#.#.##...##...... ..#..#.#.....#..##..#.####...#.. .#.####....#...##..#..#.#.#.##.. ###.##..##.##.###.#...#.##.....# ...#..#.#..#.#..#...##.#.#.###.# ...##..#####.#..###.##.####..### .#.#####.#.###.####...#.....#### ###....###.#.##..##.##..#..#...# ..#.##..#..#.#...###.#..#.###### ###.#####.##.###...##...#.#####. #.#.##...##.#...#..####.....##.# .##..##.##...##...##.#..##.....# #...##.##.#.#.##..#..##.##.#...# #.#####.##.#######.#.....##...#. #..##.#####.###.....#####.#.#..# ##...#####.##.....####.###..#... [出力例] 33 [入力例] 50 60 .#.###.##.##.###..#..####..##...##......##.#.##.#.#..##.#.## ..##..##.###...####..#.###..#.#.#.###...##..#.#.#....#.#.### ..#.###..#####.##.##..#.###.###..####..#...##..####.#.#..### #.....#.#..###.###.#.#...#...#.....#...#.#######...##....... #..#.#..####..##.....##.#####...#....#....##..#.##.#...#..## .....####.#.##....###..#.#...###.###.##..#####..###.##.#...# #..#..#....#..#.#.##.###..#.#.#########...##...##..#...#.### .....##.#.#.#..#.##..##.#....#.#.##..#.....###.############# ##.....###.##.#...#####.......##.#.#..##.....####.##..##..## ######.##.###....#.#..##...###.....#..#.###.#.#.......#.#.#. ....#.........#.##..####..#.##....########...#..######...### ###.#.##..#..#..#....#.####..#....##....##.#..#..##..#...#.. ...#..###..#####..#.##.##.#..###.#.##....#..###.##.##.##.... #..#.#..##.##.#.#...#..#..###.#.####...#....#..#..####..###. #.###.####.......##.###...##....#.###.#.##.##.#.#....#.##### ##.##.#.#..#.#.#.###...#.#...###....##....#####.#..#....###. .##.##.....#...####.#..#...#..#.##......#..#.#.##.#.#.#..... #..#.###.#.###..#...####..#.##.###...#.#######..#..#...#...# .###.#.#.#..###.##.....##.#..#....##....#.#.###.##.#....###. #..#.#.#...#.##..####..####.#.#..###..####.#.#.##...###...#. ...#.###...##..###...#...##.##...#..#.....#########..###.### ...###.#....##.#.#.#..#...#.#...####.....#..#.####.#...#.### #..##.####....#.#..#.#.##.##.####..###########.###..#######. .....#..####....##.#...#..#..###...#.##..##..#.#.####.#..### ..#......#..###.#.....######.##.####......#..#.##...##.#.... #..#.##.##.##.......##.#..##.#..####...#.##.....#...#...#... .#.###....#...#....#######.#....####.#...#.#.#####.###.#...# #.##.##.##.##..#..#..##.#.#.#...##....#.#.#####.#.##...##..# ##...#.#..##...#......#######.#.#..##.####.#.#..#....#..##.# ....###..#.#...#.##..####....#..#..##.#.#####.##.......###.# #.#..######.###..###...#....##..#.#.####.####...##.#...##.#. ...####.###.#.#..####...#..#....##....#...##.#...##.#.#..... ####.#.#...##.##.#.###.#.##..#...#.#...#####..#.#.###..##.## .##.#...###.###...###...##...#.#.#..#..#...###.#..#..##...## #.##.#.....###.#####..#...##..###.#.##..#..####.##.##..#.#.. #.#..#..#.###.##.....#.......###..#.##...##.#.#...###.##..#. .##..#........##.###..#.#.#...#..######.####.###...#....#... .#.#.#..##.###.###..#..##.....##.#....#.#..##..#####..##...# #..##.#...#.#..######....#.##.##....##.#..#..####...##.##.#. #.##...#.###......#.##.######...#..#.#..##.#.#.#....####...# ........#..#.##..####.....#.......####...#.##.###.####....#. ...######.###.########..#.#....######....###.##...##..#.##.# ##....#.#.#..#.#.##.###.#..#..###.#.......#..#...#.##.##.... .#.###.#.##.#######.##.....#...##..#..#..#..#..###...##.#... ..#...#.###....##.####...##....#...####.#.###.#.##....#####. ##..#..#.#..#.#####......#.###.......##..#...###...##......# ..#.#...#..#####...#####.##.....#.#.########.#.#.##..##..#.# #..##.######...####.#######..###....###...#..############### .......####.##.#..#....###.#.##..##...#####.####.###..#.#... ...#.#..#.###......#...#......#...#....###......########.#.# [出力例] 88 |
■参照サイト
M-SOLUTIONS プロコンオープン2021(AtCoder Beginner Contest 232)