結果
問題 | No.1536 仕切り直し |
ユーザー | stoq |
提出日時 | 2021-06-06 18:24:33 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 28 ms / 2,000 ms |
コード長 | 3,310 bytes |
コンパイル時間 | 2,042 ms |
コンパイル使用メモリ | 211,792 KB |
実行使用メモリ | 35,072 KB |
最終ジャッジ日時 | 2024-05-04 00:47:08 |
合計ジャッジ時間 | 3,058 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
35,072 KB |
testcase_01 | AC | 12 ms
34,868 KB |
testcase_02 | AC | 21 ms
34,944 KB |
testcase_03 | AC | 12 ms
35,072 KB |
testcase_04 | AC | 25 ms
34,944 KB |
testcase_05 | AC | 18 ms
34,944 KB |
testcase_06 | AC | 22 ms
35,072 KB |
testcase_07 | AC | 12 ms
35,056 KB |
testcase_08 | AC | 27 ms
35,072 KB |
testcase_09 | AC | 16 ms
34,912 KB |
testcase_10 | AC | 27 ms
34,944 KB |
testcase_11 | AC | 13 ms
34,944 KB |
testcase_12 | AC | 28 ms
34,944 KB |
コンパイルメッセージ
main.cpp: In function 'void solve()': main.cpp:135:32: warning: 'Maxi' may be used uninitialized [-Wmaybe-uninitialized] 135 | if (dp[i][j] == dp[i - 1][j] + a[i - 1] * s) | ~~~~~~~~~~~^ main.cpp:123:7: note: 'Maxi' was declared here 123 | int Maxi; | ^~~~
ソースコード
#define MOD_TYPE 2 #pragma region Macros #include <bits/stdc++.h> using namespace std; #if 0 #include <boost/multiprecision/cpp_int.hpp> #include <boost/multiprecision/cpp_dec_float.hpp> using Int = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; #endif #if 1 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif using ll = long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; using pld = pair<ld, ld>; template <typename Q_type> using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>; constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; constexpr ld PI = acos(-1.0); constexpr ld EPS = 1e-7; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define possible(n) cout << ((n) ? "possible" : "impossible") << "\n" #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; struct io_init { io_init() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); }; } io_init; template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; } template <typename A, size_t N, typename T> inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template <typename T, typename U> constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept { is >> p.first >> p.second; return is; } template <typename T, typename U> constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept { os << p.first << " " << p.second; return os; } #pragma endregion // -------------------------------------- ll dp[2010][2010]; void solve() { Fill(dp, -LINF); int n, m; cin >> n >> m; vector<ll> a(n); rep(i, n) cin >> a[i]; dp[0][0] = 0; rep(i, n) rep(j, m + 1) { int s = (j % 2 == 0 ? 1 : -1); if (j < m) { chmax(dp[i + 1][j + 1], dp[i][j] - a[i] * s); } chmax(dp[i + 1][j], dp[i][j] + a[i] * s); } ll Max = -LINF; int Maxi; rep(j, m + 1) { if (chmax(Max, dp[n][j])) Maxi = j; } vector<int> ans; int j = Maxi; for (int i = n; i >= 1; i--) { int s = (j % 2 == 0 ? 1 : -1); if (dp[i][j] == dp[i - 1][j] + a[i - 1] * s) { ; } else { j--; ans.push_back(i - 1); } } reverse(all(ans)); while (ans.size() < m) ans.push_back(n); rep(i, ans.size()) cout << ans[i] << (i + 1 == ans.size() ? "\n" : " "); } int main() { solve(); }