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

• 問題: No.1254 補強への架け橋
• ユーザー: cureskol
• 提出日時: 2022-11-16 12:55:41
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 408 ms / 2,000 ms
• コード長: 6,209 bytes
• コンパイル時間: 3,293 ms
• コンパイル使用メモリ: 244,768 KB
• 実行使用メモリ: 21,096 KB
• 最終ジャッジ日時: 2023-10-17 11:32:48
• 合計ジャッジ時間: 21,493 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,348 KB
testcase_01	AC	2 ms; 4,348 KB
testcase_02	AC	2 ms; 4,348 KB
testcase_03	AC	2 ms; 4,348 KB
testcase_04	AC	2 ms; 4,348 KB
testcase_05	AC	2 ms; 4,348 KB
testcase_06	AC	2 ms; 4,348 KB
testcase_07	AC	2 ms; 4,348 KB
testcase_08	AC	2 ms; 4,348 KB
testcase_09	AC	2 ms; 4,348 KB
testcase_10	AC	2 ms; 4,348 KB
testcase_11	AC	2 ms; 4,348 KB
testcase_12	AC	2 ms; 4,348 KB
testcase_13	AC	2 ms; 4,348 KB
testcase_14	AC	2 ms; 4,348 KB
testcase_15	AC	2 ms; 4,348 KB
testcase_16	AC	2 ms; 4,348 KB
testcase_17	AC	2 ms; 4,348 KB
testcase_18	AC	2 ms; 4,348 KB
testcase_19	AC	2 ms; 4,348 KB
testcase_20	AC	2 ms; 4,348 KB
testcase_21	AC	2 ms; 4,348 KB
testcase_22	AC	2 ms; 4,348 KB
testcase_23	AC	2 ms; 4,348 KB
testcase_24	AC	2 ms; 4,348 KB
testcase_25	AC	2 ms; 4,348 KB
testcase_26	AC	3 ms; 4,348 KB
testcase_27	AC	2 ms; 4,348 KB
testcase_28	AC	2 ms; 4,348 KB
testcase_29	AC	2 ms; 4,348 KB
testcase_30	AC	2 ms; 4,348 KB
testcase_31	AC	2 ms; 4,348 KB
testcase_32	AC	2 ms; 4,348 KB
testcase_33	AC	2 ms; 4,348 KB
testcase_34	AC	2 ms; 4,348 KB
testcase_35	AC	2 ms; 4,348 KB
testcase_36	AC	2 ms; 4,348 KB
testcase_37	AC	2 ms; 4,348 KB
testcase_38	AC	2 ms; 4,348 KB
testcase_39	AC	2 ms; 4,348 KB
testcase_40	AC	2 ms; 4,348 KB
testcase_41	AC	2 ms; 4,348 KB
testcase_42	AC	2 ms; 4,348 KB
testcase_43	AC	3 ms; 4,348 KB
testcase_44	AC	3 ms; 4,348 KB
testcase_45	AC	2 ms; 4,348 KB
testcase_46	AC	3 ms; 4,348 KB
testcase_47	AC	2 ms; 4,348 KB
testcase_48	AC	2 ms; 4,348 KB
testcase_49	AC	2 ms; 4,348 KB
testcase_50	AC	3 ms; 4,348 KB
testcase_51	AC	3 ms; 4,348 KB
testcase_52	AC	3 ms; 4,348 KB
testcase_53	AC	2 ms; 4,348 KB
testcase_54	AC	3 ms; 4,348 KB
testcase_55	AC	3 ms; 4,348 KB
testcase_56	AC	2 ms; 4,348 KB
testcase_57	AC	2 ms; 4,348 KB
testcase_58	AC	2 ms; 4,348 KB
testcase_59	AC	2 ms; 4,348 KB
testcase_60	AC	2 ms; 4,348 KB
testcase_61	AC	2 ms; 4,348 KB
testcase_62	AC	2 ms; 4,348 KB
testcase_63	AC	12 ms; 5,116 KB
testcase_64	AC	5 ms; 4,348 KB
testcase_65	AC	8 ms; 4,596 KB
testcase_66	AC	6 ms; 4,404 KB
testcase_67	AC	4 ms; 4,348 KB
testcase_68	AC	7 ms; 4,476 KB
testcase_69	AC	9 ms; 4,724 KB
testcase_70	AC	5 ms; 4,348 KB
testcase_71	AC	4 ms; 4,348 KB
testcase_72	AC	9 ms; 4,756 KB
testcase_73	AC	5 ms; 4,348 KB
testcase_74	AC	9 ms; 4,684 KB
testcase_75	AC	8 ms; 4,436 KB
testcase_76	AC	3 ms; 4,348 KB
testcase_77	AC	6 ms; 4,348 KB
testcase_78	AC	11 ms; 4,952 KB
testcase_79	AC	12 ms; 5,004 KB
testcase_80	AC	10 ms; 4,824 KB
testcase_81	AC	11 ms; 5,008 KB
testcase_82	AC	10 ms; 4,908 KB
testcase_83	AC	193 ms; 19,336 KB
testcase_84	AC	184 ms; 18,808 KB
testcase_85	AC	100 ms; 13,012 KB
testcase_86	AC	152 ms; 16,696 KB
testcase_87	AC	170 ms; 18,016 KB
testcase_88	AC	18 ms; 5,752 KB
testcase_89	AC	191 ms; 19,072 KB
testcase_90	AC	111 ms; 13,528 KB
testcase_91	AC	79 ms; 11,456 KB
testcase_92	AC	38 ms; 7,720 KB
testcase_93	AC	142 ms; 16,168 KB
testcase_94	AC	120 ms; 14,848 KB
testcase_95	AC	128 ms; 14,848 KB
testcase_96	AC	176 ms; 18,280 KB
testcase_97	AC	64 ms; 10,360 KB
testcase_98	AC	183 ms; 18,544 KB
testcase_99	AC	93 ms; 12,736 KB
testcase_100	AC	196 ms; 19,600 KB
testcase_101	AC	33 ms; 7,192 KB
testcase_102	AC	15 ms; 5,444 KB
testcase_103	AC	36 ms; 7,456 KB
testcase_104	AC	51 ms; 9,360 KB
testcase_105	AC	136 ms; 16,168 KB
testcase_106	AC	72 ms; 10,912 KB
testcase_107	AC	186 ms; 19,072 KB
testcase_108	AC	185 ms; 19,072 KB
testcase_109	AC	139 ms; 15,904 KB
testcase_110	AC	121 ms; 14,848 KB
testcase_111	AC	137 ms; 15,640 KB
testcase_112	AC	51 ms; 8,776 KB
testcase_113	AC	116 ms; 14,364 KB
testcase_114	AC	68 ms; 10,680 KB
testcase_115	AC	20 ms; 5,960 KB
testcase_116	AC	83 ms; 11,804 KB
testcase_117	AC	49 ms; 8,944 KB
testcase_118	AC	176 ms; 18,280 KB
testcase_119	AC	94 ms; 12,472 KB
testcase_120	AC	166 ms; 17,752 KB
testcase_121	AC	43 ms; 7,984 KB
testcase_122	AC	83 ms; 11,680 KB
testcase_123	AC	2 ms; 4,348 KB
testcase_124	AC	408 ms; 21,096 KB
testcase_125	AC	405 ms; 21,096 KB

ソースコード

#pragma region template
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL
 #include <debug>
#else
 #define debug(...) void(0)
#endif
 
using ll=long long;
using ld=long double;
using vi=vector<int>;
using vll=vector<ll>;
using pi=pair<int,int>;
using pll=pair<ll,ll>;
 
#define overload2(a,b,c,...) c
#define overload3(a,b,c,d,...) d
#define overload4(a,b,c,d,e,...) e
#define overload5(a,b,c,d,e,f,...) f
 
#define TYPE1(T) template<typename T>
#define TYPE2(T,U) template<typename T,typename U>
#define TYPE(...) overload2(__VA_ARGS__,TYPE2,TYPE1)(__VA_ARGS__)
#define TYPES1(T) template<typename... T>
#define TYPES2(H,T) template<typename H,typename... T>
#define TYPES(...) overload2(__VA_ARGS__,TYPES2,TYPES1)(__VA_ARGS__)
 
#define REP4(i,s,n,d) for(int i=(s);i<(n);i+=(d))
#define REP3(i,s,n) REP4(i,s,n,1)
#define REP2(i,n) REP3(i,0,n)
#define REP1(n) REP2(tomato,n)
#define REP(...) overload4(__VA_ARGS__,REP4,REP3,REP2,REP1)(__VA_ARGS__)
 
#define RREP4(i,n,s,d) for(int i=(n)-1;i>=s;i-=d)
#define RREP3(i,n,s) RREP4(i,n,s,1)
#define RREP2(i,n) RREP3(i,n,0)
#define RREP1(n) RREP2(tomato,n)
#define RREP(...) overload4(__VA_ARGS__,RREP4,RREP3,RREP2,RREP1)(__VA_ARGS__)

#define FOR4(a,b,c,d,v) for(auto [a,b,c,d]:v)
#define FOR3(a,b,c,v) for(auto [a,b,c]:v)
#define FOR2(a,b,v) for(auto [a,b]:v)
#define FOR1(a,v) for(auto a:v)
#define FOR(...) overload5(__VA_ARGS__,FOR4,FOR3,FOR2,FOR1)(__VA_ARGS__)

#define AFOR4(a,b,c,d,v) for(auto&[a,b,c,d]:v)
#define AFOR3(a,b,c,v) for(auto&[a,b,c]:v)
#define AFOR2(a,b,v) for(auto&[a,b]:v)
#define AFOR1(a,v) for(auto&a:v)
#define AFOR(...) overload5(__VA_ARGS__,AFOR4,AFOR3,AFOR2,AFOR1)(__VA_ARGS__)

#define CFOR4(a,b,c,d,v) for(const auto&[a,b,c,d]:v)
#define CFOR3(a,b,c,v) for(const auto&[a,b,c]:v)
#define CFOR2(a,b,v) for(const auto&[a,b]:v)
#define CFOR1(a,v) for(const auto&a:v)
#define CFOR(...) overload5(__VA_ARGS__,CFOR4,CFOR3,CFOR2,CFOR1)(__VA_ARGS__)
 
#define ALL(v) v.begin(),v.end()
#define RALL(v) v.rbegin(),v.rend()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define REVERSE(v) reverse(ALL(v))
#define UNIQUE(v) SORT(v),v.erase(unique(ALL(v)),v.end())
 
TYPES(T) void input(T&... a){ (cin>>...>>a); }
#define DECLARE(T,...) T __VA_ARGS__;input(__VA_ARGS__);
#define INT(...) DECLARE(int,__VA_ARGS__)
#define STR(...) DECLARE(string,__VA_ARGS__)
#define LL(...) DECLARE(long long,__VA_ARGS__)
#define CHR(...) DECLARE(char,__VA_ARGS__)
#define DBL(...) DECLARE(double,__VA_ARGS__)
#define VI(n,v) vi v(n);cin>>v;
#define VLL(n,v) vll v(n);cin>>v;
 
TYPE(T) istream&operator>>(istream&is,vector<T>&v){
  for(auto&a:v)cin>>a;
  return is;
}
TYPE(T) ostream&operator<<(ostream&os,const vector<T>&v){
  if(&os==&cerr)os<<"[";
  REP(i,v.size()){
    os<<v[i];
    if(i+1<v.size())os<<(&os==&cerr?",":" ");
  }
  if(&os==&cerr)os<<"]";
  return os;
}
TYPE(T,S) istream&operator>>(istream&is,pair<T,S>&p){
  cin>>p.first>>p.second;
  return is;
}

void print(){ cout << '\n'; }
TYPES(T,Ts) void print(const T& a,const Ts&... b){
  cout<<a;
  (cout<<...<<(cout<< ' ',b));
  cout << '\n';
}
 
TYPE(T) using pq=priority_queue<T>;
TYPE(T) using pqg=priority_queue<T,vector<T>,greater<T>>;
TYPE(T) T pick(queue<T>& que){assert(que.size()); T a=que.front();que.pop();return a;}
TYPE(T) T pick(pq<T>& que){assert(que.size()); T a=que.top();que.pop();return a;}
TYPE(T) T pick(pqg<T>& que){assert(que.size()); T a=que.top();que.pop();return a;}
TYPE(T) T pick(stack<T>& sta){assert(sta.size()); T a=sta.top();sta.pop();return a;}
 
string YES(bool f=true){return (f?"YES":"NO");}
string Yes(bool f=true){return (f?"Yes":"No");}
string yes(bool f=true){return (f?"yes":"no");}
 
constexpr int INF=1e9+7;
constexpr ll LINF=ll(1e18)+7;
constexpr ld EPS=1e-10;
 
vi iota(int n){vi a(n);iota(ALL(a),0);return a;}
TYPE(T) T rev(T a){ REVERSE(a);return a; }
TYPE(T) void fin(T a){cout<<a<<endl;exit(0);}
TYPE(T) bool chmax(T &a,T b){return (a<b&&(a=b,true));}
TYPE(T) bool chmin(T &a,T b){return (a>b&&(a=b,true));}
TYPES(T,Ns) auto make_vector(T x,int n,Ns ...ns){
  if constexpr(sizeof...(ns)==0)return vector<T>(n,x);
  else return vector(n,make_vector<T>(x,ns...));
}
bool in(const ll S,const int a){return (S>>a)&1;}
int popcount(const ll S){return __builtin_popcountll(S);}
#pragma endregion template

struct TwoEdgeConnectedComponents{
  struct edge{int to,rev,bri,tree;};
  int n,cnt=0;
  vector<vector<edge>> G;
  vector<int> ord,low;
  vector<bool> used;
  TwoEdgeConnectedComponents(int n_):n(n_),G(n_),ord(n_,0),low(n_,n_+1),used(n_,false){}

  void add_edge(int u,int v){
    G[u].push_back({v,(int)G[v].size(),false,false});
    G[v].push_back({u,(int)G[u].size()-1,false,false});
  }

  inline void dfs(int v){
    low[v]=ord[v]=++cnt;
    for(edge &p:G[v]){
      if(G[p.to][p.rev].tree)continue;
      if(!ord[p.to]){
        p.tree=true;
        dfs(p.to);
      }
      low[v]=min(low[v],low[p.to]);
      p.bri=G[p.to][p.rev].bri=p.tree&&ord[v]<low[p.to];
    }
  }

  vector<vector<int>> solve(){
    vector<vector<int>> res;
    for(int i=0;i<n;i++)if(!ord[i])dfs(i);
    queue<int> que;
    vector<bool>used(n,false);
    for(int i=0;i<n;i++){
      if(used[i])continue;
      vector<int> tmp;
      que.push(i);used[i]=true;
      while(que.size()){
        int p=que.front();que.pop();
        tmp.push_back(p);
        for(edge q:G[p])if(!q.bri&&!used[q.to]){
          que.push(q.to);
          used[q.to]=true;
        }
      }
      res.push_back(tmp);
    }
    return res;
  }
};

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  INT(n);
  vector<vector<int>> g(n);
  vector<int> in(n,0);
  map<pair<int,int>,int> mp;
  REP(i,n){
    INT(a,b);a--;b--;
    g[a].push_back(b);
    g[b].push_back(a);
    in[a]++;in[b]++;
    mp[minmax(a,b)]=i+1;
  }
  queue<int> que;
  REP(i,n)if(in[i]==1)que.push(i);
  set<int> se;
  REP(i,n)se.insert(i);
  while(que.size()){
    int p=pick(que);
    se.erase(p);
    for(int q:g[p])if(--in[q]==1)que.push(q);
  }
  vector<int> ans;
  REP(i,n)if(se.count(i))
    for(int to:g[i])if(se.count(to))
      ans.push_back(mp[minmax(i,to)]);
  SORT(ans);
  UNIQUE(ans);
  cout<<ans.size()<<endl;
  cout<<ans<<endl;
}