#916875 (C++14) No.2488 Mod Sum Maximization

提出ソース

結果

問題	No.2488 Mod Sum Maximization
ユーザー	woodywoody
提出日時	2023-09-30 15:23:45
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	859 ms / 2,000 ms
コード長	5,190 bytes
コンパイル時間	4,069 ms
コンパイル使用メモリ	232,204 KB
実行使用メモリ	16,592 KB
最終ジャッジ日時	2024-07-23 09:23:48
合計ジャッジ時間	17,677 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	22 ms 7,244 KB
testcase_01	AC	10 ms 7,088 KB
testcase_02	AC	4 ms 7,088 KB
testcase_03	AC	647 ms 16,452 KB
testcase_04	AC	619 ms 16,524 KB
testcase_05	AC	613 ms 16,516 KB
testcase_06	AC	578 ms 16,400 KB
testcase_07	AC	378 ms 12,008 KB
testcase_08	AC	626 ms 16,408 KB
testcase_09	AC	464 ms 12,116 KB
testcase_10	AC	314 ms 11,932 KB
testcase_11	AC	12 ms 7,548 KB
testcase_12	AC	282 ms 11,800 KB
testcase_13	AC	226 ms 9,700 KB
testcase_14	AC	42 ms 7,796 KB
testcase_15	AC	341 ms 11,936 KB
testcase_16	AC	14 ms 7,492 KB
testcase_17	AC	85 ms 8,380 KB
testcase_18	AC	22 ms 7,528 KB
testcase_19	AC	521 ms 12,308 KB
testcase_20	AC	538 ms 16,476 KB
testcase_21	AC	494 ms 12,288 KB
testcase_22	AC	594 ms 16,592 KB
testcase_23	AC	606 ms 16,456 KB
testcase_24	AC	176 ms 9,568 KB
testcase_25	AC	9 ms 7,536 KB
testcase_26	AC	20 ms 7,496 KB
testcase_27	AC	449 ms 11,828 KB
testcase_28	AC	443 ms 11,788 KB
testcase_29	AC	349 ms 11,792 KB
testcase_30	AC	247 ms 9,596 KB
testcase_31	AC	36 ms 7,740 KB
testcase_32	AC	811 ms 12,164 KB
testcase_33	AC	5 ms 7,132 KB
testcase_34	AC	859 ms 16,444 KB
testcase_35	AC	223 ms 9,516 KB
testcase_36	AC	4 ms 7,044 KB
testcase_37	AC	4 ms 7,184 KB
testcase_38	AC	4 ms 7,184 KB
testcase_39	AC	4 ms 7,144 KB
testcase_40	AC	3 ms 7,192 KB

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

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!x) {vi v(3e8);}
#define asserttle(x) if (!x) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

ll op(ll a, ll b){
    return min(a,b);
}
ll e(){
    return LINF;
}

void solve(){
    int n; cin>>n;
    vi a(n);
    rep(i,n) cin>>a[i];

    segtree<ll, op, e> dp(n);
    dp.set(0, 0);
    const int mxa = (int)1e6+1;
    vi idxr(mxa);
    rep(i,n) idxr[a[i]] = i;
    rep(i,n-1){
        ll now = dp.prod(i, n);
        dp.set(i, now);
        for(int j=a[i]; j<mxa+a[i]; j+=a[i]){
            auto it = lower_bound(rng(a), j);
            if (it == a.begin()) continue;
            it--;
            int id = idxr[*it];
            dp.set(id, min(dp.get(id), now + (a[id]/a[i])*a[i]));
        }
    }
    ll ans = sumv(a) - dp.get(n-1);
    out;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード