Trouble with 463C-Gargari and Bishops

Правка en3, от _kira_1008, 2020-07-13 01:31:26

link to my submission — https://mirror.codeforces.com/contest/463/submission/86461525 Basically I first calculated the sums of all the diagonals. Then through observations figured out that one bishop needs to be placed at row and column with even sum(let say white square) and other at the black square. So I thought the answer must be max of white sq sum+ max(black square sum) and then minus the square at which they both intersect. I can't figure out where this goes wrong

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский _kira_1008 2020-07-13 01:31:26 53
en2 Английский _kira_1008 2020-07-13 01:30:58 59
en1 Английский _kira_1008 2020-07-13 01:29:09 507 Initial revision (published)