結果

問題 No.1334 Multiply or Add
ユーザー fastmathfastmath
提出日時 2021-01-08 22:59:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,488 bytes
コンパイル時間 2,180 ms
コンパイル使用メモリ 205,468 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-16 14:59:29
合計ジャッジ時間 5,268 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 14 ms
5,248 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 14 ms
5,248 KB
testcase_07 AC 14 ms
5,248 KB
testcase_08 WA -
testcase_09 AC 15 ms
5,248 KB
testcase_10 AC 15 ms
5,248 KB
testcase_11 AC 15 ms
5,248 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 15 ms
5,248 KB
testcase_17 AC 15 ms
5,248 KB
testcase_18 AC 14 ms
5,248 KB
testcase_19 AC 14 ms
5,248 KB
testcase_20 AC 14 ms
5,248 KB
testcase_21 AC 15 ms
5,248 KB
testcase_22 AC 14 ms
5,248 KB
testcase_23 AC 15 ms
5,248 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 15 ms
5,248 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 15 ms
5,248 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 2 ms
5,248 KB
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 AC 25 ms
5,248 KB
testcase_51 AC 25 ms
5,248 KB
testcase_52 AC 26 ms
5,248 KB
testcase_53 AC 26 ms
5,248 KB
testcase_54 AC 25 ms
5,248 KB
testcase_55 AC 26 ms
5,248 KB
testcase_56 AC 2 ms
5,248 KB
testcase_57 WA -
testcase_58 WA -
testcase_59 AC 2 ms
5,248 KB
testcase_60 AC 2 ms
5,248 KB
testcase_61 AC 1 ms
5,248 KB
testcase_62 AC 1 ms
5,248 KB
testcase_63 AC 2 ms
5,248 KB
testcase_64 AC 2 ms
5,248 KB
testcase_65 AC 2 ms
5,248 KB
testcase_66 AC 21 ms
5,248 KB
testcase_67 AC 14 ms
5,248 KB
testcase_68 AC 2 ms
5,248 KB
testcase_69 AC 24 ms
5,248 KB
testcase_70 AC 22 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}

const int INF = 1e16;
int mul(int a, int b) {
    if (a == 0 || b == 0)
        return 0;
    if (b > INF/a)
        return INF;
    else    
        return a * b;
}   

//need define int long long
namespace Stuff {
const int MOD = 1e9+7;
int mod(int n) {
    n %= MOD;
    if (n < 0) return n + MOD;
    else return n;
}   
int fp(int a, int p) {
    int ans = 1, c = a;
    for (int i = 0; (1ll << i) <= p; ++i) {
        if ((p >> i) & 1) ans = mod(ans * c);
        c = mod(c * c);
    }   
    return ans;
}   
int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); }
};
struct M {
ll x;
M (int x_) { x = Stuff::mod(x_); }   
M () { x = 0; }
M operator + (M y) {
    int ans = x + y.x;
    if (ans >= Stuff::MOD)
        ans -= Stuff::MOD;
    return M(ans);
}
M operator - (M y) {
    int ans = x - y.x;
    if (ans < 0)
        ans += Stuff::MOD;
    return M(ans);            
}   
M operator * (M y) { return M(x * y.x % Stuff::MOD); }   
M operator / (M y) { return M(x * Stuff::fp(y.x, Stuff::MOD - 2) % Stuff::MOD); }   
M operator + (int y) { return (*this) + M(y); }
M operator - (int y) { return (*this) - M(y); }   
M operator * (int y) { return (*this) * M(y); }   
M operator / (int y) { return (*this) / M(y); }   
M operator ^ (int p) { return M(Stuff::fp(x, p)); }   
void operator += (M y) { *this = *this + y; }   
void operator -= (M y) { *this = *this - y; }   
void operator *= (M y) { *this = *this * y; }
void operator /= (M y) { *this = *this / y; }   
void operator += (int y) { *this = *this + y; }   
void operator -= (int y) { *this = *this - y; }   
void operator *= (int y) { *this = *this * y; }
void operator /= (int y) { *this = *this / y; }   
void operator ^= (int p) { *this = *this ^ p; }
bool operator == (M y) { return x == y.x; }
};  
std::ostream& operator << (std::ostream& o, const M& a)
{
    cout << a.x;
    return o;
}

const int N = 101;
int dp[N];

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    int n;
    cin >> n;
    vi a(n);
    re(a);
    int f = 1;
    trav (x, a)
        f = mul(f, x);

    if (f == INF) {
        M ans = 1;
        trav (x, a)
            ans *= x;

        int ptr = 0;
        while (a[ptr] == 1) {
            ans += 1;
            ptr++;
        }   

        ptr = n - 1;
        while (a[ptr] == 1) {
            ans += 1;
            ptr--;
        }   

        cout << ans << endl;
        exit(0);
    }   

    vi p;
    FOR (i, n)
        if (a[i] > 1)
            p.app(i);

    if (p.empty()) {
        cout << n << endl;
        exit(0);
    }   

    int sz = p.size();
    for (int i = 0; i < sz; ++i) {
        int f = 1;
        for (int l = i; l >= 0; --l) {
            f *= a[p[l]];
            int nn = f;
            if (l > 0) {
                nn += dp[l - 1];   
            }
            ckmax(dp[i], nn);
        }   
    }   
    M ans = dp[sz - 1];
    
    int ptr = 0;
    while (a[ptr] == 1) {
        ans += 1;
        ptr++;
    }   

    ptr = n - 1;
    while (a[ptr] == 1) {
        ans += 1;
        ptr--;
    }   
    cout << ans << endl;
}
0