A班考试?来长长见识

#include<iostream>
#include<vector>
using namespace std;
struct node{
	int de,cost;
};
int D,P,C,F,S,maxs,dis[250],vis[250];
vector<vector<node>>v1;
int dfs(int s,int j){
	dis[s]=j;
	for(int i=0;i<v1[s].size();i++){
		if(dis[v1[s][i].de]<dis[s]-v1[s][i].cost+D){
			maxs=max(maxs,dfs(v1[s][i].de,dis[s]-v1[s][i].cost+D));
		}
	}
	return max(maxs,j);
}
int main(){
	cin>>D>>P>>C>>F>>S;
	maxs=D;
	v1.resize(C+10);
	while(P--){
		int a,b;
		cin>>a>>b;
		v1[a].push_back({b,0});
	}
	while(F--){
		int a,b,t;
		cin>>a>>b>>t;
		v1[a].push_back({b,t});
	}
	cout<<dfs(S,D);
	return 0;
}