oj.uz

Submission #744972

# Submission time Handle Problem Language Result Execution time Memory
744972 2023-05-19T09:15:59 Z zeta7532 Split the sequence (APIO14_sequence) C++17
50 / 100
 2000 ms 48212 KB 
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
const ll mod = 998244353;
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define faster ios::sync_with_stdio(false);cin.tie(nullptr)
 
int main() {
    ll N,K;
    cin >> N >> K;
    K++;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];
    vector<ll> sum(N+1);
    sum[0]=0;
    rep(i,N) sum[i+1]=sum[i]+A[i];
    vector<vector<ll>> dp(N+1,vector<ll>(K+1,0));
    ll ans[N+1][K+1][2];
    rep(i,N){
        rep(k,min(i+1,K)){
            dp[i+1][k+1]=-1;
            for(ll j=k;j<i+1;j++){
                ll x=dp[j][k]+(sum[i+1]-sum[j])*(sum[N]-sum[i+1]);
                if(dp[i+1][k+1]<x){
                    dp[i+1][k+1]=x;
                    ans[i+1][k+1][0]=j;
                    ans[i+1][k+1][1]=k;
                }
            }    
        }
    }
    cout << dp[N][K] << endl;
    ll y=N,z=K;
    vector<ll> ANS;
    while(1){
        ll ny=ans[y][z][0];
        ll nz=ans[y][z][1];
        y=ny;
        z=nz;
        if(y==0) break;
        ANS.push_back(y);
    }
    reverse(all(ANS));
    rep(i,ANS.size()) cout << ANS[i] << " ";
    cout << endl;
    return 0;
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:10:30: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 | #define rep(i,n) for(ll i=0;i<n;i++)
......
   50 |     rep(i,ANS.size()) cout << ANS[i] << " ";
      |         ~~~~~~~~~~~~          
sequence.cpp:50:5: note: in expansion of macro 'rep'
   50 |     rep(i,ANS.size()) cout << ANS[i] << " ";
      |     ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB contestant found the optimal answer: 108 == 108
2 Correct 0 ms 212 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 212 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 212 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 212 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 212 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 212 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 212 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 212 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 212 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 212 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 212 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 1 ms 212 KB contestant found the optimal answer: 805 == 805
16 Correct 0 ms 212 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 212 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 212 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 340 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 212 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 1 ms 212 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 1 ms 212 KB contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 212 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 1 ms 212 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 212 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 1 ms 212 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 212 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 3 ms 1236 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 212 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 4 ms 972 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 4 ms 1160 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 3 ms 1236 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 2 ms 468 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 2 ms 432 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 468 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 3 ms 424 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 160 ms 5036 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 3 ms 340 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 127 ms 5076 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 117 ms 4308 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 120 ms 5076 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 128 ms 5076 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 32 ms 1312 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 56 ms 2260 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 1876 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 254 ms 1948 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2088 ms 48212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2062 ms 16724 KB Time limit exceeded
2 Halted 0 ms 0 KB -