#396583 (D) No.921 ずんだアロー

• 問題: No.921 ずんだアロー
• ユーザー: daut-dlang
• 提出日時: 2019-11-08 22:08:07
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 2,364 bytes
• コンパイル時間: 808 ms
• コンパイル使用メモリ: 115,516 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 03:00:33
• 合計ジャッジ時間: 1,961 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	1 ms; 6,940 KB
testcase_04	AC	1 ms; 6,940 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	1 ms; 6,944 KB
testcase_07	AC	1 ms; 6,944 KB
testcase_08	AC	1 ms; 6,940 KB
testcase_09	AC	1 ms; 6,944 KB
testcase_10	AC	13 ms; 6,940 KB
testcase_11	WA	-
testcase_12	AC	5 ms; 6,944 KB
testcase_13	AC	11 ms; 6,940 KB
testcase_14	AC	13 ms; 6,944 KB
testcase_15	AC	8 ms; 6,944 KB
testcase_16	AC	2 ms; 6,944 KB
testcase_17	AC	13 ms; 6,944 KB
testcase_18	AC	15 ms; 6,940 KB
testcase_19	AC	15 ms; 6,944 KB
testcase_20	WA	-
testcase_21	AC	15 ms; 6,944 KB
testcase_22	AC	15 ms; 6,944 KB
testcase_23	AC	15 ms; 6,944 KB
testcase_24	AC	15 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 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; }

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 A = RDA;

	long ans1 = 1;
	foreach (i; 0..(N-1)/2)
	{
		if (A[i*2] == A[i*2+1] && A[i*2+1] == A[i*2+2])
			ans1 += 2;
		else
			++ans1;
	}
	debug writeln("ans1:", ans1);
	if (N % 2 == 0)
	{
		if (A[$-1] == A[$-2])
			++ans1;
		else if (A[$-3] == A[$-4] && A[$-3] == A[$-2]+A[$-1])
			++ans1;
	}

	long ans2 = 1;
	if (A[0] == A[1]) ++ans2;
	else if (A[2] == A[3] && A[2] == A[0]+A[1])
		++ans2;
	foreach (i; 0..N/2-1)
	{
		if (A[i*2+1] == A[i*2+2] && A[i*2+2] == A[i*2+3])
			ans2 += 2;
		else
			++ans2;
	}
	debug writeln("ans2:", ans2);
	if (N % 2 == 1)
	{
		if (A[$-1] == A[$-2])
			++ans2;
		else if (A[$-3] == A[$-4] && A[$-3] == A[$-2]+A[$-1])
			++ans2;
	}
	debug writeln("ans1:", ans1, " ans2:", ans2);

	writeln(max(ans1, ans2));
	stdout.flush();
	debug readln();
}