计算客第一场，初赛。

第一题，按照题目意思模拟即可，注意0k0E。要输出0k0

#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <ctime>
#include <bitset>
#include <algorithm>
#include <assert.h>
#pragma comment(linker, "/STACK:102400000,102400000")
#define mp make_pair
#define pb push_back
#define LL(x) ((x)<<1)
#define RR(x) ((x)<<1|1)
using namespace std;
typedef long long lld;

const int MAXN=1001000;
const int MOD=1000000007;
const lld INF=1000000000LL;
char s[MAXN];
bool ok(char x)
{
    return isdigit(x)||(x>='A'&&x<='E');
}
int main()
{
    int n,m;
    int i,j;
    int ioflag=1;
    //freopen("10.in","r",stdin);
    //freopen("10.out","w",stdout);
    //A-E
    while(scanf("%s",s)!=EOF) 
    {
        n=strlen(s);
        s[n]=s[n+1]=s[n+2]=0;
        for(i=0;i<n;i++)
        {
            if(s[i]=='0'&&s[i+1]=='k')
            {
                if(s[i+2]=='0')
                {
                    cout<<"0k0"<<endl;
                    i+=2;
                }
                else if((s[i+2]>='1'&&s[i+2]<='9')
                        ||(s[i+2]>='A'&&s[i+2]<='E'))
                {
                    printf("0k");
                    i+=2;
                    putchar(s[i]);
                    i++;
                    while(i<n&&ok(s[i]))
                    {
                        putchar(s[i]);
                        i++;
                    }
                    i--;
                    cout<<endl;
                }
            }
        }
    }
    return 0;
}
/*

*/

第二题中n==1的时候可以dp[i][j]代表前i个放好之后第i个放j的情况。复杂度O(m*k*k)

先把格子翻转一下，这样可以按照行来DP，可以减少内存置换的开消。

对于n==2的情况，可以dp[i][j][a][b],表示到第i行,第j列的时候，如果j==0表示当前格子放a，右上角放b，否则表示当前格子放b，前面一个格子放a的情况。

总的复杂度是m*k*k*k

#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <ctime>
#include <bitset>
#include <algorithm>
#include <assert.h>
#pragma comment(linker, "/STACK:102400000,102400000")
#define mp make_pair
#define pb push_back
#define LL(x) ((x)<<1)
#define RR(x) ((x)<<1|1)
using namespace std;
typedef long long lld;

const int MAXN=1001000;
const int MOD=1000000007;
const lld INF=1000000000LL;
char s[MAXN];
bool ok(char x)
{
    return isdigit(x)||(x>='A'&&x<='E');
}
int dp[32][2][64][64];
int u[32][32];
int w[32][32];
void read(int x[32][32],int n,int m)
{
    int i,j;
    for(i=0;i<n;i++)
    {
        for(j=0;j<m;j++)
        {
            scanf("%d",&x[j][i]);
            //x[j][i]=rand()%30+1;
        }
    }
}
void out(int x[32][32],int n,int m)
{
    int i,j;
    for(i=0;i<n;i++)
    {
        for(j=0;j<m;j++)
            printf("%d ",x[i][j]);
        cout<<endl;
    }
}
inline int vabs(int x){return x>0?x:-x;}
inline int calc(int i,int j,int c)
{
    return (vabs(i+1+j+1+c)^u[i][j])*w[i][j];
}
int solve(int n,int m,int off)
{
    int d[32][64];
    int i,j,k;
    for(i=0;i<n;i++)
    {
        for(j=0;j<=2*off;j++)
        {
            d[i][j]=INF;
        }
    }
    //0 row;
    for(j=0;j<=2*off;j++)
    {
        d[0][j]=calc(0,0,j-off);
    }
    int tmp=0;
    for(i=1;i<n;i++)
    {
        for(j=0;j<=2*off;j++)
        {
            for(k=0;k<=2*off;k++)
            {
                tmp=d[i-1][j]+calc(i,0,k-off)+vabs(j-off+k-off);
                if(tmp<d[i][k])d[i][k]=tmp;
            }
        }
    }
    int ans=INF;
    i=n-1;
    for(j=0;j<=2*off;j++)
    {
        tmp=d[i][j];
        if(tmp<ans)ans=tmp;
    }
    return ans;
}
int main()
{
    int n,m;
    int i,j,k;
    int ioflag=1;
    //freopen("10.in","r",stdin);
    //freopen("10.out","w",stdout);
    //A-E
    int off;
    while(scanf("%d%d%d",&n,&m,&off)!=EOF) 
    //while(true)
    {
        //n=m=off=30;
        read(u,n,m);
        read(w,n,m);

        swap(n,m);

        if(m==1)
        {
            printf("%d\n",solve(n,m,off));
            continue;
        }
        //out(u,n,m);        puts("u");
        //out(w,n,m);        puts("w");
        int col=0;
        for(i=0;i<n;i++)
        {
            for(col=0;col<2;col++)
            for(j=0;j<=2*off;j++)
            {
                for(k=0;k<=2*off;k++)
                {
                    dp[i][col][j][k]=INF;
                }
            }
        }
        int tmp=0;
        //第0行。
        for(j=0;j<=2*off;j++)
        {
            for(k=0;k<=2*off;k++)
            {
                dp[0][1][j][k]=calc(0,0,j-off)+calc(0,1,k-off)+vabs(j-off+k-off);
            }
        }

        
        for(i=1;i<n;i++)
        {
            //col==0
            for(j=0;j<=2*off;j++)
            {
                for(k=0;k<=2*off;k++)
                {
                    int save=dp[i-1][1][j][k];

                    int a;
                    for(a=0;a<=2*off;a++)
                    {    
                        tmp=save+calc(i,0,a-off)  +vabs(j-off+a-off);
                        if(tmp<dp[i][0][a][k])
                        {
                            dp[i][0][a][k]=tmp;
                        } 
                    }
                }
            }

            //col==1
            for(j=0;j<=2*off;j++)
            {
                for(k=0;k<=2*off;k++)
                {
                    int save=dp[i][0][j][k];

                    int a;
                    for(a=0;a<=2*off;a++)
                    {    
                        tmp=save+calc(i,1,a-off)  +vabs(j-off+a-off)
                            +vabs(k-off+a-off);
                        if(tmp<dp[i][1][j][a])
                        {
                            dp[i][1][j][a]=tmp;
                        } 
                    }
                }
            }

        }
        int ans=INF;
        for(j=0;j<=2*off;j++)
        {
            for(k=0;k<=2*off;k++)
            {
                tmp=dp[n-1][1][j][k];
                if(tmp<ans)ans=tmp;
            }
        }
        cout<<ans<<endl;
        //printf("%f\n",(double)(clock())/CLOCKS_PER_SEC);break;
    }
    return 0;
}
/*

*/