Cod sursa(job #2969477)

Utilizator biancalautaruBianca Lautaru biancalautaru Data 23 ianuarie 2023 11:26:25
Problema Distante Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.41 kb
#include <fstream>
#include <vector>
#include <set>
#define DIM 50001
#define INF 100000001
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int t,n,m,p,x,y,c,v[DIM],d[DIM];
vector<pair<int,int>> l[DIM];
set<pair<int,int>> s;
int main() {
    fin>>t;
    while (t--) {
        fin>>n>>m>>p;
        for (int i=1;i<=n;i++) {
            fin>>v[i];
            l[i].clear();
        }
        while (m--) {
            fin>>x>>y>>c;
            l[x].push_back(make_pair(y,c));
            l[y].push_back(make_pair(x,c));
        }
        for (int i=1;i<=n;i++)
            d[i]=INF;
        d[p]=0;
        s.clear();
        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));
                }
            }
        }
        bool ok=1;
        for (int i=1;i<=n;i++)
            if (d[i]!=v[i]) {
                ok=0;
                break;
            }
        if (ok==1)
            fout<<"DA\n";
        else
            fout<<"NU\n";
    }
    return 0;
}