Submission #6089802

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
namespace Flandle_Scarlet
{
    #define N 200100
    #define int long long
    struct Edge
    {
        int u,v,w;
        const bool operator<(Edge CompWith) const
        {
            return w<CompWith.w;
        }
    }E[N<<1];int cnt=0;
    class DSU
    {
        public:
            int Father[N],Cnt[N];
            void Init()
            {
                for(int i=0;i<N;i++)
                {
                    Father[i]=i;
                    Cnt[i]=1;
                }
            }
            int Find(int x)
            {
                return (x==Father[x])?x:(Father[x]=Find(Father[x]));
            }
            void Merge(int x,int y)
            {
                int ax=Find(x),ay=Find(y);
                if (Cnt[ax]<Cnt[ay])
                {
                    Cnt[ay]+=Cnt[ax];
                    Father[ax]=ay;
                }
                else
                {
                    Cnt[ax]+=Cnt[ay];
                    Father[ay]=ax;
                }
            }
    }D;
    int n,q;
    int d[N];
    void Input()
    {
        scanf("%lld%lld",&n,&q);
        memset(d,0x3f,sizeof(d));
        for(int i=1;i<=q;++i)
        {
            int u,v,w;
            scanf("%lld%lld%lld",&u,&v,&w);
            E[++cnt]=(Edge){u,v,w};
            d[u]=min(d[u],w+1);
            d[v]=min(d[v],w+2);
        }
    }

    void Soviet()
    {
        for(int i=0;i<n;++i)
        {
            d[i]=min(d[i],d[(i+n-1)%n]+2);
        }
        for(int i=0;i<n;++i)
        {
            d[i]=min(d[i],d[(i+n-1)%n]+2);
        }

        for(int i=0;i<=n;++i)
        {
            E[++cnt]=(Edge){i,(i+1)%n,d[i]};
        }
        sort(E+1,E+cnt+1);
        D.Init();
        int ans=0;int rest=n;
        for(int i=1;i<=cnt and rest>1;++i)
        {
            int u=E[i].u,v=E[i].v,w=E[i].w;
            if (D.Find(u)!=D.Find(v))
            {
                D.Merge(u,v);
                ans+=w;
                --rest;
            }
        }
        printf("%lld\n",ans);
    }
    void IsMyWife()
    {
        if (0)
        {
            freopen("","r",stdin);
            freopen("","w",stdout);
        }
        Input();
        Soviet();
    }
    #undef int //long long
};
int main()
{
    Flandle_Scarlet::IsMyWife();
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void Flandle_Scarlet::Input()’:
./Main.cpp:50:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld",&n,&q);
                                ^
./Main.cpp:55:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%lld%lld%lld",&u,&v,&w);
                                           ^
./Main.cpp: In function ‘void Flandle_Scarlet::IsMyWife()’:
./Main.cpp:96:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
             freopen("","r",stdin);
                                  ^
./Main.cpp:97:35: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
             freopen("","w",stdout);
                      ...

Judge Result