Whether it is possible better?

Accepted
 0.015 286 KB

xxvictorxx@mail.ru

Mine is 0.015s 178k

0.015    166 КБ :D See I have you write down if you want to know how it can be :D

see and train.

http://acm.timus.ru/status.aspx?space=1&num=1210&author=31927

0.015 132 Kb - now by changing longint to integer :D

0.031 104kb

#include "iostream"
using namespace std;
void main ()
{
    long n,lay,from,fee;
    long i=0;
    long j;

    long arr[35];
    long arr2[35];
    long* one;
    long* two;
    long* help;
    char c;

    for (i=0;i<35;i++)
    {
        arr2[i]=0;
        arr[i]=0;
    };
    one=arr;
    two=arr2;

    cin>>n;

    for (i=0;i<n;i++)
    {
        cin>>lay;
        for (j=0;j<lay;j++)
        {
            cin>>from;
            if (from==0)
                    { continue;}
            cin>>fee;
            two[j+1]=one[from]+fee;
            while(2>1)
            {
                cin>>from;
                if (from==0)
                    { break;}
                cin>>fee;
                if (two[j+1]>(one[from]+fee))
                {
                    two[j+1]=one[from]+fee;
                };
            };
        };

        if (i!=n-1)
        {
            help=one;
            one=two;
            two=help;
            cin>>c;
        };
    };

    long m;

    m=two[1];
    for (j=1;j<lay;j++)
        if (m>two[j+1])
            m=two[j+1];
    cout<<m;

}