CodeForces - 237B Young Table （模拟）_codeforces young table-CSDN博客

本文链接：https://blog.csdn.net/yanghui07216/article/details/51281042

Time Limit: 2000MS

Memory Limit: 262144KB

64bit IO Format: %I64d & %I64u

Description

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

Let's denote s as the total number of cells of table a, that is, $\text{[math]}$ . 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 c_i, then let's denote the number written in the j-th cell of the i-th row as a_i, j. Your task is to perform several swap operations to rearrange the numbers in the table so as to fulfill the following conditions:

for all i, j(1 < i ≤ n; 1 ≤ j ≤ c_i) holds a_i, j > a_{i - 1, j};
for all i, j(1 ≤ i ≤ n; 1 < j ≤ c_i) holds a_i, j > a_{i, 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 c_i(1 ≤ c_i ≤ 50; c_i ≤ c_i - 1) — the numbers of cells on the corresponding rows.

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

It is guaranteed that all the given numbers a_i, j are positive and do not exceed s. It is guaranteed that all a_i, 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 x_i, y_i, p_i, q_i(1 ≤ x_i, p_i ≤ n; 1 ≤ y_i ≤ c_{x_i}; 1 ≤ q_i ≤ c_{p_i}). The printed numbers denote swapping the contents of cells a_{x_i, y_i} and a_{p_i, q_i}. 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 Input

Input

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

Source

Codeforces Round #147 (Div. 2)

//题意：输入一个数n，接着下一行输入n个数b[i]，再接下来输入n行数，每行的数的个数为b[i]个。

表示给你n行数，每行数的个数为b[i]个，数的总个数为s现在让你将这s个数通过两两交换，使得每一行是单调递增的，每一列也是单调递增的，输出需要移动几次，并将每次移动的两个数的位置输出。

Hait：没让你找出最少交换次数，而是只要满足最后要求即可，（一开始惯性思维想着是输出最少次数就没敢写，下来一看题意，才发现是个水模拟，下次得注意，读题得仔细）。。。

//思路：

直接将他们从小到大排序，在将它们一行一行放入，在放入的是交换他们的值和位置坐标就行了。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#define N 3010
using namespace std;
int a[60][60];
int b[60];
struct zz
{
	int m;
	int x;
	int y;
}p[N];
bool cmp(zz a,zz b)
{
	return a.m<b.m;
}
struct ss
{
	int x1,y1,x2,y2;
}q[N];
int main()
{
	int n,i,j,k;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=1;i<=n;i++)
			scanf("%d",&b[i]);
		k=1;
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=b[i];j++)
			{
				scanf("%d",&a[i][j]);
				p[k].m=a[i][j];
				p[k].x=i;p[k++].y=j;
			}
		}
		sort(p+1,p+k,cmp);
		int kk=1,mm=0,t;
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=b[i];j++)
			{
				if(p[kk].m==a[i][j])
				{
					kk++;
					continue;
				}
				else
				{
					q[mm].x1=i;q[mm].y1=j;
					q[mm].x2=p[kk].x;q[mm].y2=p[kk].y;
					p[a[i][j]].x=p[kk].x;p[a[i][j]].y=p[kk].y;
					t=a[i][j];a[i][j]=a[p[kk].x][p[kk].y];a[p[kk].x][p[kk].y]=t;					
					kk++;mm++;
				}
			}
		}
		printf("%d\n",mm);
		for(i=0;i<mm;i++)
			printf("%d %d %d %d\n",q[i].x1,q[i].y1,q[i].x2,q[i].y2);
	}
	return 0;
}