oj.uz

Submission #368341

# Submission time Handle Problem Language Result Execution time Memory
368341 2021-02-19T23:01:32 Z Ahmad_Hasan Vođe (COCI17_vode) C++17
0 / 120
 3000 ms 189036 KB 
#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][z]);
                    else
                        dp[i][j]=max(dp[i][j],((v[i]!=v[(i+1)%n])?!dp[(i+1)%n][j+z]:dp[(i+1)%n][j+z]));
                }

            }
        }
    }
/**
    for(int i=0;i<n;i++){
        cout<<'#';
        for(int j=(m/20)*20;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;
}



/**
6 20 5
1 0 0 1 1 0


*/

Subtask #1
0 / 12.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 12.0

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

Subtask #7
0 / 12.0

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

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 56428 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3063 ms 189036 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3077 ms 187756 KB Time limit exceeded
2 Halted 0 ms 0 KB -