fork download
  1. #include"stdio.h"
  2.  
  3. int main(){
  4. int test;
  5. scanf("%d",&test);
  6. for(int t=0; t<test; t++){
  7. int m,n,on=0,A[50][50], B[50]={0};
  8. scanf("%d%d%d",&m,&n,&n);
  9. for(int i=0; i<n; i++)
  10. for(int j=0; j<n; j++){
  11. scanf("%d",&A[i][j]);
  12. if(A[i][j]) {
  13. B[j]++;
  14. on++;
  15. }
  16. }
  17.  
  18. for(int i=0; i<m; i++){
  19. int min=B[0],k=0;
  20. for(int j=1; j<n; j++){ /// Update Min
  21. if(B[j]<=min) {
  22. min=B[j];
  23. k=j;
  24. }
  25. }
  26. B[k]=n-B[k]; /// Update trạng thái
  27. on-=2*min-n;
  28. }
  29. printf("%d\n",on);
  30. }
  31. return 0;
  32. }
Success #stdin #stdout 0s 4524KB
stdin
5
21
10 10
1 0 0 0 0 0 1 0 1 0 
1 0 0 0 1 0 0 0 1 0 
0 1 1 0 0 1 1 1 1 0 
1 0 0 1 1 1 1 0 1 0 
0 1 1 0 0 1 0 0 1 1 
1 1 0 0 0 0 1 1 1 0 
0 0 1 0 0 0 0 1 0 1 
1 1 0 1 1 0 0 0 1 1 
0 0 0 1 0 0 0 1 1 0 
0 0 1 0 0 1 0 0 1 0 
33
10 10
0 0 0 1 1 1 0 0 1 1 
0 0 0 0 1 0 1 1 0 0 
1 0 1 1 0 0 1 0 0 0 
0 1 1 1 1 0 0 1 0 0 
1 1 0 1 1 0 1 1 1 1 
1 1 1 1 0 1 0 1 1 1 
0 1 1 0 1 0 0 1 1 0 
1 1 1 0 1 0 0 0 1 1 
1 0 0 1 0 0 1 1 1 0 
1 0 1 1 1 0 0 0 0 1 
25
10 10
0 0 1 0 1 0 1 0 1 0 
0 1 1 0 0 1 0 1 0 1 
0 0 1 1 0 0 0 0 1 0 
0 1 1 1 0 1 0 1 1 1 
0 0 0 0 0 1 1 0 0 1 
0 1 1 1 1 0 1 1 0 0 
0 0 1 1 1 1 0 0 0 0 
0 1 0 0 1 0 1 0 1 0 
0 0 1 0 1 0 1 1 0 1 
0 0 1 0 1 1 1 1 0 0 
30
10 10
1 1 0 1 1 0 1 0 0 0 
1 1 1 1 1 1 0 1 1 1 
0 1 0 0 0 1 1 1 1 1 
1 1 1 1 0 1 0 0 0 0 
1 1 1 0 0 1 0 1 1 0 
1 1 0 0 0 0 0 0 1 0 
0 0 0 0 0 0 1 1 0 0 
0 0 1 0 0 1 1 1 0 1 
0 1 0 1 0 1 0 1 0 0 
0 1 1 0 0 0 1 0 0 1 
44
10 10
0 1 1 0 0 0 1 0 0 0 
1 0 1 1 0 0 0 0 1 1 
0 0 0 0 0 0 1 0 1 0 
1 1 0 1 0 1 1 0 1 0 
1 0 0 1 1 1 1 0 0 0 
1 1 0 1 1 0 1 1 0 1 
0 1 0 0 0 1 1 0 0 0 
1 0 0 1 0 1 1 1 0 1 
0 0 0 1 0 0 1 1 1 0 
1 0 0 0 1 0 1 0 0 0 
stdout
65
62
64
61
66