求正确性

记录

代码

#pragma GCC target("avx")
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include <bits/stdc++.h>
using namespace std;
int n,h,w,a[105],b[105],cnt[105],f[105][105];
void dfs(int u){
	if(u>n){
		for(int i=1;i<=h;i++){
			for(int j=1;j<= w;j++){
				if(f[i][j]==0)return;
			}
		}
		printf("Yes");
		exit(0);
	}
	dfs(u+1);
	int p=cnt[u];
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			if(f[i][j]==0&&f[i][j-1]!=0&&f[i-1][j]!= 0){
				int e=1;
				if(i+a[p]-1<=h&&j+b[p]-1<=w){
					for(int x=i;x<=i+a[p]-1;x++){
						for(int y=j;y<=j+b[p]-1;y++){
							if(f[x][y]!=0){
								e=0;
								break;
							}
						}
						if(e==0)break;
					}
					if(e==1){
						for(int x=i;x<=i+a[p]-1;x++){
							for(int y=j;y<=j+b[p]-1;y++)f[x][y]=1;
						}
						dfs(u+1);
						for(int x=i;x<=i+a[p]-1;x++){
							for(int y=j;y<=j+b[p]-1;y++)f[x][y]=0;
						}
					}
				}
				e=1;
				if(i+b[p]-1<=h&&j+a[p]-1<=w){
					for(int x=i;x<=i+b[p]-1;x++){
						for(int y=j;y<=j+a[p]-1;y++){
							if(f[x][y]!=0){
								e=0;
								break;
							}
						}
						if(e==0)break;
					}
					if(e==1){
						for(int x=i;x<=i+b[p]-1;x++){
							for(int y=j;y<=j+a[p]-1;y++)f[x][y]=1;
						}
						dfs(u+1);
						for(int x=i;x<=i+b[p]-1;x++){
							for(int y=j;y<=j+a[p]-1;y++)f[x][y]=0;
						}
					}
				}
			}
		}
	}
}
int main(){
	scanf("%d%d%d",&n,&h,&w);
	for(int i=0;i<=h;i++)f[i][0]=1;
	for(int i=0;i<=w;i++)f[0][i]=1;
	for(int i=1;i<=n;i++){
		scanf("%d%d",&a[i],&b[i]);
		cnt[i]=i;
	}
	do{
		dfs(1);
	}while(clock()*1.0/CLOCKS_PER_SEC<1.8);
	printf("No");
	return 0;
}