Submission #5018642
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 200010;
struct edge {
int u,v;
LL c;
bool operator<(const edge &n1) const {
return c<n1.c;
}
};
vector<edge> e;
int f[maxn];
int sf(int x) {return f[x] == x?x:f[x] = sf(f[x]);}
void join(int x,int y) {
x = sf(x);
y = sf(y);
if(x!=y) {
f[x] = y;
}
}
int main() {
int n,q;
scanf("%d%d",&n,&q);
for(int i=0;i<=n;i++) f[i] = i;
for(int i=0;i<q;i++) {
int u,v;
LL c;
scanf("%d%d%lld",&u,&v,&c);
e.push_back(edge{u,v,c});
e.push_back(edge{(u+1)%n,v,(c+1)});
e.push_back(edge{(u+1)%n,(v+1)%n,(c+2)});
e.push_back(edge{(u+2)%n,(v+1)%n,(c+3)});
e.push_back(edge{(u+2)%n,(v+2)%n,(c+4)});
e.push_back(edge{(u+3)%n,(v+2)%n,(c+5)});
e.push_back(edge{(u+3)%n,(v+3)%n,(c+6)});
}
sort(e.begin(),e.end());
LL ans = 0;
for(int i=0;i<e.size();i++) {
int u = e[i].u;
int v = e[i].v;
if(sf(u)!=sf(v)) {
ans+=e[i].c;
join(u,v);
}
}
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time
2019-04-18 22:15:15+0900
Task
G - Zigzag MST
User
vjudge2
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1159 Byte
Status
WA
Exec Time
215 ms
Memory
35684 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:27:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&q);
^
./Main.cpp:32:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%lld",&u,&v,&c);
^
Judge Result
Set Name
sample
all
Score / Max Score
0 / 0
0 / 1300
Status
Set Name
Test Cases
sample
sample-01.txt, sample-02.txt, sample-03.txt
all
sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name
Status
Exec Time
Memory
01-01.txt
AC
1 ms
256 KB
01-02.txt
AC
166 ms
33508 KB
01-03.txt
WA
202 ms
34788 KB
01-04.txt
WA
2 ms
1024 KB
01-05.txt
WA
2 ms
1024 KB
01-06.txt
WA
2 ms
1024 KB
01-07.txt
WA
2 ms
1024 KB
01-08.txt
WA
2 ms
1280 KB
01-09.txt
WA
10 ms
3188 KB
01-10.txt
WA
109 ms
19304 KB
01-11.txt
WA
194 ms
35172 KB
01-12.txt
WA
214 ms
34148 KB
01-13.txt
WA
212 ms
34532 KB
01-14.txt
WA
213 ms
35556 KB
01-15.txt
WA
215 ms
34660 KB
01-16.txt
WA
212 ms
34404 KB
01-17.txt
WA
215 ms
35172 KB
01-18.txt
WA
126 ms
35684 KB
01-19.txt
WA
2 ms
1024 KB
01-20.txt
WA
3 ms
1408 KB
01-21.txt
WA
51 ms
10476 KB
01-22.txt
WA
154 ms
35172 KB
01-23.txt
WA
155 ms
35428 KB
01-24.txt
WA
9 ms
3188 KB
01-25.txt
AC
119 ms
34148 KB
01-26.txt
WA
2 ms
1024 KB
01-27.txt
WA
10 ms
3188 KB
01-28.txt
WA
102 ms
17768 KB
01-29.txt
WA
147 ms
35044 KB
01-30.txt
WA
160 ms
34020 KB
sample-01.txt
AC
1 ms
256 KB
sample-02.txt
AC
1 ms
256 KB
sample-03.txt
AC
1 ms
256 KB