#352131 (D) No.837 Noelちゃんと星々2

• 問題: No.837 Noelちゃんと星々2
• ユーザー: daut-dlang
• 提出日時: 2019-06-14 23:19:31
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 2,042 bytes
• コンパイル時間: 678 ms
• コンパイル使用メモリ: 122,172 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-06-22 01:45:04
• 合計ジャッジ時間: 1,946 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	1 ms; 6,940 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	AC	1 ms; 6,940 KB
testcase_25	AC	1 ms; 6,940 KB
testcase_26	AC	1 ms; 6,944 KB
testcase_27	WA	-
testcase_28	AC	1 ms; 6,944 KB
testcase_29	AC	1 ms; 6,940 KB
testcase_30	AC	1 ms; 6,940 KB
testcase_31	AC	1 ms; 6,940 KB
testcase_32	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 = "%.10f";

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

void main()
{
	auto N = RD;
	auto Y = RDR.ARR;
	Y.sort();

	auto a = new long[](N+1);
	foreach (i; 0..N-1)
	{
		a[i+1] = (Y[i+1] - Y[i]) * (i+1) + a[i];
	}
	/*auto b = new long[](N+1);
	foreach_reverse (i; 1..N)
	{
		b[i] = (Y[i] - Y[i-1]) * (N-i) + b[i+1];
	}*/
	debug writeln(Y);
	debug writeln(a);

	long ans = long.max;
	foreach (i; 1..N)
	{
		auto mid1   = i / 2;
		auto cost11 = a[mid1];
		auto cost12 = a[i-1] - a[mid1] - (Y[i-1] - Y[mid1]) * mid1;
		auto remain = N - i;
		auto mid2   = N - max(remain / 2, 1);
		auto cost21 = a[mid2] - a[i] - (Y[mid2] - Y[i]) * i;
		auto cost22 = a[N-1] - a[mid2] - (Y[N-1] - Y[mid2]) * mid2;

		debug writeln(i, ":", remain);
		debug writeln(cost11, " ", cost12, " ", cost21, " ", cost22);
		long cost = cost11 + cost12 + cost21 + cost22;
		cost = cost == 0 && Y[mid1] == Y[mid2] ? 1 : cost;
		ans = min(ans, cost);
	}

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