Luzhiled's Library

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub ei1333/library

:heavy_check_mark: test/verify/aoj-1254.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1254

#include "../../template/template.hpp"
#include "../../math/matrix/square-matrix.hpp"

#include "../../graph/others/chromatic-number.hpp"

const double EPS = 1e-10;

struct Point {
  double x, y;

  Point() {}

  Point(double x, double y) : x(x), y(y) {}

  Point operator+(Point p) { return Point(x + p.x, y + p.y); }

  Point operator-(Point p) { return Point(x - p.x, y - p.y); }

  Point operator*(double k) { return Point(x * k, y * k); }

  Point operator/(double k) { return Point(x / k, y / k); }
};

typedef Point Vector;
typedef vector< Point > Polygon;

double norm(Vector a) {
  return a.x * a.x + a.y * a.y;
}

double abs(Vector a) {
  return sqrt(norm(a));
}

double cross(Vector a, Vector b) {
  return a.x * b.y - a.y * b.x;
}

bool calc(Point a1, Point a2, Point b1, Point b2) {
  if(abs(cross(a2 - a1, b1 - a1)) > EPS) return 0;
  if(abs(cross(a2 - a1, b2 - a1)) > EPS) return 0;
  double ml = 0;
  ml = max(ml, abs(a1 - a2));
  ml = max(ml, abs(a1 - b1));
  ml = max(ml, abs(a1 - b2));
  ml = max(ml, abs(a2 - b1));
  ml = max(ml, abs(a2 - b2));
  ml = max(ml, abs(b1 - b2));
  return (ml + EPS < abs(a1 - a2) + abs(b1 - b2));
}

int main() {
  int n;
  while(cin >> n, n) {
    vector< Polygon > p(n);
    vector< string > name(n);
    map< string, int > m;
    for(int i = 0; i < n; i++) {
      cin >> name[i];
      if(!m.count(name[i])) {
        int k = m.size();
        m[name[i]] = k;
      }
      int x, y;
      while(cin >> x, ~x) {
        cin >> y;
        p[i].push_back(Point(x, y));
      }
    }

    SquareMatrix< bool, 10 > G{};
    for(int i = 0; i < n; i++) {
      for(int j = i + 1; j < n; j++) {
        if(name[i] == name[j]) continue;
        for(int k = 0; k < (int) p[i].size(); k++) {
          for(int l = 0; l < (int) p[j].size(); l++) {
            if(calc(p[i][k], p[i][(k + 1) % p[i].size()],
                    p[j][l], p[j][(l + 1) % p[j].size()])) {
              G[m[name[j]]][m[name[i]]] = true;
              G[m[name[i]]][m[name[j]]] = true;
            }
          }
        }
      }
    }
    cout << chromatic_number(G) << endl;
  }
}


#line 1 "test/verify/aoj-1254.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1254

#line 1 "template/template.hpp"
#include<bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};
 
template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}
#line 1 "math/matrix/square-matrix.hpp"
/**
 * @brief Square-Matrix(正方行列)
 */
template< class T, size_t N >
struct SquareMatrix {
  array< array< T, N >, N > A;

  SquareMatrix() : A{{}} {}

  size_t size() const { return N; }

  inline const array< T, N > &operator[](int k) const {
    return (A.at(k));
  }

  inline array< T, N > &operator[](int k) {
    return (A.at(k));
  }

  static SquareMatrix add_identity() {
    return SquareMatrix();
  }

  static SquareMatrix mul_identity() {
    SquareMatrix mat;
    for(size_t i = 0; i < N; i++) mat[i][i] = 1;
    return mat;
  }

  SquareMatrix &operator+=(const SquareMatrix &B) {
    for(size_t i = 0; i < N; i++) {
      for(size_t j = 0; j < N; j++) {
        (*this)[i][j] += B[i][j];
      }
    }
    return *this;
  }

  SquareMatrix &operator-=(const SquareMatrix &B) {
    for(size_t i = 0; i < N; i++) {
      for(size_t j = 0; j < N; j++) {
        (*this)[i][j] -= B[i][j];
      }
    }
    return *this;
  }

  SquareMatrix &operator*=(const SquareMatrix &B) {
    array< array< T, N >, N > C;
    for(size_t i = 0; i < N; i++) {
      for(size_t j = 0; j < N; j++) {
        for(size_t k = 0; k < N; k++) {
          C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]);
        }
      }
    }
    A.swap(C);
    return (*this);
  }

  SquareMatrix &operator^=(uint64_t k) {
    SquareMatrix B = SquareMatrix::mul_identity();
    while(k > 0) {
      if(k & 1) B *= *this;
      *this *= *this;
      k >>= 1LL;
    }
    A.swap(B.A);
    return *this;
  }

  SquareMatrix operator+(const SquareMatrix &B) const {
    return SquareMatrix(*this) += B;
  }

  SquareMatrix operator-(const SquareMatrix &B) const {
    return SquareMatrix(*this) -= B;
  }

  SquareMatrix operator*(const SquareMatrix &B) const {
    return SquareMatrix(*this) *= B;
  }

  SquareMatrix operator^(uint64_t k) const {
    return SquareMatrix(*this) ^= k;
  }

  friend ostream &operator<<(ostream &os, SquareMatrix &p) {
    for(int i = 0; i < N; i++) {
      os << "[";
      for(int j = 0; j < N; j++) {
        os << p[i][j] << (j + 1 == N ? "]\n" : ",");
      }
    }
    return os;
  }
};
#line 5 "test/verify/aoj-1254.test.cpp"

#line 2 "graph/others/chromatic-number.hpp"

/**
 * @brief Chromatic Number(彩色数)
 * 
 * @see https://www.slideshare.net/wata_orz/ss-12131479
 */
template< typename Matrix >
int chromatic_number(Matrix &g) {
  int N = (int) g.size();
  vector< int > es(N);
  for(int i = 0; i < (int) g.size(); i++) {
    for(int j = 0; j < (int) g.size(); j++) {
      if(g[i][j] != 0) es[i] |= 1 << j;
    }
  }
  vector< int > ind(1 << N);
  ind[0] = 1;
  for(int S = 1; S < (1 << N); S++) {
    int u = __builtin_ctz(S);
    ind[S] = ind[S ^ (1 << u)] + ind[(S ^ (1 << u)) & ~es[u]];
  }
  vector< int > cnt((1 << N) + 1);
  for(int i = 0; i < (1 << N); i++) {
    cnt[ind[i]] += __builtin_parity(i) ? -1 : 1;
  }
  vector< pair< unsigned, int > > hist;
  for(int i = 1; i <= (1 << N); i++) {
    if(cnt[i]) hist.emplace_back(i, cnt[i]);
  }
  constexpr int mods[] = {1000000007, 1000000011, 1000000021};
  int ret = N;
  for(int k = 0; k < 3; k++) {
    auto buf = hist;
    for(int c = 1; c < ret; c++) {
      int64_t sum = 0;
      for(auto&[i, x] : buf) {
        sum += (x = int64_t(x) * i % mods[k]);
      }
      if(sum % mods[k]) ret = c;
    }
  }
  return ret;
}
#line 7 "test/verify/aoj-1254.test.cpp"

const double EPS = 1e-10;

struct Point {
  double x, y;

  Point() {}

  Point(double x, double y) : x(x), y(y) {}

  Point operator+(Point p) { return Point(x + p.x, y + p.y); }

  Point operator-(Point p) { return Point(x - p.x, y - p.y); }

  Point operator*(double k) { return Point(x * k, y * k); }

  Point operator/(double k) { return Point(x / k, y / k); }
};

typedef Point Vector;
typedef vector< Point > Polygon;

double norm(Vector a) {
  return a.x * a.x + a.y * a.y;
}

double abs(Vector a) {
  return sqrt(norm(a));
}

double cross(Vector a, Vector b) {
  return a.x * b.y - a.y * b.x;
}

bool calc(Point a1, Point a2, Point b1, Point b2) {
  if(abs(cross(a2 - a1, b1 - a1)) > EPS) return 0;
  if(abs(cross(a2 - a1, b2 - a1)) > EPS) return 0;
  double ml = 0;
  ml = max(ml, abs(a1 - a2));
  ml = max(ml, abs(a1 - b1));
  ml = max(ml, abs(a1 - b2));
  ml = max(ml, abs(a2 - b1));
  ml = max(ml, abs(a2 - b2));
  ml = max(ml, abs(b1 - b2));
  return (ml + EPS < abs(a1 - a2) + abs(b1 - b2));
}

int main() {
  int n;
  while(cin >> n, n) {
    vector< Polygon > p(n);
    vector< string > name(n);
    map< string, int > m;
    for(int i = 0; i < n; i++) {
      cin >> name[i];
      if(!m.count(name[i])) {
        int k = m.size();
        m[name[i]] = k;
      }
      int x, y;
      while(cin >> x, ~x) {
        cin >> y;
        p[i].push_back(Point(x, y));
      }
    }

    SquareMatrix< bool, 10 > G{};
    for(int i = 0; i < n; i++) {
      for(int j = i + 1; j < n; j++) {
        if(name[i] == name[j]) continue;
        for(int k = 0; k < (int) p[i].size(); k++) {
          for(int l = 0; l < (int) p[j].size(); l++) {
            if(calc(p[i][k], p[i][(k + 1) % p[i].size()],
                    p[j][l], p[j][(l + 1) % p[j].size()])) {
              G[m[name[j]]][m[name[i]]] = true;
              G[m[name[i]]][m[name[j]]] = true;
            }
          }
        }
      }
    }
    cout << chromatic_number(G) << endl;
  }
}

Test cases

Env Name Status Elapsed Memory
g++ judge_data :heavy_check_mark: AC 10 ms 4 MB
clang++ judge_data :heavy_check_mark: AC 10 ms 4 MB
Back to top page