oj.uz

답안 #247039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247039 2020-07-10T19:49:11 Z hackermub 수열 (APIO14_sequence) C++17
100 / 100
 665 ms 84400 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<ll,ll>
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define pb push_back
const int MOD =1e9+7;
const int64_t INF = 1e18;

vector<ll> M,C;
vector<int> L;
int last;

bool bad(int l1,int l2,int l3){
    return __int128(C[l3]-C[l1])*(M[l1]-M[l2]) < __int128(C[l2]-C[l1])*(M[l1]-M[l3]);
}

void insert(ll m,ll c,int l){
    if(!M.empty() && M.back() == m) {
        if(c>=C.back()){
            M.pop_back();
            C.pop_back();
            L.pop_back();
        }
    }
    M.push_back(m);
    C.push_back(c);
    L.push_back(l);
    while(M.size()>=3 && bad(M.size()-3,M.size()-2,M.size()-1)){
        M.erase(M.end()-2);
        C.erase(C.end()-2);
        L.erase(L.end()-2);
    }
}

ll f(int idx,ll x){
    return M[idx]*x + C[idx];
}

pii query(ll x){
    last = min(last , (int)M.size()-1);
    while(last<M.size()-1 && f(last,x)<=f(last+1,x)) last++;
    return {f(last,x),L[last]};
}

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie();
    //If you hack my code , You are gay;
    int n,K;
    cin>>n>>K;
    vector<ll> pre(n+1);
    for(int i=1;i<=n;i++){
        cin>>pre[i];
        pre[i]+=pre[i-1];
    }
    ll dp[2][n+1];
    int path[K+1][n+1];
    memset(dp,0,sizeof(dp));
    memset(path,0,sizeof(path));
    for(int k=1;k<=K;k++){
        M.clear();
        C.clear();
        L.clear();
        last=0;
        insert(0,0,0);
        for(int i=1;i<=n;i++){
            pii now = query(pre[i]);
            dp[k%2][i] = now.fi;
            path[k][i] = now.se;
            insert(pre[i],dp[!(k%2)][i]-pre[i]*pre[i],i);
        }
    }
    cout<<dp[K%2][n]<<"\n";
    vector<int> ans;
    for(int k=K;k;k--){
        n = path[k][n];
        ans.push_back(n);
    }
    reverse(all(ans));
    for(auto x:ans) cout<<x<<" ";
    return 0;
}

Compilation message

sequence.cpp: In function 'std::pair<long long int, long long int> query(long long int)':
sequence.cpp:45:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(last<M.size()-1 && f(last,x)<=f(last+1,x)) last++;
           ~~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

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

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1024 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 1024 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 53 ms 8832 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 1152 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 45 ms 5504 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 56 ms 6392 KB contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 53 ms 6912 KB contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 38 ms 5840 KB contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 43 ms 6528 KB contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 55 ms 8064 KB contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 6336 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 23 ms 6336 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 479 ms 84400 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 23 ms 7224 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 665 ms 83640 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 471 ms 60216 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 489 ms 64688 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 365 ms 53680 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 376 ms 60464 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 482 ms 76212 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845