結果
問題 | No.1242 高橋君とすごろく |
ユーザー |
![]() |
提出日時 | 2020-10-03 00:16:57 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 16 ms / 2,000 ms |
コード長 | 4,270 bytes |
コンパイル時間 | 1,869 ms |
コンパイル使用メモリ | 199,328 KB |
最終ジャッジ日時 | 2025-01-15 01:30:38 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 24 |
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios {fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); };} fast_ios_;#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)#define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)#define REP(i, n) FOR(i, 0, n)#define IREP(i, n) IFOR(i, 0, n)#define ALL(x) (x).begin(), (x).end()//template <typename T, typename V>void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }template <typename T, typename V, typename... Args>void ndarray(vector<T>& vec, const V& val, int len, Args... args){vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); });}template <typename T>bool chmax(T& m, const T q) { return m < q ? (m = q, true) : false; }template <typename T>bool chmin(T& m, const T q) { return m > q ? (m = q, true) : false; }template <typename T1, typename T2>pair<T1, T2> operator+(const pair<T1, T2>& l, const pair<T1, T2>& r) { return make_pair(l.first + r.first, l.second + r.second); }template <typename T1, typename T2>pair<T1, T2> operator-(const pair<T1, T2>& l, const pair<T1, T2>& r) { return make_pair(l.first - r.first, l.second - r.second); }template <typename T>vector<T> srtunq(vector<T> vec) { return sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()), vec; }template <typename T>istream& operator>>(istream& is, vector<T>& vec){return for_each(begin(vec), end(vec), [&](T& v) { is >> v; }), is;}// outputtemplate <typename T, typename V>ostream& dmpseq(ostream&, const T&, const string&, const string&, const string&);#if __cplusplus >= 201703Ltemplate <typename... T>ostream& operator<<(ostream& os, const tuple<T...>& tpl){return apply([&os](auto&&... args) { ((os << args << ','), ...); }, tpl), os;}#endif//template <typename T1, typename T2>ostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << '(' << p.first << ',' << p.second << ')'; }template <typename T>ostream& operator<<(ostream& os, const vector<T>& x) { return dmpseq<vector<T>, T>(os, x, "[", ",", "]"); }template <typename T>ostream& operator<<(ostream& os, const deque<T>& x) { return dmpseq<deque<T>, T>(os, x, "deq[", ",", "]"); }template <typename T>ostream& operator<<(ostream& os, const set<T>& x) { return dmpseq<set<T>, T>(os, x, "{", ",", "}"); }template <typename T, typename TH>ostream& operator<<(ostream& os, const unordered_set<T, TH>& x) { return dmpseq<unordered_set<T, TH>, T>(os, x, "{", ",", "}"); }template <typename T>ostream& operator<<(ostream& os, const multiset<T>& x) { return dmpseq<multiset<T>, T>(os, x, "{", ",", "}"); }template <typename TK, typename T>ostream& operator<<(ostream& os, const map<TK, T>& x) { return dmpseq<map<TK, T>, pair<TK, T>>(os, x, "{", ",", "}"); }template <typename TK, typename T, typename TH>ostream& operator<<(ostream& os, const unordered_map<TK, T, TH>& x) { return dmpseq<unordered_map<TK, T, TH>, pair<TK, T>>(os, x, "{", ",", "}"); }template <typename T, typename V>ostream& dmpseq(ostream& os, const T& seq, const string& pre, const string& sp, const string& suf){return os << pre, for_each(begin(seq), end(seq), [&](V x) { os << x << sp; }), os << suf;}template <typename T>void print(const vector<T>& x) { dmpseq<vector<T>, T>(cout, x, "", " ", "\n"); }#ifdef HITONANODE_LOCAL#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl#else#define dbg(x) {}#endifint main(){lint N_, K_;cin >> N_ >> K_;vector<lint> A(K_);cin >> A;A.insert(A.begin(), 1);FOR(i, 1, A.size()){lint d = A[i] - A[i - 1];if (d > 20){d -= 10;FOR(j, i, A.size()) A[j] -= d;}dbg(A);}vector<int> bad(A.back() + 10);for (auto a : A) bad[a] = 1;bad[1] = 0;IREP(i, bad.size() - 7) if (!bad[i]){FOR(d, 1, 4) if (bad[i + d] and bad[i + 7 - d]) bad[i] = 1;}dbg(bad);cout << (bad[1] ? "No" : "Yes") << '\n';}