제출 #557644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
557644		iancu	도시들 (IOI15_towns)	C++14	49 / 100	20 ms	396 KiB

towns

#include "towns.h"
#include <vector>
#include <map>

using namespace std;

class DSU {
private:
  vector<int> par;
  map<int, int> poz;
  map<pair<int, int>, bool> disjoint;
public:
  DSU(const vector<int>& v) {
    for (int i = 0; i < v.size(); ++i)
      poz[v[i]] = i;
    for (int i = 0; i < v.size(); ++i)
      par.push_back(i);
  }
  int getRoot(int x) {
    if (x == par[x])
      return x;
    return par[x] = getRoot(par[x]);
  }
  bool query(int a, int b) {
    a = poz[a], b = poz[b];
    int ra = getRoot(a);
    int rb = getRoot(b);
    if (ra != rb) {
      disjoint[{a, b}] = true;
      return false;
    }
    return true;
  }
  void join(int a, int b) {
    a = poz[a], b = poz[b];
    int ra = getRoot(a);
    int rb = getRoot(b);
    par[ra] = rb;
  }
  bool check_disjoint(int a, int b) {
    a = poz[a], b = poz[b];
    return disjoint[{a, b}];
  }
};

int hubDistance(int N, int sub) {
  vector<vector<int>> dist(N, vector<int>(N, -1));
  auto getDist = [&dist](int a, int b) {
    if (dist[a][b] == -1)
      dist[a][b] = dist[b][a] = getDistance(a, b);
    return dist[a][b];
  };
  int D1, D2, dist_max = 0;
  for (int i = 1; i < N; ++i)
    if (getDist(0, i) > dist_max) {
      dist_max = getDist(0, i);
      D1 = i;
    }
  dist_max = 0;
  for (int i = 0; i < N; ++i)
    if (i != D1 && getDist(D1, i) > dist_max) {
      dist_max = getDist(D1, i);
      D2 = i;
    }
  int R = getDist(D1, D2);
  for (int i = 0; i < N; ++i)
    if (i != D1 && i != 0) {
      int dist_i = (getDist(i, D1) - getDist(i, 0) + getDist(D1, 0)) / 2;
      R = min(R, max(dist_i, getDist(D1, D2) - dist_i));
    }
  vector<int> leaves1, leaves2;
  int cnt1 = 0, cnt2 = 0;
  int st = 0, dr = 0;
  for (int i = 0; i < N; ++i) {
      int dist_i = (getDist(i, D1) - getDist(i, 0) + getDist(D1, 0)) / 2;
      if (R == max(dist_i, getDist(D1, D2) - dist_i)) {
        if (R == dist_i) {
          ++cnt1;
          leaves1.push_back(i);
        } else {
          ++cnt2;
          leaves2.push_back(i);
        }
      } else if (dist_i < getDist(D1, D2) - dist_i) {
        ++st;
      } else {
        ++dr;
      }
    }
  if (st > N / 2 || dr > N / 2)
    return -R;
  int R_init = R;
  vector<int> leaves;
  if (leaves1.size() > leaves2.size()) {
    leaves = leaves1;
  } else {
    leaves = leaves2;
    R = getDist(D1, D2) - R;
  }
  auto sameSubtree = [&dist, &D1, &D2, &getDist, &R](int a, int b) {
    int dist_lca = (getDist(a, D1) + getDist(b, D1) - getDist(a, b)) / 2;
    if (dist_lca <= R)
      return false;
    return true;
  };
  if (leaves.empty())
    return R_init;
  DSU dsu(leaves);
  vector<int> cand = leaves;
  int fin = leaves.back();
  while (!cand.empty()) {
    vector<int> new_cand;
    for (int i = 0; i < cand.size(); i += 2) {
      if (i < cand.size() - 1) {
        if (sameSubtree(cand[i], cand[i + 1])) {
          dsu.join(cand[i], cand[i + 1]);
          new_cand.push_back(cand[i]);
        }
      } else {
        fin = cand[i];
      }
    }
    cand = new_cand;
  }
  int ap = 0;
  for (auto i: leaves) {
    if (dsu.check_disjoint(fin, i))
      continue;
    if (dsu.query(fin, i) || sameSubtree(fin, i))
      ++ap;
  }
  if (ap > N / 2)
    return -R_init;
  return R_init;
}

컴파일 시 표준 에러 (stderr) 메시지

towns.cpp: In constructor 'DSU::DSU(const std::vector<int>&)':
towns.cpp:14:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for (int i = 0; i < v.size(); ++i)
      |                     ~~^~~~~~~~~~
towns.cpp:16:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for (int i = 0; i < v.size(); ++i)
      |                     ~~^~~~~~~~~~
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:113:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for (int i = 0; i < cand.size(); i += 2) {
      |                     ~~^~~~~~~~~~~~~
towns.cpp:114:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |       if (i < cand.size() - 1) {
      |           ~~^~~~~~~~~~~~~~~~~
towns.cpp:46:28: warning: unused parameter 'sub' [-Wunused-parameter]
   46 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~
towns.cpp:49:15: warning: 'D1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   49 |     if (dist[a][b] == -1)
      |               ^
towns.cpp:50:44: warning: 'D2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   50 |       dist[a][b] = dist[b][a] = getDistance(a, b);
      |                                 ~~~~~~~~~~~^~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 0 / 12
• Subtask 3: 13 / 13
• Subtask 4: 10 / 10
• Subtask 5: 13 / 13
• Subtask 6: 0 / 39