#931325 (C++23) No.2542 Yokan for Two

• 問題: No.2542 Yokan for Two
• ユーザー: sgfc
• 提出日時: 2023-11-25 04:39:23
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 84 ms / 2,000 ms
• コード長: 3,849 bytes
• コンパイル時間: 6,247 ms
• コンパイル使用メモリ: 315,948 KB
• 実行使用メモリ: 7,296 KB
• 最終ジャッジ日時: 2023-11-25 04:39:33
• 合計ジャッジ時間: 8,939 ms
• ジャッジサーバーID （参考情報）: judge12 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	28 ms; 7,296 KB
testcase_04	AC	13 ms; 6,676 KB
testcase_05	AC	41 ms; 6,704 KB
testcase_06	AC	5 ms; 6,676 KB
testcase_07	AC	69 ms; 6,992 KB
testcase_08	AC	23 ms; 6,676 KB
testcase_09	AC	70 ms; 6,972 KB
testcase_10	AC	9 ms; 6,676 KB
testcase_11	AC	10 ms; 6,676 KB
testcase_12	AC	32 ms; 6,676 KB
testcase_13	AC	7 ms; 6,676 KB
testcase_14	AC	74 ms; 7,008 KB
testcase_15	AC	76 ms; 7,116 KB
testcase_16	AC	74 ms; 7,056 KB
testcase_17	AC	70 ms; 6,972 KB
testcase_18	AC	77 ms; 7,288 KB
testcase_19	AC	39 ms; 6,676 KB
testcase_20	AC	35 ms; 6,676 KB
testcase_21	AC	35 ms; 6,676 KB
testcase_22	AC	36 ms; 6,676 KB
testcase_23	AC	37 ms; 6,676 KB
testcase_24	AC	10 ms; 7,296 KB
testcase_25	AC	13 ms; 7,296 KB
testcase_26	AC	13 ms; 7,296 KB
testcase_27	AC	13 ms; 7,168 KB
testcase_28	AC	14 ms; 7,296 KB
testcase_29	AC	25 ms; 7,168 KB
testcase_30	AC	78 ms; 7,176 KB
testcase_31	AC	78 ms; 7,176 KB
testcase_32	AC	76 ms; 7,176 KB
testcase_33	AC	83 ms; 7,176 KB
testcase_34	AC	78 ms; 7,176 KB
testcase_35	AC	77 ms; 7,176 KB
testcase_36	AC	77 ms; 7,176 KB
testcase_37	AC	77 ms; 7,176 KB
testcase_38	AC	77 ms; 7,176 KB
testcase_39	AC	76 ms; 7,176 KB
testcase_40	AC	77 ms; 7,176 KB
testcase_41	AC	84 ms; 7,176 KB
testcase_42	AC	78 ms; 7,176 KB
testcase_43	AC	77 ms; 7,176 KB

ソースコード

#include "bits/stdc++.h"

#include <stdio.h>
#include <math.h>

#include "atcoder/all"
#include <float.h>

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

using vl = vector<ll>; using vvl = vector<vector<ll>>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>;
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << std::fixed << std::setprecision(10);

    ll l, n;
    cin >> l >> n;
    vl x(n + 1); REP(i, n) cin >> x[i + 1];
    x[0] = 0;

    vvl dp(2, vl(l + 1, 0));
    dp[0][0] = 1;

    REP(i, n) {
        vvl dp2(2, vl(l + 1, 0));

        ll add = x[i + 1] - x[i];
        REP(j, 2) {
            REP(k, l + 1) {
                if (dp[j][k] == 0) continue;
                ll aadd = (j == 0) ? add : 0;
                //切らない
                dp2[j][k+ aadd] = 1;
                //切る
                dp2[(j+1)%2][k+ aadd] = 1;
            }
        }
        dp = move(dp2);
    }

    ll ans = llhuge;
    REP(i, l + 1) {
        if (dp[0][i] == 0) continue;
        chmin(ans, abs(l - i - i));
    }

    cout << ans << endl;

    return 0;
}