Submission #62413

#	Time	Username	Problem	Language	Result	Execution time	Memory
62413		theknife2001	Ideal city (IOI12_city)	C++17	11 / 100	1080 ms	12724 KiB

city

#include <bits/stdc++.h>

using namespace std;
const int N=2005;
int dist[N][N];
map < pair < int , int > , int > mp;
int mx[]={ 0, 0,-1,+1};
int my[]={-1,+1, 0, 0};
int n;

void bfs(int s,int *X,int *Y)
{
    for(int i=0;i<n;i++)
        dist[s][i]=1e9+55;
    dist[s][s]=0;
    queue < int > q;
    q.push(s);
    int u ,c ,v;
    int x,y;
    while(q.size())
    {
        u=q.front();
        c=dist[s][u];
        q.pop();
        for(int i=0;i<4;i++)
        {
            x=mx[i]+X[u];
            y=my[i]+Y[u];
            v=mp[{x,y}];
            if(v==0)
                continue;
            v--;
            if(dist[s][v]>c+1)
            {
                dist[s][v]=c+1;
                q.push(v);
            }
        }
    }
}

int DistanceSum(int N, int *X, int *Y) {

  n=N;
  long long ans=0;
  int m=1e9;
  for(int i=0;i<n;i++)
  {
      mp[{X[i],Y[i]}]=i+1;
  }
  for(int i=0;i<n;i++)
    bfs(i,X,Y);
  for(int i=0;i<n;i++)
  {
    for(int j=i+1;j<n;j++)
    {
        ans+=dist[i][j];
        ans%=m;
    }
  }
  int ret=ans;
  return ret;

}

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