Cod sursa(job #2969725)

Utilizator amunnumeVlad Patrascu amunnume Data 23 ianuarie 2023 17:12:03
Problema Distante Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.44 kb
#include <fstream>
#include <vector>
#include <set>
#define DIM 50001
#define INF 1000000001
using namespace std;
ifstream cin("distante.in");
ofstream cout("distante.out");
int n,p,x,y,c,d[DIM],sol[DIM],m;
set<pair<int,int> > s;
int main()
{
    int T;
    cin>>T;
    for(int q=1; q<=T; ++q)
    {
        cin>>n>>m>>p; int ok=1;
        vector<pair<int,int>>l[DIM];
        for (int i=1; i<=n; i++)
        {
            cin>>sol[i];
            d[i]=INF;
        }
        d[p]=0;
        for(int i=1;i<=m;++i)
        {
            cin>>x>>y>>c;
            l[x].push_back(make_pair(y,c));
            l[y].push_back(make_pair(x,c));
        }
        s.insert(make_pair(0,p));
        while (!s.empty())
        {
            int nod=s.begin()->second;
            s.erase(s.begin());
            for (int i=0; i<l[nod].size(); i++)
            {
                int vec=l[nod][i].first;
                int cost=l[nod][i].second;
                if (d[nod]+cost<d[vec])
                {
                    s.erase(make_pair(d[vec],vec));
                    d[vec]=d[nod]+cost;
                    s.insert(make_pair(d[vec],vec));
                }
            }
        }
        for (int i=1; i<=n; i++)
        {
            if(d[i]!=sol[i])
            {
                cout<<"NU\n";
                ok=0;
                break;
            }
        }
        if(ok) cout<<"DA\n";
    }
    return 0;
}