Submission #369201

#	Time	Username	Problem	Language	Result	Execution time	Memory
369201		Ahmad_Hasan	Vođe (COCI17_vode)	C++17	96 / 120	1629 ms	524292 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);*/
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);


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

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

    for(int i=0;i<n;i++){
        dp[i][m]=0;
        dp[i][0]=-1;
    }

    int cntr[n+5][m+5][2];
    memset(cntr,0,sizeof(cntr));
    for(int i=0;i<n;i++)
        cntr[i][m][0]=1;

    for(int j=m-1;j>=0;j--){
        for(int i=n-1;i>=0;i--){

            if(j==0){
                if(cntr[i][j+1][1])
                    dp[i][j]=1;
                else
                    dp[i][j]=0;
            }
            else{
                if(v[i]==v[(i+1)%n]){
                    if(cntr[(i+1)%n][j+1][1])
                        dp[i][j]=1;
                    else
                        dp[i][j]=0;
                }
                else{
                    if(cntr[(i+1)%n][j+1][1])
                        dp[i][j]=0;
                    else
                        dp[i][j]=1;
                }
            }
            cntr[i][j][0]=cntr[i][j+1][0];
            cntr[i][j][1]=cntr[i][j+1][1];
            cntr[i][j][dp[i][j]]++;
            if(j+k<=m){
                cntr[i][j][dp[i][j+k]]--;

            }
            ///cout<<i<<' '<<j<<' '<<cntr[i][j][0]<<'\n';


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

            }*/
        }
    }
/**
    for(int i=0;i<n;i++){
        cout<<'#';
        for(int j=0;j<=m;j++){
            cout<<dp[i][j]<<' ';
        }
        cout<<'\n';
    }
    for(int i=0;i<n;i++){
        cout<<'#';
        for(int j=0;j<=m;j++){
            cout<<cntr[i][j][0]<<'&'<<cntr[i][j][1]<<' ';
        }
        cout<<'\n';
    }
*/

    for(int i=0;i<n;i++)
        cout<<((dp[i][0]==1)?v[i]:!v[i])<<' ';



    return 0;
}



/**
6 20 5
1 0 0 1 1 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: 0 / 12
• Subtask 10: 0 / 12