Submission #3221620


Source Code Expand

#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
int par[200000];
int fnd(int k)
{
    return par[k]==k?k:par[k]=fnd(par[k]);
}
int w[200000];
bool cmp(const pair<pair<int,int>,int> &a,const pair<pair<int,int>,int> &b)
{
    return a.second<b.second;
}
int main()
{
    int n,q;
    scanf("%d%d",&n,&q);
    vector<pair<pair<int,int>,int> > cross;
    for (int i=0;i<n;++i)
        w[i]=2000000000;
    for (int i=0;i<q;++i)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        cross.push_back(make_pair(make_pair(a,b),c));
        if (c+1<w[a])
            w[a]=c+1;
        if (c+2<w[b])
            w[b]=c+2;
    }
    for (int i=0;i<n;++i)
        w[(i+1)%n]=min(w[(i+1)%n],w[i]+2);
    for (int i=0;i<n;++i)
        w[(i+1)%n]=min(w[(i+1)%n],w[i]+2);
    for (int i=0;i<n;++i)
        cross.push_back(make_pair(make_pair(i,(i+1)%n),w[i]));
    sort(cross.begin(),cross.end(),cmp);
    for (int i=0;i<n;++i)
        par[i]=i;
    long long ans=0;
    for (auto &c:cross)
    {
        int u=c.first.first,v=c.first.second;
        if (fnd(u)!=fnd(v))
        {
            par[fnd(u)]=fnd(v);
            ans+=c.second;
        }
    }
    printf("%lld\n",ans);
    return 0;
}

Submission Info

Submission Time
Task G - Zigzag MST
User BaCl2
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 1279 Byte
Status AC
Exec Time 125 ms
Memory 10732 KB

Compile Error

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

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 256 KB
01-02.txt AC 70 ms 3444 KB
01-03.txt AC 111 ms 8304 KB
01-04.txt AC 37 ms 6640 KB
01-05.txt AC 24 ms 5616 KB
01-06.txt AC 30 ms 6128 KB
01-07.txt AC 26 ms 4592 KB
01-08.txt AC 25 ms 5364 KB
01-09.txt AC 30 ms 4464 KB
01-10.txt AC 68 ms 7536 KB
01-11.txt AC 94 ms 8560 KB
01-12.txt AC 109 ms 8816 KB
01-13.txt AC 111 ms 7920 KB
01-14.txt AC 110 ms 8304 KB
01-15.txt AC 112 ms 9328 KB
01-16.txt AC 109 ms 7920 KB
01-17.txt AC 109 ms 8688 KB
01-18.txt AC 88 ms 10220 KB
01-19.txt AC 25 ms 5620 KB
01-20.txt AC 31 ms 4336 KB
01-21.txt AC 47 ms 4976 KB
01-22.txt AC 93 ms 8176 KB
01-23.txt AC 93 ms 7664 KB
01-24.txt AC 26 ms 7536 KB
01-25.txt AC 125 ms 10732 KB
01-26.txt AC 36 ms 6896 KB
01-27.txt AC 33 ms 6000 KB
01-28.txt AC 73 ms 8176 KB
01-29.txt AC 90 ms 7664 KB
01-30.txt AC 105 ms 9580 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