Codeforces Round #147 (Div. 2) B. Young Table

点击打开题目链接

B. Young Table

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You've got table a, consisting of n rows, numbered from 1 to n. The i-th line of table a contains ci cells, at that for all i (1 < i ≤ n)holds ci ≤ ci - 1.

Let's denote s as the total number of cells of table a, that is, . We know that each cell of the table contains a single integer from 1 to s, at that all written integers are distinct.

Let's assume that the cells of the i-th row of table a are numbered from 1 to ci, then let's denote the number written in the j-th cell of the i-th row as ai, j. Your task is to perform several swap operations to rearrange the numbers in the table so as to fulfill the following conditions:

1. for all i, j (1 < i ≤ n; 1 ≤ j ≤ ci) holds ai, j > ai - 1, j;
2. for all i, j (1 ≤ i ≤ n; 1 < j ≤ ci) holds ai, j > ai, j - 1.

In one swap operation you are allowed to choose two different cells of the table and swap the recorded there numbers, that is the number that was recorded in the first of the selected cells before the swap, is written in the second cell after it. Similarly, the number that was recorded in the second of the selected cells, is written in the first cell after the swap.

Rearrange the numbers in the required manner. Note that you are allowed to perform any number of operations, but not more than s. You do not have to minimize the number of operations.

Input

The first line contains a single integer n (1 ≤ n ≤ 50) that shows the number of rows in the table. The second line contains n space-separated integers ci (1 ≤ ci ≤ 50; ci ≤ ci - 1) — the numbers of cells on the corresponding rows.

Next n lines contain table а. The i-th of them contains ci space-separated integers: the j-th integer in this line represents ai, j.

It is guaranteed that all the given numbers ai, j are positive and do not exceed s. It is guaranteed that all ai, j are distinct.

Output

In the first line print a single integer m (0 ≤ m ≤ s), representing the number of performed swaps.

In the next m lines print the description of these swap operations. In the i-th line print four space-separated integers xi, yi, pi, qi (1 ≤ xi, pi ≤ n; 1 ≤ yi ≤ cxi; 1 ≤ qi ≤ cpi). The printed numbers denote swapping the contents of cells axi, yi and api, qi. Note that a swap operation can change the contents of distinct table cells. Print the swaps in the order, in which they should be executed.

Sample test(s)

input

3
3 2 1
4 3 5
6 1
2

output

2
1 1 2 2
2 1 3 1

input

1
4
4 3 2 1

output

2
1 1 1 4
1 2 1 3

题意：n代表有多少行数据，接下来一行有n个数据,c[i]代表每一行有多少数据，接下来输出每一行的数据，一共有个数据，且规定每个数据互不相等且都<=s

所以数据是从1到s，要求交换数据使得数组满足ai, j > ai - 1, j;且ai, j > ai, j - 1.只要数据是按从小到大的顺序排的

就可以，而且数据不大，没规定是最小步数，只要第i个上放数据i就可以啦。

代码：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define MAXN  1000005
using namespace std;
int n,a[55][55],c,i,j,k,m;
int b[5000],s[5000][4];
 int main()
 {
    cin>>n;
  for(i=0;i<n;i++)
    cin>>b[i];
  for(i=0;i<n;i++)
   {
       for(j=0;j<b[i];j++)
          cin>>a[i][j];
     c+=b[i];
   }
   int t=0,y=0,x=0;

  for(k=1;k<=c;k++)
   {
       if(a[x][y]!=k)
         for(i=0;i<n;i++)
          for(j=0;j<b[i];j++)
            if(a[i][j]==k)
             {
        s[t][0]=i+1;s[t][1]=j+1; s[t][2]=x+1;s[t++][3]=y+1;
        swap (a[x][y],a[i][j]);
             }
        y++;
      if(y==b[x])
       {
           x++;y=0;
       }

   }
cout<<t<<endl;
 for(i=0;i<t;i++)
  printf("%d %d %d %d\n",s[i][0],s[i][1],s[i][2],s[i][3]);
     return 0;
 }