CHECHOC - Editorial

editorial
, , , , , ,
222

if there’s only one cell there are no pairs of cells so the limit of y does not apply to anything

1 Like
223

Damn , missed only the base case

224

Please check my code, I don’t get where I did wrong solution

225

It is not clear whether your remarks is about my question(209) or not. If so, the test case given by you returns answer as 34121 and not 36461 as told by you. Please check again and if possible please tell me where I have done the mistake?

https://www.codechef.com/viewsolution/35987993

Please anyone help me.

226

Can anyone tell me what’s wrong with my solution?
https://www.codechef.com/viewsolution/36047769

227

Since you have written your code in py , I can’t help ( I know cpp only)
If you know cpp then use it
CHECHOC WA FINDER

It will gives you all posssible Test Cases where you failed.
Try Once, you will Love it!!

228

The beauty about this question was the base case (1x1) :slight_smile:

1 Like
229

i literally submitted this code 7 time got WA and time penalty for 70 mins

  void test_case(){
    int n,m,x,y;
    cin>>n>>m>>x>>y;
    int arr[n][m];
    lld sum=0;
    if(n<2){
        cout<<x<<endl;
        return;
    }
    x=min(x,y);
    for(int i=0;i<n;++i){
        for(int j=0;j<m;++j){
            if((i+j)%2==0){
                sum+=x;
            }
            else{
                sum+=max(0,min(x,y-x));
            }
        }
    }
    cout<<sum<<endl;
}

ps did you figure out mistake in my code.

what was my mistake is only edge case condition didn’t satisfy.
Here is the correct code to it:

void test_case(){
    int n,m,x,y;
    cin>>n>>m>>x>>y;
    int arr[n][m];
    lld sum=0;
    if(n*m<2){
        cout<<x<<endl;
        return;
    }
    x=min(x,y);
    for(int i=0;i<n;++i){
        for(int j=0;j<m;++j){
            if((i+j)%2==0){
                sum+=x;
            }
            else{
                sum+=max(0,min(x,y-x));
            }
        }
    }
    cout<<sum<<endl;
}

total wasted my rank should have been under 200-300 but ended up getting 2000+ xoxo.

231

Well, Thankyou for the reply. I corrected the base case but then also, it’s showing WA after submission!

233

Please check this code
https://www.codechef.com/viewsolution/36048722

@sksama
@anon70990627

235

@anon70990627 Sir, please provide me testcases, here is my code CodeChef: Practical coding for everyone

236

I am getting 95. Is it correct??

237

Hello, I don’t know what’s wrong with this ; I tried all the base cases
Can anyone please help me look into it:

[CodeChef: Practical coding for everyone](http://My Submission is here)
Thanks in advance :smile:

238

yours code goes wrong where n or m is odd, try drawing a matrix on a paper and fill it , for odd number of n and m, u will see whats wrong, and x==y is not needed.

Try making a matrix and visualize it, if still dont understand see the videos, the question is explained with diagrams

A hint- You did +x, which only adds for 1 block

Draw on paper fill all the block and take out sum for each row and what happens when its odd and what when even

English Explanation
Hindi Explaination

239

Fails on-

1
9 1 2 8

Ans- 18. Your output 34

2 Likes
240

Can someone tell me the intuition behind the formula for calculating the black and white squares? I just can’t figure it out at the moment. Thanks :slight_smile:

241

@anon70990627 Thank a lot sir. I really did a silly mistake. I forgot about first condition that value in cell can’t exceeded x. :man_facepalming:

1 Like
242

Suppose there is a matrix, we assume the matrix as a chess board black and white… the first row starts from black,

so in first row we fill it with max possible i.e, x and in 2nd we can only will y-x (as sum of 2 adjacent black +white is always less than y)

243

@rajarshi_basu @cherry0697 @yash_chandnani
Why my solution is giving WA on submission. Please suggest. Thanks in advance :slightly_smiling_face:
https://www.codechef.com/viewsolution/36056485

244

try this testcase:
1
3 3 2 5
your code outputs 23 where as it should be 9*2 = 18
here is my code check it out: solution