Sadonkorjuu

input/code.cpp: In instantiation of 'void Graph<T>::djikstraSSSP(std::vector<_Tp>, std::vector<int>&) [with T = int]':
input/code.cpp:120:19:   required from here
input/code.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         while (J < srcs.size())
      |                ~~^~~~~~~~~~~~~

#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <climits>
#include <regex>
using namespace std;
template <typename T>

class Graph
{
    map<T, list<pair<T, int>>> l;

public:
    void addEdge(T x, T y, int wt)
    {
        l[x].push_back({y, wt});
        l[y].push_back({x, wt});
    }
    void djikstraSSSP(vector<T> srcs, vector<int> &scores)
    {
        int J = 0;
        while (J < srcs.size())
        {
            T src = srcs[J];
            map<T, int> dist;

            for (auto p : l)
            {
                T node = p.first;
                dist[node] = INT_MAX;
            }
            dist[src] = 0;

            set<pair<int, T>> s;
            s.insert({dist[src], src});

            while (!s.empty())
            {

                pair<int, T> p = *s.begin();
                s.erase(s.begin());
                T currNode = p.second;
                int currNodeDist = p.first;

                for (auto nbr : l[currNode])
                {
                    T nbrNode = nbr.first;
                    // int distInBetween = nbr.second;
                    // int nbrNodeDist = dist[nbrNode];

                    if (currNodeDist + nbr.second < dist[nbrNode])
                    {
                        auto pr = s.find({dist[nbrNode], nbrNode});
                        if (pr != s.end())
                        {
                            s.erase(pr);
                        }
                        dist[nbrNode] = currNodeDist + nbr.second;
                        s.insert({dist[nbrNode], nbrNode});
                    }
                }
            }
            int i = 0;
            for (auto x : dist)
            {
                if (scores[i] != -1)
                {
                    if (scores[i] > x.second)
                    {
                        scores[i] = x.second;
                    }
                }
                else
                {
                    scores[i] = x.second;
                }

                ++i;
            }
        }
    }
};

int main()
{

    Graph<int> g;

    int V = 0;
    cin >> V;
    int i = 0;
    int paths = V - 1;
    string roles;
    getline(cin >> ws, roles);
    std::regex r("\\s+");

    roles = std::regex_replace(roles, r, "");
    vector<int> scores(V, -1);
    while (i < paths)
    {
        int a, b, c;
        cin >> a >> b >> c;
        g.addEdge(a, b, c);
        ++i;
    }
    unsigned int j = 1;
    vector<int> srcs;
    while (j < roles.length() + 1)
    { 
        if (roles[j - 1] == '0')
        {
            srcs.push_back(j);
        }
        ++j;
    }
    g.djikstraSSSP(srcs, scores);
    int totalLength = 0;
    for (int num : scores)
    {
        totalLength += num;
    }
    cout << totalLength << endl;

} // TODO Move loop to inside dijkstra function not outside.

Test 1

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 30

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED