Cod sursa(job #562999)

Utilizator eudanipEugenie Daniel Posdarascu eudanip Data 24 martie 2011 10:51:24
Problema PScNv Scor 80
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.49 kb
#include<stdio.h>
#include<vector>
#include<string.h>
using namespace std;

#define NMAX 250005
#define maxim(a,b) (a>b ? a : b)
#define pb push_back

vector<int> q[1005],v[NMAX];
vector<short int> cost[NMAX];
int n,m,start,sfarsit,poz;
char viz[NMAX];
char s[52];

inline int afla()
{
    int val=0;
    while(s[poz]>='0' && s[poz]<='9')
    {
        val=val*10+s[poz]-'0';
        poz++;
    }
    poz++;
    return val;
}

int main ()
{
    int i,j,t,a,b,c,nr;
    int lim,lim2,vec,vec2;
    
    freopen("pscnv.in","r",stdin);
    freopen("pscnv.out","w",stdout);
    scanf("%d%d%d%d\n",&n,&m,&start,&sfarsit);
    for(i=1;i<=m;i++)
    {
        fgets(s,sizeof(s),stdin);
        nr=strlen(s);poz=0;
        a=afla();
        b=afla();
        c=afla();
        v[a].pb(b);
        cost[a].pb(c);
    }
    q[0].pb(start);
    for(i=0;i<=1000;i++)
    {
        lim=q[i].size();
        for(j=0;j<lim;j++)
        {
            vec=q[i][j];
            if(vec==sfarsit)
            {
                printf("%d\n",i);
                return 0;
            }
            viz[vec]=1;
            lim2=v[vec].size();
            for(t=0;t<lim2;t++)
            {
                vec2=v[vec][t];
                if(viz[vec2])
                    continue;
                c=maxim(i,cost[vec][t]);
                q[c].pb(vec2);
                if(c==i)
                    lim++;
            }
        }
    }
    return 0;
}