标签:
Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 502 Accepted Submission(s):
215
#include <iostream> #include <string.h> using namespace std; int h[1010],l[1010], zh[1010], zl[1010]; int a[1010][1010]; int main() { int T, n, m, q, i, j, c, x, y, t; cin>>T; while(T--) { memset(zh,0,sizeof(zh)); memset(zl,0,sizeof(zl)); for(i=1;i<=1005;i++) h[i]=l[i]=i; scanf("%d%d%d", &n, &m, &q); for(i=1;i<=n;i++) for(j=1;j<=m;j++) scanf("%d", &a[i][j]); while(q--) { scanf("%d%d%d", &c, &x, &y); if(c==1) {t=h[x];h[x]=h[y];h[y]=t;} else if(c==2) {t=l[x];l[x]=l[y];l[y]=t;} else if(c==3) zh[h[x]] += y; else if(c==4) zl[l[x]] += y; } for(i=1;i<=n;i++) { for(j=1;j<=m;j++) if(j==1) printf("%d", a[h[i]][l[j]]+zh[h[i]]+zl[l[j]]); else printf(" %d", a[h[i]][l[j]]+zh[h[i]]+zl[l[j]]); printf("\n"); } } return 0; }
标签:
原文地址:http://www.cnblogs.com/Noevon/p/5426009.html