結果
| 問題 | No.2330 Eat Slime |
| ユーザー |
 jupiro
|
| 提出日時 | 2023-05-28 15:18:51 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,908 bytes |
| コンパイル時間 | 2,954 ms |
| コンパイル使用メモリ | 212,904 KB |
| 実行使用メモリ | 10,752 KB |
| 最終ジャッジ日時 | 2024-06-08 07:29:10 |
| 合計ジャッジ時間 | 9,230 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | TLE | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
ソースコード
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using ll = long long;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
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;
}
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 62;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
std::swap(a -= t * b, b);
std::swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend std::ostream &operator<<(std::ostream &os, const ModInt &p) { return os << p.x; }
friend std::istream &operator>>(std::istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
constexpr int mod = (int)1e9 + 7;
using mint = ModInt<mod>;
void solve() {
ll n, m, K;
cin >> n >> m >> K;
std::vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
std::sort(a.begin(), a.end());
a.erase(std::unique(a.begin(), a.end()), a.end());
std::reverse(a.rbegin(), a.rend());
ll res = 0;
for (int i = 0; i < n; i++) {
for (int cnt_i = 0; cnt_i <= K; cnt_i++) {
ll t = a[i] * cnt_i;
if (t > m)
break;
chmax(res, t);
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int cnt_i = 1; cnt_i <= K; cnt_i++) {
for (int cnt_j = 1; cnt_i + cnt_j <= K; cnt_j++) {
ll t = a[i] * cnt_i + a[j] * cnt_j;
if (t > m)
break;
chmax(res, t);
}
}
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1; k < n; k++) {
for (int cnt_i = 1; cnt_i <= K; cnt_i++) {
for (int cnt_j = 1; cnt_i + cnt_j <= K; cnt_j++) {
for (int cnt_k = 1; cnt_i + cnt_j + cnt_k <= K; cnt_k++) {
ll t = a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k;
if (t > m)
break;
chmax(res, t);
}
}
}
}
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1; k < n; k++) {
for (int l = k + 1; l < n; l++) {
for (int cnt_i = 1; cnt_i <= K; cnt_i++) {
for (int cnt_j = 1; cnt_i + cnt_j <= K; cnt_j++) {
for (int cnt_k = 1; cnt_i + cnt_j + cnt_k <= K; cnt_k++) {
for (int cnt_l = 1; cnt_i + cnt_j + cnt_k + cnt_l <= K; cnt_l++) {
ll t = a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k + a[l] * cnt_l;
if (t > m)
break;
chmax(res, t);
}
}
}
}
}
}
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1; k < n; k++) {
for (int l = k + 1; l < n; l++) {
for (int p = l + 1; p < n; p++) {
for (int cnt_i = 1; cnt_i <= K and a[i] * cnt_i <= m; cnt_i++) {
for (int cnt_j = 1; cnt_i + cnt_j <= K and a[i] * cnt_i + a[j] * cnt_j <= m; cnt_j++) {
for (int cnt_k = 1;
cnt_i + cnt_j + cnt_k <= K and a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k <= m;
cnt_k++) {
for (int cnt_l = 1; cnt_i + cnt_j + cnt_k + cnt_l <= K and
a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k + a[l] * cnt_l <= m;
cnt_l++) {
for (int cnt_p = 1;
cnt_i + cnt_j + cnt_k + cnt_l + cnt_p <= K and
a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k + a[l] * cnt_l + a[p] * cnt_p <=
m;
cnt_p++) {
ll t = a[i] * cnt_i + a[j] * cnt_j + a[k] * cnt_k + a[l] * cnt_l +
a[p] * cnt_p;
chmax(res, t);
}
}
}
}
}
}
}
}
}
}
cout << res << "\n";
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int I_love_KKT89 = 1;
// cin >> I_love_KKT89;
for (int Case = 1; Case <= I_love_KKT89; ++Case) {
// cout << "Case #" << Case << ": ";
solve();
}
return 0;
}