結果

問題 No.1254 補強への架け橋
ユーザー hirono999hirono999
提出日時 2020-10-09 23:06:45
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 278 ms / 2,000 ms
コード長 7,311 bytes
コンパイル時間 3,780 ms
コンパイル使用メモリ 250,436 KB
実行使用メモリ 32,864 KB
最終ジャッジ日時 2023-09-27 19:30:50
合計ジャッジ時間 17,856 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 1 ms
4,376 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 1 ms
4,380 KB
testcase_12 AC 1 ms
4,380 KB
testcase_13 AC 1 ms
4,380 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 2 ms
4,376 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 1 ms
4,376 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 1 ms
4,380 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 1 ms
4,376 KB
testcase_23 AC 1 ms
4,380 KB
testcase_24 AC 1 ms
4,376 KB
testcase_25 AC 2 ms
4,380 KB
testcase_26 AC 2 ms
4,384 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 2 ms
4,380 KB
testcase_29 AC 2 ms
4,376 KB
testcase_30 AC 1 ms
4,376 KB
testcase_31 AC 2 ms
4,380 KB
testcase_32 AC 2 ms
4,380 KB
testcase_33 AC 2 ms
4,376 KB
testcase_34 AC 1 ms
4,384 KB
testcase_35 AC 1 ms
4,380 KB
testcase_36 AC 1 ms
4,376 KB
testcase_37 AC 1 ms
4,380 KB
testcase_38 AC 1 ms
4,380 KB
testcase_39 AC 1 ms
4,376 KB
testcase_40 AC 2 ms
4,380 KB
testcase_41 AC 1 ms
4,376 KB
testcase_42 AC 1 ms
4,380 KB
testcase_43 AC 2 ms
4,380 KB
testcase_44 AC 2 ms
4,376 KB
testcase_45 AC 2 ms
4,380 KB
testcase_46 AC 2 ms
4,376 KB
testcase_47 AC 2 ms
4,376 KB
testcase_48 AC 3 ms
4,376 KB
testcase_49 AC 1 ms
4,380 KB
testcase_50 AC 3 ms
4,376 KB
testcase_51 AC 3 ms
4,380 KB
testcase_52 AC 2 ms
4,380 KB
testcase_53 AC 3 ms
4,376 KB
testcase_54 AC 2 ms
4,380 KB
testcase_55 AC 2 ms
4,380 KB
testcase_56 AC 2 ms
4,376 KB
testcase_57 AC 3 ms
4,380 KB
testcase_58 AC 2 ms
4,376 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 1 ms
4,376 KB
testcase_63 AC 17 ms
5,604 KB
testcase_64 AC 5 ms
4,380 KB
testcase_65 AC 11 ms
5,008 KB
testcase_66 AC 8 ms
4,728 KB
testcase_67 AC 4 ms
4,380 KB
testcase_68 AC 10 ms
4,748 KB
testcase_69 AC 12 ms
5,188 KB
testcase_70 AC 6 ms
4,376 KB
testcase_71 AC 5 ms
4,380 KB
testcase_72 AC 14 ms
4,992 KB
testcase_73 AC 5 ms
4,376 KB
testcase_74 AC 12 ms
4,848 KB
testcase_75 AC 10 ms
4,616 KB
testcase_76 AC 3 ms
4,376 KB
testcase_77 AC 8 ms
4,564 KB
testcase_78 AC 15 ms
5,308 KB
testcase_79 AC 15 ms
5,524 KB
testcase_80 AC 13 ms
5,212 KB
testcase_81 AC 16 ms
5,464 KB
testcase_82 AC 15 ms
5,332 KB
testcase_83 AC 267 ms
27,168 KB
testcase_84 AC 253 ms
26,280 KB
testcase_85 AC 142 ms
17,800 KB
testcase_86 AC 223 ms
23,384 KB
testcase_87 AC 250 ms
25,288 KB
testcase_88 AC 24 ms
6,812 KB
testcase_89 AC 271 ms
27,088 KB
testcase_90 AC 141 ms
18,572 KB
testcase_91 AC 111 ms
15,624 KB
testcase_92 AC 49 ms
9,472 KB
testcase_93 AC 198 ms
22,108 KB
testcase_94 AC 181 ms
20,632 KB
testcase_95 AC 166 ms
20,340 KB
testcase_96 AC 243 ms
25,628 KB
testcase_97 AC 83 ms
13,520 KB
testcase_98 AC 249 ms
26,140 KB
testcase_99 AC 128 ms
17,100 KB
testcase_100 AC 278 ms
27,644 KB
testcase_101 AC 43 ms
8,964 KB
testcase_102 AC 21 ms
6,204 KB
testcase_103 AC 45 ms
9,388 KB
testcase_104 AC 70 ms
11,816 KB
testcase_105 AC 194 ms
22,252 KB
testcase_106 AC 102 ms
14,472 KB
testcase_107 AC 257 ms
27,040 KB
testcase_108 AC 246 ms
26,664 KB
testcase_109 AC 195 ms
22,072 KB
testcase_110 AC 162 ms
20,360 KB
testcase_111 AC 186 ms
21,736 KB
testcase_112 AC 62 ms
11,492 KB
testcase_113 AC 152 ms
19,992 KB
testcase_114 AC 90 ms
14,264 KB
testcase_115 AC 27 ms
7,052 KB
testcase_116 AC 104 ms
15,916 KB
testcase_117 AC 64 ms
11,648 KB
testcase_118 AC 244 ms
25,760 KB
testcase_119 AC 126 ms
16,912 KB
testcase_120 AC 240 ms
24,692 KB
testcase_121 AC 53 ms
10,204 KB
testcase_122 AC 104 ms
15,860 KB
testcase_123 AC 1 ms
4,376 KB
testcase_124 AC 219 ms
32,604 KB
testcase_125 AC 230 ms
32,864 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: 関数 ‘int main()’ 内:
main.cpp:236:18: 警告: narrowing conversion of ‘b’ from ‘ll’ {aka ‘long long int’} to ‘int’ [-Wnarrowing]
  236 |         G[a].pb({b});
      |                  ^
main.cpp:237:18: 警告: narrowing conversion of ‘a’ from ‘ll’ {aka ‘long long int’} to ‘int’ [-Wnarrowing]
  237 |         G[b].pb({a});
      |                  ^

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define to_s to_string
#define len(v) (ll)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define print(x) cout << (x) << '\n'
#define drop(x) cout << (x) << '\n', exit(0)
#define debug(x) cout << #x << ": " << (x) << '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> tpl;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef vector<vector<vector<ll>>> vec3;
template<class S, class T> inline bool chmax(S &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class S, class T> inline bool chmin(S &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline ll msb(ll v) { return 1 << (31 - __builtin_clzll(v)); }
inline ll devc(ll x, ll y) { return (x + y - 1) / y; }
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
 
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 T1, typename T2, typename T3 >
ostream &operator << (ostream &os, const tuple< T1, T2, T3 > &t) {
    os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t);
    return os;
}
 
template< typename T1, typename T2, typename T3 >
istream &operator >> (istream &is, tuple< T1, T2, T3 > &t) {
    is >> get<0>(t) >> get<1>(t) >> get<2>(t);
    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 T >
ostream &operator << (ostream &os, const set< T > &st){
    int ct = 0;
    for(auto& s : st) cout << s << (++ct != st.size() ? " " : "");
    return os;
}

template <typename T>
constexpr set<T> &operator|= (set<T> &st1, const set<T> &st2) { 
    for(auto& s : st2) st1.insert(s);
    return st1; 
}

template <typename T>
constexpr set<T> &operator-= (set<T> &st1, const set<T> &st2) {
    for(auto& s : st2) if(st1.count(s)) st1.erase(s);
    return st1;
}

template <typename T>
constexpr set<T> &operator&= (set<T> &st1, const set<T> &st2) {
    auto itr = st1.begin();
    while(itr != st1.end()){
        if(!st2.count(*itr)) itr = st1.erase(itr);
        else ++itr;
    }
    return st1;
}

template <typename T>
constexpr set<T> operator| (const set<T> &st1, const set<T> &st2) {
    set<T> res = st1;
    res |= st2;
    return res;
}

template <typename T>
constexpr set<T> operator- (const set<T> &st1, const set<T> &st2) {
    set<T> res = st1;
    res -= st2;
    return res;
}

template <typename T>
constexpr set<T> operator& (const set<T> &st1, const set<T> &st2) {
    set<T> res = st1;
    res &= st2;
    return res;
}

/*---------------------------------    Tools    ------------------------------------------*/
template< typename T >
vector<T> cumsum(const vector<T> &X){
    vector<T> res(X.size() + 1, 0);
    for(int i = 0; i < X.size(); ++i) res[i + 1] += res[i] + X[i];
    return res;
}
 
template< typename S, typename T, typename F>
pair<T, T> bisearch(S left, T right, F f) {
    while(abs(right - left) > 1){
        T mid = (right + left) / 2;
        if(f(mid)) right = mid;
        else left = mid;
    }
    return {left, right};
}
 
template< typename S, typename T, typename F>
double trisearch(S left, T right, F f, int maxLoop = 90){
    double low = left, high = right;
    while(maxLoop--){
        double mid_left = high / 3 + low * 2 / 3;
        double mid_right = high * 2 / 3 + low / 3;
        if(f(mid_left) >= f(mid_right)) low = mid_left;
        else high = mid_right;
    }
    return (low + high) * 0.5;
}

template< typename F >
ll ternarySearch(ll L, ll R, F f) { //[L, R)
    ll lo = L - 1, hi = R - 1;
    while (lo + 1 != hi) {
        ll mi = (lo + hi) / 2;
        if (f(mi) <= f(mi + 1)) hi = mi;
        else lo = mi;
    }
    return hi;
}

struct Edge {
    int to;
};
using Graph = vector<vector<Edge>>;
/* Lowlink: グラフの関節点・橋を列挙する構造体
    作成: O(E+V)
    関節点の集合: vector<int> aps
    橋の集合: vector<P> bridges
*/
struct LowLink {
    const Graph &G;
    vector<int> used, ord, low;
    vector<int> aps;  // articulation points
    vector<P> bridges;
    LowLink(const Graph &G_) : G(G_) {
        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);
        }
        sort(aps.begin(), aps.end()); // 必要ならソートする
        sort(bridges.begin(), bridges.end()); // 必要ならソートする
    }
    int dfs(int id, int k, int par) { // id:探索中の頂点, k:dfsで何番目に探索するか, par:idの親
        used[id] = true;
        ord[id] = k++;
        low[id] = ord[id];
        bool is_aps = false;
        int count = 0; // 子の数
        for (auto &e : G[id]) {
            if (!used[e.to]) {
                count++;
                k = dfs(e.to, k, id);
                low[id] = min(low[id], low[e.to]);
                if (par != -1 && ord[id] <= low[e.to]) is_aps = true; // 条件2を満たすので関節点
                if (ord[id] < low[e.to]) bridges.emplace_back(min(id, e.to), max(id, e.to));  
            } else if (e.to != par) { // eが後退辺の時
                low[id] = min(low[id], ord[e.to]);
            }
        }
        if (par == -1 && count >= 2) is_aps = true; // 条件1を満たすので関節点
        if (is_aps) aps.push_back(id);
        return k;
    }
};

// #include <atcoder/all>
// using namespace atcoder;
constexpr long long MOD = 1000000007;
/*------------------------------- Main Code Here -----------------------------------------*/
 
int main()
{
    ll N;
    cin >> N;
    Graph G(N);
    map<P, ll> bridge;
    rep(i, N){
        ll a, b;
        cin >> a >> b;
        --a, --b;
        G[a].pb({b});
        G[b].pb({a});
        bridge[{a, b}] = i;
        bridge[{b, a}] = i;
    }
    LowLink LK(G);
    set<ll> ans;
    rep1(i, N) ans.insert(i);
    for(auto p : LK.bridges){
        ans.erase(bridge[p] + 1);
    }
    print(len(ans));
    print(ans);

    return 0;
}
0