Submission #2901999
Source Code Expand
#include<bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll N = 100005;
ll n, m, k, cc, c[N], p[2*N], ans;
vector<pair<ll, pll> > e;
vector<ll> v;
ll Find (ll X) {
if(p[X] == X) return X;
return p[X] = Find(p[X]);
}
int main()
{
scanf("%lld%lld%lld",&n,&m,&k);
for(ll i=1;i<=n;i++) {
scanf("%lld",&c[i]);
}
iota(p+1, p+1+n+k, 1);
cc = k;
for(ll i=1;i<=m;i++) {
ll A, B, C;
scanf("%lld%lld%lld",&A,&B,&C);
if(!c[A]) c[A] = ++cc;
if(!c[B]) c[B] = ++cc;
e.push_back({C, {c[A], c[B]}});
}
sort(e.begin(), e.end());
for(auto &T : e) {
ll A = T.Y.X, B = T.Y.Y, C = T.X;
A = Find(A);
B = Find(B);
if(A == B) continue;
p[A] = B;
v.push_back(C);
}
if(v.size() < k-1) {
puts("-1");
return 0;
}
for(ll i=0;i<k-1;i++) {
ans += v[i];
}
printf("%lld\n",ans);
}
Submission Info
Submission Time |
|
Task |
A - Colorful MST |
User |
khsoo01 |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
925 Byte |
Status |
AC |
Exec Time |
52 ms |
Memory |
7152 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:22:32: 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:24:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld",&c[i]);
^
./Main.cpp:30:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld%lld",&A,&B,&C);
^
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Subtask3 |
Subtask4 |
Score / Max Score |
0 / 0 |
100 / 100 |
100 / 100 |
200 / 200 |
300 / 300 |
Status |
|
|
|
|
|
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 |
1 ms |
256 KB |
00_example_02.txt |
AC |
1 ms |
256 KB |
00_example_03.txt |
AC |
1 ms |
256 KB |
00_example_04.txt |
AC |
1 ms |
256 KB |
s1_01.txt |
AC |
1 ms |
256 KB |
s1_02.txt |
AC |
51 ms |
6640 KB |
s1_03.txt |
AC |
1 ms |
256 KB |
s1_04.txt |
AC |
1 ms |
256 KB |
s1_05.txt |
AC |
26 ms |
4340 KB |
s1_06.txt |
AC |
51 ms |
6640 KB |
s2_07.txt |
AC |
7 ms |
1088 KB |
s2_08.txt |
AC |
51 ms |
6772 KB |
s2_09.txt |
AC |
37 ms |
4212 KB |
s2_10.txt |
AC |
34 ms |
5492 KB |
s2_11.txt |
AC |
47 ms |
6516 KB |
s2_12.txt |
AC |
46 ms |
6132 KB |
s3_13.txt |
AC |
7 ms |
1148 KB |
s3_14.txt |
AC |
49 ms |
6640 KB |
s3_15.txt |
AC |
41 ms |
4340 KB |
s3_16.txt |
AC |
38 ms |
4980 KB |
s3_17.txt |
AC |
50 ms |
7152 KB |
s3_18.txt |
AC |
50 ms |
6640 KB |
s4_19.txt |
AC |
7 ms |
1148 KB |
s4_20.txt |
AC |
50 ms |
5236 KB |
s4_21.txt |
AC |
39 ms |
5108 KB |
s4_22.txt |
AC |
38 ms |
4340 KB |
s4_23.txt |
AC |
52 ms |
6640 KB |
s4_24.txt |
AC |
51 ms |
6004 KB |