#194828 (C++17) No.158 奇妙なお使い

• 問題: No.158 奇妙なお使い
• ユーザー: mai
• 提出日時: 2017-08-09 21:29:07
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,169 ms / 5,000 ms
• コード長: 4,783 bytes
• コンパイル時間: 3,267 ms
• コンパイル使用メモリ: 228,492 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-30 02:03:41
• 合計ジャッジ時間: 5,702 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	1,169 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	10 ms; 5,376 KB
testcase_18	AC	126 ms; 5,376 KB
testcase_19	AC	3 ms; 5,376 KB
testcase_20	AC	10 ms; 5,376 KB
testcase_21	AC	3 ms; 5,376 KB
testcase_22	AC	3 ms; 5,376 KB
testcase_23	AC	3 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB
testcase_30	AC	4 ms; 5,376 KB

コンパイルメッセージ

main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
main.cpp:63:9: warning: no return statement in function returning non-void [-Wreturn-type]
   63 |         }
      |         ^

ソースコード

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}}
#define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}}
#define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

mt19937 mt(8901016);
inline int rand_int(int l, int h) {
    return uniform_int_distribution<>(l, h)(mt);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiablechar(cc); cc = getchar_unlocked());
            for (; isvisiablechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;


int n, len;
int result = -1;

ll a4, a3, a1;
ll db, b4, b3, b1;
ll dc, c4, c3, c1;

map<pair<ll,ll>,ll> dp;
// 1円玉の枚数は最大数だけ覚えておけば良い！

/*
my-testcase
2 0 0
1000
0 9 10
1000
0 8 90
*/

int main() {

    scanner >> a4 >> a3 >> a1;
    scanner >> db;
    scanner >> b4 >> b3 >> b1;
    scanner >> dc;
    scanner >> c4 >> c3 >> c1;

    dp[make_pair(a4, a3)] = a1;

    int count = -1;
    bool updated = true;

    for (; updated; ++count) {
        updated = false;

        int next = (count + 1) % 2;
        int curr = (count) % 2;

        map<pair<ll, ll>, ll> dp_nxt;

        for (auto p : dp) {

            ll t1 = p.second;
            ll t4 = p.first.first;
            ll t3 = p.first.second;
            
            function<bool(ll, ll, ll, ll, ll, ll, ll, ll, ll, ll)> dfs1 = [&](ll y, ll y4, ll y3, ll y1, ll x4, ll x3, ll x1, ll p4, ll p3, ll p1) {
                //xprintf("%lld %lld %lld %lld\n", y, x4, x3, x1);
                if (y % 100 > x1) return false;
                if ((y / 100) % 10 > x3) return 100 > x1 ? false : dfs1(y, y4, y3, y1, x4, x3 + 1, x1 - 100, p4, p3 - 1, p1 + 100);
                if ((y / 1000) % 10 > x4) return 10 > x3 ? (100 > x1 ? false : dfs1(y, y4, y3, y1, x4, x3 + 1, x1 - 100, p4, p3 - 1, p1 + 100)) : dfs1(y, y4, y3, y1, x4 + 1, x3 - 10, x1, p4 - 1, p3 + 10, p1);

                //xprintf("> %lld %lld %lld %lld\n", y, x4, x3, x1);
                ll o1 = y % 100 + p1;
                ll o3 = (y / 100)%10 + p3;
                ll o4 = (y / 1000)%10 + p4;
            
                auto key = make_pair(t4 - o4 + y4, t3 - o3 + y3);
                dp_nxt[key] = max(dp_nxt[key], t1 - o1 + y1);
                if (x3 >= 10) dfs1(y, y4, y3, y1, x4 + 1, x3 - 10, x1, p4 - 1, p3 + 10, p1);
                return true;
            };

            updated |= dfs1(db, b4, b3, b1, t4, t3, t1, 0, 0, 0);
            updated |= dfs1(dc, c4, c3, c1, t4, t3, t1, 0, 0, 0);

        }
        dp.swap(dp_nxt);
    }

    cout << count << endl;
    return 0;

}