提出 #72889819

ソースコード 拡げる

#include <stdio.h>
#include <algorithm>
int T, n, m;
char s[3005][3005];
bool vis[3005][3005];
int main()
{
	scanf("%d", &T);
	while (~--T)
	{
		scanf("%d%d", &n, &m);
		for (int i = 1; i <= n; ++i)
			scanf("%s", s[i] + 1);
		vis[n][m] = true;
		for (int i = 1; i <= n; ++i)
			for (int j = n; j >= 1; --j)
				if (s[j][i] == '#')
				{
					s[j][i] = 'f';
					break;
				}
		for (int i = n - 1; i >= 1; --i)
			for (int j = 1; j <= n; ++j)
				if (s[i][j] != '#')
				{
					vis[i][j] |= vis[i + 1][j];
					vis[i][j] |= vis[i + 1][j - 1];
					vis[i][j] |= vis[i + 1][j + 1];
					if (vis[i][j] && s[i][j] == 'f')
						for (int k = 1; k < i; ++k)
							vis[k][j] = true;
				}
		for (int i = 1; i <= n; ++i)
			putchar(vis[1][i] + '0');
		putchar('\n');
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j)
				vis[i][j] = false;
	}
	return 0;
}

提出情報

提出日時
問題 E - Climbing Silver
ユーザ XiangXunyi
言語 C++23 (GCC 15.2.0)
得点 450
コード長 901 Byte
結果 AC
実行時間 67 ms
メモリ 19340 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 450 / 450
結果
AC × 1
AC × 48
セット名 テストケース
Sample sample_01.txt
All sample_01.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt
ケース名 結果 実行時間 メモリ
sample_01.txt AC 1 ms 1648 KiB
test_01.txt AC 8 ms 1556 KiB
test_02.txt AC 11 ms 1452 KiB
test_03.txt AC 15 ms 1600 KiB
test_04.txt AC 19 ms 1764 KiB
test_05.txt AC 24 ms 1748 KiB
test_06.txt AC 29 ms 1728 KiB
test_07.txt AC 34 ms 1580 KiB
test_08.txt AC 39 ms 1648 KiB
test_09.txt AC 45 ms 1764 KiB
test_10.txt AC 52 ms 1804 KiB
test_11.txt AC 58 ms 1648 KiB
test_12.txt AC 66 ms 1652 KiB
test_13.txt AC 67 ms 1652 KiB
test_14.txt AC 48 ms 1892 KiB
test_15.txt AC 34 ms 3348 KiB
test_16.txt AC 33 ms 3244 KiB
test_17.txt AC 47 ms 19284 KiB
test_18.txt AC 38 ms 19296 KiB
test_19.txt AC 37 ms 19188 KiB
test_20.txt AC 46 ms 19300 KiB
test_21.txt AC 33 ms 19220 KiB
test_22.txt AC 42 ms 19264 KiB
test_23.txt AC 46 ms 19264 KiB
test_24.txt AC 20 ms 19300 KiB
test_25.txt AC 20 ms 19284 KiB
test_26.txt AC 19 ms 19184 KiB
test_27.txt AC 35 ms 19264 KiB
test_28.txt AC 35 ms 19332 KiB
test_29.txt AC 39 ms 19264 KiB
test_30.txt AC 40 ms 19284 KiB
test_31.txt AC 25 ms 19300 KiB
test_32.txt AC 44 ms 19188 KiB
test_33.txt AC 43 ms 19264 KiB
test_34.txt AC 52 ms 19332 KiB
test_35.txt AC 45 ms 19264 KiB
test_36.txt AC 53 ms 19296 KiB
test_37.txt AC 40 ms 19332 KiB
test_38.txt AC 35 ms 19340 KiB
test_39.txt AC 36 ms 19264 KiB
test_40.txt AC 42 ms 19284 KiB
test_41.txt AC 42 ms 19300 KiB
test_42.txt AC 31 ms 19188 KiB
test_43.txt AC 43 ms 19284 KiB
test_44.txt AC 42 ms 19184 KiB
test_45.txt AC 35 ms 19264 KiB
test_46.txt AC 26 ms 19264 KiB
test_47.txt AC 23 ms 19300 KiB