Find number of transformation to make two Matrix Equal
Last Updated :
28 Dec, 2024
Given two matrices a and b of size n*m. The task is to find the required number of transformation steps so that both matrices become equal. Print -1 if this is not possible.
The transformation step is as follows:
- Select any one matrix out of two matrices.
- Choose either row/column of the selected matrix.
- Increment every element of the select row/column by 1.
Examples:
Input:
a[][] = [[1, 1],
[1, 1]]
b[][] = [[1, 2],
[3, 4]]
Output: 3
Explanation:
[[1, 1], -> [[1, 2], -> [[1, 2], -> [[1, 2],
[1, 1]] [1, 2]] [2, 3]] [3, 4]]
Input:
a[][] = [[1, 1],
[1, 0]]
b[][] = [[1, 2],
[3, 4]]
Output : -1
Explanation: No transformation will make a and b equal.
Approach:
The idea is that incrementing any row/column in matrix a is equivalent to decrementing the same row/column in matrix b.
This means that instead of tracking both matrices, we can work with their difference (a[i][j] - b[i][j]). When we increment a row in 'a', all elements in that row increase by 1, which is the same as all elements in that row of the difference matrix increasing by 1. Similarly, when we increment a column in 'a', it's equivalent to increasing all elements in that column of the difference matrix by 1.
This allows us to transform the problem into working with just one matrix.
Determine if any solution exists or not:
After creating the difference matrix, for each cell a[i][j] (excluding the first row and first column), we check if
a[i][j] - a[i][0] - a[0][j] + a[0][0] = 0.
If this equation doesn't hold for any cell, we can immediately conclude that no solution exists.
Why does this work?
Think about how row and column operations affect each cell: when we perform x operations on row i and y operations on column j, a[i][j] changes by (x + y), a[i][0] changes by x (row operations only), a[0][j] changes by y (column operations only), and a[0][0] is affected by neither row i nor column j operations. Therefore, (x + y) - x - y + 0 = 0 must hold for any valid solution. If this equation doesn't hold for any cell, it means no sequence of row and column operations can transform one matrix into another.
Calculate number of transformations required:
To calculate number of transformations required, we only need to look at the first row and first column because:
- We first sum up |a[i][0]| for all i (each first column element) because this represents how many row operations we need. For each row i, we need |a[i][0]| operations to make that row element zero.
- Then we sum up |a[0][j] - a[0][0]| for all j (each first row element minus first element) because this represents additional column operations needed. We subtract a[0][0] to avoid counting it twice since row operations have already affected this element.
- The sum of these two gives us the minimum number of operations needed, as row operations handle the first column differences, and column operations handle the remaining differences in the first row.
C++
// C++ program to find number of transformation
// to make two Matrix Equal
#include <bits/stdc++.h>
using namespace std;
int countOperations(vector<vector<int>> &a, vector<vector<int>> &b) {
int n = a.size();
int m = a[0].size();
// Create difference matrix (a = a - b)
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
a[i][j] -= b[i][j];
}
}
// Check if transformation is possible using the property
// a[i][j] - a[i][0] - a[0][j] + a[0][0] should be 0
for (int i = 1; i < n; i++) {
for (int j = 1; j < m; j++) {
if (a[i][j] - a[i][0] - a[0][j] + a[0][0] != 0) {
return -1;
}
}
}
int result = 0;
// Add operations needed for first column
for (int i = 0; i < n; i++) {
result += abs(a[i][0]);
}
// Add operations needed for
// first row (excluding a[0][0])
for (int j = 0; j < m; j++) {
result += abs(a[0][j] - a[0][0]);
}
return result;
}
int main() {
vector<vector<int>> a = {{1, 1}, {1, 1}};
vector<vector<int>> b = {{1, 2}, {3, 4}};
cout << countOperations(a, b);
return 0;
}
// Java program to find number of transformation
// to make two Matrix Equal
import java.util.*;
class GfG {
static int countOperations(int[][] a, int[][] b) {
int n = a.length;
int m = a[0].length;
// Create difference matrix (a = a - b)
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
a[i][j] -= b[i][j];
}
}
// Check if transformation is possible using the
// property a[i][j] - a[i][0] - a[0][j] + a[0][0]
// should be 0
for (int i = 1; i < n; i++) {
for (int j = 1; j < m; j++) {
if (a[i][j] - a[i][0] - a[0][j] + a[0][0]
!= 0) {
return -1;
}
}
}
int result = 0;
// Add operations needed for first column
for (int i = 0; i < n; i++) {
result += Math.abs(a[i][0]);
}
// Add operations needed for
// first row (excluding a[0][0])
for (int j = 0; j < m; j++) {
result += Math.abs(a[0][j] - a[0][0]);
}
return result;
}
public static void main(String[] args) {
int[][] a = { { 1, 1 }, { 1, 1 } };
int[][] b = { { 1, 2 }, { 3, 4 } };
System.out.println(countOperations(a, b));
}
}
# Python program to find number of transformation
# to make two Matrix Equal
def countOperations(a, b):
n = len(a)
m = len(a[0])
# Create difference matrix (a = a - b)
for i in range(n):
for j in range(m):
a[i][j] -= b[i][j]
# Check if transformation is possible using the property
# a[i][j] - a[i][0] - a[0][j] + a[0][0] should be 0
for i in range(1, n):
for j in range(1, m):
if a[i][j] - a[i][0] - a[0][j] + a[0][0] != 0:
return -1
result = 0
# Add operations needed for first column
for i in range(n):
result += abs(a[i][0])
# Add operations needed for
# first row (excluding a[0][0])
for j in range(m):
result += abs(a[0][j] - a[0][0])
return result
if __name__ == "__main__":
a = [
[1, 1],
[1, 1]
]
b = [
[1, 2],
[3, 4]
]
print(countOperations(a, b))
// C# program to find number of transformation
// to make two Matrix Equal
using System;
class GfG {
static int countOperations(int[, ] a, int[, ] b) {
int n = a.GetLength(0);
int m = a.GetLength(1);
// Create difference matrix (a = a - b)
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
a[i, j] -= b[i, j];
}
}
// Check if transformation is possible using the
// property a[i, j] - a[i, 0] - a[0, j] + a[0, 0]
// should be 0
for (int i = 1; i < n; i++) {
for (int j = 1; j < m; j++) {
if (a[i, j] - a[i, 0] - a[0, j] + a[0, 0]
!= 0) {
return -1;
}
}
}
int result = 0;
// Add operations needed for first column
for (int i = 0; i < n; i++) {
result += Math.Abs(a[i, 0]);
}
// Add operations needed for
// first row (excluding a[0, 0])
for (int j = 0; j < m; j++) {
result += Math.Abs(a[0, j] - a[0, 0]);
}
return result;
}
static void Main(string[] args) {
int[, ] a = { { 1, 1 }, { 1, 1 } };
int[, ] b = { { 1, 2 }, { 3, 4 } };
Console.WriteLine(countOperations(a, b));
}
}
// JavaScript program to find number of transformation
// to make two Matrix Equal
function countOperations(a, b) {
let n = a.length;
let m = a[0].length;
// Create difference matrix (a = a - b)
for (let i = 0; i < n; i++) {
for (let j = 0; j < m; j++) {
a[i][j] -= b[i][j];
}
}
// Check if transformation is possible using the
// property a[i][j] - a[i][0] - a[0][j] + a[0][0] should
// be 0
for (let i = 1; i < n; i++) {
for (let j = 1; j < m; j++) {
if (a[i][j] - a[i][0] - a[0][j] + a[0][0]
!== 0) {
return -1;
}
}
}
let result = 0;
// Add operations needed for first column
for (let i = 0; i < n; i++) {
result += Math.abs(a[i][0]);
}
// Add operations needed for
// first row (excluding a[0][0])
for (let j = 0; j < m; j++) {
result += Math.abs(a[0][j] - a[0][0]);
}
return result;
}
//Driver code
let a = [ [ 1, 1 ], [ 1, 1 ] ];
let b = [ [ 1, 2 ], [ 3, 4 ] ];
console.log(countOperations(a, b));
Time Complexity: O(n*m)
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem