結果
問題 | No.2003 Frog on Grid |
ユーザー | 👑 ygussany |
提出日時 | 2022-06-12 14:37:51 |
言語 | C (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 149 ms / 2,000 ms |
コード長 | 2,391 bytes |
コンパイル時間 | 1,391 ms |
コンパイル使用メモリ | 32,108 KB |
実行使用メモリ | 117,240 KB |
最終ジャッジ日時 | 2023-10-24 10:33:26 |
合計ジャッジ時間 | 3,651 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 1 ms
4,348 KB |
testcase_05 | AC | 1 ms
4,348 KB |
testcase_06 | AC | 1 ms
4,348 KB |
testcase_07 | AC | 1 ms
4,348 KB |
testcase_08 | AC | 1 ms
4,348 KB |
testcase_09 | AC | 1 ms
4,348 KB |
testcase_10 | AC | 2 ms
4,348 KB |
testcase_11 | AC | 1 ms
4,348 KB |
testcase_12 | AC | 1 ms
4,348 KB |
testcase_13 | AC | 1 ms
4,348 KB |
testcase_14 | AC | 1 ms
4,348 KB |
testcase_15 | AC | 1 ms
4,348 KB |
testcase_16 | AC | 1 ms
4,348 KB |
testcase_17 | AC | 18 ms
9,456 KB |
testcase_18 | AC | 53 ms
23,416 KB |
testcase_19 | AC | 36 ms
48,652 KB |
testcase_20 | AC | 139 ms
86,736 KB |
testcase_21 | AC | 46 ms
79,156 KB |
testcase_22 | AC | 149 ms
117,240 KB |
testcase_23 | AC | 32 ms
15,828 KB |
testcase_24 | AC | 35 ms
16,040 KB |
testcase_25 | AC | 70 ms
40,184 KB |
testcase_26 | AC | 72 ms
40,868 KB |
testcase_27 | AC | 28 ms
16,176 KB |
testcase_28 | AC | 61 ms
40,184 KB |
ソースコード
#include <stdio.h> #include <stdlib.h> const int Mod = 998244353; int main() { int i, j, H, W, K; char **c, **c_tmp; scanf("%d %d %d", &H, &W, &K); c_tmp = (char**)malloc(sizeof(char*) * (H + 2)); for (i = 1; i <= H; i++) { c_tmp[i] = (char*)malloc(sizeof(char) * (W + 2)); scanf("%s", &(c_tmp[i][1])); } if (H <= W) { W += K; c = (char**)malloc(sizeof(char*) * (H + 2)); for (i = 0; i <= H + 1; i++) { c[i] = (char*)malloc(sizeof(char) * (W + 2)); for (j = 0; j <= W + 1; j++) c[i][j] = 0; } for (i = 1; i <= H; i++) for (j = K + 1; j <= W; j++) c[i][j] = c_tmp[i][j-K]; } else { H ^= W; W ^= H; H ^= W; W += K; c = (char**)malloc(sizeof(char*) * (H + 2)); for (i = 0; i <= H + 1; i++) { c[i] = (char*)malloc(sizeof(char) * (W + 2)); for (j = 0; j <= W + 1; j++) c[i][j] = 0; } for (i = 1; i <= H; i++) for (j = K + 1; j <= W; j++) c[i][j] = c_tmp[j-K][i]; } int tmp, **dp, **dp_sum_add, **dp_sum_sub; dp = (int**)malloc(sizeof(int*) * (H + 2)); dp_sum_add = (int**)malloc(sizeof(int*) * (H + 2)); dp_sum_sub = (int**)malloc(sizeof(int*) * (H + 2)); for (i = 0; i <= H + 1; i++) { dp[i] = (int*)malloc(sizeof(int) * (W + 2)); dp_sum_add[i] = (int*)malloc(sizeof(int) * (W + 2)); dp_sum_sub[i] = (int*)malloc(sizeof(int) * (W + 2)); } for (i = 0; i <= H + 1; i++) { for (j = 0; j <= W + 1; j++) { dp[i][j] = 0; dp_sum_add[i][j] = 0; dp_sum_sub[i][j] = 0; } } dp[1][K+1] = 1; dp_sum_add[1][K+1] = 1; dp_sum_sub[1][K+1] = 1; for (i = 1, j = K + 2, tmp = 1; 1; j++) { if (j > W) { i++; if (i > H) break; j = 0; tmp = 0; } tmp += dp_sum_add[i-1][j]; if (j >= K + 1) tmp -= dp_sum_sub[i][j-K-1]; if (tmp >= Mod) tmp -= Mod; else if (tmp < 0) tmp += Mod; if (c[i][j] == '.') dp[i][j] = tmp; else dp[i][j] = 0; dp_sum_add[i][j] = dp_sum_add[i-1][j] + dp[i][j]; if (i - K >= 1) dp_sum_add[i][j] -= dp[i-K][j]; if (dp_sum_add[i][j] >= Mod) dp_sum_add[i][j] -= Mod; else if (dp_sum_add[i][j] < 0) dp_sum_add[i][j] += Mod; dp_sum_sub[i][j] = dp_sum_sub[i-1][j+1] + dp[i][j]; if (i - K - 1 >= 1 && j + K + 1 <= W) dp_sum_sub[i][j] -= dp[i-K-1][j+K+1]; if (dp_sum_sub[i][j] >= Mod) dp_sum_sub[i][j] -= Mod; else if (dp_sum_sub[i][j] < 0) dp_sum_sub[i][j] += Mod; tmp += dp[i][j]; if (tmp >= Mod) tmp -= Mod; } printf("%d\n", dp[H][W]); fflush(stdout); return 0; }