kyopro-lib

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

View on GitHub

:x: test/aoj/ITP2_11_B/main.asc.test.cpp

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP2_11_B"

#include <iostream>
#include <map>
#include <vector>
#include "Mylib/Bit/enumerate_supersets_asc.cpp"
#include "Mylib/IO/input_vector.cpp"

namespace hl = haar_lib;

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  int n, k;
  std::cin >> n >> k;

  int t = 0;
  for (auto b : hl::input_vector<int>(k)) {
    t |= 1 << b;
  }

  std::map<int, std::vector<int>> ans;
  hl::enumerate_supersets_asc(
      t, n,
      [&](int d) {
        ans[d];
        for (int i = 0; i < n; ++i) {
          if (d & (1 << i)) ans[d].push_back(i);
        }
        return true;
      });

  for (auto& [m, v] : ans) {
    std::cout << m << ":";
    for (auto x : v) std::cout << " " << x;
    std::cout << "\n";
  }

  return 0;
}
#line 1 "test/aoj/ITP2_11_B/main.asc.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP2_11_B"

#include <iostream>
#include <map>
#include <vector>
#line 2 "Mylib/Bit/enumerate_supersets_asc.cpp"

namespace haar_lib {
  template <typename Func>
  void enumerate_supersets_asc(int a, int n, const Func &f) {
    for (int t = a; t < (1 << n); t = (t + 1) | a) {
      if (not f(t)) break;
    }
  }
}  // namespace haar_lib
#line 4 "Mylib/IO/input_vector.cpp"

namespace haar_lib {
  template <typename T>
  std::vector<T> input_vector(int N) {
    std::vector<T> ret(N);
    for (int i = 0; i < N; ++i) std::cin >> ret[i];
    return ret;
  }

  template <typename T>
  std::vector<std::vector<T>> input_vector(int N, int M) {
    std::vector<std::vector<T>> ret(N);
    for (int i = 0; i < N; ++i) ret[i] = input_vector<T>(M);
    return ret;
  }
}  // namespace haar_lib
#line 8 "test/aoj/ITP2_11_B/main.asc.test.cpp"

namespace hl = haar_lib;

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  int n, k;
  std::cin >> n >> k;

  int t = 0;
  for (auto b : hl::input_vector<int>(k)) {
    t |= 1 << b;
  }

  std::map<int, std::vector<int>> ans;
  hl::enumerate_supersets_asc(
      t, n,
      [&](int d) {
        ans[d];
        for (int i = 0; i < n; ++i) {
          if (d & (1 << i)) ans[d].push_back(i);
        }
        return true;
      });

  for (auto& [m, v] : ans) {
    std::cout << m << ":";
    for (auto x : v) std::cout << " " << x;
    std::cout << "\n";
  }

  return 0;
}
Back to top page