oj.uz

Submission #369215

# Submission time Handle Problem Language Result Execution time Memory
369215 2021-02-20T23:04:00 Z Ahmad_Hasan Vođe (COCI17_vode) C++17
120 / 120
 798 ms 144548 KB 
#include <bits/stdc++.h>
#define int int16_t
/**
     ||||||||||       |||||     |||||    ||||||||||
    |||||||||||||     |||||     |||||  |||||
   ||||     ||||||    |||||     |||||  |||||
  |||||||||||||||||   |||||||||||||||    ||||||||||
 |||||||||||||||||||  |||||||||||||||           |||||
 |||||         |||||  |||||     |||||           |||||
 |||||         |||||  |||||     |||||    ||||||||||
AHMED;HASSAN;SAEED;
*/

using namespace std;


int dp[5000][5000+5],cntr[5000][5000+5][2],v[5000];
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);


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

    for(int i=0;i<n;i++){
        cin>>v[i];
    }


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


    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)?0:i+1)]){
                    if(cntr[((i+1==n)?0:i+1)][j+1][1])
                        dp[i][j]=1;
                    else
                        dp[i][j]=0;
                }
                else{
                    if(cntr[((i+1==n)?0:i+1)][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]]--;

            }

        }
    }

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



    return 0;
}



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


*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 1 ms 876 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2156 KB Output is correct
2 Correct 1 ms 1292 KB Output is correct
3 Correct 2 ms 2156 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2540 KB Output is correct
2 Correct 2 ms 2412 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3564 KB Output is correct
2 Correct 4 ms 4204 KB Output is correct
3 Correct 3 ms 4076 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5356 KB Output is correct
2 Correct 5 ms 4972 KB Output is correct
3 Correct 4 ms 4716 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4716 KB Output is correct
2 Correct 5 ms 4844 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 32364 KB Output is correct
2 Correct 108 ms 34668 KB Output is correct
3 Correct 748 ms 141860 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 62316 KB Output is correct
2 Correct 671 ms 141676 KB Output is correct
3 Correct 237 ms 67180 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 798 ms 142956 KB Output is correct
2 Correct 6 ms 3692 KB Output is correct
3 Correct 3 ms 2284 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 791 ms 143904 KB Output is correct
2 Correct 712 ms 144492 KB Output is correct
3 Correct 703 ms 144548 KB Output is correct