Submission #2864196


Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>
using std::sort;
using std::min;
const int MAXN=400010;
const int INF=2e9;
struct Edge {
    int u,v,w;
    friend bool operator<(Edge a,Edge b) {
        return a.w<b.w;
    }
}ed[MAXN];
int cnt=0;
inline void join(int x,int y,int z) {
    ed[++cnt].u=x;
    ed[cnt].v=y;
    ed[cnt].w=z;
    return;
}
int f[MAXN];
inline void init(int n) {
    for(int i=0;i<=n;++i) {
        f[i]=i;
    }
}
int find(int x) {
    return x==f[x]?x:(f[x]=find(f[x]));
}
int best[MAXN];
int main() {
    int n,q;
    scanf("%d%d",&n,&q);
    for(int i=0;i<=n;++i) {
        best[i]=INF;
    }
    int x,y,z;
    for(int i=1;i<=q;++i) {
        scanf("%d%d%d",&x,&y,&z);
        join(x,y,z);
        best[x]=min(best[x],z+1);
        best[y]=min(best[y],z+2);
    }	
    for(int i=0;i<n*2;++i) {
        best[(i+1)%n]=min(best[(i+1)%n],best[i%n]+2); //n*2防止更新了n-1到0 
    }
    for(int i=0;i<n;++i) {
        if(best[i]!=INF) join(i,(i+1)%n,best[i]);
    }
    init(n);
    sort(ed+1,ed+1+cnt);
    long long ans=0;
    for(int i=1;i<=cnt;++i) {
        int a=find(ed[i].u),b=find(ed[i].v);
        if(a!=b) {
            ans+=ed[i].w;
            f[a]=b;
        }
    }
    printf("%lld",ans);
    return 0;
}
//rt

Submission Info

Submission Time
Task G - Zigzag MST
User Sleepp
Language C++ (GCC 5.4.1)
Score 1300
Code Size 1332 Byte
Status AC
Exec Time 90 ms
Memory 10368 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:33: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:39:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&x,&y,&z);
                                 ^

Judge Result

Set Name sample all
Score / Max Score 0 / 0 1300 / 1300
Status
AC × 3
AC × 36
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 2176 KB
01-02.txt AC 62 ms 4224 KB
01-03.txt AC 88 ms 7424 KB
01-04.txt AC 19 ms 7808 KB
01-05.txt AC 12 ms 6528 KB
01-06.txt AC 16 ms 7040 KB
01-07.txt AC 14 ms 5888 KB
01-08.txt AC 15 ms 5632 KB
01-09.txt AC 20 ms 5504 KB
01-10.txt AC 52 ms 6016 KB
01-11.txt AC 77 ms 5504 KB
01-12.txt AC 89 ms 7168 KB
01-13.txt AC 88 ms 7168 KB
01-14.txt AC 88 ms 7168 KB
01-15.txt AC 90 ms 7168 KB
01-16.txt AC 88 ms 7168 KB
01-17.txt AC 88 ms 7168 KB
01-18.txt AC 67 ms 10368 KB
01-19.txt AC 14 ms 5888 KB
01-20.txt AC 17 ms 5504 KB
01-21.txt AC 37 ms 5504 KB
01-22.txt AC 76 ms 7168 KB
01-23.txt AC 76 ms 7168 KB
01-24.txt AC 14 ms 8576 KB
01-25.txt AC 87 ms 10368 KB
01-26.txt AC 20 ms 8192 KB
01-27.txt AC 21 ms 7040 KB
01-28.txt AC 57 ms 7808 KB
01-29.txt AC 72 ms 6656 KB
01-30.txt AC 83 ms 8704 KB
sample-01.txt AC 1 ms 2176 KB
sample-02.txt AC 1 ms 2176 KB
sample-03.txt AC 1 ms 2176 KB