Sadonkorjuu

#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <climits>
#include <regex>
#include <numeric>
#include <algorithm>
using namespace std;
template<typename T>
 
class Graph {
	map<T, list<pair<T, unsigned int>>> l;
 
public:
	void addEdge(T x, T y,unsigned  int wt) {
		l[x].push_back({ y, wt });
		l[y].push_back({ x, wt });
	}
	void djikstraSSSP(T src, vector<unsigned int>& scores) {
 
		map<T, unsigned int> dist;
 
		for (auto p : l) {
			T node = p.first;
			dist[node] = INT_MAX;
		}
		dist[src] = 0;
 
		set<pair<unsigned int, T>> s;
		s.insert({ dist[src], src });
 
		while (!s.empty()) {
 
			pair<unsigned 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 + distInBetween < nbrNodeDist) {
					auto pr = s.find({ dist[nbrNode], nbrNode });
					if (pr != s.end()) {
						s.erase(pr);
					}
					dist[nbrNode] = currNodeDist + distInBetween;
					s.insert({ dist[nbrNode], nbrNode });
				}
			}
 
		}
		unsigned int i = 0;
		for (auto x : dist) {
			if (scores[i] != 0) {
				if (scores[i] > x.second) {
					scores[i] = x.second;
				}
			}
			else {
				scores[i] = x.second;
			}
 
			++i;
		}
	}
 
};
 
int main() {
 
	Graph<unsigned int> g;
 
	register unsigned int V = 0;
	cin >> V;
	register unsigned int i = 0;
	register unsigned int paths = V - 1;
	string roles;
	getline(cin >> ws, roles);
	std::regex r("\\s+");
 
	roles = std::regex_replace(roles, r, "");
 
	while (i < paths) {
		register unsigned int a, b, c;
		cin >> a >> b >> c;
		g.addEdge(a, b, c);
		++i;
	}
	register unsigned int j = 1;
	std::string::difference_type rl = std::count(roles.begin(), roles.end(), '0');
	while (j < roles.length() + 1) {
		if (roles[j - 1] == '0') {
 
			g.addEdge(0, j, 0);
		}
		++j;
	}
	vector<unsigned int> scores(V + rl, 0);
	g.djikstraSSSP(0, scores);
 
	int totalLength = std::accumulate(scores.begin(), scores.end(), 0);
	std::cout << totalLength << endl;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 1, 2

Verdict: ACCEPTED

Test 16

Group: 1, 2

Verdict: ACCEPTED

Test 17

Group: 1, 2

Verdict: ACCEPTED

Test 18

Group: 1, 2

Verdict: ACCEPTED

Test 19

Group: 1, 2

Verdict: ACCEPTED

Test 20

Group: 1, 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 1, 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 1, 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: ACCEPTED

Test 28

Group: 1, 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: ACCEPTED

Test 30

Group: 1, 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: ACCEPTED