UVA 10895 Matrix Transpose

按一定方式输入一个矩阵，转置后再按同样的要求输出。

那个方式为：先输入该行非零元素的个数，再依次输入每个的位置，下一行是每数个的值。

输出时也是这样，但要注意几点：1、两个数之间有空格，最后一个数后边没有空格·，而是换行。2、如果某一行都是0，则先输出0，再换行，再输出一行空行。

输入的时候把行号存为列号，把列号存为行号。结构体 + vector就行啦。

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<cmath>
#include<set>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", n)
///OTHER
#define pb push_back
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 100000000;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int N = 11111;
const int M = 22;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

struct node
{
    int num, p;
    node(){};
    node(int a, int b){num = a, p = b;};
};

int a[N];
vector<node> v[N];

int main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int n, m, k, b;
    while(RII(n, m) != EOF)
    {
        FFF(i, 1, m)v[i].clear();
        FFF(i, 1, n)
        {
            RI(k);
            REP(j, k)RI(a[j]);
            REP(j, k)
            {
                RI(b);
                v[a[j]].pb(node(b, i));
            }
        }
        printf("%d %d\n", m, n);
        FFF(i, 1, m)
        {
            k = v[i].size();
            printf("%d", k);
            REP(j, k)printf(" %d", v[i][j].p);puts("");
            REP(j, k)printf("%d%c", v[i][j].num, (j == k - 1) ? '\n' : ' ');
            if(!k)puts("");
        }
    }
    return 0;
}