Submission #3012294

---

Source Code Expand

#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>

using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define LLIandI pair<long long int , int>
#define IandI pair<int,int>


int main(){
    int N;
    int X[100002],Y[100002];
    vector< pair<int,int> > edges[100002];//cost,town
    vector< pair<int,int> > Xsort;
    vector< pair<int,int> > Ysort;
    bool d[100002];
    scanf("%d",&N);
    rep(i,N){
        scanf("%d %d",&X[i],&Y[i]);
        Xsort.push_back(mp(X[i],i));
        Ysort.push_back(mp(Y[i],i));
        d[i]=false;
    }
    sort(Xsort.begin(),Xsort.end());
    sort(Ysort.begin(),Ysort.end());
    rep(i,N-1){
        //X,Yで隣同士のものに編を貼っていく
        edges[Xsort[i].second].push_back( mp( Xsort[i+1].first-Xsort[i].first , Xsort[i+1].second ) );
        edges[Xsort[i+1].second].push_back( mp( Xsort[i+1].first-Xsort[i].first , Xsort[i].second ) );
        edges[Ysort[i].second].push_back( mp( Ysort[i+1].first-Ysort[i].first , Ysort[i+1].second ) );
        edges[Ysort[i+1].second].push_back( mp( Ysort[i+1].first-Ysort[i].first , Ysort[i].second ) );
        
    }
    //plim  (dijkstraみたいな)
    priority_queue< IandI , vector<IandI >, greater< IandI > > que;//cost,nexttown
    que.push(mp(0,0) );
    long long int ans=0;
    while(!que.empty()){
        IandI p=que.top();que.pop();
        int town=p.second;int cost=p.first;
        if(d[town])continue;
        d[town]=true;ans+=cost;
        rep(i,edges[town].size()){
            que.push(mp(edges[town][i].first,edges[town][i].second) );
        }
    }
    printf("%lld\n",ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:23:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
                   ^
./Main.cpp:25:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&X[i],&Y[i]);
                                   ^

Judge Result