oj.uz

답안 #1076428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076428 2024-08-26T13:46:42 Z YassirSalama 수열 (APIO14_sequence) C++17
50 / 100
 107 ms 3596 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define F first
#define S second
template<typename T> 
void dbg(const T& t){
    cout<<t<<endl;
}
template<typename T,typename... Args>
void dbg(const T& t,const Args&... args){
    cout<<t<<" , ";
    dbg(args...);
}
#define dbg(...) cout<<"("<<#__VA_ARGS__<<") : ";dbg(__VA_ARGS__);
const int maxn=1000+10;
int n,k;
int pref[maxn];
int v[maxn];
int sum(int l,int r){
    if(l>r) return 0LL;
    if(l==0) return pref[r];
    return pref[r]-pref[l-1];
}
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>v[i];
    }
    for(int i=1;i<=n;i++){
        pref[i]=v[i];
        if(i) pref[i]+=pref[i-1];
    }
    int dp[n+1][k+1];
    for(int i=0;i<=n;i++) for(int j=0;j<=k;j++) dp[i][j]=-1e18;
    dp[0][0]=0;
    int ans=0;
    int dp2[n+1][k+1];
    memset(dp2,0,sizeof(dp2));
    for(int i=1;i<=n;i++){
        for(int j=i;j>=1;j--){
            for(int t=k;t>=1;t--){
                int x=dp[j-1][t-1]+sum(j,i)*sum(i+1,n);
                if(dp[i][t]<x){
                    dp[i][t]=x;
                    dp2[i][t]=j;
                    ans=max(ans,dp[i][t]);
                }
            }
        }
    }
    cout<<ans<<"\n";
    vector<int> a;
    int t=k;
    for(int i=n-1;i>=1;i--){
        if(dp[i][t]==ans){
            a.pb(i);
            ans=dp[dp2[i][t]-1][t-1];
            t--;
            // break;
        }
    }
    reverse(all(a));
    for(auto x:a){
        cout<<x<<" ";
    }
    cout<<"\n";
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 348 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 107 ms 3420 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 344 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 106 ms 3420 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 90 ms 2908 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 106 ms 3596 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 105 ms 3420 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 22 ms 860 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 46 ms 1628 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -