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

提出ソース

結果

問題	No.1254 補強への架け橋
ユーザー	ei1333333
提出日時	2021-04-18 02:23:16
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	109 ms / 2,000 ms
コード長	6,625 bytes
コンパイル時間	2,939 ms
コンパイル使用メモリ	230,412 KB
実行使用メモリ	26,016 KB
最終ジャッジ日時	2024-07-04 04:24:41
合計ジャッジ時間	14,459 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	1 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	2 ms 5,376 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	AC	2 ms 5,376 KB
testcase_20	AC	2 ms 5,376 KB
testcase_21	AC	2 ms 5,376 KB
testcase_22	AC	2 ms 5,376 KB
testcase_23	AC	2 ms 5,376 KB
testcase_24	AC	2 ms 5,376 KB
testcase_25	AC	2 ms 5,376 KB
testcase_26	AC	2 ms 5,376 KB
testcase_27	AC	2 ms 5,376 KB
testcase_28	AC	2 ms 5,376 KB
testcase_29	AC	2 ms 5,376 KB
testcase_30	AC	2 ms 5,376 KB
testcase_31	AC	2 ms 5,376 KB
testcase_32	AC	2 ms 5,376 KB
testcase_33	AC	2 ms 5,376 KB
testcase_34	AC	2 ms 5,376 KB
testcase_35	AC	2 ms 5,376 KB
testcase_36	AC	2 ms 5,376 KB
testcase_37	AC	2 ms 5,376 KB
testcase_38	AC	2 ms 5,376 KB
testcase_39	AC	2 ms 5,376 KB
testcase_40	AC	2 ms 5,376 KB
testcase_41	AC	2 ms 5,376 KB
testcase_42	AC	2 ms 5,376 KB
testcase_43	AC	3 ms 5,376 KB
testcase_44	AC	2 ms 5,376 KB
testcase_45	AC	2 ms 5,376 KB
testcase_46	AC	2 ms 5,376 KB
testcase_47	AC	2 ms 5,376 KB
testcase_48	AC	2 ms 5,376 KB
testcase_49	AC	2 ms 5,376 KB
testcase_50	AC	2 ms 5,376 KB
testcase_51	AC	2 ms 5,376 KB
testcase_52	AC	2 ms 5,376 KB
testcase_53	AC	2 ms 5,376 KB
testcase_54	AC	3 ms 5,376 KB
testcase_55	AC	2 ms 5,376 KB
testcase_56	AC	2 ms 5,376 KB
testcase_57	AC	2 ms 5,376 KB
testcase_58	AC	2 ms 5,376 KB
testcase_59	AC	2 ms 5,376 KB
testcase_60	AC	2 ms 5,376 KB
testcase_61	AC	2 ms 5,376 KB
testcase_62	AC	2 ms 5,376 KB
testcase_63	AC	9 ms 5,504 KB
testcase_64	AC	4 ms 5,376 KB
testcase_65	AC	6 ms 5,376 KB
testcase_66	AC	5 ms 5,376 KB
testcase_67	AC	3 ms 5,376 KB
testcase_68	AC	6 ms 5,376 KB
testcase_69	AC	7 ms 5,376 KB
testcase_70	AC	5 ms 5,376 KB
testcase_71	AC	3 ms 5,376 KB
testcase_72	AC	7 ms 5,376 KB
testcase_73	AC	4 ms 5,376 KB
testcase_74	AC	6 ms 5,376 KB
testcase_75	AC	6 ms 5,376 KB
testcase_76	AC	3 ms 5,376 KB
testcase_77	AC	5 ms 5,376 KB
testcase_78	AC	8 ms 5,376 KB
testcase_79	AC	8 ms 5,376 KB
testcase_80	AC	7 ms 5,376 KB
testcase_81	AC	9 ms 5,376 KB
testcase_82	AC	8 ms 5,376 KB
testcase_83	AC	84 ms 23,712 KB
testcase_84	AC	77 ms 19,072 KB
testcase_85	AC	48 ms 14,360 KB
testcase_86	AC	75 ms 20,068 KB
testcase_87	AC	75 ms 19,344 KB
testcase_88	AC	12 ms 6,528 KB
testcase_89	AC	90 ms 20,620 KB
testcase_90	AC	51 ms 14,120 KB
testcase_91	AC	39 ms 12,340 KB
testcase_92	AC	20 ms 8,960 KB
testcase_93	AC	64 ms 18,176 KB
testcase_94	AC	66 ms 18,560 KB
testcase_95	AC	61 ms 18,432 KB
testcase_96	AC	81 ms 23,544 KB
testcase_97	AC	32 ms 10,096 KB
testcase_98	AC	77 ms 18,540 KB
testcase_99	AC	46 ms 15,616 KB
testcase_100	AC	86 ms 24,772 KB
testcase_101	AC	19 ms 7,680 KB
testcase_102	AC	10 ms 6,016 KB
testcase_103	AC	21 ms 8,448 KB
testcase_104	AC	27 ms 10,624 KB
testcase_105	AC	61 ms 17,532 KB
testcase_106	AC	36 ms 12,672 KB
testcase_107	AC	85 ms 25,416 KB
testcase_108	AC	86 ms 20,812 KB
testcase_109	AC	71 ms 17,464 KB
testcase_110	AC	58 ms 17,084 KB
testcase_111	AC	64 ms 16,808 KB
testcase_112	AC	27 ms 9,472 KB
testcase_113	AC	58 ms 17,792 KB
testcase_114	AC	36 ms 13,056 KB
testcase_115	AC	13 ms 6,400 KB
testcase_116	AC	43 ms 14,464 KB
testcase_117	AC	28 ms 10,148 KB
testcase_118	AC	74 ms 21,436 KB
testcase_119	AC	45 ms 15,488 KB
testcase_120	AC	71 ms 22,364 KB
testcase_121	AC	22 ms 8,448 KB
testcase_122	AC	40 ms 14,080 KB
testcase_123	AC	2 ms 5,376 KB
testcase_124	AC	101 ms 26,016 KB
testcase_125	AC	109 ms 26,008 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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 Namori-Graph
 * @docs docs/namori-graph.md
 */
template< typename T = int >
struct NamoriGraph : Graph< T > {
public:
  using Graph< T >::Graph;
  using Graph< T >::g;

  vector< Graph< T > > forest;
  Edges< T > loop_edges;

  struct Info {
    int forest_id, id;
  };

  Info operator[](const int &k) const {
    return (Info) {mark_id[k], id[k]};
  }

  int inv(int forest_id, int k) {
    return iv[forest_id][k];
  }

  size_t loop_size() {
    return forest.size();
  }

  void build() {
    int n = (int) g.size();
    vector< int > deg(n), used(n);
    queue< int > que;
    for(int i = 0; i < n; i++) {
      deg[i] = (int) g[i].size();
      if(deg[i] == 1) {
        que.emplace(i);
        used[i] = true;
      }
    }
    while(not que.empty()) {
      int idx = que.front();
      que.pop();
      for(auto &e : g[idx]) {
        if(used[e.to]) {
          continue;
        }
        --deg[e.to];
        if(deg[e.to] == 1) {
          que.emplace(e.to);
          used[e.to] = true;
        }
      }
    }
    int mx = 0;
    for(auto &edges : g) {
      for(auto &e : edges) mx = max(mx, e.idx);
    }
    vector< int > edge_used(mx + 1);
    vector< int > loop;
    for(int v = 0; v < n; v++) {
      if(!used[v]) {
        for(bool update = true; update;) {
          update = false;
          loop.emplace_back(v);
          for(auto &e : g[v]) {
            if(used[e.to] or edge_used[e.idx]) {
              continue;
            }
            edge_used[e.idx] = true;
            loop_edges.emplace_back(loop.size() - 1, loop.size(), e.cost, e.idx);
            v = e.to;
            update = true;
            break;
          }
        }
        break;
      }
    }
    loop.pop_back();
    loop_edges.back().to = 0;
    mark_id.resize(n);
    id.resize(n);
    int ptr = 0;
    for(int i = 0; i < (int) loop.size(); i++) {
      int pre = loop[(i + loop.size() - 1) % loop.size()];
      int nxt = loop[(i + 1) % loop.size()];
      int sz = 0;
      mark_id[loop[i]] = ptr;
      iv.emplace_back();
      id[loop[i]] = sz++;
      iv.back().emplace_back(loop[i]);
      for(auto &e : g[loop[i]]) {
        if(e.to != pre and e.to != nxt) {
          mark_dfs(e.to, loop[i], ptr, sz);
        }
      }
      Graph< T > tree(sz);
      for(auto &e : g[loop[i]]) {
        if(e.to != pre and e.to != nxt) {
          tree.g[id[loop[i]]].emplace_back(id[loop[i]], id[e.to], e.cost, e.idx);
          tree.g[id[e.to]].emplace_back(id[e.to], id[loop[i]], e.cost, e.idx);
          build_dfs(e.to, loop[i], tree);
        }
      }
      forest.emplace_back(tree);
    }
  }

private:
  vector< vector< int > > iv;
  vector< int > mark_id, id;

  void mark_dfs(int idx, int par, int k, int &l) {
    mark_id[idx] = k;
    id[idx] = l++;
    iv.back().emplace_back(idx);
    for(auto &e : g[idx]) {
      if(e.to != par) {
        mark_dfs(e.to, idx, k, l);
      }
    }
  }

  void build_dfs(int idx, int par, Graph< T > &tree) {
    for(auto &e : g[idx]) {
      if(e.to != par) {
        tree.g[id[idx]].emplace_back(id[idx], id[e.to], e.cost, e.idx);
        tree.g[id[e.to]].emplace_back(id[e.to], id[idx], e.cost, e.idx);
        build_dfs(e.to, idx, tree);
      }
    }
  }
};

int main() {
  int N;
  cin >> N;
  NamoriGraph< int > g(N);
  g.read(N);
  g.build();
  vector< int > ans;
  for(auto &e : g.loop_edges) {
    ans.emplace_back(e.idx + 1);
  }
  sort(begin(ans), end(ans));
  cout << ans.size() << "\n";
  cout << ans << "\n";
}

yukicoder

結果

テストケース

ソースコード