結果
問題 | No.1916 Making Palindrome on Gird |
ユーザー | daut-dlang |
提出日時 | 2022-04-29 23:39:54 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,629 bytes |
コンパイル時間 | 835 ms |
コンパイル使用メモリ | 121,056 KB |
実行使用メモリ | 186,548 KB |
最終ジャッジ日時 | 2024-06-22 15:03:54 |
合計ジャッジ時間 | 12,233 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | WA | - |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | WA | - |
testcase_10 | AC | 1 ms
6,944 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 11 ms
18,056 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 612 ms
157,936 KB |
testcase_19 | AC | 588 ms
156,132 KB |
testcase_20 | AC | 591 ms
154,716 KB |
testcase_21 | AC | 606 ms
156,756 KB |
testcase_22 | AC | 612 ms
158,400 KB |
testcase_23 | AC | 2 ms
6,940 KB |
testcase_24 | AC | 2 ms
6,940 KB |
testcase_25 | AC | 2 ms
6,944 KB |
testcase_26 | AC | 1 ms
6,944 KB |
testcase_27 | AC | 2 ms
6,944 KB |
testcase_28 | AC | 1,418 ms
184,824 KB |
testcase_29 | AC | 1,331 ms
184,900 KB |
testcase_30 | AC | 1,339 ms
186,548 KB |
testcase_31 | AC | 1,356 ms
184,800 KB |
testcase_32 | AC | 1,420 ms
184,856 KB |
ソースコード
import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); } double euDist(T)(T[] a, T[] b) { auto c = a.dup; c[] -= b[]; c[] *= c[]; return sqrt(cast(double)c.sum); } double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; } double norm(double[] vec) { return sqrt(reduce!((a,b)=>a+b*b)(0.0, vec)); } double dotProd(double[] a, double[] b) { auto r = a.dup; r[] *= b[]; return r.sum; } long mod = 10^^9 + 7; //long mod = 998_244_353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); } void main() { auto H = RD; auto W = RD; bool isRotate = H > W; auto a = new long[][](min(H, W), max(H, W)); foreach (i; 0..H) { auto S = RD!string; foreach (j; 0..W) { if (isRotate) a[j][i] = S[j]-'a'; else a[i][j] = S[j]-'a'; } } if (isRotate) swap(H, W); if (a[0][0] != a[H-1][W-1]) writeln(0); else { auto dp = new long[][][]((H+W)/2, H, H); dp[0][0][0] = 1; foreach (i; 0..dp.length-1) { auto len = min(i+1, H); foreach (j; 0..len) { auto y1 = j; auto x1 = i-j; foreach (k; 0..len) { if (dp[i][j][k] == 0) continue; auto y2 = H-len+k; auto x2 = W-k-1; if (a[y1][x1] != a[y2][x2]) continue; foreach (dd1, d1; [[0, 1], [1, 0]]) { auto dy1 = y1 + d1[0]; auto dx1 = x1 + d1[1]; if (!inside(dy1, 0, H) || !inside(dx1, 0, W)) continue; foreach (dd2, d2; [[1, 0], [0, 1]]) { auto dy2 = y2 - d2[0]; auto dx2 = x2 - d2[1]; if (!inside(dy2, 0, H) || !inside(dx2, 0, W)) continue; if (a[dy1][dx1] == a[dy2][dx2]) { dp[i+1][j+dd1][y2 == 0 ? k : k+dd2].moda(dp[i][j][k]); } } } } } } debug writeln(dp); long ans; foreach (i; 0..H) ans.moda(dp[$-1][i][i]); if ((H + W) % 2) { foreach (i; 0..H-1) ans.moda(dp[$-1][i][i+1]); } writeln(ans); } stdout.flush; debug readln; }