제출 #363021

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
363021		casperwang	Ideal city (IOI12_city)	C++14	32 / 100	1062 ms	4076 KiB

city

#include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
#define debug(args...) kout("[ + " string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MOD = 1000000000;
const int MAXN = 100000;
vector <int> path[MAXN+1];

ll BFS(int s, int N) {
  vector <int> dis(N, MOD);
  dis[s] = 0;
  queue <int> nxt;
  nxt.push(s);
  while (nxt.size()) {
    int now = nxt.front();
    nxt.pop();
    for (int i : path[now]) {
      if (dis[i] == MOD) {
        dis[i] = dis[now] + 1;
        nxt.push(i);
      }
    }
  }
  ll sum = 0;
  for (int i = s+1; i < N; i++)
    sum += dis[i];
  return sum;
}

void init(int N) {
  for (int i = 0; i < N; i++)
    path[i].clear();
}

int DistanceSum(int N, int *X, int *Y) {
  init(N);
  ll ans = 0;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      if (i == j) continue;
      if (abs(X[i]-X[j])+abs(Y[i]-Y[j]) <= 1) {
        path[i].pb(j);
        path[j].pb(i);
      }
    }
  }
  for (int i = 0; i < N; i++)
    ans = (ans + BFS(i, N)) % MOD;
  return ans;
}

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