WA on #1,3,4,10 60pts求调 玄关

#include<bits/stdc++.h>
using namespace std;
typedef int i32;
#define int long long
#define debug() cout<<"come on"<<'\n'
#define mkp make_pair
#define pb push_back
#define ft first
#define sd second
typedef pair<int,int> pii;
typedef pair<int,pii> piii;
const int mod=987654321;
unordered_map<int,int> mp; 
int n,m,c,dp[50005][11],sum,can[50005][11],ans,fi[11];
bool hv[50005],cg[50005];
vector<vector<int> > v(50005);
void solve(int x){
	memset(dp,0,sizeof dp);
	dp[1][x]=fi[x];
	if(dp[1][x]==0)return ;
	for(int i=2;i<=n;i++){
		for(int j=1;j<=c;j++){
			if(cg[i-1]){
				dp[i][j]+=dp[i-1][j]*(can[i-1][j]==1||(can[i-1][j]==0&&!hv[i-1])),dp[i][j]%=mod;
			}
			else{
				for(int k=1;k<=c;k++){
					dp[i][j]+=dp[i-1][k]*(k!=j)*(can[i-1][k]==1||(can[i-1][k]==0&&!hv[i-1])),dp[i][j]%=mod;
				}
			}
		}
	}
	for(int i=1;i<=c;i++)ans+=dp[n][i]*(i!=x),ans%=mod;
}
signed main(){
	cin>>n>>m>>c;
	for(int i=1,type,x,y;i<=m;i++){
		cin>>type>>x>>y;
		if(type==1)can[x][y]=1,hv[x]=true;
		else if(type==2)can[x][y]=-1;
		else cg[min(x,y)]=true;
	}
	for(int i=1;i<=c;i++)fi[i]=(can[1][i]==1||(can[1][i]==0&&!hv[1]));
	for(int i=1;i<=c;i++)solve(i);
	cout<<ans;
	return 0;
}