#601630 (C++17) No.1334 Multiply or Add

提出ソース

結果

問題	No.1334 Multiply or Add
ユーザー	rniya
提出日時	2021-01-09 00:09:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,313 bytes
コンパイル時間	2,217 ms
コンパイル使用メモリ	207,904 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-11-16 19:30:15
合計ジャッジ時間	5,524 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	14 ms 5,248 KB
testcase_04	AC	14 ms 5,248 KB
testcase_05	AC	14 ms 5,248 KB
testcase_06	AC	14 ms 5,248 KB
testcase_07	AC	15 ms 5,248 KB
testcase_08	AC	14 ms 5,248 KB
testcase_09	AC	14 ms 5,248 KB
testcase_10	AC	15 ms 5,248 KB
testcase_11	AC	14 ms 5,248 KB
testcase_12	AC	14 ms 5,248 KB
testcase_13	AC	14 ms 5,248 KB
testcase_14	AC	14 ms 5,248 KB
testcase_15	AC	14 ms 5,248 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	23 ms 5,248 KB
testcase_20	AC	22 ms 5,248 KB
testcase_21	AC	22 ms 5,248 KB
testcase_22	RE	-
testcase_23	AC	15 ms 5,248 KB
testcase_24	AC	14 ms 5,248 KB
testcase_25	AC	13 ms 5,248 KB
testcase_26	AC	14 ms 5,248 KB
testcase_27	AC	14 ms 5,248 KB
testcase_28	AC	15 ms 5,248 KB
testcase_29	AC	13 ms 5,248 KB
testcase_30	AC	14 ms 5,248 KB
testcase_31	AC	15 ms 5,248 KB
testcase_32	AC	15 ms 5,248 KB
testcase_33	AC	14 ms 5,248 KB
testcase_34	AC	14 ms 5,248 KB
testcase_35	AC	15 ms 5,248 KB
testcase_36	AC	15 ms 5,248 KB
testcase_37	AC	15 ms 5,248 KB
testcase_38	AC	14 ms 5,248 KB
testcase_39	RE	-
testcase_40	AC	6 ms 5,248 KB
testcase_41	AC	3 ms 5,248 KB
testcase_42	AC	4 ms 5,248 KB
testcase_43	AC	11 ms 5,248 KB
testcase_44	AC	7 ms 5,248 KB
testcase_45	AC	4 ms 5,248 KB
testcase_46	AC	8 ms 5,248 KB
testcase_47	AC	10 ms 5,248 KB
testcase_48	AC	7 ms 5,248 KB
testcase_49	AC	13 ms 5,248 KB
testcase_50	AC	26 ms 5,248 KB
testcase_51	AC	27 ms 5,248 KB
testcase_52	AC	24 ms 5,248 KB
testcase_53	AC	26 ms 5,248 KB
testcase_54	AC	27 ms 5,248 KB
testcase_55	AC	28 ms 5,248 KB
testcase_56	AC	2 ms 5,248 KB
testcase_57	AC	2 ms 5,248 KB
testcase_58	AC	1 ms 5,248 KB
testcase_59	WA	-
testcase_60	AC	2 ms 5,248 KB
testcase_61	AC	2 ms 5,248 KB
testcase_62	AC	2 ms 5,248 KB
testcase_63	WA	-
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	3 ms 5,248 KB
testcase_69	AC	23 ms 5,248 KB
testcase_70	AC	22 ms 5,248 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

template<uint32_t mod> class modint{
    using i64=int64_t;
    using u32=uint32_t;
    using u64=uint64_t;
public:
    u32 v;
    constexpr modint(const i64 x=0) noexcept :v(x<0?mod-1-(-(x+1)%mod):x%mod){}
    constexpr u32 &value() noexcept {return v;}
    constexpr const u32 &value() const noexcept {return v;}
    constexpr modint operator+(const modint &rhs) const noexcept {return modint(*this)+=rhs;}
    constexpr modint operator-(const modint &rhs) const noexcept {return modint(*this)-=rhs;}
    constexpr modint operator*(const modint &rhs) const noexcept {return modint(*this)*=rhs;}
    constexpr modint operator/(const modint &rhs) const noexcept {return modint(*this)/=rhs;}
    constexpr modint &operator+=(const modint &rhs) noexcept {
        v+=rhs.v;
        if (v>=mod) v-=mod;
        return *this;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept {
        if (v<rhs.v) v+=mod;
        v-=rhs.v;
        return *this;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept {
        v=(u64)v*rhs.v%mod;
        return *this;
    }
    constexpr modint &operator/=(const modint &rhs) noexcept {
        return *this*=rhs.pow(mod-2);
    }
    constexpr modint pow(u64 exp) const noexcept {
        modint self(*this),res(1);
        while (exp>0){
            if (exp&1) res*=self;
            self*=self; exp>>=1;
        }
        return res;
    }
    constexpr modint &operator++() noexcept {if (++v==mod) v=0; return *this;}
    constexpr modint &operator--() noexcept {if (v==0) v=mod; return --v,*this;}
    constexpr modint operator++(int) noexcept {modint t=*this; return ++*this,t;}
    constexpr modint operator--(int) noexcept {modint t=*this; return --*this,t;}
    constexpr modint operator-() const noexcept {return modint(mod-v);}
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept {return modint(x)+y;}
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept {return modint(x)-y;}
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept {return modint(x)*y;}
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept {return modint(x)/y;}
    constexpr bool operator==(const modint &rhs) const noexcept {return v==rhs.v;}
    constexpr bool operator!=(const modint &rhs) const noexcept {return v!=rhs.v;}
    constexpr bool operator!() const noexcept {return !v;}
    friend istream &operator>>(istream &s,modint &rhs) noexcept {
        i64 v; rhs=modint{(s>>v,v)}; return s;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept {
        return s<<rhs.v;
    }
};

using mint=modint<MOD>;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N; cin >> N;
    deque<int> A;
    for (int i=0;i<N;++i){
        int a; cin >> a;
        A.emplace_back(a);
    }

    ll prod=1; bool ok=false;
    for (int x:A){
        prod*=x;
        if (prod>=2*N){
            ok=true;
            break;
        }
    }

    if (ok){
        mint ans=1;
        for (int x:A) ans*=x;
        cout << ans << '\n';
        return 0;
    }

    int sum=0;
    while (!A.empty()&&A.front()==1) ++sum,A.pop_front();
    while (!A.empty()&&A.back()==1) ++sum,A.pop_back();

    N=A.size();
    vector<int> v;
    for (int i=0;i<N;){
        int p=1;
        if (A[i]==1){
            p=0;
            while (i<N&&A[i]==1) ++p,++i;
        } else {
            while (i<N&&A[i]!=1) p*=A[i],++i;
        }
        v.emplace_back(p);
    }

    int n=v.size(),m=(n-1)/2;
    int ans=0;
    for (int mask=0;mask<(1<<m);++mask){
        int S=0,cur=v[0];
        for (int i=0;i<m;++i){
            if (mask&1<<i) S+=cur+v[2*i+1],cur=v[2*i+2];
            else cur*=v[2*i+2];
        }
        ans=max(ans,S+cur);
    }

    cout << ans+sum << '\n';
}

yukicoder

結果

テストケース

ソースコード