#930924 (C++17) No.2542 Yokan for Two

提出ソース

結果

問題	No.2542 Yokan for Two
ユーザー	dyktr_06
提出日時	2023-11-24 21:40:02
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,108 ms / 2,000 ms
コード長	5,065 bytes
コンパイル時間	2,564 ms
コンパイル使用メモリ	211,344 KB
実行使用メモリ	5,828 KB
最終ジャッジ日時	2024-09-26 09:02:11
合計ジャッジ時間	28,360 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	93 ms 5,376 KB
testcase_04	AC	195 ms 5,376 KB
testcase_05	AC	354 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	1,108 ms 5,412 KB
testcase_08	AC	88 ms 5,376 KB
testcase_09	AC	1,036 ms 5,376 KB
testcase_10	AC	54 ms 5,376 KB
testcase_11	AC	104 ms 5,376 KB
testcase_12	AC	212 ms 5,376 KB
testcase_13	AC	49 ms 5,376 KB
testcase_14	AC	932 ms 5,452 KB
testcase_15	AC	1,023 ms 5,548 KB
testcase_16	AC	982 ms 5,648 KB
testcase_17	AC	917 ms 5,376 KB
testcase_18	AC	1,021 ms 5,632 KB
testcase_19	AC	532 ms 5,376 KB
testcase_20	AC	465 ms 5,376 KB
testcase_21	AC	486 ms 5,376 KB
testcase_22	AC	493 ms 5,376 KB
testcase_23	AC	509 ms 5,376 KB
testcase_24	AC	6 ms 5,376 KB
testcase_25	AC	11 ms 5,376 KB
testcase_26	AC	12 ms 5,376 KB
testcase_27	AC	13 ms 5,376 KB
testcase_28	AC	14 ms 5,376 KB
testcase_29	AC	72 ms 5,376 KB
testcase_30	AC	938 ms 5,632 KB
testcase_31	AC	937 ms 5,696 KB
testcase_32	AC	929 ms 5,760 KB
testcase_33	AC	960 ms 5,828 KB
testcase_34	AC	987 ms 5,692 KB
testcase_35	AC	1,000 ms 5,760 KB
testcase_36	AC	982 ms 5,760 KB
testcase_37	AC	998 ms 5,696 KB
testcase_38	AC	986 ms 5,760 KB
testcase_39	AC	1,007 ms 5,632 KB
testcase_40	AC	1,005 ms 5,696 KB
testcase_41	AC	989 ms 5,696 KB
testcase_42	AC	988 ms 5,696 KB
testcase_43	AC	1,015 ms 5,760 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll l, x;
vll a;

void input(){
    in(l, x);
    vin(a, x);
}

void solve(){
    a.push_back(l);

    vector<vector<bool>> dp(x + 1, vector<bool>(l + 1));
    dp[0][a[0]] = 1;
    rep(i, x){
        vector<vector<bool>> ndp(x + 1, vector<bool>(l + 1));
        rep(j, i + 1){
            rep(k, l + 1){
                if(!dp[j][k]) continue;
                ll d = a[i + 1] - a[i];
                if(j % 2 == 0){
                    ndp[j + 1][k] = 1;
                    ndp[j][k + d] = 1;
                }else{
                    ndp[j + 1][k + d] = 1;
                    ndp[j][k] = 1;
                }
            }
        }
        swap(dp, ndp);
    }

    ll ans = INF;
    rep(j, x + 1){
        rep(k, l + 1){
            if(j % 2 == 0) continue;
            if(dp[j][k]){
                ll k2 = l - k;
                chmin(ans, abs(k - k2));
            }
        }
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード