結果
問題 | No.1606 Stuffed Animals Keeper |
ユーザー | au7777 |
提出日時 | 2022-03-24 16:01:18 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 197 ms / 3,000 ms |
コード長 | 2,876 bytes |
コンパイル時間 | 4,266 ms |
コンパイル使用メモリ | 227,304 KB |
実行使用メモリ | 199,192 KB |
最終ジャッジ日時 | 2024-04-21 01:51:34 |
合計ジャッジ時間 | 12,048 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 117 ms
198,816 KB |
testcase_01 | AC | 174 ms
198,836 KB |
testcase_02 | AC | 114 ms
198,944 KB |
testcase_03 | AC | 129 ms
199,016 KB |
testcase_04 | AC | 131 ms
199,152 KB |
testcase_05 | AC | 122 ms
199,160 KB |
testcase_06 | AC | 123 ms
198,980 KB |
testcase_07 | AC | 126 ms
198,876 KB |
testcase_08 | AC | 127 ms
198,900 KB |
testcase_09 | AC | 122 ms
199,048 KB |
testcase_10 | AC | 120 ms
199,068 KB |
testcase_11 | AC | 118 ms
198,956 KB |
testcase_12 | AC | 123 ms
198,848 KB |
testcase_13 | AC | 114 ms
198,932 KB |
testcase_14 | AC | 114 ms
198,988 KB |
testcase_15 | AC | 172 ms
199,128 KB |
testcase_16 | AC | 133 ms
199,032 KB |
testcase_17 | AC | 132 ms
198,928 KB |
testcase_18 | AC | 132 ms
199,120 KB |
testcase_19 | AC | 133 ms
199,152 KB |
testcase_20 | AC | 132 ms
199,188 KB |
testcase_21 | AC | 116 ms
199,088 KB |
testcase_22 | AC | 116 ms
198,952 KB |
testcase_23 | AC | 116 ms
198,912 KB |
testcase_24 | AC | 116 ms
199,056 KB |
testcase_25 | AC | 116 ms
199,116 KB |
testcase_26 | AC | 114 ms
198,964 KB |
testcase_27 | AC | 115 ms
198,988 KB |
testcase_28 | AC | 115 ms
199,060 KB |
testcase_29 | AC | 114 ms
198,852 KB |
testcase_30 | AC | 114 ms
198,892 KB |
testcase_31 | AC | 115 ms
199,144 KB |
testcase_32 | AC | 114 ms
199,112 KB |
testcase_33 | AC | 114 ms
199,048 KB |
testcase_34 | AC | 114 ms
199,084 KB |
testcase_35 | AC | 114 ms
198,904 KB |
testcase_36 | AC | 115 ms
199,136 KB |
testcase_37 | AC | 115 ms
198,856 KB |
testcase_38 | AC | 114 ms
199,016 KB |
testcase_39 | AC | 115 ms
199,084 KB |
testcase_40 | AC | 114 ms
199,100 KB |
testcase_41 | AC | 115 ms
198,924 KB |
testcase_42 | AC | 116 ms
198,956 KB |
testcase_43 | AC | 197 ms
199,124 KB |
testcase_44 | AC | 132 ms
199,128 KB |
testcase_45 | AC | 134 ms
199,016 KB |
testcase_46 | AC | 133 ms
199,192 KB |
testcase_47 | AC | 133 ms
198,888 KB |
testcase_48 | AC | 114 ms
199,052 KB |
testcase_49 | AC | 114 ms
199,072 KB |
testcase_50 | AC | 113 ms
198,884 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> typedef long long int ll; typedef long long int ull; #define MP make_pair using namespace std; using namespace atcoder; typedef pair<ll, ll> P; // const ll MOD = 998244353; const ll MOD = 1000000007; // using mint = modint998244353; using mint = modint1000000007; const double pi = 3.1415926536; const int MAX = 2000003; long long fac[MAX], finv[MAX], inv[MAX]; void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } // 二項係数計算 long long COM(int n, int k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } ll gcd(ll x, ll y) { if (y == 0) return x; else if (y > x) { return gcd (y, x); } else return gcd(x % y, y); } ll lcm (ll x, ll y) { return x / gcd(x, y) * y; } ll my_sqrt(ll x) { ll m = 0; ll M = 3000000001; while (M - m > 1) { ll now = (M + m) / 2; if (now * now <= x) { m = now; } else { M = now; } } return m; } ll keta(ll n) { ll ret = 0; while (n) { n /= 10; ret++; } return ret; } ll ceil(ll n, ll m) { // n > 0, m > 0 ll ret = n / m; if (n % m) ret++; return ret; } ll pow_ll(ll x, ll n) { if (n == 0) return 1; if (n % 2) { return pow_ll(x, n - 1) * x; } else { ll tmp = pow_ll(x, n / 2); return tmp * tmp; } } ll dp[5001][5001]; ll INF = 100000000000; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int now0 = 0; int now1 = 0; vector<P> v; int all_z = 0; for (int i = 0; i < n; i++) { if (a[i] == 2) { v.push_back(P(now0, now1)); now0 = 0; now1 = 0; } else if (a[i] == 0) { now0++; all_z++; } else { now1++; } } v.push_back(P(now0, now1)); int r = v.size(); for (int i = 0; i <= 5000; i++) { for (int j = 0; j <= 5000; j++) { dp[i][j] = INF; } } dp[0][0] = 0; for (int i = 0; i < r; i++) { for (int j = 0; j <= 5000; j++) { // 0埋めする場合 if (j + v[i].first + v[i].second <= 5000) { dp[i + 1][j + v[i].first + v[i].second] = min(dp[i + 1][j + v[i].first + v[i].second], dp[i][j] + v[i].second); } // 1埋めする場合 dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]); } } if (dp[r][all_z] == INF) cout << -1 << endl; else cout << dp[r][all_z] << endl; return 0; }