标签:优化 sim mat tom pair out using require ESS
Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 5859 Accepted Submission(s): 1615
Special Judge
#include <bits/stdc++.h> #define INF 0x3f3f3f3f #define eps 1e-9 #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 fi first #define se second #define pb push_back #define np next_permutation #define mp make_pair using namespace std; const int maxn=1e5+5; const int maxm=1e5+5; int t,n,m,k,flag; //dfs 找方案剪枝 int dp[10][10],c[100]; bool check1(int x,int y,int i) { if(x-1>=1 && dp[x-1][y]==i) return false; if(y-1>=1 && dp[x][y-1]==i) return false; return true; } void dfs(int x,int y,int le) { rep(i,1,k+1) if(c[i]>(le+1)/2) return; if(flag) return; if(x==n+1) { flag=1; return; } for(int i=1;i<=k;i++) { if(c[i]) { if(check1(x,y,i)) { c[i]--; dp[x][y] = i; if(y==m) dfs(x+1,1,le-1); else dfs(x,y+1,le-1); if(flag) return; c[i]++; dp[x][y] = 0; } } } } int main() { scanf("%d",&t); rep(tt,1,t+1) { flag=0; memset(dp,0,sizeof(dp)); scanf("%d%d%d",&n,&m,&k); rep(i,1,k+1) scanf("%d",c+i); dfs(1,1,n*m); printf("Case #%d:\n",tt); if(flag) { printf("YES"); rep(i,1,n+1) { rep(j,1,m) printf("%d ",dp[i][j]); printf("%d\n",dp[i][m]); } } else printf("YES"); } return 0; }
标签:优化 sim mat tom pair out using require ESS
原文地址:https://www.cnblogs.com/songorz/p/9710553.html