fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. ll n,m,q,type[10009],r[10009],c[10009],x[10009],nr,nc,i,j;
  5. ll row[1000],col[1000],ans[1000][1000];
  6. int main()
  7. {
  8. cin>>n>>m>>q;
  9. for(i=1;i<=q;i++)
  10. {
  11. cin>>type[i];
  12. if(type[i]==1)
  13. {
  14. cin>>r[i];
  15. }
  16. else if(type[i]==2)
  17. {
  18. cin>>c[i];
  19. }
  20. else
  21. {
  22. cin>>r[i]>>c[i]>>x[i];
  23. nr=r[i];
  24. nc=c[i];
  25. for(j=i-1;j>=1;j--)
  26. {
  27. if(type[j]==3)
  28. continue;
  29. if(type[j]==1&&r[j]==nr)
  30. {
  31. ll z=1;
  32. if(nc+z<=m)
  33. {
  34. nc++;
  35. }
  36. else
  37. {
  38. nc=1;
  39. }
  40. }
  41. else if(type[j]==2&&c[j]==nc)
  42. {
  43. ll z=1;
  44. if(nr+z<=n)
  45. {
  46. nr++;
  47. }
  48. else
  49. {
  50. nr=1;
  51. }
  52. }
  53. }
  54. ans[nr][nc]=x[i];
  55. }
  56. }
  57. for(i=1;i<=n;i++)
  58. {
  59. for(j=1;j<=m;j++)
  60. {
  61. cout<<ans[i][j]<<" ";
  62. }
  63. cout<<"\n";
  64. }
  65. return 0;
  66. }
Success #stdin #stdout 0s 10872KB
stdin
3 3 7
1 2
2 1
3 1 1 2
2 3
3 2 3 4
1 1
3 1 1 9
stdout
0 9 0 
0 2 0 
0 0 4