제출 #348410

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348410		daniel920712	Ideal city (IOI12_city)	C++14	55 / 100	274 ms	4332 KiB

city

#include <map>
#include <utility>
#include <queue>
#include <algorithm>
using namespace std;
vector < int > Next[100005];
int con[100005];
map < pair < int , int > , int > where;
int MOD=1000000000;
queue < pair < int , int > > BFS;
int DistanceSum(int N, int *X, int *Y)
{
    int ans=0,x=0,y=0,i,j;
    if(N<=2000)
    {
        for(i=0;i<N;i++) where[make_pair(X[i],Y[i])]=i;
        for(i=0;i<N;i++)
        {
            if(where.find(make_pair(X[i]+1,Y[i]))!=where.end()) Next[i].push_back(where[make_pair(X[i]+1,Y[i])]);
            if(where.find(make_pair(X[i]-1,Y[i]))!=where.end()) Next[i].push_back(where[make_pair(X[i]-1,Y[i])]);
            if(where.find(make_pair(X[i],Y[i]+1))!=where.end()) Next[i].push_back(where[make_pair(X[i],Y[i]+1)]);
            if(where.find(make_pair(X[i],Y[i]-1))!=where.end()) Next[i].push_back(where[make_pair(X[i],Y[i]-1)]);
        }
        for(i=0;i<N;i++)
        {
            for(j=0;j<N;j++) con[j]=-1;
            BFS.push(make_pair(i,0));
            while(!BFS.empty())
            {
                x=BFS.front().first;
                y=BFS.front().second;
                BFS.pop();
                if(con[x]!=-1) continue;
                con[x]=y;
                if(i<x)
                {
                    ans+=y;
                    if(ans>MOD) ans-=MOD;
                }
                for(auto k:Next[x]) BFS.push(make_pair(k,y+1));
            }
        }
    }
    else
    {
        sort(X,X+N);
        sort(Y,Y+N);
        for(i=0;i<N;i++)
        {
            ans+=(int) ((long long) X[i]*(long long) i%MOD);
            ans%=MOD;
            ans-=x;
            ans+=MOD;
            ans%=MOD;

            ans+=(int) ((long long) Y[i]*(long long) i%MOD);
            ans%=MOD;
            ans-=y;
            ans+=MOD;
            ans%=MOD;

            x=(int)(((long long) x+(long long) X[i])%MOD);
            y=(int)(((long long) y+(long long) Y[i])%MOD);
        }
    }

    return ans;

}

• Subtask 1: 11 / 11
• Subtask 2: 21 / 21
• Subtask 3: 23 / 23
• Subtask 4: 0 / 45