結果

問題 No.158 奇妙なお使い
コンテスト
ユーザー firiexp
提出日時 2019-11-07 23:12:14
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,375 bytes
コンパイル時間 728 ms
コンパイル使用メモリ 88,744 KB
最終ジャッジ日時 2024-11-14 21:49:18
合計ジャッジ時間 1,192 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:17:39: error: '::numeric_limits' has not been declared
   17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                       ^~~~~~~~~~~~~~
main.cpp:17:55: error: expected primary-expression before '>' token
   17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                                       ^
main.cpp:17:61: error: no matching function for call to 'max()'
   17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                                        ~~~~~^~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39,
                 from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
main.cpp:17:61: note:   candidate expects 2 arguments, 0 provided
   17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
      |                                                        ~~~~~^~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    auto dp = make_v(2, 11, 101, -1);
    int a1, a2, a3;
    cin >> a1 >> a2 >> a3;
    dp[0][a1][a2] = a3;
    int b1, b2, b3, c1, c2, c3, d1, d2;
    cin >> d1 >> b1 >> b2 >> b3 >> d2 >> c1 >> c2 >> c3;
    int ok = 1, cnt = 0;
    for (int now = 0; ok; now ^= 1, cnt++) {
        ok = 0;
        int nxt = now^1;
        for (int i = 0; i <= 10; ++i) {
            for (int j = 0; j <= 100; ++j) {
                dp[nxt][i][j] = -1;
            }
        }
        for (int i = 0; i <= 10; ++i) {
            for (int j = 0; j <= 100; ++j) {
                if(~dp[now][i][j]){
                    int p = i, q = j, r = dp[now][i][j];
                    int required = d1;
                    int tmp = min(p, required/1000);
                    p -= tmp; required -= tmp*1000;
                    tmp = min(q, required/100);
                    q -= tmp; required -= tmp*100;
                    if(r-required >= 0){
                         chmax(dp[nxt][p+b1][q+b2], r-required+b3);
                         ok = 1;
                    }
                    p = i, q = j, r = dp[now][i][j];
                    required = d2;
                    tmp = min(p, required/1000);
                    p -= tmp; required -= tmp*1000;
                    tmp = min(q, required/100);
                    q -= tmp; required -= tmp*100;
                    if(r-required >= 0){
                        chmax(dp[nxt][p+c1][q+c2], r-required+c3);
                        ok = 1;
                    }
                }
            }
        }
    }
    cout << cnt-1 << "\n";
    return 0;
}
0