Pagini recente » Cod sursa (job #1172267) | Cod sursa (job #158645) | Cod sursa (job #1878) | Cod sursa (job #1127976) | Cod sursa (job #890783)
Cod sursa(job #890783)
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
int dp[3600][160];
int cost[3600][160];
ifstream in("amenzi.in");
ofstream out("amenzi.out");
vector<pair<int,int> > a[160];
int n,k,m,p;
void dinamica();
void read()
{
in>>n>>m>>k>>p;
int x,y,z;
for(int i=1;i<=m;i++)
{
in>>x>>y>>z;
a[x].push_back(make_pair(y,z));
a[y].push_back(make_pair(x,z));
}
for(int i=1;i<=k;i++)
{
in>>x>>y>>z;
cost[y][x]+=z;
}
dinamica();
for(int i=1;i<=p;i++)
{
in>>x>>y;
out<<dp[y][x]<<"\n";
}
}
void dinamica()
{
memset(dp,-1,sizeof(dp));
dp[0][1]=cost[0][1];
for(int i=1;i<=3500;i++)
for(int j=1;j<=n;j++)
{
for(int w=0;w<a[j].size();w++)
{
if(i-a[j][w].second>=0) dp[i][j]=max(dp[i][j],dp[i-a[j][w].second][a[j][w].first]);
}
dp[i][j]=max(dp[i][j],dp[i-1][j]);
if(dp[i][j]!=-1)
dp[i][j]+=cost[i][j];
}
}
int main()
{
read();
return 0;
}