Sadonkorjuu

input/code.cpp: In function 'int main()':
input/code.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
input/code.cpp:23:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |                 scanf("%d", &x);
      |                 ~~~~~^~~~~~~~~~
input/code.cpp:31:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |                 scanf("%d %d %d", &x, &y, &z);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
bool cmp(const tuple<int, int, int> a, const tuple<int, int, int> b){
	return get<0>(a)<get<0>(b);
}
 
int main(){
	int n, i = 0, ii=0, x, y, z;
	ll t;
	scanf("%d", &n);
	vector<int> f;
	int p[n+1];
	ll rl[n+1];
	while(i<=n) p[i++]=0;
	i=0;
	while(i<=n) rl[i++]=0;
	i=0;
	while(i++<n){
		scanf("%d", &x);
		if(x)f.push_back(i);
		else p[i] = 1;
	} 
	pair<int, int> a[n+1];
	tuple<int,int, int> b[2*(n-1)];
	i=1;
	while(i++<n){
		scanf("%d %d %d", &x, &y, &z);
		// list of all edges -> sort -> check where each node starts ends -> store value
		b[ii++]={x,y,z};
		b[ii++]={y,x,z};
	}
	sort(b, b+2*(n-1), cmp);
	i=0;
	ii=1;
	int s = (int) 2*(n-1);
	while(i<s && ii<=n){
		while(get<0>(b[i])!=ii) i++;
		a[ii].first = i;
		a[ii-1].second = i;
		ii++;
	}
	a[ii-1].second = i+1;
	priority_queue<pair<ll,int>> q;
	int pross[n+1];
	ll dist[n+1];
	i=0;
	ll r=0;
	s = (int)f.size();
	while(i<s){
		// Dijkstra's algorithm (modified)
		ll l = 299999999ll;
		for(int i=0; i <= n; i++) pross[i] = 0;
		for(int i=0; i <= n; i++) dist[i] = 299999999ll;
		dist[f[i]] = 0;
		q.push({0,f[i]});
		while(!q.empty()){
			x = q.top().second; 
			q.pop();
			if(pross[x]) continue;
			if(dist[x]>=l) continue;
			pross[x] = 1;
			printf("\n%d:\n", x);
			int iii = a[x].first;
			while(iii<a[x].second){
				y = get<1>(b[iii]); t = dist[x] + (ll) get<2>(b[iii]);
				printf(" 	%d: %lld/%lld  (%lld)\n", y, t, dist[y], l);
				if((t<l) && (t<dist[y])){
					dist[y]=t;
					if(p[y]) l = t;
			 		else if(rl[y]){ if(dist[y]+rl[y]<l){ l = dist[y]+rl[y];}}
					else q.push({-t, y});
				}
				iii++;
			}
		}
		//
		r+=l;
		printf("%d : %lld\n",f[i],l);
		rl[f[i]]=l;
		i++;
	}
	printf("%lld", r);
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: WRONG ANSWER

Test 15

Group: 1, 2

Verdict: WRONG ANSWER

Test 16

Group: 1, 2

Verdict: WRONG ANSWER

Test 17

Group: 1, 2

Verdict: WRONG ANSWER

Test 18

Group: 1, 2

Verdict: WRONG ANSWER

Test 19

Group: 1, 2

Verdict: WRONG ANSWER

Test 20

Group: 1, 2

Verdict: WRONG ANSWER

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: WRONG ANSWER

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 1, 2

Verdict: WRONG ANSWER

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 1, 2

Verdict: WRONG ANSWER

Test 27

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

Test 28

Group: 1, 2

Verdict: WRONG ANSWER

Test 29

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

Test 30

Group: 1, 2

Verdict: WRONG ANSWER

Test 31

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED