1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
| #include <bits/stdc++.h> #define MAXN 55 #define MOD 998244353 using namespace std; inline int read(){ int x=0,f=1; char ch=getchar(); while (ch<'0'||ch>'9'){ if (ch=='-') f=-1; ch=getchar(); } while (ch>='0'&&ch<='9'){ x=(x<<3)+(x<<1)+(ch^'0'); ch=getchar(); } return x*f; } int w[MAXN]; int dp[3][MAXN][MAXN][MAXN]; int G[MAXN][MAXN]; inline int alb(int x){ return x>0?x:-x; } inline void inc(int &x,int y){ x=(x+y)%MOD; } int n,m,c,q; int main(){ int T=read(); while (T--){ memset(G,0,sizeof(G)); n=read(),m=read(),c=read(),q=read(); for (register int i=1;i<=n;++i){ w[i]=read(); } for (register int i=1;i<=m;++i){ int u=read(),v=read(); G[u][v]=1; } for (register int i=n;i>=1;--i){ for (register int j=n;j>=1;--j){ for (register int k=n;k>=1;--k){ dp[0][i][j][k]=1,dp[1][i][j][k]=dp[2][i][j][k]=0; if (max(max(alb(w[i]-w[j]),alb(w[j]-w[k])),alb(w[k]-w[i]))>c){ dp[0][i][j][k]=0; } else { for (register int u=k+1;u<=n;++u){ if (G[k][u]) inc(dp[0][i][j][k],dp[2][i][j][u]); } } for (register int u=i+1;u<=n;++u){ if (G[i][u]) inc(dp[1][i][j][k],dp[0][u][j][k]); } for (register int u=j+1;u<=n;++u){ if (G[j][u]) inc(dp[2][i][j][k],dp[1][i][u][k]); } } } } while (q--){ int x=read(),y=read(),z=read(); printf("%d\n",dp[0][x][y][z]); } } }
|