例题4-5 UVa512 Spreadsheet Tracking

来源：互联网发布：卡卡网络验证 9.5 编辑：程序博客网时间：2024/06/06 08:50

方法一：先将表格进行所有的操作，在根据坐标输出
要点：
1.利用三个函数，几乎涵盖了前面所学所有内容

#include<stdio.h>#include<string.h>#define maxn 100#define big 10000int r, c, n, d[maxn][maxn], d2[maxn][maxn], ans[maxn][maxn], cols[maxn];//d2作为表格变化中原表格的存储，通过ans得知行列如何变换，cols作为要改变的行列的存储void copy(char type, int p,int q)  //复制函数，del和ins函数中都要用到{    if (type == 'R')    {        for (int i = 1; i <= c; i++)            d[p][i] = d2[q][i];  //一列一列的复制一整个行    }    else    {        for (int i = 1; i <= r; i++)            d[i][p] = d2[i][q];  //一行一行复制一整个列    }}void del(char type){    memcpy(d2, d, sizeof(d));  //新函数memcpy    int cnt = type == 'R' ? r : c, cnt2 = 0;  //判断删除行还是列    for (int i = 1; i <= cnt; i++)    {        if (!cols[i])  //要删除的行跳过            copy(type, ++cnt2, i);  //从第一行开始复制，但不复制跳过的行    }    if (type == 'R') //改变得到新的行列数        r = cnt2;    else        c = cnt2;}void ins(char type){    memcpy(d2, d, sizeof(d));    int cnt = type == 'R' ? r : c, cnt2 = 0;    for (int i = 1; i <= cnt; i++)    {        if (cols[i])            copy(type, ++cnt2, 0);   //要插入的行列都复制为第一行和第一列，同时cnt2也增加        copy(type, ++cnt2, i);    //一直在复制    }    if (type == 'R')         r = cnt2;    else        c = cnt2;}int main(){    int r1, c1, r2, c2, q, count = 0;    char cmd[10];  //操作行    memset(d, 0, sizeof(d));    while (scanf("%d%d", &r, &c) == 2 && r) //输入0 0跳出程序    {        scanf("%d", &n);        for (int i = 1; i <= r; i++)   //注意这里i，j都是从1开始的，这样方便理解            for (int j = 1; j <= c; j++)                d[i][j] = i * big + j;        while (n--)        {            scanf("%s", cmd);            if (cmd[0] == 'E')   //第一个字符等于E，则要交换单元格            {                scanf("%d%d%d%d", &r1, &c1, &r2, &c2);                int t = d[r1][c1];                d[r1][c1] = d[r2][c2];                d[r2][c2] = t;            }            else            {                int a, x;  //a为要变换的行列的个数                scanf("%d", &a);                memset(cols, 0, sizeof(cols));                for (int i = 0; i < a; i++)                {                    scanf("%d", &x);                    cols[x] = 1;  //将要变换的行与列的位置标记                }                if (cmd[0] == 'D')                    del(cmd[1]);                else                    ins(cmd[1]);            }        }        memset(ans, 0, sizeof(ans));        for (int i = 1; i <= r; i++)            for (int j = 1; j <= c; j++)            {                ans[d[i][j] / big][d[i][j] % big] = i*big + j;                //      原来的行列数               现在的行列数            }        if (count > 0)            printf("\n");  //不同的output中间隔一行，第一个不空        printf("Spreadsheet #%d\n", ++count);        scanf("%d", &q);        while (q--)        {            scanf("%d%d", &r1, &c1);            printf("Cell data in (%d,%d) ", r1, c1);            if (ans[r1][c1] == 0)                printf("GONE\n");            else                printf("moved to (%d,%d)\n", ans[r1][c1] / big, ans[r1][c1] % big);        }    }    return 0;}

方法二：将所有操作保存，只寻找每个查询的单元格的变化，此方法好写且效率更高

#include<stdio.h>#include<string.h>#define maxn 10000struct command  //将所有的输入都集合到一个变量中{    char c[5];  //作为DR等开头的存储    int r1, c1, r2, c2;    int a, x[20];  //a作为DR后输入多少数，x则作为相关的行列数} cmd[maxn];int r, c, n;int simulate(int *r0, int *c0){    for (int i = 0; i < n; i++)    {        if (cmd[i].c[0] == 'E')        {            //恰好满足EX中的坐标            if (cmd[i].r1 == *r0&&cmd[i].c1 == *c0)            {                *r0 = cmd[i].r2;                *c0 = cmd[i].c2;            }            else if(cmd[i].r2 == *r0&&cmd[i].c2 == *c0)            {                *r0 = cmd[i].r1;                *c0 = cmd[i].c1;            }        }        else        {            int dr = 0, dc = 0; //存储操作后行列的变化量            for (int j = 0; j < cmd[i].a; j++)            {                int x = cmd[i].x[j];                if (cmd[i].c[0] == 'I')                {                    if (cmd[i].c[1] =='R'&&x <= *r0)                        dr++;                    if (cmd[i].c[1] =='C'&&x <= *c0)                        dc++;                }     //若在前面插入，则行或列加一                else                {                    if (cmd[i].c[1] == 'R'&&x == *r0)                        return 0;                    if (cmd[i].c[1] == 'C'&&x == *c0)                        return 0;                    if (cmd[i].c[1] == 'R'&&x < *r0)                        dr--;                    if (cmd[i].c[1] == 'C'&&x < *c0)                        dc--;                }            }            *r0 += dr; *c0 += dc;        }    }    return 1;}int main(){    int r0, c0, q, kase = 0;    while (scanf("%d%d", &r, &c) == 2 && r)    {        scanf("%d", &n);        for (int i = 0; i < n; i++)        {            scanf("%s", cmd[i].c);            if (cmd[i].c[0] == 'E')            {                scanf("%d%d%d%d", &cmd[i].r1, &cmd[i].c1, &cmd[i].r2, &cmd[i].c2);            }            else            {                scanf("%d", &cmd[i].a);                for (int j = 0; j < cmd[i].a; j++)                    scanf("%d", &cmd[i].x[j]);            }        }        if (kase > 0)            printf("\n");        printf("Spreadsheet #%d\n",++kase);        scanf("%d", &q);        while (q--)        {            scanf("%d%d", &r0, &c0);            printf("Cell data in (%d,%d) ", r0, c0);            if (!simulate(&r0, &c0))                printf("GONE\n");            else                printf("moved to (%d,%d)\n", r0, c0);        }    }    return 0;}

0 0