Submission #368332

#	Time	Username	Problem	Language	Result	Execution time	Memory
368332		Ahmad_Hasan	Vođe (COCI17_vode)	C++17	0 / 120	3093 ms	189036 KiB

vode

#include <bits/stdc++.h>
#define int long long
/**
     ||||||||||       |||||     |||||    ||||||||||
    |||||||||||||     |||||     |||||  |||||
   ||||     ||||||    |||||     |||||  |||||
  |||||||||||||||||   |||||||||||||||    ||||||||||
 |||||||||||||||||||  |||||||||||||||           |||||
 |||||         |||||  |||||     |||||           |||||
 |||||         |||||  |||||     |||||    ||||||||||
AHMED;HASSAN;SAEED;
*/

using namespace std;



int32_t main()
{
    /**freopen("movie.in","r",stdin);
    freopen("movie.out","w",stdout);*/


    int n,m,k;
    cin>>n>>m>>k;

    vector<int>v(n);
    for(int i=0;i<n;i++){
        cin>>v[i];
    }
    int dp[n+5][m+5];
    memset(dp,-1,sizeof(dp));

    for(int i=0;i<n;i++)
        dp[i][m]=0;

    for(int j=m;j>=0;j--){
        for(int i=n-1;i>=0;i--){
            for(int z=1;z<=k;z++){
                if(z+j<=m){
                    if(j==0)
                        dp[i][j]=max(dp[i][j],dp[(i)%n][j+z]);
                    else
                        dp[i][j]=max(dp[i][j],(v[i]!=v[(i+1)%n])-dp[(i+1)%n][j+z]);
                }

            }
        }
    }
/**
    for(int i=0;i<n;i++){
        for(int j=0;j<=m;j++){
            cout<<dp[i][j]<<' ';
        }
        cout<<'\n';
    }
*/
    for(int i=0;i<n;i++)
        cout<<((dp[i][0]==1)?v[i]:!v[i])<<' ';



    return 0;
}



/**
4 3
100000000000 200000000000 300000000000 400000000000 800000000000 1000000000000 2000000000000

*/

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