oj.uz

답안 #974179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974179 2024-05-03T04:28:50 Z 12345678 Akcija (COCI15_akcija) C++17
16 / 80
 8 ms 2396 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;

#define ll long long

ll n, c[nx], dp[nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>c[i];
    for (int i=1; i<=n; i++)
    {
        dp[i]=dp[i-1]+c[i];
        if (i>=3) dp[i]=min(dp[i], dp[i-3]+c[i-2]+c[i-1]+c[i]-min(c[i-2], min(c[i-1], c[i])));
    }
    cout<<dp[n];
}

Subtask #1
16.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Incorrect 6 ms 2268 KB Output isn't correct
7 Correct 8 ms 2392 KB Output is correct
8 Correct 6 ms 2396 KB Output is correct
9 Incorrect 7 ms 2396 KB Output isn't correct
10 Incorrect 7 ms 2396 KB Output isn't correct