#462025 (D) No.1021 Children in Classrooms

• 問題: No.1021 Children in Classrooms
• ユーザー: daut-dlang
• 提出日時: 2020-04-10 21:54:23
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 2,468 bytes
• コンパイル時間: 1,013 ms
• コンパイル使用メモリ: 125,528 KB
• 実行使用メモリ: 13,628 KB
• 最終ジャッジ日時: 2024-06-22 06:33:00
• 合計ジャッジ時間: 2,572 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	1 ms; 6,944 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	1 ms; 6,940 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	WA	-
testcase_08	WA	-
testcase_09	AC	57 ms; 12,468 KB
testcase_10	AC	58 ms; 12,596 KB
testcase_11	AC	59 ms; 13,628 KB
testcase_12	AC	58 ms; 13,352 KB
testcase_13	AC	58 ms; 12,504 KB
testcase_14	AC	56 ms; 12,232 KB
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	57 ms; 13,420 KB
testcase_19	WA	-

ソースコード

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)); }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); }

void main()
{
	auto N = RD;
	auto M = RD;
	auto a = RDA;
	auto S = RD!string;

	long l, r = N-1, ll, rr = N-1;
	foreach (c; S)
	{
		if (c == 'L')
		{
			++l;
			++r;
		}
		else
		{
			--l;
			--r;
		}
		ll.chmax(l);
		rr.chmin(r);
	}
	debug writeln("ll:", ll, " rr:", rr);

	foreach (i; 0..min(ll, N-1))
	{
		a[i+1] += a[i];
		a[i] = 0;
	}
	foreach_reverse (i; max(rr, 0)+1..N)
	{
		a[i-1] += a[i];
		a[i] = 0;
	}
	debug writeln(a);

	auto ans = new long[](N);
	l.chmax(-(N-1));
	l.chmin(N-1);
	foreach (i; 0..N)
	{
		if (l >= 0 && l < N)
			ans[i] = a[l];
		++l;
	}

	ans.map!(to!string).join(" ").writeln();
	stdout.flush;
	debug readln;
}