結果

問題 No.1553 Lovely City
ユーザー stoqstoq
提出日時 2021-06-18 22:24:34
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 146 ms / 2,000 ms
コード長 5,701 bytes
コンパイル時間 2,560 ms
コンパイル使用メモリ 218,380 KB
実行使用メモリ 23,776 KB
最終ジャッジ日時 2023-09-04 23:36:16
合計ジャッジ時間 10,708 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
13,732 KB
testcase_01 AC 5 ms
13,588 KB
testcase_02 AC 36 ms
20,396 KB
testcase_03 AC 6 ms
13,564 KB
testcase_04 AC 6 ms
13,772 KB
testcase_05 AC 6 ms
13,644 KB
testcase_06 AC 6 ms
13,556 KB
testcase_07 AC 6 ms
13,828 KB
testcase_08 AC 87 ms
18,912 KB
testcase_09 AC 92 ms
19,148 KB
testcase_10 AC 108 ms
20,728 KB
testcase_11 AC 72 ms
18,288 KB
testcase_12 AC 113 ms
21,924 KB
testcase_13 AC 75 ms
18,680 KB
testcase_14 AC 79 ms
19,288 KB
testcase_15 AC 81 ms
18,844 KB
testcase_16 AC 99 ms
19,568 KB
testcase_17 AC 75 ms
19,364 KB
testcase_18 AC 138 ms
23,636 KB
testcase_19 AC 135 ms
23,776 KB
testcase_20 AC 138 ms
23,648 KB
testcase_21 AC 145 ms
22,648 KB
testcase_22 AC 146 ms
22,600 KB
testcase_23 AC 141 ms
23,760 KB
testcase_24 AC 144 ms
23,752 KB
testcase_25 AC 142 ms
23,684 KB
testcase_26 AC 142 ms
22,696 KB
testcase_27 AC 145 ms
23,724 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#pragma region Macros

#include <bits/stdc++.h>
using namespace std;

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
template <typename T>
using extset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename T>
using smaller_queue = priority_queue<T, vector<T>, greater<T>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr ld PI = acos(-1.0);
constexpr ld EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

// --------------------------------------

struct UnionFind
{
public:
  UnionFind() : _n(0) {}
  UnionFind(int n) : _n(n), parent_or_size(n, -1) {}

  int unite(int a, int b)
  {
    assert(0 <= a && a < _n);
    assert(0 <= b && b < _n);
    int x = root(a), y = root(b);
    if (x == y)
      return x;
    if (-parent_or_size[x] < -parent_or_size[y])
      swap(x, y);
    parent_or_size[x] += parent_or_size[y];
    parent_or_size[y] = x;
    return x;
  }

  bool same(int a, int b)
  {
    assert(0 <= a && a < _n);
    assert(0 <= b && b < _n);
    return root(a) == root(b);
  }

  int root(int a)
  {
    assert(0 <= a && a < _n);
    if (parent_or_size[a] < 0)
      return a;
    return parent_or_size[a] = root(parent_or_size[a]);
  }

  int size(int a)
  {
    assert(0 <= a && a < _n);
    return -parent_or_size[root(a)];
  }

  vector<vector<int>> groups()
  {
    vector<int> leader_buf(_n), group_size(_n);
    for (int i = 0; i < _n; i++)
    {
      leader_buf[i] = root(i);
      group_size[leader_buf[i]]++;
    }
    vector<vector<int>> result(_n);
    for (int i = 0; i < _n; i++)
    {
      result[i].reserve(group_size[i]);
    }
    for (int i = 0; i < _n; i++)
    {
      result[leader_buf[i]].push_back(i);
    }
    result.erase(
        remove_if(result.begin(), result.end(),
                  [&](const vector<int> &v) { return v.empty(); }),
        result.end());
    return result;
  }

private:
  int _n;
  vector<int> parent_or_size;
};

vector<int> E[200010];
int in[200010] = {};
vector<int> v[200010];
bool used[200010] = {};

void solve()
{
  int n, m;
  cin >> n >> m;

  UnionFind uf(n);
  rep(i, m)
  {
    int a, b;
    cin >> a >> b;
    a--, b--;
    E[a].push_back(b);
    in[b]++;
    uf.unite(a, b);
  }

  rep(i, n)
  {
    v[uf.root(i)].push_back(i);
  }

  vector<pii> ans;
  rep(r, n)
  {
    if (v[r].empty())
      continue;
    queue<int> que;
    for (auto t : v[r])
    {
      if (in[t] == 0)
      {
        que.push(t);
        used[t] = true;
      }
    }
    if (que.empty())
    {
      rep(i, v[r].size())
      {
        ans.push_back({v[r][i], v[r][(i + 1) % v[r].size()]});
      }
      continue;
    }
    vector<int> topo;
    while (!que.empty())
    {
      int q = que.front();
      que.pop();
      topo.push_back(q);
      for (auto to : E[q])
      {
        if (used[to]) // 閉路が存在
        {
          while (!que.empty())
            que.pop();
          break;
        }
        in[to]--;
        if (in[to] == 0)
        {
          used[to] = true;
          que.push(to);
        }
      }
    }
    if (topo.size() + 1 < v[r].size())
    {
      rep(i, v[r].size())
      {
        ans.push_back({v[r][i], v[r][(i + 1) % v[r].size()]});
      }
    }
    else
    {
      assert(topo.size() >= 1);
      rep(i, topo.size() - 1)
      {
        ans.push_back({topo[i], topo[i + 1]});
      }
    }
  }
  cout << ans.size() << "\n";
  for (auto [a, b] : ans)
    cout << a + 1 << " " << b + 1 << "\n";
}

int main()
{
  solve();
}
0