Submission #121644

#	Time	Username	Problem	Language	Result	Execution time	Memory
121644		Leonardo_Paes	Vođe (COCI17_vode)	C++11	120 / 120	762 ms	96696 KiB

vode

#include <bits/stdc++.h>

using namespace std;

const int maxn = 5e3 + 10;

int vet[maxn], dp[maxn][maxn];

int main(){

    int n, m, k;

    cin >> n >> m >> k;

    m--;

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

    for(int j=m-1; j>=0; j--){
        for(int i=0; i<n; i++){
            int possible_answers = dp[(i+1)%n][j+1];
            int length = m-j;
            if(j+k<m){
                possible_answers -= dp[(i+1)%n][j+k+1];
                length = k;
            }
            if(possible_answers==0) dp[i][j] = dp[i][j+1];
            else if(possible_answers==length) dp[i][j] = 1 + dp[i][j+1];
            else dp[i][j] = vet[i] + dp[i][j+1];
        }
    }

    for(int i=0; i<n; i++){
        cout << dp[i][0] - dp[i][1] << " ";
    }
	cout << "\n";
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12