Cod sursa(job #2007707)

Utilizator dacianouaPapadia Mortala dacianoua Data 3 august 2017 19:45:49
Problema Amenzi Scor 20
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.1 kb
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <cstring>
#define tmax 3500
using namespace std;
int n,m,k,p,a[151][151],c[tmax+1][151],dp[tmax+1][151];
int main()
{
    int x,y,z;
    freopen("amenzi.in","r",stdin);
    freopen("amenzi.out","w",stdout);
    scanf("%d %d %d %d",&n,&m,&k,&p);
    memset(dp,-1,sizeof(dp));memset(a,0,sizeof(a));
    for (int i=1;i<=m;i++)
    {
        scanf("%d %d %d",&x,&y,&z);
        a[x][y]=a[y][x]=z;
    }
    for(int i=1;i<=k;i++)
    {
        scanf("%d %d %d",&x,&y,&z);
        c[y][x]=z;
    }
    dp[0][1]=0;
    for(int i=1;i<=tmax;i++)
        for(int nod=1;nod<=n;nod++)
    {
        for(int j=1;j<=n;j++)
            if((i-a[nod][j]>=0) && a[nod][j]!=0)
            dp[i][nod]=max(dp[i][nod],dp[i-a[nod][j]][j]);
        if(dp[i-1][nod]>dp[i][nod])
            dp[i][nod]=dp[i-1][nod];
        if(dp[i][nod]>=0)
            dp[i][nod]+=c[i][nod];
    }
    for(int i=1;i<=p;i++)
    {
        scanf("%d %d",&x,&y);
        printf("%d\n",dp[y][x]);
    }
    fclose(stdin);
    fclose(stdout);

    return 0;
}