#379188 (D) No.885 アマリクエリ

• 問題: No.885 アマリクエリ
• ユーザー: daut-dlang
• 提出日時: 2019-09-13 22:56:36
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 184 ms / 2,000 ms
• コード長: 2,241 bytes
• コンパイル時間: 866 ms
• コンパイル使用メモリ: 116,000 KB
• 実行使用メモリ: 10,228 KB
• 最終ジャッジ日時: 2024-06-22 02:34:27
• 合計ジャッジ時間: 3,718 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	184 ms; 6,812 KB
testcase_01	AC	87 ms; 9,208 KB
testcase_02	AC	74 ms; 10,228 KB
testcase_03	AC	67 ms; 10,152 KB
testcase_04	AC	72 ms; 9,536 KB
testcase_05	AC	53 ms; 9,872 KB
testcase_06	AC	41 ms; 8,776 KB
testcase_07	AC	18 ms; 6,944 KB
testcase_08	AC	39 ms; 6,944 KB
testcase_09	AC	93 ms; 9,708 KB
testcase_10	AC	1 ms; 6,940 KB
testcase_11	AC	1 ms; 6,940 KB
testcase_12	AC	1 ms; 6,940 KB
testcase_13	AC	1 ms; 6,944 KB
testcase_14	AC	2 ms; 6,940 KB
testcase_15	AC	1 ms; 6,940 KB
testcase_16	AC	1 ms; 6,940 KB
testcase_17	AC	2 ms; 6,944 KB
testcase_18	AC	2 ms; 6,940 KB
testcase_19	AC	1 ms; 6,940 KB
testcase_20	AC	1 ms; 6,940 KB
testcase_21	AC	1 ms; 6,940 KB

コンパイルメッセージ

/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`

ソースコード

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.15f";

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; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
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; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//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; }

int binarySearch(alias pred, T)(in T[] arr, bool isLower = true)
{ 
	int ok, ng;
	if (isLower) { ok = cast(int)arr.length; ng = -1; }
	else		 { ok = -1; ng = cast(int)arr.length; }
	while (abs(ok-ng) > 1)
	{
		auto mid = (ok+ng) / 2;
		if (unaryFun!pred(arr[mid]))
			ok = mid;
		else ng = mid;
	}
	return ok;
}

void main()
{
	auto N = RD;
	auto A = RDA;
	auto Q = RD;
	auto X = new long[](Q);
	foreach (i; 0..Q)
	{
		if (i == 0)
			X[i] = RD;
		else
			X[i] = min(X[i-1], RD);
	}

	auto ans = new long[](Q);
	foreach (i; 0..N)
	{
		auto b = A[i];
		while (true)
		{
			auto pos = X.binarySearch!((long a) => a <= b)();
			if (pos == X.length)
			{
				break;
			}
			auto c = b % X[pos];
			ans[pos] += b - c;
			b = c;
		}
	}

	auto base = A.sum;
	foreach (i; 0..Q)
	{
		base -= ans[i];
		writeln(base);
	}

	stdout.flush();
	debug readln();
}