結果

問題 No.733 分身並列コーディング
ユーザー jelljell
提出日時 2019-01-09 20:44:15
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 82 ms / 1,500 ms
コード長 6,758 bytes
コンパイル時間 1,902 ms
コンパイル使用メモリ 169,268 KB
実行使用メモリ 12,748 KB
最終ジャッジ日時 2024-11-24 00:59:50
合計ジャッジ時間 3,796 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
12,672 KB
testcase_01 AC 8 ms
12,672 KB
testcase_02 AC 8 ms
12,564 KB
testcase_03 AC 82 ms
12,672 KB
testcase_04 AC 81 ms
12,544 KB
testcase_05 AC 16 ms
12,568 KB
testcase_06 AC 8 ms
12,748 KB
testcase_07 AC 20 ms
12,544 KB
testcase_08 AC 18 ms
12,672 KB
testcase_09 AC 29 ms
12,544 KB
testcase_10 AC 9 ms
12,524 KB
testcase_11 AC 11 ms
12,672 KB
testcase_12 AC 8 ms
12,544 KB
testcase_13 AC 7 ms
12,544 KB
testcase_14 AC 19 ms
12,644 KB
testcase_15 AC 8 ms
12,544 KB
testcase_16 AC 8 ms
12,544 KB
testcase_17 AC 8 ms
12,568 KB
testcase_18 AC 9 ms
12,672 KB
testcase_19 AC 30 ms
12,544 KB
testcase_20 AC 25 ms
12,544 KB
testcase_21 AC 19 ms
12,632 KB
testcase_22 AC 51 ms
12,636 KB
testcase_23 AC 17 ms
12,544 KB
testcase_24 AC 15 ms
12,712 KB
testcase_25 AC 8 ms
12,544 KB
testcase_26 AC 8 ms
12,544 KB
testcase_27 AC 9 ms
12,544 KB
testcase_28 AC 20 ms
12,644 KB
testcase_29 AC 36 ms
12,672 KB
testcase_30 AC 35 ms
12,676 KB
testcase_31 AC 34 ms
12,524 KB
testcase_32 AC 11 ms
12,640 KB
testcase_33 AC 10 ms
12,524 KB
testcase_34 AC 10 ms
12,520 KB
testcase_35 AC 11 ms
12,544 KB
testcase_36 AC 11 ms
12,672 KB
testcase_37 AC 10 ms
12,672 KB
testcase_38 AC 30 ms
12,544 KB
testcase_39 AC 30 ms
12,532 KB
testcase_40 AC 30 ms
12,544 KB
testcase_41 AC 10 ms
12,556 KB
testcase_42 AC 11 ms
12,620 KB
testcase_43 AC 11 ms
12,544 KB
testcase_44 AC 30 ms
12,544 KB
testcase_45 AC 30 ms
12,544 KB
testcase_46 AC 31 ms
12,544 KB
testcase_47 AC 29 ms
12,640 KB
testcase_48 AC 30 ms
12,544 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
using pdi = pair<double, int>;
template <class T> using vct = vector<T>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2 - 1;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double gold = 1.618033988;
constexpr long double eps = 1e-15;

#define stdout_precision 10
#define stderr_precision 2
#define each(i,v) for (auto i = begin(v); i != end(v); ++i)
#define reach(i,v) for (auto i = rbegin(v); i != rend(v); ++i)
#define urep(i,s,t) for (int i = (s); i <= (t); ++i)
#define drep(i,s,t) for (int i = (s); i >= (t); --i)
#define rep(i,n) urep(i, 0, (n)-1)
#define rep1(i,n) urep(i, 1, (n))
#define rrep(i,n) drep(i, (n)-1, 0)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define fro front()
#define bac back()
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount

struct setupper {
    setupper() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        std::cout.tie(nullptr);
        std::cerr.tie(nullptr);
        std::cout << fixed << setprecision(stdout_precision);
        std::cerr << fixed << setprecision(stderr_precision);
#ifdef Local
        std::cerr << "\n---stderr---\n";
        auto print_atexit = []() {
            std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n";
            std::cerr << "------------\n";
        };
        atexit((void(*)())print_atexit);
#endif
    }
} setupper_;

namespace std {
    template <class T> void hash_combine(size_t &seed, T const &key) {
        seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
    }
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &pr) const
        {
            size_t seed = 0;
            hash_combine(seed,pr.first);
            hash_combine(seed,pr.second);
            return seed;
        }
    };
    template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc {
        static void apply(size_t& seed, Tup const& tup) {
            hashval_calc<Tup, index - 1>::apply(seed, tup);
            hash_combine(seed,get<index>(tup));
        }
    };
    template <class Tup> struct hashval_calc<Tup,0> {
        static void apply(size_t& seed, Tup const& tup) {
            hash_combine(seed,get<0>(tup));
        }
    };
    template <class ...T> struct hash<tuple<T...>> {
        size_t operator()(tuple<T...> const& tup) const
        {
            size_t seed = 0;
            hashval_calc<tuple<T...>>::apply(seed,tup);
            return seed;
        }
    };
}

template <class T, class U> ostream& operator << (ostream& s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream& s, vct<T> v) { each(i,v) { if(i != begin(v)) s << " "; s << *i; } return s; }
#define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ";\
dump_func(__VA_ARGS__)
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
template <class T = int> T read() { T x; return cin >> x, x; }
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)

namespace updater {
    template <class T> static void add(T &x, const T &y) { x += y; }
    template <class T> static void ext_add(T &x, const T &y, size_t w) { x += y * w; }
    template <class T> static void mul(T &x, const T &y) { x *= y; }
    template <class T> static void ext_mul(T &x, const T &y, size_t w) { x *= (T)pow(y,w); }
    template <class T> static bool chmax(T &x, const T &y) { return x < y ? x = y,true : false; }
    template <class T> static bool chmin(T &x, const T &y) { return x > y ? x = y,true : false; }
};
using updater::chmax;
using updater::chmin;

template <class T> T minf(const T &x, const T &y) { return min(x,y); }
template <class T> T mixf(const T &x, const T &y) { return max(x,y); }
bool bit(i64 n, uint8_t e) { return (n >> e) & 1; }
i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
int ilog(uint64_t x, uint64_t b = 2) { return x ? 1 + ilog(x / b,b) : -1; }
template <class F> int_fast64_t binry(int_fast64_t ok,int_fast64_t ng,const F &fn) {
    if(abs(ok - ng) <= 1) return ok;
    int_fast64_t mid = ok + ng >> 1;
    return fn(mid) ? binry(mid,ng,fn) : binry(ok,mid,fn);
}
template <class A, size_t N, class T> void init(A (&ary)[N], const T &val) { fill((T*)ary,(T*)(ary + N),val); }
template <class A> void cmprs(A ary[], size_t n) {
    vector<A> tmp(ary,ary + n);
    tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
    for(A *i = ary; i != ary + n; ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}
template <class T> void cmprs(vector<T> &v) {
    vector<T> tmp = v; sort(begin(tmp),end(tmp));
    tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
    for(auto i = begin(v); i != end(v); ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}

template <class F> void for_subset(uint_fast64_t s, const F &fn) {
    uint_fast64_t tmp = s;
    do { fn(tmp); (--tmp) &= s; } while(tmp != s);
}

int T,N;
int t[17],t_min;
int f[1<<17];
int dp[18][1<<17];

signed main() {
    init(dp,inf<int>);
    cin>>T>>N;
    for(int i=0; i<N; ++i) cin>>t[i];
    for(int i=0; i<1<<N; ++i) {
        dp[0][i]=0;
        for(int j=0; j<N; ++j) if(i>>j&1) dp[0][i]+=t[j];
    }
    for(int i=1; i<=N; ++i) {
        for(int j=0; j<1<<N; ++j) {
            if(!j || dp[i-1][j]<=T) {
                dp[i][j]=0;
                if(j==(1<<N)-1) esc(i);
            }
            else {
                for(int k=0; k<N; ++k) {
                    if(j>>k&1) {
                        chmin(dp[i][j],dp[i][j^1<<k]+t[k]);
                    }
                }
            }
        }
    }
}
0