{"id":168,"date":"2010-03-20T13:16:00","date_gmt":"2010-03-20T05:16:00","guid":{"rendered":"http:\/\/localhost\/?p=168"},"modified":"2010-03-20T13:16:00","modified_gmt":"2010-03-20T05:16:00","slug":"jsoi2009count","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/wjmzbmr\/?p=168","title":{"rendered":"[JSOI2009]Count"},"content":{"rendered":"\n

[JSOI2009]Count<\/p>\n

Time Limit:10000MS  Memory Limit:65536K
Total Submit:16 Accepted:15
Case Time Limit:1000MS<\/p>\n

Description <\/strong><\/p>\n

<\/p>\n

Input <\/strong><\/p>\n

<\/p>\n

Output <\/strong><\/p>\n

<\/p>\n

Sample Input <\/strong><\/p>\n

<\/p>\n

Sample Output <\/strong><\/p>\n

1
2<\/p>\n

Hint <\/strong><\/p>\n

<\/p>\n

Source <\/strong><\/p>\n

JSOI2009Day1
61.187.179.132:8080\/JudgeOnline\/showproblem
<\/a><\/p>\n

\u6211\u5df2\u7ecf\u83dc\u5230\u53ea\u4f1a\u505a\u6c34\u9898\u4e86\u3002\u3002\u53c8\u770b\u4e86\u4e24\u9053\u9898\u3002\u3002\u90fd\u4e0d\u4f1a\u56e7\u3002\u3002\u53ea\u597d\u628a\u9898\u76ee\u6309\u901a\u8fc7\u4eba\u6570\u6392\u5e8f\u4e86\u4e00\u4e0b\u56e7\u3002\u3002
\u8fd9\u9053\u9898\u4e0d\u77e5\u9053\u6709\u6ca1\u6709\u4ec0\u4e48\u66f4\u597d\u7684\u529e\u6cd5\u3002\u6211\u4e0d\u7ba1\u4e09\u4e03\u4e8c\u5341\u4e00\u76f4\u63a5\u4e0a\u4e8c\u7ef4\u6811\u72b6\u6570\u7ec4\u4e86\u3002\u4e8c\u7ef4\u6811\u72b6\u6570\u7ec4\u672c\u8d28\u4e0a\u8ddf\u4e00\u7ef4\u7684\u4e5f\u5dee\u4e0d\u591a\u3002\u3002\u5c31\u662f\u5bf9\u6bcf\u4e2a\u989c\u8272\u90fd\u7ef4\u62a4\u4e00\u4e2a\u6811\u72b6\u6570\u7ec4\uff0c\u7136\u540e\u5176\u4ed6\u5c31\u597d\u8bf4\u4e86\u3002\u3002
Code\uff1a<\/p>\n

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
using namespace std;
const int inf=~0U>>1,maxn=301,maxc=100;
int n,m;
struct Board
{
int C[maxn][maxn];
Board(){memset(C,0,sizeof(C));}
void change(int i,int j,int d)
{
for(int x=i;x<=n;x+=x&-x)
for(int y=j;y<=n;y+=y&-y)
C[x][y]+=d;
}
int sum(int i,int j)
{
int Ans=0;
for(int x=i;x>0;x-=x&-x)
for(int y=j;y>0;y-=y&-y)
Ans+=C[x][y];
return Ans;
}
int sum(int x0,int y0,int x1,int y1)
{
return sum(x1,y1)-sum(x1,y0-1)-sum(x0-1,y1)+sum(x0-1,y0-1);
}
}C[maxc];
int M[maxn][maxn];
void Change(int x,int y,int c)
{
int o=M[x][y];
C[o].change(x,y,-1);
C.change(x,y,1);
M[x][y]=c;
}
int main()
{
\/\/freopen("in","r",stdin);
cin>>n>>m;int c;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
scanf("%d",&c);–c;
C.change(i,j,1);
M[i][j]=c;
}
int p,t,x,y,x0,y0,x1,y1;cin>>p;
while(p–)
{
scanf("%d",&t);
if(t==1)
scanf("%d %d %d",&x,&y,&c),Change(x,y,c-1);
else
scanf("%d %d %d %d %d",&x0,&x1,&y0,&y1,&c),printf("%dn",C[c-1].sum(x0,y0,x1,y1));
}
}<\/p>\n","protected":false},"excerpt":{"rendered":"

[JSOI2009]Count Time Limit:10000MS  Memory Limit:65536KTotal Submit:16 Accepted:15 Case Time Limit:1000MS Description Input Output Sample Input Sample Output 12 Hint Source JSOI2009Day161.187.179.132:8080\/JudgeOnline\/showproblem \u6211\u5df2\u7ecf\u83dc\u5230\u53ea\u4f1a\u505a\u6c34\u9898\u4e86\u3002\u3002\u53c8\u770b\u4e86\u4e24\u9053\u9898\u3002\u3002\u90fd\u4e0d\u4f1a\u56e7\u3002\u3002\u53ea\u597d\u628a\u9898\u76ee\u6309\u901a\u8fc7\u4eba\u6570\u6392\u5e8f\u4e86\u4e00\u4e0b\u56e7\u3002\u3002\u8fd9\u9053\u9898\u4e0d\u77e5\u9053\u6709\u6ca1\u6709\u4ec0\u4e48\u66f4\u597d\u7684\u529e\u6cd5\u3002\u6211\u4e0d\u7ba1\u4e09\u4e03\u4e8c\u5341\u4e00\u76f4\u63a5\u4e0a\u4e8c\u7ef4\u6811\u72b6\u6570\u7ec4\u4e86\u3002\u4e8c\u7ef4\u6811\u72b6\u6570\u7ec4\u672c\u8d28\u4e0a\u8ddf\u4e00\u7ef4\u7684\u4e5f\u5dee\u4e0d\u591a\u3002\u3002\u5c31\u662f\u5bf9\u6bcf\u4e2a\u989c\u8272\u90fd\u7ef4\u62a4\u4e00\u4e2a\u6811\u72b6\u6570\u7ec4\uff0c\u7136\u540e\u5176\u4ed6\u5c31\u597d\u8bf4\u4e86\u3002\u3002Code\uff1a #include<cstdio>#include<iostream>#include<algorithm>#include<string>#include<vector>#include<cstring>#define rep(i,n) for(int i=0;i<n;i++)#define pb push_backusing namespace std;const int inf=~0U>>1,maxn=301,maxc=100;int n,m;struct Board{ int C[maxn][maxn]; Board(){memset(C,0,sizeof(C));} void change(int i,int j,int d) { for(int x=i;x<=n;x+=x&-x) for(int y=j;y<=n;y+=y&-y) C[x][y]+=d; } int sum(int i,int j) { int […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/168"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=168"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/168\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=168"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=168"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=168"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}