Submission #18588

#TimeUsernameProblemLanguageResultExecution timeMemory
18588eaststar일도양단! (kriii1_1)C++14
0 / 1
6 ms16384 KiB
#include <stdio.h> #include <algorithm> using namespace std; int a[8][8][8],b[8][8][8][8][8][8]; int sum(int i,int j,int k,int x,int y,int z){return a[i][j][k]-a[x][j][k]-a[i][y][k]-a[i][j][z]+a[x][y][k]+a[i][y][z]+a[x][j][z]-a[x][y][z];} int f(int sr,int er,int sc,int ec,int sh,int eh){ int i,s,t,&mx=b[sr][er][sc][ec][sh][eh]; if(mx)return mx; s=sum(er,ec,eh,sr-1,sc-1,sh-1); if(!s)return 0; if(s==1)return mx=(er-sr+1)*(ec-sc+1)*(eh-sh+1); for(i=sr;i<er;++i)mx=max(mx,min(f(sr,i,sc,ec,sh,eh),f(i+1,er,sc,ec,sh,eh))); for(i=sc;i<ec;++i)mx=max(mx,min(f(sr,er,sc,i,sh,eh),f(sr,er,i+1,ec,sh,eh))); for(i=sh;i<eh;++i)mx=max(mx,min(f(sr,er,sc,ec,sh,i),f(sr,er,sc,ec,sh,i+1))); return mx; } int main(){ int i,j,k,r,c,h,n,x,y,z; scanf("%d%d%d%d",&r,&c,&h,&n); for(i=1;i<=n;++i)scanf("%d%d%d",&x,&y,&z),a[x][y][z]=1; for(i=1;i<=r;++i){ for(j=1;j<=c;++j){ for(k=1;k<=h;++k)a[i][j][k]-=sum(i,j,k,i-1,j-1,k-1)-a[i][j][k]; } } printf("%d",f(1,r,1,c,1,h)); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...