Sadonkorjuu

input/code.cpp: In function 'int main()':
input/code.cpp:69:14: warning: unused variable 'b' [-Wunused-variable]
   69 |         bool b = 1;
      |              ^
input/code.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
input/code.cpp:51:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |                 scanf("%d", &x);
      |                 ~~~~~^~~~~~~~~~
input/code.cpp:60:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |                 scanf("%d %d %d", &x, &y, &z);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

stack<pair<int, int>> a;

ll processC(vector<ll> * sp, vector<bool> * field, vector<vector<pair<int, int>>> * conn, vector<bool> * pross, int c, int pc, ll cp){
	if(!(field[0][c])){ 
		if(!pross[0][c]){ 
			for(vector<pair<int,int>>::iterator it = conn[0][c].begin(); it!= conn[0][c].end(); it++){
				if(it->first==pc) continue;
				if(!field[0][it->first]) a.push({it->first,c}); 
				else processC(sp,field,conn,pross,it->first, c, 0+(ll)it->second);
			}
			pross[0][c]=1; 
		}
		return 0ll;
	}
	int t; 
	bool b = 0; 
	if( (!pross[0][c]) || sp[0][c]>cp){ 
		for(vector<pair<int,int>>::iterator it = conn[0][c].begin(); it!= conn[0][c].end(); it++){
			if(it->first==pc) continue;
			t=processC(sp,field,conn,pross,it->first, c, cp+(ll)it->second)+(ll)it->second;
			if(t<cp){ 
				cp=t;
				b = 1; 
			}
		}
		if(b) processC(sp,field,conn,pross,c, pc, cp); 
		
		pross[0][c]=1;
		sp[0][c]=cp;
	}
	return sp[0][c];
}

int main(){
//	freopen("lavbb", "r",  stdin);
	int n, i = 0, x, y, z;
	
	scanf("%d", &n);

	vector<ll> sp(n+1, 299999999ll);
	
	vector<bool> field(n+1, 0); 

	while(i++<n){
		scanf("%d", &x);
		field[i]=(bool)x;
	}
	
	vector<vector<pair<int, int>>> conn(n+1);
	vector<bool> pross(n+1, 0);

	i=1;
	while(i++<n){
		scanf("%d %d %d", &x, &y, &z);
		if(x!=y){
			conn[x].push_back({y,z});
			conn[y].push_back({x,z});
		}
	}

	a.push({1, 0});
	pair<int, int> t; 
	bool b = 1;

	while(1){
		while(!a.empty()){
			t=a.top();
			a.pop();
			processC(&sp,&field,&conn,&pross,t.first,t.second,299999999ll);
		}
		int ii = 0;
		while(ii++<n) if(!pross[ii]) a.push({ii,-1});
		if(a.empty()) break;	
	}

	//processC(&sp,&field,&conn,&pross,1,-1,2999999999ll);
	
	
	
	i=0;
	ll r = 0; 

	while(i++<n) if(field[i])r+=sp[i];
	printf("%lld", r);
}

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: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

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