题解：P3786 萃香抱西瓜

#include<bits/stdc++.h>
using namespace std;

const int STEPS[4][2] = {-1,0,0,-1,0,1,1,0};

int h, w, t, sx, sy, n, m;
int f[105][25], dp[105][1024][25];

int pos(int r,int c){
    return 5 * ( r - 1 ) + c - 1;
}

void update(int k, int t, int p){
    int r = p / 5 + 1;
    int c = p % 5 + 1;
    //有大西瓜或越界
    if(f[k][p] == -1 || r<1 || r>w || c<1 || c>h){
        dp[k][t][p] = 114514;
        return;
    }
    //若本格有小西瓜，则可以由没搬过这个西瓜的状态前来
    int lt = f[k][p]? t & ~(1<<(f[k][p]-1)) : t;
    dp[k][t][p] = dp[k-1][lt][p];//按兵不动
    for(int i = 0; i < 4; i++){
        int lr = r + STEPS[i][0];
        int lc = c + STEPS[i][1];
        if(lr<1 || lr>w || lc<1 || lc>h){
            continue;
        }
        if(dp[k][t][p] > dp[k-1][lt][pos(lr,lc)]){
            dp[k][t][p] = dp[k-1][lt][pos(lr,lc)]+1;
        }
    }
}

int main(){

    scanf("%d%d%d%d%d%d%d",&h,&w,&t,&sx,&sy,&n,&m);
    for(int i = 0, cnt = 0, t1, t2, a; i < n; i++){
        scanf("%d%d%d", &t1, &t2, &a);
        if(a) cnt++;
        for(int j = t1, x, y; j < t2; j++){
            scanf("%d%d", &x, &y);
            //给小西瓜安排座位
            f[j][pos(x, y)] = a? cnt : -1;
        }
    }

    //第一时刻除出生点外全图不可达
    int maxt = (1<<m)-1;
    for(int t = 0; t <= maxt; t++){
        for(int p = 0; p < 25; p++){
            dp[1][t][p] = 114514;
        }
    }
    //初始时不用动
    int orz = f[0][pos(sx, sy)];
    if(orz){//若初始自带一颗小西瓜
    	dp[1][1<<(orz-1)][pos(sx, sy)] = 0;
	}else{
		dp[1][0][pos(sx, sy)] = 0;
	}
    
    for(int k = 2; k <= t; k++){
        for(int t = 0; t <= maxt; t++){
            for(int p = 0; p < 25; p++){
                update(k, t, p);
            }
        }
    }

    //即使早就抱走全部小西瓜，也只能在第T时刻离开
    int ans = 114514;
    for(int j = 0; j < 25; j++){
        ans = min(ans, dp[t][maxt][j]);
    }

    printf("%d", ans == 114514? -1 : ans);

    return 0;
}