結果

問題 No.1242 高橋君とすごろく
ユーザー akun0716akun0716
提出日時 2020-10-03 10:22:19
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
MLE  
実行時間 -
コード長 4,307 bytes
コンパイル時間 919 ms
コンパイル使用メモリ 93,816 KB
実行使用メモリ 814,204 KB
最終ジャッジ日時 2024-07-18 04:09:58
合計ジャッジ時間 2,990 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 MLE -
testcase_02 -- -
testcase_03 -- -
testcase_04 -- -
testcase_05 -- -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, K; cin >> N >> K;
	VI A(K);
	REP(i, K)cin >> A[i];
	bool F = true;
	int X = -1, x = -1;
	VI TMP;
	REP(i, K) {
		FOR(j, i + 1, K) {
			int tmp = A[j] - A[i];
			if (tmp == 5) {
				if (A[i] - 1 == 1)F = false;
				X = A[i] - 1;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 3) {
				if (A[i] - 2 == 1)F = false;
				X = A[i] - 2;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 1) {
				if (A[i] - 3 == 1)F = false;
				X = A[i] - 3;
				if (X <= 20)TMP.push_back(X);
			}
			chmax(x, X);
		}
	}
	REP(i, K)TMP.push_back(A[i]);
	SORT(TMP);
	K = TMP.size();
	A = TMP;
	TMP.clear();
	REP(i, K) {
		FOR(j, i + 1, K) {
			int tmp = A[j] - A[i];
			if (tmp == 5) {
				if (A[i] - 1 == 1)F = false;
				X = A[i] - 1;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 3) {
				if (A[i] - 2 == 1)F = false;
				X = A[i] - 2;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 1) {
				if (A[i] - 3 == 1)F = false;
				X = A[i] - 3;
				if (X <= 20)TMP.push_back(X);
			}
		}
	}

	REP(i, K)TMP.push_back(A[i]);
	SORT(TMP);
	K = TMP.size();
	A = TMP;
	//REP(i, K)cout << A[i] << endl;
	TMP.clear();
	REP(i, K) {
		FOR(j, i + 1, K) {
			int tmp = A[j] - A[i];
			if (tmp == 5) {
				if (A[i] - 1 == 1)F = false;
				X = A[i] - 1;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 3) {
				if (A[i] - 2 == 1)F = false;
				X = A[i] - 2;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 1) {
				if (A[i] - 3 == 1)F = false;
				X = A[i] - 3;
				if (X <= 20)TMP.push_back(X);
			}
		}
	}

	REP(i, K)TMP.push_back(A[i]);
	SORT(TMP);
	K = TMP.size();
	A = TMP;
	//REP(i, K)cout << A[i] << endl;
	TMP.clear();
	REP(i, K) {
		FOR(j, i + 1, K) {
			int tmp = A[j] - A[i];
			if (tmp == 5) {
				if (A[i] - 1 == 1)F = false;
				X = A[i] - 1;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 3) {
				if (A[i] - 2 == 1)F = false;
				X = A[i] - 2;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 1) {
				if (A[i] - 3 == 1)F = false;
				X = A[i] - 3;
				if (X <= 20)TMP.push_back(X);
			}
		}
	}
	REP(i, K)TMP.push_back(A[i]);
	SORT(TMP);
	K = TMP.size();
	A = TMP;
	//REP(i, K)cout << A[i] << endl;
	TMP.clear();
	REP(i, K) {
		FOR(j, i + 1, K) {
			int tmp = A[j] - A[i];
			if (tmp == 5) {
				if (A[i] - 1 == 1)F = false;
				X = A[i] - 1;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 3) {
				if (A[i] - 2 == 1)F = false;
				X = A[i] - 2;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 1) {
				if (A[i] - 3 == 1)F = false;
				X = A[i] - 3;
				if (X <= 20)TMP.push_back(X);
			}
		}
	}
	REP(i, K)TMP.push_back(A[i]);
	SORT(TMP);
	K = TMP.size();
	A = TMP;
	//REP(i, K)cout << A[i] << endl;
	TMP.clear();
	REP(i, K) {
		FOR(j, i + 1, K) {
			int tmp = A[j] - A[i];
			if (tmp == 5) {
				if (A[i] - 1 == 1)F = false;
				X = A[i] - 1;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 3) {
				if (A[i] - 2 == 1)F = false;
				X = A[i] - 2;
				if (X <= 20)TMP.push_back(X);
			}
			if (tmp == 1) {
				if (A[i] - 3 == 1)F = false;
				X = A[i] - 3;
				if (X <= 20)TMP.push_back(X);
			}
		}
	}

	x -= 8;
	if (x >= 1)F = false;
	cout << (F ? "Yes" : "No") << endl;

	return 0;
}
0