ICPCCamp 2016 Day 6 - Spb SU and Spb AU Contest(Colored path-dp)

题意：给1个n*n矩阵，每个点上有2个整数权值w和c，现在你希望从(1,1)开始，每次只能向右或向下走（从(i,j)到(i+1,j) or (i,j+1) ），使得路径上的权值和不超过W，出现过的不同颜色数量尽可能少，求最少颜色数，及任意一条对应路径。

$1\le n \le 400,1 \le W \le 10^9, 1 \le c \le k ,1 \le k \le 10$

枚举颜色子集暴力求$O(2^k *n^2)$

#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <functional>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (500000000000LL)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
typedef long long ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (400+10)
int p2[20];
ll f[MAXN][MAXN],g[MAXN][MAXN],g2[MAXN][MAXN];
ll W,w[MAXN][MAXN],c[MAXN][MAXN];
int n,k;
void pri(int i,int j) {
    if (i!=1||j!=1) {
        if (g2[i][j] ==1) pri(i-1,j);
        else pri(i,j-1);
    } 
    printf("%d %d",i,j);
    if (i==n && j==n ) puts(""); else putchar(' ');
}
int main() {

    p2[0]=1; For(i,10) p2[i]=p2[i-1]<<1;

    cin >> n >> k >> W;
    For(i,n) For(j,n) cin>>w[i][j];
    For(i,n) For(j,n) cin>>c[i][j];

    ll ans=INF;

    For(i,n) For(j,n) c[i][j]=p2[c[i][j]-1];

    if (w[1][1]>W) {
        puts("-1"); return 0;
    }
    f[1][1]=w[1][1];
    Rep(mask,p2[k]) {
        if ( !(mask & c[1][1] )  ) continue;
        For(i,n) For(j,n) {
            if (i==1 && j==1 ) continue;
            f[i][j]=INF;
            if (i>1 && f[i-1][j] + w[i][j] < f[i][j] && (mask&c[i][j]) ) {
               f[i][j] =  f[i-1][j] + w[i][j] ;
               g[i][j]=1;
            }
            if (j>1 && f[i][j-1] + w[i][j] < f[i][j] && (mask&c[i][j]) ) {
               f[i][j] =  f[i][j-1] + w[i][j] ;
               g[i][j]=2;
            }

        }
        if (f[n][n] <= W && ans > __builtin_popcount(mask) ) {
            ans=__builtin_popcount(mask);
            For(i,n) For(j,n) g2[i][j]=g[i][j];
        }



    }
    if (ans==INF) {
        puts("-1"); return 0;
    }
    cout<<ans<<endl;
    pri(n,n);
    return 0;
}