Submission #1624962

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define pb push_back
typedef long long ll;
typedef pair<ll,ll>P;
#define fi first
#define sc second
#define mp make_pair
int x[11][11],n,m,k,s,dep;
bool ok = 0;
void dfs(){
	int rui[11][11]={},rui2[11][11]={}; int pre = 0;
	for(int i=1;i<=n;i++){pre = 0; for(int j=1;j<=m;j++){
		rui[i][j] = rui[i][j-1]+x[i][j];
		if(rui[i][j]-pre > s){
			if(dep == k) return;
			for(int k=1;k<=j;k++){
				x[i][k]*=-1; dep++; dfs(); dep--; x[i][k]*=-1;
				
			}return;
		}
		pre = min(pre,rui[i][j]);
	}}
	for(int j=1;j<=m;j++){pre=0; for(int i=1;i<=n;i++){
		rui2[i][j] = rui2[i-1][j]+x[i][j];
		if(rui2[i][j]-pre > s){
			if(dep == k) return;
			for(int k=1;k<=i;k++){
				x[k][j]*=-1; dep++; dfs(); dep--; x[k][j]*=-1;
				
			}return;
		}
		pre = min(pre,rui2[i][j]);
	}}
	//repn(i,n){repn(j,m)cout<<x[i][j]<<" ";cout<<endl;}
	ok=1; return;
}
int main(){
	cin>>n>>m>>k>>s;
	repn(i,n)repn(j,m)cin>>x[i][j];
	dfs();
	puts(ok?"Yes":"No");
}

Submission Info

Judge Result