#652675 (D) No.1492 01文字列と転倒

• 問題: No.1492 01文字列と転倒
• ユーザー: daut-dlang
• 提出日時: 2021-04-30 22:06:23
• 言語: D (dmd 2.106.1)
• 結果: TLE
• 実行時間: -
• コード長: 2,443 bytes
• コンパイル時間: 731 ms
• コンパイル使用メモリ: 117,724 KB
• 実行使用メモリ: 46,116 KB
• 最終ジャッジ日時: 2024-06-22 11:13:46
• 合計ジャッジ時間: 38,336 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	TLE	-
testcase_03	TLE	-
testcase_04	AC	3,765 ms; 43,032 KB
testcase_05	AC	3,279 ms; 36,796 KB
testcase_06	AC	3,339 ms; 36,856 KB
testcase_07	AC	3,647 ms; 43,000 KB
testcase_08	TLE	-
testcase_09	AC	1 ms; 6,944 KB
testcase_10	AC	1 ms; 6,940 KB
testcase_11	AC	1 ms; 6,940 KB
testcase_12	AC	2 ms; 6,944 KB
testcase_13	AC	1 ms; 6,944 KB
testcase_14	AC	3,280 ms; 36,852 KB
testcase_15	AC	8 ms; 6,940 KB
testcase_16	AC	61 ms; 6,940 KB
testcase_17	AC	3,207 ms; 36,788 KB
testcase_18	AC	69 ms; 6,940 KB
testcase_19	AC	3 ms; 6,940 KB
testcase_20	AC	42 ms; 6,940 KB
testcase_21	AC	2,729 ms; 37,056 KB
testcase_22	AC	61 ms; 6,944 KB
testcase_23	AC	25 ms; 6,940 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[] rotate(double[] vec, double rad) { return [cos(rad) * vec[0] - sin(rad) * vec[1], sin(rad) * vec[0] + cos(rad) * vec[1]]; }

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 N = RD;
	mod = RD;

	auto dp = new long[][](N+1, N^^2+1);
	dp[0][0] = 1;
	foreach (i; 0..N*2)
	{
		auto ndp = new long[][](N+1, N^^2+1);
		foreach (j; 0..N+1)
		{
			foreach (k; 0..N^^2+1)
			{
				auto nk = j+k;
				if (nk < N^^2+1)
					ndp[j][nk].moda(dp[j][k]);
				if ((j+1)*2 <= i+1)
					ndp[j+1][k].moda(dp[j][k]);
			}
		}
		dp = ndp;
		debug writeln(dp);
	}

	foreach (i; 0..N^^2+1)
		writeln(dp[N][i]);
	stdout.flush;
	debug readln;
}