結果

問題 No.2286 Join Hands
コンテスト
ユーザー risujiroh
提出日時 2023-04-28 22:36:53
言語 C++23
(gcc 15.2.0 + boost 1.89.0)
コンパイル:
g++-15 -O2 -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,680 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 3,249 ms
コンパイル使用メモリ 334,864 KB
最終ジャッジ日時 2026-05-12 15:26:31
合計ジャッジ時間 4,037 ms
ジャッジサーバーID
（参考情報） 		judge3_1 / judge1_1
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
In file included from main.cpp:113:
main.cpp: In function 'void std::ranges::views::solve()':
main.cpp:25:8: error: no matching function for call to 'print(int)'
   25 |   print(x * 2 - n);
      |   ~~~~~^~~~~~~~~~~
main.cpp:25:8: note: there are 3 candidates
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/istream:43,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/sstream:42,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/complex:50,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/x86_64-pc-linux-gnu/bits/stdc++.h:141,
                 from main.cpp:30:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ostream:259:5: note: candidate 1: 'template<class ... _Args> void std::print(ostream&, format_string<_Args ...>, _Args&& ...)'
  259 |     print(ostream& __os, format_string<_Args...> __fmt, _Args&&... __args)
      |     ^~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ostream:259:5: note: candidate expects at least 2 arguments, 1 provided
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/x86_64-pc-linux-gnu/bits/stdc++.h:231:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/print:106:5: note: candidate 2: 'template<class ... _Args> void std::print(FILE*, format_string<_Args ...>, _Args&& ...)'
  106 |     print(FILE* __stream, format_string<_Args...> __fmt, _Args&&... __args)
      |     ^~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/print:106:5: note: candidate expects at least 2 arguments, 1 provided
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/print:117:5: note: candidate 3: 'void std::print(format_string<_Args ...>, _Args&& ...) [with _Args = {}; format_string<_Args ...> = basic_format_string<char>]'
  117 |     print(format_string<_Args...> __fmt, _Args&&... __args)
      |     ^~~~~
/home/linuxbrew/.li

ソースコード

diff #
raw source code 

#if __INCLUDE_LEVEL__

void solve() {
  auto [n, m] = input<int, int>();
  int S = n + n;
  int T = S + 1;
  atcoder::mf_graph<int> g(T + 1);
  set<int> s;
  while (m--) {
    auto [u, v] = input<int, 2>();
    --u;
    --v;
    assert(u < v);
    g.add_edge(u, n + v, 1);
    g.add_edge(v, n + u, 1);
    s.insert(u);
    s.insert(v);
  }
  for (v : iota(0, n)) {
    g.add_edge(S, v, 1);
    g.add_edge(n + v, T, 1);
  }
  int x = g.flow(S, T);
  x -= x == n - 1 && ssize(s) < n;
  print(x * 2 - n);
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

#include <atcoder/maxflow>

namespace std {

template <class T>
auto operator>>(istream& is, T&& t) -> decltype(tuple_cat(t), is) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class T>
auto operator<<(ostream& os, T&& t) -> decltype(tuple_cat(t), os) {
  auto f = [&os](auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (auto&& e : v) {
    is >> e;
  }
  return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  static constexpr auto SEP = is_convertible_v<int, T> ? " " : "\n";
  for (auto sep = ""; const auto& e : v) {
    os << exchange(sep, SEP) << e;
  }
  return os;
}

}  // namespace std

template <class... Ts, class... Args>
auto input(Args&&... args) {
  if constexpr (sizeof...(Ts) == 0) {
    static_assert(sizeof...(Args) == 0);
    return input<int>();
  } else if constexpr (1 < sizeof...(Ts)) {
    static_assert(sizeof...(Args) == 0);
    return input<std::tuple<Ts...>>();
  } else {
    using T = std::tuple_element_t<0, std::tuple<Ts...>>;
    if constexpr (sizeof...(args)) {
      T x(std::forward<Args>(args)...);
      std::cin >> x;
      return x;
    } else {
      T x;
      std::cin >> x;
      return x;
    }
  }
}

template <class T, int N>
std::array<T, N> input() {
  return input<std::array<T, N>>();
}

template <class... Ts>
void print(Ts&&... xs) {
  std::cout << std::tie(xs...) << '\n';
}

using namespace std;

#define show(...) static_cast<void>(0)
#define for(...) for ([[maybe_unused]] auto&& __VA_ARGS__)
#define lambda(...) [&](auto&&... args) { return __VA_ARGS__; }
#define $1 get<0>(tie(args...))
#define $2 get<1>(tie(args...))
#define ALL(f, r, ...) lambda(f(begin($1), end($1), ##__VA_ARGS__))(r)

namespace std::ranges::views {

#include __BASE_FILE__

}  // namespace std::ranges::views

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  views::solve();
}

#endif  // __INCLUDE_LEVEL__
0