#include<bits/stdc++.h>
#define int long long
using namespace std;
int tab[51][51];
int memo[51][51][51][51];
int solve(int xmin,int xmax,int ymin,int ymax)
{
if(memo[xmin][xmax][ymin][ymax]!=-1)
return memo[xmin][xmax][ymin][ymax];
int ans=10000000000000000,cur=0;
for(int x=xmin;x<=xmax;x++)
{
for(int y=ymin;y<=ymax;y++)
cur+=tab[x][y];
}
if((xmax-xmin==1 && ymax-ymin==0)||(xmax-xmin==0 && ymax-ymin==1))
return cur;
for(int x=xmin+1;x<=xmax;x++)
ans=min(ans,solve(xmin,x-1,ymin,ymax)+solve(x,xmax,ymin,ymax)+cur);
for(int y=ymin+1;y<=ymax;y++)
ans=min(ans,solve(xmin,xmax,ymin,y-1)+solve(xmin,xmax,y,ymax)+cur);
memo[xmin][xmax][ymin][ymax]=ans;
return ans;
}
signed main()
{
memset(memo,-1,sizeof(memo));
int n,m;
cin>>n>>m;
for(int x=0;x<n;x++)
{
for(int y=0;y<m;y++)
cin>>tab[x][y];
}
cout<<solve(0,n-1,0,m-1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
20 ms |
53204 KB |
Output isn't correct |
2 |
Correct |
19 ms |
53204 KB |
Output is correct |
3 |
Incorrect |
19 ms |
53232 KB |
Output isn't correct |
4 |
Incorrect |
19 ms |
53204 KB |
Output isn't correct |
5 |
Incorrect |
18 ms |
53140 KB |
Output isn't correct |
6 |
Incorrect |
19 ms |
53152 KB |
Output isn't correct |
7 |
Incorrect |
20 ms |
53200 KB |
Output isn't correct |
8 |
Incorrect |
22 ms |
53268 KB |
Output isn't correct |
9 |
Incorrect |
25 ms |
53160 KB |
Output isn't correct |
10 |
Incorrect |
27 ms |
53204 KB |
Output isn't correct |
11 |
Incorrect |
26 ms |
53228 KB |
Output isn't correct |
12 |
Incorrect |
47 ms |
53256 KB |
Output isn't correct |
13 |
Incorrect |
68 ms |
53260 KB |
Output isn't correct |
14 |
Incorrect |
31 ms |
53204 KB |
Output isn't correct |
15 |
Incorrect |
80 ms |
53232 KB |
Output isn't correct |
16 |
Incorrect |
24 ms |
53204 KB |
Output isn't correct |
17 |
Incorrect |
42 ms |
53180 KB |
Output isn't correct |
18 |
Incorrect |
186 ms |
53256 KB |
Output isn't correct |
19 |
Correct |
340 ms |
53272 KB |
Output is correct |
20 |
Incorrect |
378 ms |
53264 KB |
Output isn't correct |