HDU 5807 Keep In Touch 优化DP思维+倒序

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define per(x,y,z) for(int (x)=(y);(x)>=(z);(x)--)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=998244353;
const int maxn=50+5;
const int ub=1e6;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,m,k,q,v[maxn];
vector<int> g[100];
ll dp[maxn][maxn][maxn][3];
int judge(int x,int y,int z){
    if(abs(v[x]-v[y])>k) return 0;
    if(abs(v[y]-v[z])>k) return 0;
    if(abs(v[z]-v[x])>k) return 0;
    return 1;
}
int main(){/*
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);*/
    ios::sync_with_stdio(false);
    int t;cin>>t;
    while(t--){
        cin>>n>>m>>k>>q;
        rep(i,1,n+1){
            cin>>v[i];
            g[i].clear();
        }
        rep(i,0,m){
            int x,y;
            cin>>x>>y;
            g[x].push_back(y);
        }
        mst(dp,0);
        rep(i,1,n+1) rep(j,1,n+1) rep(k,1,n+1) 
            if(judge(i,j,k)) dp[i][j][k][0]=1;
        per(i,n,1) per(j,n,1) per(k,n,1){ 
            rep(tp,0,g[k].size()){
                int kk=g[k][tp];
                dp[i][j][k][2]+=dp[i][j][kk][0];
                dp[i][j][k][2]%=mod;
            }
            rep(tp,0,g[j].size()){
                int jj=g[j][tp];
                dp[i][j][k][1]+=dp[i][jj][k][2];
                dp[i][j][k][1]%=mod;
            }
            if(!dp[i][j][k][0]) continue;
            rep(tp,0,g[i].size()){
                int ii=g[i][tp];
                dp[i][j][k][0]+=dp[ii][j][k][1];
                dp[i][j][k][0]%=mod;
            }
        }
        while(q--){
            int x,y,z;
            cin>>x>>y>>z;
               //cout<<dp[x][y][z][0]<<"\n";
            cout<<dp[y][x][z][0]<<"\n";
        }
    }
    return 0;
}