Submission #58365

ソースコード

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };
constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;
template <class T>
using MaxHeap = priority_queue<T, vector<T>, less<T>>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
cin >> head;
input(forward<Tail>(tail)...);
}
template <class T>
inline void input(vector<T> &vec) {
for (auto &e: vec) {
cin >> e;
}
}
template <class T>
inline void input(vector<vector<T>> &mat) {
for (auto &vec: mat) {
input(vec);
}
}
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head&& head, Tail&&... tail) {
static constexpr const char *delim[] = {"", " "};
cout << head << delim[sizeof...(tail)];
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream& operator<<(ostream &strm, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e: vec) {
strm << e << delim[&e == &vec.back()];
}
return strm;
}
template <class T>
inline vector<T> make_v(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto make_v(const T &initValue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initValue, args...))>(sz, make_v<T>(initValue, args...));
}
template <class Func>
class FixPoint : Func {
public:
explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}
template <class... Args>
constexpr decltype(auto) operator()(Args&&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
return FixPoint<Func>{forward<Func>(f)};
}
template <class T>
inline bool chmax(T &a, const T &b) noexcept {
return b > a && (a = b, true);
}
template <class T>
inline bool chmin(T &a, const T &b) noexcept {
return b < a && (a = b, true);
}
template <class T>
inline T diff(const T &a, const T &b) noexcept {
return a < b ? b - a : a - b;
}
// End Header }}}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
var(intmax_t, N, X);
vector a(N, 0_jd);
input(a);
vector<size_t> half1, half2;
rep(i, N / 2) {
half1.emplace_back(i);
}
reps(i, N / 2, N - 1) {
half2.emplace_back(i);
}
const auto fun = [&](vector<size_t> idx) -> vector<intmax_t> {
vector<intmax_t> ret;
const size_t size = idx.size();
rep(bit, (1 << size)) {
intmax_t sum = 0;
rep(i, size) {
if (bit & (1 << i)) {
sum += a[idx[i]];
}
}
ret.emplace_back(sum);
}
sort(all(ret));
return ret;
};
auto x = fun(half1), y = fun(half2);
intmax_t res = LINF;
for (const auto xi: x) {
const intmax_t key = X - xi;
const auto pos = lower_bound(all(y), key);
if (pos == y.end()) {
chmin(res, diff(xi + y.back(), X));
} else if (pos == y.begin()) {
chmin(res, diff(xi + y.front(), X));
} else {
chmin(res, min(diff(xi + *pos, X), diff(xi + *prev(pos), X)));
}
}
print(res);
return 0;
}

ステータス

項目 データ
問題 1106 - 破壊の果実
ユーザー名 もけ
投稿日時 2020-02-01 23:31:42
言語 C++17
状態 Accepted
得点 1
ソースコード長 4312 Byte
最大実行時間 32 ms
最大メモリ使用量 712 KB

セット

セット 得点 Cases
1 ALL 1 / 1 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
case01.in AC 20 ms 476 KB
1
case02.in AC 24 ms 536 KB
1
case03.in AC 23 ms 468 KB
1
case04.in AC 23 ms 524 KB
1
case05.in AC 24 ms 584 KB
1
case06.in AC 16 ms 648 KB
1
case07.in AC 20 ms 712 KB
1
case08.in AC 29 ms 512 KB
1
case09.in AC 20 ms 568 KB
1
case10.in AC 21 ms 496 KB
1
case11.in AC 26 ms 432 KB
1
case12.in AC 16 ms 492 KB
1
case13.in AC 23 ms 552 KB
1
case14.in AC 23 ms 612 KB
1
case15.in AC 32 ms 540 KB
1
case16.in AC 18 ms 596 KB
1
case17.in AC 23 ms 520 KB
1
case18.in AC 22 ms 576 KB
1
case19.in AC 21 ms 632 KB
1
case20.in AC 19 ms 564 KB
1
sample01.in AC 15 ms 500 KB
1
sample02.in AC 21 ms 584 KB
1
sample03.in AC 19 ms 668 KB
1