https://ac.nowcoder.com/acm/contest/642/F
反思:很少做多维的dp~~,dp[i][j][k][0/1],表示在位置(i,j)转了k次弯后面向右还是下;
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=1e5+9;
const int mod=1e9+7;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
ll power(ll x,ll n)
{
ll ans=1;
while(n)
{
if(n&1) ans=ans*x;
x=x*x;
n>>=1;
}
return ans;
}
int a[109][109];
int dp[109][109][30][2];
int base[109];
int main()
{
//FAST_IO;
//freopen("input.txt","r",stdin);
base[0]=1;
for(int i=1;i<30;i++) base[i]=base[i-1]*2;
int t;
cin>>t;
while(t--)
{
mem(dp,INF);
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++) cin>>a[i][j];
}
dp[1][1][0][0]=a[1][1];//右
dp[1][1][0][1]=a[1][1];//下
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
for(int k=0;k<20;k++)
{
dp[i][j][k][0]=min(dp[i][j][k][0],dp[i][j-1][k][0]+a[i][j]);
dp[i][j][k+1][0]=min(dp[i][j][k+1][0],dp[i][j-1][k][1]+base[k]+a[i][j]);
}
for(int k=0;k<20;k++)
{
dp[i][j][k][1]=min(dp[i][j][k][1],dp[i-1][j][k][1]+a[i][j]);
dp[i][j][k+1][1]=min(dp[i][j][k+1][1],dp[i-1][j][k][0]+base[k]+a[i][j]);
}
}
}
int ans=INF;
for(int i=0;i<20;i++)
{
ans=min(ans,min(dp[n][n][i][0],dp[n][n][i][1]));
}
cout<<ans<<endl;
}
return 0;
}