#643332 (D) No.1465 Archaea

• 問題: No.1465 Archaea
• ユーザー: daut-dlang
• 提出日時: 2021-04-02 22:27:15
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 2,374 bytes
• コンパイル時間: 738 ms
• コンパイル使用メモリ: 118,900 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-06-22 11:09:33
• 合計ジャッジ時間: 1,718 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

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

	char[] s;
	while (N)
	{
		s ~= (N % 2).to!string;
		N /= 2;
	}
	s.reverse;
	s.popFront;

	long cnt = s.length;
	while (!s.empty)
	{
		if (s.length == 1)
		{
			if (s[0] == '1')
				cnt = -1;
			s.popFront;
		}
		else if (s[0] == '1' && s[1] == '1')
		{
			++cnt;
			s.popFront;
			s.popFront;
		}
		else if (s[0] == '0')
			s.popFront;
		else
		{
			cnt = -1;
			break;
		}
	}
	
	if (cnt == -1)
		writeln("NO");
	else
		writeln(cnt <= K ? "YES" : "NO");
	stdout.flush;
	debug readln;
}