#563981 (C++17) No.1254 補強への架け橋

• 問題: No.1254 補強への架け橋
• ユーザー: ei1333333
• 提出日時: 2020-10-09 21:24:35
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 93 ms / 2,000 ms
• コード長: 4,724 bytes
• コンパイル時間: 2,193 ms
• コンパイル使用メモリ: 208,544 KB
• 実行使用メモリ: 22,288 KB
• 最終ジャッジ日時: 2023-09-27 14:13:24
• 合計ジャッジ時間: 12,916 ms
• ジャッジサーバーID （参考情報）: judge14 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,376 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	1 ms; 4,380 KB
testcase_03	AC	1 ms; 4,376 KB
testcase_04	AC	2 ms; 4,376 KB
testcase_05	AC	2 ms; 4,380 KB
testcase_06	AC	2 ms; 4,376 KB
testcase_07	AC	1 ms; 4,376 KB
testcase_08	AC	2 ms; 4,376 KB
testcase_09	AC	2 ms; 4,376 KB
testcase_10	AC	2 ms; 4,376 KB
testcase_11	AC	2 ms; 4,380 KB
testcase_12	AC	1 ms; 4,376 KB
testcase_13	AC	2 ms; 4,376 KB
testcase_14	AC	2 ms; 4,380 KB
testcase_15	AC	1 ms; 4,376 KB
testcase_16	AC	1 ms; 4,380 KB
testcase_17	AC	1 ms; 4,376 KB
testcase_18	AC	1 ms; 4,376 KB
testcase_19	AC	1 ms; 4,376 KB
testcase_20	AC	1 ms; 4,376 KB
testcase_21	AC	2 ms; 4,376 KB
testcase_22	AC	2 ms; 4,376 KB
testcase_23	AC	1 ms; 4,376 KB
testcase_24	AC	1 ms; 4,376 KB
testcase_25	AC	1 ms; 4,380 KB
testcase_26	AC	2 ms; 4,380 KB
testcase_27	AC	2 ms; 4,380 KB
testcase_28	AC	2 ms; 4,376 KB
testcase_29	AC	1 ms; 4,376 KB
testcase_30	AC	2 ms; 4,376 KB
testcase_31	AC	2 ms; 4,376 KB
testcase_32	AC	1 ms; 4,376 KB
testcase_33	AC	1 ms; 4,376 KB
testcase_34	AC	2 ms; 4,380 KB
testcase_35	AC	2 ms; 4,380 KB
testcase_36	AC	1 ms; 4,380 KB
testcase_37	AC	2 ms; 4,380 KB
testcase_38	AC	1 ms; 4,380 KB
testcase_39	AC	1 ms; 4,376 KB
testcase_40	AC	1 ms; 4,384 KB
testcase_41	AC	2 ms; 4,376 KB
testcase_42	AC	2 ms; 4,376 KB
testcase_43	AC	2 ms; 4,380 KB
testcase_44	AC	2 ms; 4,380 KB
testcase_45	AC	2 ms; 4,380 KB
testcase_46	AC	2 ms; 4,380 KB
testcase_47	AC	2 ms; 4,380 KB
testcase_48	AC	2 ms; 4,380 KB
testcase_49	AC	2 ms; 4,376 KB
testcase_50	AC	2 ms; 4,376 KB
testcase_51	AC	2 ms; 4,376 KB
testcase_52	AC	2 ms; 4,380 KB
testcase_53	AC	2 ms; 4,380 KB
testcase_54	AC	2 ms; 4,380 KB
testcase_55	AC	2 ms; 4,380 KB
testcase_56	AC	2 ms; 4,380 KB
testcase_57	AC	2 ms; 4,376 KB
testcase_58	AC	2 ms; 4,380 KB
testcase_59	AC	2 ms; 4,376 KB
testcase_60	AC	2 ms; 4,376 KB
testcase_61	AC	2 ms; 4,380 KB
testcase_62	AC	2 ms; 4,376 KB
testcase_63	AC	6 ms; 4,376 KB
testcase_64	AC	2 ms; 4,380 KB
testcase_65	AC	5 ms; 4,376 KB
testcase_66	AC	4 ms; 4,380 KB
testcase_67	AC	2 ms; 4,380 KB
testcase_68	AC	4 ms; 4,380 KB
testcase_69	AC	5 ms; 4,376 KB
testcase_70	AC	3 ms; 4,376 KB
testcase_71	AC	3 ms; 4,376 KB
testcase_72	AC	5 ms; 4,376 KB
testcase_73	AC	3 ms; 4,376 KB
testcase_74	AC	4 ms; 4,376 KB
testcase_75	AC	4 ms; 4,380 KB
testcase_76	AC	2 ms; 4,376 KB
testcase_77	AC	3 ms; 4,376 KB
testcase_78	AC	5 ms; 4,376 KB
testcase_79	AC	6 ms; 4,456 KB
testcase_80	AC	5 ms; 4,376 KB
testcase_81	AC	5 ms; 4,376 KB
testcase_82	AC	5 ms; 4,380 KB
testcase_83	AC	54 ms; 13,548 KB
testcase_84	AC	58 ms; 13,328 KB
testcase_85	AC	28 ms; 9,264 KB
testcase_86	AC	52 ms; 12,268 KB
testcase_87	AC	51 ms; 12,908 KB
testcase_88	AC	8 ms; 4,636 KB
testcase_89	AC	56 ms; 13,544 KB
testcase_90	AC	32 ms; 9,888 KB
testcase_91	AC	24 ms; 8,300 KB
testcase_92	AC	13 ms; 5,828 KB
testcase_93	AC	47 ms; 11,956 KB
testcase_94	AC	36 ms; 11,244 KB
testcase_95	AC	36 ms; 11,284 KB
testcase_96	AC	56 ms; 12,988 KB
testcase_97	AC	22 ms; 7,884 KB
testcase_98	AC	49 ms; 13,196 KB
testcase_99	AC	28 ms; 9,072 KB
testcase_100	AC	56 ms; 13,860 KB
testcase_101	AC	12 ms; 5,756 KB
testcase_102	AC	7 ms; 4,400 KB
testcase_103	AC	14 ms; 5,852 KB
testcase_104	AC	20 ms; 7,352 KB
testcase_105	AC	40 ms; 12,208 KB
testcase_106	AC	23 ms; 7,984 KB
testcase_107	AC	61 ms; 13,612 KB
testcase_108	AC	51 ms; 13,476 KB
testcase_109	AC	44 ms; 11,908 KB
testcase_110	AC	38 ms; 11,276 KB
testcase_111	AC	41 ms; 11,924 KB
testcase_112	AC	19 ms; 6,660 KB
testcase_113	AC	38 ms; 10,392 KB
testcase_114	AC	22 ms; 7,964 KB
testcase_115	AC	8 ms; 4,884 KB
testcase_116	AC	26 ms; 8,616 KB
testcase_117	AC	18 ms; 7,092 KB
testcase_118	AC	59 ms; 13,096 KB
testcase_119	AC	29 ms; 9,096 KB
testcase_120	AC	50 ms; 12,704 KB
testcase_121	AC	15 ms; 6,152 KB
testcase_122	AC	25 ms; 8,744 KB
testcase_123	AC	2 ms; 4,376 KB
testcase_124	AC	93 ms; 22,288 KB
testcase_125	AC	78 ms; 22,284 KB

ソースコード

#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
//const int mod = 998244353;

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 {
  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)};
}

template< typename T = int >
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template< typename T = int >
struct Graph {
  vector< vector< Edge< T > > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  size_t size() const {
    return g.size();
  }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false, bool directed = false) {
    for(int i = 0; i < M; i++) {
      int a, b;
      cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if(weighted) cin >> c;
      if(directed) add_directed_edge(a, b, c);
      else add_edge(a, b, c);
    }
  }
};

template< typename T = int >
using Edges = vector< Edge< T > >;

/**
 * @brief Low-Link
 * @see http://kagamiz.hatenablog.com/entry/2013/10/05/005213
 */
template< typename T = int >
struct LowLink : Graph< T > {
public:
  using Graph< T >::Graph;
  vector< int > ord, low, articulation;
  vector< Edge< T > > bridge;
  using Graph< T >::g;

  virtual void build() {
    used.assign(g.size(), 0);
    ord.assign(g.size(), 0);
    low.assign(g.size(), 0);
    int k = 0;
    for(int i = 0; i < (int) g.size(); i++) {
      if(!used[i]) k = dfs(i, k, -1);
    }
  }

  explicit LowLink(const Graph< T > &g) : Graph< T >(g) {}

private:
  vector< int > used;

  int dfs(int idx, int k, int par) {
    used[idx] = true;
    ord[idx] = k++;
    low[idx] = ord[idx];
    bool is_articulation = false, beet = false;
    int cnt = 0;
    for(auto &to : g[idx]) {
      if(to == par && !exchange(beet, true)) {
        continue;
      }
      if(!used[to]) {
        ++cnt;
        k = dfs(to, k, idx);
        low[idx] = min(low[idx], low[to]);
        is_articulation |= par >= 0 && low[to] >= ord[idx];
        if(ord[idx] < low[to]) bridge.emplace_back(to);
      } else {
        low[idx] = min(low[idx], ord[to]);
      }
    }
    is_articulation |= par == -1 && cnt > 1;
    if(is_articulation) articulation.push_back(idx);
    return k;
  }
};

int main() {
  int N;
  cin >> N;
  LowLink< int > g(N);
  g.read(N);
  g.build();
  vector< int > tap(N);
  for(auto &p : g.bridge) tap[p.idx] = true;
  vector< int > ans;
  for(int i = 0; i < N; i++) {
    if(!tap[i]) ans.emplace_back(i + 1);
  }
  cout << ans.size() << "\n";
  cout << ans << "\n";
}