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

提出ソース

結果

問題	No.1254 補強への架け橋
ユーザー	NyaanNyaan
提出日時	2020-10-09 21:51:22
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	118 ms / 2,000 ms
コード長	10,965 bytes
コンパイル時間	3,239 ms
コンパイル使用メモリ	313,328 KB
実行使用メモリ	27,612 KB
最終ジャッジ日時	2023-09-27 16:26:43
合計ジャッジ時間	13,409 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,384 KB
testcase_01	AC	1 ms 4,384 KB
testcase_02	AC	1 ms 4,380 KB
testcase_03	AC	2 ms 4,376 KB
testcase_04	AC	2 ms 4,380 KB
testcase_05	AC	2 ms 4,376 KB
testcase_06	AC	2 ms 4,380 KB
testcase_07	AC	2 ms 4,376 KB
testcase_08	AC	1 ms 4,376 KB
testcase_09	AC	1 ms 4,376 KB
testcase_10	AC	1 ms 4,380 KB
testcase_11	AC	1 ms 4,380 KB
testcase_12	AC	2 ms 4,376 KB
testcase_13	AC	1 ms 4,380 KB
testcase_14	AC	1 ms 4,376 KB
testcase_15	AC	1 ms 4,384 KB
testcase_16	AC	1 ms 4,380 KB
testcase_17	AC	1 ms 4,380 KB
testcase_18	AC	1 ms 4,380 KB
testcase_19	AC	1 ms 4,380 KB
testcase_20	AC	2 ms 4,380 KB
testcase_21	AC	1 ms 4,376 KB
testcase_22	AC	1 ms 4,376 KB
testcase_23	AC	1 ms 4,380 KB
testcase_24	AC	1 ms 4,380 KB
testcase_25	AC	1 ms 4,380 KB
testcase_26	AC	2 ms 4,380 KB
testcase_27	AC	2 ms 4,376 KB
testcase_28	AC	2 ms 4,380 KB
testcase_29	AC	1 ms 4,380 KB
testcase_30	AC	1 ms 4,376 KB
testcase_31	AC	1 ms 4,380 KB
testcase_32	AC	1 ms 4,380 KB
testcase_33	AC	1 ms 4,380 KB
testcase_34	AC	1 ms 4,376 KB
testcase_35	AC	1 ms 4,380 KB
testcase_36	AC	2 ms 4,380 KB
testcase_37	AC	1 ms 4,376 KB
testcase_38	AC	1 ms 4,380 KB
testcase_39	AC	2 ms 4,380 KB
testcase_40	AC	1 ms 4,376 KB
testcase_41	AC	1 ms 4,384 KB
testcase_42	AC	1 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,376 KB
testcase_46	AC	2 ms 4,376 KB
testcase_47	AC	2 ms 4,380 KB
testcase_48	AC	2 ms 4,380 KB
testcase_49	AC	1 ms 4,376 KB
testcase_50	AC	2 ms 4,380 KB
testcase_51	AC	2 ms 4,376 KB
testcase_52	AC	2 ms 4,380 KB
testcase_53	AC	2 ms 4,384 KB
testcase_54	AC	2 ms 4,384 KB
testcase_55	AC	1 ms 4,380 KB
testcase_56	AC	2 ms 4,376 KB
testcase_57	AC	1 ms 4,380 KB
testcase_58	AC	2 ms 4,380 KB
testcase_59	AC	1 ms 4,380 KB
testcase_60	AC	2 ms 4,380 KB
testcase_61	AC	2 ms 4,376 KB
testcase_62	AC	2 ms 4,376 KB
testcase_63	AC	8 ms 4,648 KB
testcase_64	AC	3 ms 4,380 KB
testcase_65	AC	6 ms 4,380 KB
testcase_66	AC	5 ms 4,380 KB
testcase_67	AC	3 ms 4,380 KB
testcase_68	AC	5 ms 4,376 KB
testcase_69	AC	7 ms 4,384 KB
testcase_70	AC	3 ms 4,380 KB
testcase_71	AC	3 ms 4,380 KB
testcase_72	AC	8 ms 4,404 KB
testcase_73	AC	3 ms 4,376 KB
testcase_74	AC	6 ms 4,380 KB
testcase_75	AC	5 ms 4,380 KB
testcase_76	AC	2 ms 4,376 KB
testcase_77	AC	4 ms 4,384 KB
testcase_78	AC	8 ms 4,424 KB
testcase_79	AC	8 ms 4,528 KB
testcase_80	AC	7 ms 4,396 KB
testcase_81	AC	9 ms 4,532 KB
testcase_82	AC	8 ms 4,528 KB
testcase_83	AC	118 ms 16,364 KB
testcase_84	AC	111 ms 16,172 KB
testcase_85	AC	59 ms 11,036 KB
testcase_86	AC	96 ms 14,336 KB
testcase_87	AC	107 ms 15,444 KB
testcase_88	AC	13 ms 5,104 KB
testcase_89	AC	114 ms 16,360 KB
testcase_90	AC	78 ms 11,624 KB
testcase_91	AC	49 ms 9,804 KB
testcase_92	AC	23 ms 6,684 KB
testcase_93	AC	84 ms 13,936 KB
testcase_94	AC	79 ms 12,932 KB
testcase_95	AC	76 ms 12,912 KB
testcase_96	AC	102 ms 15,564 KB
testcase_97	AC	42 ms 8,900 KB
testcase_98	AC	108 ms 15,808 KB
testcase_99	AC	58 ms 10,840 KB
testcase_100	AC	115 ms 16,668 KB
testcase_101	AC	21 ms 6,424 KB
testcase_102	AC	11 ms 5,048 KB
testcase_103	AC	24 ms 6,748 KB
testcase_104	AC	33 ms 8,124 KB
testcase_105	AC	88 ms 14,024 KB
testcase_106	AC	44 ms 9,532 KB
testcase_107	AC	111 ms 16,436 KB
testcase_108	AC	109 ms 15,920 KB
testcase_109	AC	82 ms 13,508 KB
testcase_110	AC	71 ms 12,968 KB
testcase_111	AC	82 ms 13,416 KB
testcase_112	AC	32 ms 7,876 KB
testcase_113	AC	73 ms 12,128 KB
testcase_114	AC	43 ms 9,276 KB
testcase_115	AC	14 ms 5,272 KB
testcase_116	AC	50 ms 10,176 KB
testcase_117	AC	32 ms 8,004 KB
testcase_118	AC	108 ms 15,752 KB
testcase_119	AC	58 ms 10,752 KB
testcase_120	AC	103 ms 15,128 KB
testcase_121	AC	26 ms 6,964 KB
testcase_122	AC	51 ms 10,056 KB
testcase_123	AC	1 ms 4,380 KB
testcase_124	AC	114 ms 27,520 KB
testcase_125	AC	110 ms 27,612 KB

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

ソースコード

raw source code

/**
 *  date : 2020-10-09 21:51:20
 */

#pragma region kyopro_template
#define Nyaan_template
#include <immintrin.h>
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define mem(a, val) memset(a, val, sizeof(a))
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define die(...)      \
  do {                \
    out(__VA_ARGS__); \
    return;           \
  } while (0)
using namespace std;
using ll = long long;
template <class T>
using V = vector<T>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using P = pair<long long, long long>;
using vp = vector<P>;
using pii = pair<int, int>;
using vpi = vector<pair<int, int>>;
constexpr int inf = 1001001001;
constexpr long long infLL = (1LL << 61) - 1;
template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << " ";
  out(u...);
}

#ifdef NyaanDebug
#define trc(...)                   \
  do {                             \
    cerr << #__VA_ARGS__ << " = "; \
    dbg_out(__VA_ARGS__);          \
  } while (0)
#define trca(v, N)       \
  do {                   \
    cerr << #v << " = "; \
    array_out(v, N);     \
  } while (0)
#define trcc(v)                             \
  do {                                      \
    cerr << #v << " = {";                   \
    each(x, v) { cerr << " " << x << ","; } \
    cerr << "}" << endl;                    \
  } while (0)
template <typename T>
void _cout(const T &c) {
  cerr << c;
}
void _cout(const int &c) {
  if (c == 1001001001)
    cerr << "inf";
  else if (c == -1001001001)
    cerr << "-inf";
  else
    cerr << c;
}
void _cout(const unsigned int &c) {
  if (c == 1001001001)
    cerr << "inf";
  else
    cerr << c;
}
void _cout(const long long &c) {
  if (c == 1001001001 || c == (1LL << 61) - 1)
    cerr << "inf";
  else if (c == -1001001001 || c == -((1LL << 61) - 1))
    cerr << "-inf";
  else
    cerr << c;
}
void _cout(const unsigned long long &c) {
  if (c == 1001001001 || c == (1LL << 61) - 1)
    cerr << "inf";
  else
    cerr << c;
}
template <typename T, typename U>
void _cout(const pair<T, U> &p) {
  cerr << "{ ";
  _cout(p.fi);
  cerr << ", ";
  _cout(p.se);
  cerr << " } ";
}
template <typename T>
void _cout(const vector<T> &v) {
  int s = v.size();
  cerr << "{ ";
  for (int i = 0; i < s; i++) {
    cerr << (i ? ", " : "");
    _cout(v[i]);
  }
  cerr << " } ";
}
template <typename T>
void _cout(const vector<vector<T>> &v) {
  cerr << "[ ";
  for (const auto &x : v) {
    cerr << endl;
    _cout(x);
    cerr << ", ";
  }
  cerr << endl << " ] ";
}
void dbg_out() { cerr << endl; }
template <typename T, class... U>
void dbg_out(const T &t, const U &... u) {
  _cout(t);
  if (sizeof...(u)) cerr << ", ";
  dbg_out(u...);
}
template <typename T>
void array_out(const T &v, int s) {
  cerr << "{ ";
  for (int i = 0; i < s; i++) {
    cerr << (i ? ", " : "");
    _cout(v[i]);
  }
  cerr << " } " << endl;
}
template <typename T>
void array_out(const T &v, int H, int W) {
  cerr << "[ ";
  for (int i = 0; i < H; i++) {
    cerr << (i ? ", " : "");
    array_out(v[i], W);
  }
  cerr << " ] " << endl;
}
#else
#define trc(...)
#define trca(...)
#define trcc(...)
#endif

inline int popcnt(unsigned long long a) { return __builtin_popcountll(a); }
inline int lsb(unsigned long long a) { return __builtin_ctzll(a); }
inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }
template <typename T>
inline int getbit(T a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void setbit(T &a, int i) {
  a |= (1LL << i);
}
template <typename T>
inline void delbit(T &a, int i) {
  a &= ~(1LL << i);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int btw(T a, T x, T b) {
  return a <= x && x < b;
}
template <typename T, typename U>
T ceil(T a, U b) {
  return (a + b - 1) / b;
}
constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  while (n) {
    if (n & 1) ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
}
template <typename T>
vector<T> mkrui(const vector<T> &v) {
  vector<T> ret(v.size() + 1);
  for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  return ret;
};
template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}
template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}
template <typename T = int>
vector<T> mkiota(int N) {
  vector<T> ret(N);
  iota(begin(ret), end(ret), 0);
  return ret;
}
template <typename T>
vector<int> mkinv(vector<T> &v) {
  vector<int> inv(v.size());
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

void solve();
int main() { solve(); }

#pragma endregion
using namespace std;

template <typename T>
struct edge {
  int src, to;
  T cost;

  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) {
    to = x;
    return *this;
  }

  operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T>>;
template <typename T>
using WeightedGraph = vector<Edges<T>>;
using UnweightedGraph = vector<vector<int>>;

// Input of (Unweighted) Graph
UnweightedGraph graph(int N, int M = -1, bool is_directed = false,
                      bool is_1origin = true) {
  UnweightedGraph g(N);
  if (M == -1) M = N - 1;
  for (int _ = 0; _ < M; _++) {
    int x, y;
    cin >> x >> y;
    if (is_1origin) x--, y--;
    g[x].push_back(y);
    if (!is_directed) g[y].push_back(x);
  }
  return g;
}

// Input of Weighted Graph
template <typename T>
WeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,
                        bool is_1origin = true) {
  WeightedGraph<T> g(N);
  if (M == -1) M = N - 1;
  for (int _ = 0; _ < M; _++) {
    int x, y;
    cin >> x >> y;
    T c;
    cin >> c;
    if (is_1origin) x--, y--;
    g[x].eb(x, y, c);
    if (!is_directed) g[y].eb(y, x, c);
  }
  return g;
}

// Input of Edges
template <typename T>
Edges<T> esgraph(int N, int M, int is_weighted = true, bool is_1origin = true) {
  Edges<T> es;
  for (int _ = 0; _ < M; _++) {
    int x, y;
    cin >> x >> y;
    T c;
    if (is_weighted)
      cin >> c;
    else
      c = 1;
    if (is_1origin) x--, y--;
    es.emplace_back(x, y, c);
  }
  return es;
}

// Input of Adjacency Matrix
template <typename T>
vector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,
                           bool is_directed = false, bool is_1origin = true) {
  vector<vector<T>> d(N, vector<T>(N, INF));
  for (int _ = 0; _ < M; _++) {
    int x, y;
    cin >> x >> y;
    T c;
    if (is_weighted)
      cin >> c;
    else
      c = 1;
    if (is_1origin) x--, y--;
    d[x][y] = c;
    if (!is_directed) d[y][x] = c;
  }
  return d;
}
using namespace std;


// LowLink ... enumerate bridge and articulation point
// bridge ... 橋 articulation point ... 関節点
template <typename G>
struct LowLink {
  int N;
  const G &g;
  vector<int> ord, low, articulation;
  vector<pair<int, int> > bridge;

  LowLink(const G &g) : g(g) {
    N = g.size();
    ord.resize(N, -1);
    low.resize(N, -1);
    int k = 0;
    for (int i = 0; i < N; i++)
      if (!(~ord[i])) k = dfs(i, k, -1);
  }

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

void solve() {
  ini(N);
  vvi g(N);
  map<P,int> m;
  rep(i,N){
    ini(u,v);
    --u,--v;
    g[u].push_back(v);
    g[v].push_back(u);
    m[minmax<ll>(u,v)]=i+1;
  }

  LowLink<vvi> lowlink(g);
  trc(lowlink.bridge);
  vi ans(N+1,1);
  ans[0]=0;
  each(x, lowlink.bridge){
    ans[m[minmax<ll>(x.first,x.second)]]=0;
  }

  vi bns;
  rep1(i,N)if(ans[i])bns.push_back(i);
  out(sz(bns));
  out(bns);

}

yukicoder

結果

テストケース

ソースコード