oj.uz

Submission #709828

# Submission time Handle Problem Language Result Execution time Memory
709828 2023-03-14T15:23:54 Z lern Split the sequence (APIO14_sequence) C++11
0 / 100
 16 ms 728 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    std::vector<int> myvector;
    int n,k,cem=0,ij=0,cem1=0;
    cin>>n>>k;
    int a[n];
    for(int i=0 ;i<n ; i++){
        cin>>a[i];
    }
    if(n%2!=0){
        for(int i=1 ;i<n ; i++){
            cem+=a[i];
        }
        cem*=a[0];
        ij=1;
        myvector.push_back(ij);
    }
    else{
        for(int i=2 ;i<n ; i++){
            cem+=a[i];
        }
        cem*=(a[0]+a[1]);
        ij=2;
        myvector.push_back(ij);
    }
    for(int i=0 ;i<k-1 ; i++){
        for(int j=ij+2 ; j<n ; j++){
            cem1+=a[j];
        }
        cem+=cem1*(a[ij]+a[ij+1]);
        ij+=2;
        myvector.push_back(ij);
        cem1=0;
    }
    cout<<cem<<endl;
    for(int i=0 ;i<k ;i++){
        cout<<myvector[i]<<" ";
    }

    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB contestant found the optimal answer: 108 == 108
2 Incorrect 1 ms 300 KB contestant didn't find the optimal answer: 471 < 999
3 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 276 KB contestant didn't find the optimal answer: 131304 < 1093956
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB contestant didn't find the optimal answer: 484137 < 610590000
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB contestant didn't find the optimal answer: 228040 < 21503404
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB contestant didn't find the optimal answer: 908387 < 1818678304
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 728 KB contestant didn't find the optimal answer: 5054352 < 19795776960
2 Halted 0 ms 0 KB -