oj.uz

Submission #101224

# Submission time Handle Problem Language Result Execution time Memory
101224 2019-03-17T18:25:12 Z Leonardo_Paes Hacker (BOI15_hac) C++11
0 / 100
 3 ms 256 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5+10;

int vet[MAXN];

int main(){

    int n, k, resp=0x3f3f3f3f;

    cin >> n;

    k = ceil((double)n/2);

    for(int i=1; i<=n; i++){
        cin >> vet[i];
    }

    for(int i=1; i<=k; i++){
        int u=i, x=1, sum=0;
        while(x<=k){
            sum+=vet[i];
            u--;
            x++;
            if(u==0)u=n;
        }
        resp=min(resp,sum);
    }
    cout << resp << endl;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -