orzorzorz
by newbie314159 @ 2018-01-21 15:24:18
@[i7\_8700k](/space/show?uid=54979) 虚伪
by iodwad @ 2018-01-21 15:32:26
BZOJ都是0ms 0kb。。。感觉不是复杂度和常数的问题啊
by iodwad @ 2018-01-21 15:33:17
@[ZCDHJ](/space/show?uid=24878) 应该是玄学问题,你看我的代码写辣么丑在bzoj也A了
by Ameyax @ 2018-01-21 15:51:18
@[Fire\_Storm](/space/show?uid=37070) 我也觉得很玄学啊。。。
by iodwad @ 2018-01-21 15:58:36
bzoj题号
by Hades18 @ 2018-01-21 16:14:07
@[尘染梦](/space/show?uid=27029) 1452
by iodwad @ 2018-01-21 16:26:36
@[ZCDHJ](/space/show?uid=24878) 我对着你的code打了一遍,然后就过了(bzoj)。。。(捂脸)
```cpp
#include<cstdio>
using namespace std;
inline int read(){
int x=0,f=0;register char ch=getchar();
for(;ch<48||ch>57;ch=getchar())f|=ch=='-';
for(;ch>47&&ch<58;ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
return f?~x+1:x;
}
int n,m,a[305][305][105],b[305][305];
inline void U(int x,int y,int w,int val)
{
for(int i=x;i<=n;i+=i&-i)
for(int j=y;j<=m;j+=j&-j)
a[i][j][w]+=val;
}
inline int Q(int x,int y,int w)
{
int res=0;
for(int i=x;i;i-=i&-i)
for(int j=y;j;j-=j&-j)
res+=a[i][j][w];
return res;
}
inline void U(int w)
{
for(int i=1;i<=n;puts(""),++i)
for(int j=1;j<=m;++j)
printf("%d ",a[i][j][w]);
}
int main()
{
n=read(),m=read();
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
U(i,j,b[i][j]=read(),1);
int q=read();
for(int cas=1;cas<=q;++cas)
{
int k=read();
if(k==1)
{
int x=read(),y=read();
U(x,y,b[x][y],-1);
b[x][y]=read();
U(x,y,b[x][y],+1);
}else
{
int x1=read(),x2=read(),y1=read(),y2=read(),w=read();
printf("%d\n",Q(x2,y2,w)-Q(x1-1,y2,w)-Q(x2,y1-1,w)+Q(x1-1,y1-1,w));
}
}
return 0;
}
```
by Hades18 @ 2018-01-21 16:28:44
@[尘染梦](/space/show?uid=27029) 那我的是怎么回事呢。。。
by iodwad @ 2018-01-21 16:29:46
@[ZCDHJ](/space/show?uid=24878) 貌似我在luogu上还没您跑的快。。。
by Hades18 @ 2018-01-21 16:31:00