Member Avatar for ishandoshi
ishandoshi 0 Newbie Poster

Hii,
The problem statement i am referring to is:

Buttons

Each cell of an N x N grid is either a 0 or a 1. You are given two such N x N grids, the initial grid and the final grid. There is a button against each row and each column of the initial N x N grid. Pressing a row-button toggles the values of all the cells in that row, and pressing a column-button toggles the values of all the cells in that column. You are required to find the minimum number of button presses required to transform the grid from the initial configuration to the final configuration, and the buttons that must be pressed in order to make this transformation.
Edit: When the initial and the final configurations are the same, print "0".
Input
The first line contains t, the number of test cases (about 10). Then t test cases follow.

Each test case has the following form:
* The first line contains n, the size of the board (1 ≤ n ≤ 1000).
* n lines follow. The ith line contains n space separated integers representing the ith row of the initial grid. Each integer is either a 0 or a 1.
* n lines follow, representing the final grid, in the same format as above.
Output
For each test case, output the number of row-button presses, followed by the row buttons that must be pressed. Print the number of column-button presses next, followed by 0-indexed indices of the column buttons that must be pressed. The total number of button presses must be minimized.
Output "-1" if it is impossible to achieve the final configuration from the initial configuration. If there is more than one solution, print any one of them.

Example

Input:
1
3
0 0 0
1 1 0
1 1 0
1 1 0
1 1 1
1 1 1

Output:
1
0
1
2

I have attached the code file for it with this post.Though i am able to run it successfully on my machine,it displays a Wrong Answer message at codechef where i need to give this.

Can anyone help me out as to where i am going wrong or something??

#include<iostream>
#include<stdio.h>
int main()
 {
	int i,j,k, noofrows,nooftestcases;
	static int resultcontainer[50000],counter = 0;
	static int matrixa[1000][1000];
	static int matrixb[1000][1000];
	static int matrixc[1000][1000], matrixrow1[1000][1000], matrixrow0[1000][1000];
	scanf("%d",&nooftestcases);
 for(k=0;k<nooftestcases;k++)
 {
	int notpossible = 0;	
	int row_switched11 = 0, row_switched10 = 0, row_switched01 = 0, row_switched00 = 0, row_switched0 = 0, row_switched1 = 0;
	int coloumn_switched1 = 0, coloumn_switched0 = 0;
	int coloumn_switched_pos0[1000], row_switched_pos0[1000], coloumn_switched_pos1[1000], row_switched_pos1[1000];
	scanf("%d", &noofrows);
		for(i=0; i< noofrows; i++){
		for(j=0; j< noofrows; j++){
			scanf("%d", &matrixa[i][j]);
		}
	}
	
	for(i=0; i< noofrows; i++){
		for(j=0; j< noofrows; j++){
		       scanf("%d", &matrixb[i][j]);
		}
	}
	
	for(i=0; i< noofrows; i++) {
		for(j=0;j<noofrows;j++) {
			if(matrixa[i][j] == matrixb[i][j]) {
				matrixc[i][j] = 0;
			}
			else {
				matrixc[i][j] = 1;
			}
		}
	}
	row_switched1= 0;
	coloumn_switched1= 0;
	for(i = 0 ; i< noofrows; i++){
		for(j = 0; j< noofrows; j++) {
			matrixrow1[i][j] = matrixc[i][j];
			matrixrow0[i][j] = matrixc[i][j];
		}
	}
	
	
	for(i =0; i< noofrows; i++) {

		if(matrixc[0][i] != 1) {
			
			coloumn_switched_pos1[coloumn_switched1] = i;
			coloumn_switched1++;
			for(j= 0; j< noofrows; j++) {
				if(matrixc[j][i] == 1)
					matrixrow1[j][i] = 0;
				else
					matrixrow1[j][i] = 1;
			}
		}
	}
	for(i = 1; i< noofrows; i++) {

		for(j = 1; j <noofrows ; j++){
			if(matrixrow1[i][j-1] != matrixrow1[i][j]){
			 	notpossible = 1;
				break;
			}
		}
	}
	for(i = 0 ;i< noofrows; i++) {
		if(matrixrow1[i][0] == 0)
			row_switched11++;
	}
	for(i = 0 ;i< noofrows; i++) {
		if(matrixrow1[i][0] == 1){
			row_switched_pos1[row_switched10] = i;
			row_switched10++;
			
		}
	}
		row_switched1 = row_switched10;

	

	for(i =0; i< noofrows; i++) {

		if(matrixc[0][i] != 0) {
			coloumn_switched_pos0[coloumn_switched0] = i;
			coloumn_switched0++;
			for(j= 0; j< noofrows; j++) {
				if(matrixc[j][i] == 0)
					matrixrow0[j][i] = 1;
				else
					matrixrow0[j][i] = 0;
			}
		}
	}
	for(i = 1; i< noofrows; i++) {

		for(j = 1; j <noofrows ; j++){
			if(matrixrow0[i][j-1] != matrixrow0[i][j]){
				notpossible = 1;
				break;
			}
		}
	}
	for(i = 0 ;i< noofrows; i++) {
		if(matrixrow0[i][0] == 1 ) {
			row_switched_pos0[row_switched00] = i;
			row_switched00++;
		}
	}
	

		 row_switched0 = row_switched00;

	if(notpossible == 0) {
		if((row_switched1 + coloumn_switched1) < (row_switched0+ coloumn_switched0)) {
			resultcontainer[counter] = row_switched1;

			counter++;
			for(i = 0; i< row_switched1; i++){
				resultcontainer[counter] = row_switched_pos1[i];
				counter++;
			}
			resultcontainer[counter] = coloumn_switched1;
			counter++;
			for(i = 0; i<coloumn_switched1; i++){
				resultcontainer[counter]= coloumn_switched_pos1[i];
				counter++;
        	        }
		}
		else{
			resultcontainer[counter] = row_switched0;

                        counter++;
                        for(i = 0; i< row_switched0; i++){
                                resultcontainer[counter] = row_switched_pos0[i];
                                counter++;
                        }
                        resultcontainer[counter] = coloumn_switched0;
                        counter++;
                        for(i = 0; i<coloumn_switched0; i++){
                                resultcontainer[counter]= coloumn_switched_pos0[i];
                                counter++;
                        }		
		}
	}
	else {
		resultcontainer[counter] = -1;
		counter++;
	}
}
for(i = 0; i < counter; i++){
	printf("%d\n", resultcontainer[i]);
}
}
  • 1 Contributor
  • 0 Replies
  • 85 Views
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.