oj.uz

답안 #311366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
311366 2020-10-10T01:53:16 Z zaneyu 수열 (APIO14_sequence) C++14
100 / 100
 1322 ms 96344 KB 
/*input
7 3
4 1 3 4 0 2 3
*/
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=3.14159265358979323846;
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define MP make_pair
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
struct line{
    ll m,c;
    ll get(ll x){
        return x*m+c;
    }
    ld intersect(line x){
        return (ld)(x.c-c)/(m-x.m+0.000000001);
    }
};
int par[maxn][205];
deque<pair<line,int>> dq[205];
ll pref[maxn];
 
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,k;
    cin>>n>>k;
    REP1(i,n){
        int x;
        cin>>x;
        pref[i]=pref[i-1]+x;
    }
    REP(j,k){
        line c={0,0};
        dq[j].pb({c,0});
    }
    ll ans=0;
    REP1(i,n){
        for(int j=k;j>=1;j--){
            while(sz(dq[j-1])>1 and dq[j-1].front().f.get(pref[i])<=dq[j-1][1].f.get(pref[i])){
                dq[j-1].pop_front();
            }
            //REP(z,i) MXTO(dp[i][j],dp[z][j-1]+(pref[i]-pref[z])*pref[z]);
            ll dp=dq[j-1].front().f.get(pref[i]);
            //cout<<dp<<'\n';
            par[i][j]=dq[j-1].front().s;
            MXTO(ans,dp);
            //cout<<i<<' '<<j<<' '<<dp[i][j]<<'\n';
            line c={pref[i],dp-pref[i]*pref[i]};
            while(sz(dq[j])>1 and c.intersect(dq[j].back().f)<=dq[j].back().f.intersect(dq[j][sz(dq[j])-2].f)) dq[j].pop_back();
            dq[j].pb({c,i});
        }
        line c={pref[i],-pref[i]*pref[i]};
        dq[0].pb({c,i});
    }
    cout<<ans<<'\n';
    int ci=n,cj=k;
    vector<int> v;
    while(cj){
        ci=par[ci][cj];
        v.pb(ci);
        --cj;
    }
    reverse(ALL(v));
    for(auto x:v) cout<<x<<' ';
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 512 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 512 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 512 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 512 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 1 ms 512 KB contestant found the optimal answer: 1 == 1
7 Correct 1 ms 512 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 512 KB contestant found the optimal answer: 1 == 1
9 Correct 1 ms 512 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 1 ms 512 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 512 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 1 ms 512 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 1 ms 512 KB contestant found the optimal answer: 140072 == 140072
14 Correct 1 ms 452 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 512 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 512 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 1 ms 512 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 1 ms 512 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 512 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 1 ms 512 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 512 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 512 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 512 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 512 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 512 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 512 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 640 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 640 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 768 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 640 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 768 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 2 ms 768 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 768 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 640 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 640 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 672 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1280 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1408 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 10 ms 1536 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1280 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 10 ms 1408 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 9 ms 1408 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 10 ms 1408 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 10 ms 1664 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 3 ms 1408 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 7 ms 1408 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8960 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 7 ms 9216 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 110 ms 10144 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 8 ms 9088 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 76 ms 10028 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 83 ms 9464 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 91 ms 9980 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 82 ms 10104 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 83 ms 9848 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 105 ms 9848 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 85752 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 67 ms 86008 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 1263 ms 96344 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 68 ms 86520 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1322 ms 95000 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 936 ms 90236 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 1022 ms 94968 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 855 ms 94072 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 918 ms 94072 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1162 ms 94584 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845