Karen and Game
time limit per test 2.5 second memory limit per test 256 megabytes
On the way to school, Karen became fixated on the puzzle game on her phone!
The game is played as follows. In each level, you have a grid with n rows and m columns. Each cell originally contains the number 0.

One move consists of choosing one row or column, and adding 1 to all of the cells in that row or column.

To win the level, after all the moves, the number in the cell at the i-th row and j-th column should be equal to gi,j.

Karen is stuck on one level, and wants to know a way to beat this level using the minimum number of moves. Please, help her with this task!

传送门:CF815A

Input

The first line of input contains two integers, n and m (1≤n,m≤100), the number of rows and the number of columns in the grid, respectively. The next n lines each contain m integers. In particular, the j-th integer in the i-th of these rows contains gi,j (0≤gi,j≤500).

Output

If there is an error and it is actually not possible to beat the level, output a single integer -1. Otherwise, on the first line, output a single integer k, the minimum number of moves necessary to beat the level. The next k lines should each contain one of the following, describing the moves in the order they must be done: row x, (1≤x≤n) describing a move of the form "choose the x-th row". col x, (1≤x≤m) describing a move of the form "choose the x-th column". If there are multiple optimal solutions, output any one of them.

Sample Input

1
2
3
4
3 5
2 2 2 3 2
0 0 0 1 0
1 1 1 2 1

Sample Output

1
2
3
4
5
4
row 1
row 1
col 4
row 3

题解

比赛最后才想到当n>m时会出问题...哎 就是行比较多的时候先删列 列比较多的时候先删行 这样每次都是删最多的 暴力就行了= =
## AC code:(不包含输入类)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
import java.io.*;  
import java.util.*;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
while (sc.hasNext()) {
int n=sc.nextInt();
int m=sc.nextInt();
int[][]maze=new int[n][m];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
maze[i][j]=sc.nextInt();
}
}
boolean row=true;
if(n>m)row=false;
boolean flag=true;
ArrayList<String>list=new ArrayList<String>();
while(true){
int max=0;
int a=-1;
int b=-1;
boolean c=false;
for(int i=0;i<n;i++){
int num1=0;
for(int j=0;j<m;j++){
if(maze[i][j]>=1){
num1++;
c=true;
}
}
if(num1==m){
a=i;
break;
}
}
for(int i=0;i<m;i++){
int num1=0;
for(int j=0;j<n;j++){
if(maze[j][i]>=1){
num1++;
}
}
if(num1==n){
b=i;
break;
}
}
//pw.println(a+" "+b);
if(a==-1&&b==-1){
if(!c){
break;
}
else{
flag=false;
break;
}
}
if(row){
if(a>=0){
list.add("row "+(a+1));
for(int i=0;i<m;i++){
maze[a][i]--;
}
}else{
list.add("col "+(b+1));
for(int i=0;i<n;i++){
maze[i][b]--;
}
}
}else{
if(b>=0){
list.add("col "+(b+1));
for(int i=0;i<n;i++){
maze[i][b]--;
}
}else{
list.add("row "+(a+1));
for(int i=0;i<m;i++){
maze[a][i]--;
}
}
}
}
if(!flag)pw.println(-1);
else{
pw.println(list.size());
for(int i=0;i<list.size();i++){
pw.println(list.get(i));
}
}
pw.flush();
}
}
}