Submission #1818992

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)


int dx4[] = { 1, -1, 0, 0 };
int dy4[] = { 0, 0, 1, -1 };

int dx8[] = { 1, -1, 0, 0, 1, 1, -1, -1 };
int dy8[] = { 0, 0, -1, 1, -1, 1, -1, 1 };

int mDays[] = { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

ll A, B, C, D, E, F, G, H, I, J, K, L, M,
   N, O, P, Q, R, S, T, U, V, W, X, Y, Z;

template <typename T>
vector<T> INP(ll n)
{
	vector<T> x;
	REP(i, n) {
		T tmp; cin >> tmp;
		x.push_back(tmp);
	}
	return move(x);
}
//* n文字1行の文字列を入力，一文字ごとの配列を返す
vector<char> SPRIT_STRING(ll n)
{
	string str; cin >> str;
	vector<char> cs(n);
	REP(i, n) cs[i] = str[i];
	return move(cs);
}
//* 文字列中から文字列を検索して別の文字列に置換する
void strReplace(std::string& str, const std::string& from, const std::string& to) {
	std::string::size_type pos = 0;
	while (pos = str.find(from, pos), pos != std::string::npos) {
		str.replace(pos, from.length(), to);
		pos += to.length();
	}
}
//* 素数判定 is_prime<unsigned>(N)
template<typename T, std::enable_if_t<std::is_unsigned<T>::value, std::nullptr_t> = nullptr>
bool is_prime(const T n) {
	if (n < 4) return n == 2 || n == 3;
	if (n % 2 == 0 || n % 3 == 0 || (n % 6 != 1 && n % 6 != 5)) return false;
	for (T i = 5; i * i <= n; i += 6) if (n % i == 0 || n % (i + 2) == 0) return false;
	return true;
}
//* 座標nx, nyがWidth,Heightの領域内にあるかどうかのチェック
inline bool rangeCheck2D(int nx, int ny, int Width, int Height)
{
	return nx >= 0 and nx < Width and ny >= 0 and ny < Height;
}
//* bit全探索
/*
for (int i = 0; i < 1<<N; i++) {
	REP(j, N)
		if ((1 & i >> j) == 1) {;}
}
*/

namespace arc030a {
	void arc030a()
	{
		cin >> N >> K;
		if (N >= (2 * K))
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
}

namespace arc029a {
	void arc029a()
	{
		cin >> N;
		vector<int> ts(N);
		REP(i, N) cin >> ts[i];
		int minTime = INT32_MAX;
		for (int i = 0; i < 1 << N; i++) {
			int cnt1 = 0, cnt2 = 0;
			REP(j, N) {
				if ((1 & i >> j) == 1)
					cnt1 += ts[j];
				else
					cnt2 += ts[j];
			}
			minTime = min(minTime, max(cnt1, cnt2));
		}
		cout << minTime << endl;
	}
}

namespace arc028a {
	void arc028a()
	{
		cin >> N >> A >> B;
		while (true) {
			N -= A;
			if (N <= 0) {
				cout << "Ant" << endl;
				return;
			}
			N -= B;
			if (N <= 0) {
				cout << "Bug" << endl;
				return;
			}
		}
	}
}

namespace arc027a {
	void arc027a()
	{
		cin >> H >> M;
		cout << 60 * 18 - 60 * H - M << endl;
	}
}

namespace arc026a {
	void arc026a()
	{
		cin >> N >> A >> B;
		cout << ((N >= 5) ? (B * 5 + (N - 5) * A) : (B * N)) << endl;;
	}
}

namespace arc013b {
	void arc013b()
	{

	}
}

int main()
{
	arc030a::arc030a();
	//arc013b::arc013b();
	return 0;
}

Submission Info

Judge Result