Row and Column Operations
All submissions for this problem are available.
You are given an N × N grid initially filled by zeros. Let the rows and columns of the grid be numbered from 1 to N, inclusive. There are two types of operations can be applied to the grid:
- RowAdd R X: all numbers in the row R should be increased by X.
- ColAdd C X: all numbers in the column C should be increased by X.
Now after performing the sequence of such operations you need to find the maximum element in the grid.
The first line of the input contains two space separated integers N and Q denoting the size of the grid and the number of performed operations respectively. Each of the following Q lines describe an operation in the format described above.
Output a single line containing the maximum number at the grid after performing all the operations.
- 1 ≤ N ≤ 314159
- 1 ≤ Q ≤ 314159
- 1 ≤ X ≤ 3141
- 1 ≤ R, C ≤ N
Input: 2 4 RowAdd 1 3 ColAdd 2 1 ColAdd 1 4 RowAdd 2 1 Output: 7
The grid changes as follows:
00 33 34 74 74 00 00 01 41 52
The maximum number in the final grid is 7.
|Tags||anton_lunyov, cook31, simple, simple-math|
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA|
Fetching successful submissions
If you are still having problems, see a sample solution here.