AtCoder Beginner Contest 278 E - Grid Filling

最新推荐文章于 2024-08-10 07:14:43 发布

wobushihaorenF

最新推荐文章于 2024-08-10 07:14:43 发布

阅读量185

点赞数

文章标签：算法 c++ 开发语言

本文链接：https://blog.csdn.net/aaa7888210/article/details/127949938

版权

E - Grid Filling

暴力判定每次覆盖的矩阵块，用总数减去覆盖的数字之后记录答案，输出之后还原回溯还原继续向后判定。

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define endl '\n'
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) {return mrand() % x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(int a,int b){return a*b/gcd(a,b);}

const int N=310;
int n,m,mx,h,w;
int a[N][N];
int cnt=0;
int s[N];
 
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m>>mx>>h>>w;
	rep(i,1,n+1){
		rep(j,1,m+1){
			cin>>a[i][j];
			s[a[i][j]]++;
		}
	}
	rep(i,1,mx+1) if(s[i]) cnt++;
	rep(i,1,n-h+2){
		rep(j,1,m-w+2){
			int k=cnt;
			rep(x,i,h+i){
				rep(y,j,w+j){
					if(--s[a[x][y]]==0) k--;
				}
			}
			cout<<k<<" ";
			rep(x,i,h+i){
				rep(y,j,w+j){
					s[a[x][y]]++;
				}
			}
		}
		cout<<endl;
	}
	return 0;
}