Submission #48510418

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
//#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll MOD=998244353;
// head
const int M=305;
int a[M][M];
int all[M];
int last[M],now[M];
signed main() 
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	
	int H,W,N,h,w;cin>>H>>W>>N>>h>>w;
	for(int i=1;i<=H;i++) for(int j=1;j<=W;j++) {cin>>a[i][j];all[a[i][j]]++;}
	for(int i=1;i<=h;i++) for(int j=1;j<=w;j++) now[a[i][j]]++;
	for(int i=1;i<=N;i++) last[i]=now[i];
	int ans=0,last_ans;
	for(int i=1;i<=N;i++) if(now[i]==all[i]) ans++; 
	last_ans=ans;
	for(int i=h;i<=H;i++){
		for(int j=w;j<=W;j++){
			cout<<N-ans<<" ";
			for(int k=i-h+1;k<=i;k++){
				if(now[a[k][j-w+1]]==all[a[k][j-w+1]]) ans--;
				now[a[k][j-w+1]]--;
			}
			for(int k=i-h+1;k<=i;k++){
				if(now[a[k][j+1]]==all[a[k][j+1]]-1) ans++;
				now[a[k][j+1]]++;
			}
		}
		ans=last_ans;
		for(int j=1;j<=N;j++) now[j]=last[j];
		for(int j=1;j<=w;j++){
			if(now[a[i-h+1][j]]==all[a[i-h+1][j]]) ans--;
			now[a[i-h+1][j]]--;
		}
		for(int j=1;j<=w;j++){
			if(now[a[i+1][j]]==all[a[i+1][j]]-1) ans++;
			now[a[i+1][j]]++;
		}
		for(int j=1;j<=N;j++) last[j]=now[j];
		last_ans=ans;
		cout<<endl;
	}
	return 0;
}

Submission Info

Judge Result