結果

問題 No.10 ＋か×か
コンテスト
ユーザー mai
提出日時 2017-07-22 03:54:27
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 428 ms / 5,000 ms
コード長 4,489 bytes
コンパイル時間 11,937 ms
コンパイル使用メモリ 281,416 KB
最終ジャッジ日時 2025-01-05 01:46:45
ジャッジサーバーID
（参考情報） 		judge4 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 12
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 |         }
      |         ^

ソースコード

diff # 

#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;


ll n, total;
ll aa[60];

ll greedy_upper(ll begin, ll result) {

    for (ll index = begin; index < n; ++index) {
        if (result == 0)
            result = aa[index];
        else if (aa[index] == 1)
            result += 1;
        else if (result == 1)
            result += aa[index];
        else
            result *= aa[index];
        result = min(result, total + 1);
    }
    return result;
}

ll greedy_lower(ll begin, ll result) {

    for (ll index = begin; index < n; ++index) {
        if (result == 0)
            result = aa[index];
        else if (aa[index] == 1)
            result *= 1;
        else if (result == 1)
            result *= aa[index];
        else
            result += aa[index];
        result = min(result, total + 1);
    }
    return result;

}

string bestop = "z";

unordered_map<ll, string> memo;
void dfs(ll index, ll result, string op = "") {
    if (index == n) {
        if (result == total) {
            bestop = min(bestop, op); // 辞書順最大？問題文の辞書順は一般的でない？
        }
        return;
    }
    if (bestop < op)
        return;

    ll high = greedy_upper(index, result);
    ll low = greedy_lower(index, result);

    if (total < low || high < total) return;


    ll key = (index << 32) | result;
    if (memo.count(key)) {
        if (memo[key] <= op)
            return;
    }
    memo[key] = op;

    dfs(index + 1, result + aa[index], op + "A");
    dfs(index + 1, result * aa[index], op + "M");
}

int main() {
    scanner >> n >> total;

    repeat(i, n) {
        scanner >> aa[i];
    }

    dfs(1, aa[0]);

    assert(bestop != "z");

    for (char c : bestop) {
        putchar(c == 'A' ? '+' : c == 'M' ? '*' : c);
    }
    cout << endl;

    return 0;
}
0