Submission #2901940


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll P[202020], C[101010], K[101010];
ll S[101010], E[101010], V[101010];
ll n, m, k, t, ans, cnt;

ll find(ll p) { return p == P[p]? p : P[p] = find(P[p]); }

int main()
{
	int i, s, e;
	
	scanf("%lld%lld%lld", &n, &m, &k);
	
	t = k;
	for(i=1; i<=n; i++){
		scanf("%lld", C+i);
		if(C[i] == 0) C[i] = ++t;
	}
	
	for(i=1; i<=t; i++) P[i] = i;
	
	for(i=1; i<=m; i++){
		scanf("%lld%lld%lld", S+i, E+i, V+i);
		K[i] = i;
	}
	
	sort(K+1, K+m+1, [=](int ca, int cb){
		return V[ca] < V[cb];
	});
	
	for(i=1; i<=m; i++){
		s = find(C[S[K[i]]]);
		e = find(C[E[K[i]]]);
		if(s != e){
			P[s] = e;
			ans += V[K[i]];
			cnt ++;
		}
		
		if(cnt == k - 1) break;
	}
	
	if(i > m) printf("-1\n");
	else printf("%lld\n", ans);
	
	return 0;
}

Submission Info

Submission Time
Task A - Colorful MST
User SebinKim
Language C++14 (GCC 5.4.1)
Score 700
Code Size 849 Byte
Status AC
Exec Time 53 ms
Memory 5760 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld", &n, &m, &k);
                                   ^
./Main.cpp:21:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", C+i);
                     ^
./Main.cpp:28:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", S+i, E+i, V+i);
                                       ^

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3 Subtask4
Score / Max Score 0 / 0 100 / 100 100 / 100 200 / 200 300 / 300
Status
AC × 4
AC × 7
AC × 12
AC × 7
AC × 28
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 00_example_04.txt
Subtask1 00_example_03.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt
Subtask2 s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s2_07.txt, s2_08.txt, s2_09.txt, s2_10.txt, s2_11.txt, s2_12.txt
Subtask3 00_example_02.txt, s3_13.txt, s3_14.txt, s3_15.txt, s3_16.txt, s3_17.txt, s3_18.txt
Subtask4 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 00_example_04.txt, s1_01.txt, s1_02.txt, s1_03.txt, s1_04.txt, s1_05.txt, s1_06.txt, s2_07.txt, s2_08.txt, s2_09.txt, s2_10.txt, s2_11.txt, s2_12.txt, s3_13.txt, s3_14.txt, s3_15.txt, s3_16.txt, s3_17.txt, s3_18.txt, s4_19.txt, s4_20.txt, s4_21.txt, s4_22.txt, s4_23.txt, s4_24.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 2 ms 2304 KB
00_example_02.txt AC 1 ms 2304 KB
00_example_03.txt AC 1 ms 2304 KB
00_example_04.txt AC 1 ms 2304 KB
s1_01.txt AC 1 ms 2304 KB
s1_02.txt AC 50 ms 4992 KB
s1_03.txt AC 1 ms 2304 KB
s1_04.txt AC 1 ms 2304 KB
s1_05.txt AC 24 ms 3840 KB
s1_06.txt AC 50 ms 4992 KB
s2_07.txt AC 8 ms 2560 KB
s2_08.txt AC 52 ms 4992 KB
s2_09.txt AC 35 ms 4096 KB
s2_10.txt AC 32 ms 4096 KB
s2_11.txt AC 45 ms 4352 KB
s2_12.txt AC 44 ms 4352 KB
s3_13.txt AC 7 ms 2688 KB
s3_14.txt AC 49 ms 5760 KB
s3_15.txt AC 34 ms 4480 KB
s3_16.txt AC 33 ms 4480 KB
s3_17.txt AC 49 ms 5760 KB
s3_18.txt AC 42 ms 5248 KB
s4_19.txt AC 8 ms 2560 KB
s4_20.txt AC 44 ms 4608 KB
s4_21.txt AC 34 ms 4224 KB
s4_22.txt AC 37 ms 4224 KB
s4_23.txt AC 53 ms 5248 KB
s4_24.txt AC 45 ms 4736 KB