結果
問題 | No.1254 補強への架け橋 |
ユーザー | mugen_1337 |
提出日時 | 2022-03-09 15:56:04 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 151 ms / 2,000 ms |
コード長 | 5,343 bytes |
コンパイル時間 | 3,544 ms |
コンパイル使用メモリ | 221,388 KB |
実行使用メモリ | 37,904 KB |
最終ジャッジ日時 | 2023-10-11 16:48:32 |
合計ジャッジ時間 | 19,763 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,368 KB |
testcase_01 | AC | 2 ms
4,372 KB |
testcase_02 | AC | 2 ms
4,372 KB |
testcase_03 | AC | 1 ms
4,368 KB |
testcase_04 | AC | 2 ms
4,372 KB |
testcase_05 | AC | 2 ms
4,368 KB |
testcase_06 | AC | 2 ms
4,368 KB |
testcase_07 | AC | 2 ms
4,372 KB |
testcase_08 | AC | 1 ms
4,372 KB |
testcase_09 | AC | 2 ms
4,368 KB |
testcase_10 | AC | 2 ms
4,372 KB |
testcase_11 | AC | 2 ms
4,368 KB |
testcase_12 | AC | 1 ms
4,368 KB |
testcase_13 | AC | 2 ms
4,368 KB |
testcase_14 | AC | 1 ms
4,372 KB |
testcase_15 | AC | 2 ms
4,372 KB |
testcase_16 | AC | 1 ms
4,372 KB |
testcase_17 | AC | 1 ms
4,372 KB |
testcase_18 | AC | 2 ms
4,372 KB |
testcase_19 | AC | 1 ms
4,372 KB |
testcase_20 | AC | 1 ms
4,372 KB |
testcase_21 | AC | 2 ms
4,368 KB |
testcase_22 | AC | 2 ms
4,372 KB |
testcase_23 | AC | 2 ms
4,368 KB |
testcase_24 | AC | 2 ms
4,372 KB |
testcase_25 | AC | 1 ms
4,372 KB |
testcase_26 | AC | 1 ms
4,368 KB |
testcase_27 | AC | 1 ms
4,372 KB |
testcase_28 | AC | 2 ms
4,368 KB |
testcase_29 | AC | 2 ms
4,372 KB |
testcase_30 | AC | 2 ms
4,368 KB |
testcase_31 | AC | 2 ms
4,372 KB |
testcase_32 | AC | 2 ms
4,368 KB |
testcase_33 | AC | 2 ms
4,368 KB |
testcase_34 | AC | 2 ms
4,368 KB |
testcase_35 | AC | 2 ms
4,372 KB |
testcase_36 | AC | 2 ms
4,372 KB |
testcase_37 | AC | 2 ms
4,368 KB |
testcase_38 | AC | 2 ms
4,372 KB |
testcase_39 | AC | 2 ms
4,372 KB |
testcase_40 | AC | 1 ms
4,372 KB |
testcase_41 | AC | 2 ms
4,368 KB |
testcase_42 | AC | 2 ms
4,368 KB |
testcase_43 | AC | 3 ms
4,368 KB |
testcase_44 | AC | 2 ms
4,368 KB |
testcase_45 | AC | 2 ms
4,368 KB |
testcase_46 | AC | 2 ms
4,368 KB |
testcase_47 | AC | 2 ms
4,368 KB |
testcase_48 | AC | 2 ms
4,368 KB |
testcase_49 | AC | 2 ms
4,368 KB |
testcase_50 | AC | 2 ms
4,368 KB |
testcase_51 | AC | 2 ms
4,368 KB |
testcase_52 | AC | 3 ms
4,372 KB |
testcase_53 | AC | 2 ms
4,372 KB |
testcase_54 | AC | 2 ms
4,372 KB |
testcase_55 | AC | 2 ms
4,368 KB |
testcase_56 | AC | 2 ms
4,372 KB |
testcase_57 | AC | 3 ms
4,372 KB |
testcase_58 | AC | 3 ms
4,368 KB |
testcase_59 | AC | 1 ms
4,372 KB |
testcase_60 | AC | 2 ms
4,368 KB |
testcase_61 | AC | 2 ms
4,368 KB |
testcase_62 | AC | 2 ms
4,368 KB |
testcase_63 | AC | 11 ms
6,972 KB |
testcase_64 | AC | 4 ms
4,372 KB |
testcase_65 | AC | 7 ms
5,024 KB |
testcase_66 | AC | 6 ms
4,988 KB |
testcase_67 | AC | 3 ms
4,368 KB |
testcase_68 | AC | 8 ms
5,148 KB |
testcase_69 | AC | 9 ms
5,380 KB |
testcase_70 | AC | 5 ms
4,528 KB |
testcase_71 | AC | 4 ms
4,368 KB |
testcase_72 | AC | 8 ms
5,696 KB |
testcase_73 | AC | 4 ms
4,372 KB |
testcase_74 | AC | 8 ms
5,168 KB |
testcase_75 | AC | 7 ms
5,008 KB |
testcase_76 | AC | 2 ms
4,372 KB |
testcase_77 | AC | 6 ms
4,788 KB |
testcase_78 | AC | 10 ms
6,208 KB |
testcase_79 | AC | 10 ms
6,256 KB |
testcase_80 | AC | 9 ms
5,552 KB |
testcase_81 | AC | 10 ms
5,948 KB |
testcase_82 | AC | 9 ms
6,220 KB |
testcase_83 | AC | 120 ms
36,132 KB |
testcase_84 | AC | 112 ms
29,744 KB |
testcase_85 | AC | 68 ms
21,664 KB |
testcase_86 | AC | 97 ms
30,688 KB |
testcase_87 | AC | 104 ms
30,136 KB |
testcase_88 | AC | 15 ms
8,260 KB |
testcase_89 | AC | 122 ms
32,248 KB |
testcase_90 | AC | 72 ms
21,808 KB |
testcase_91 | AC | 54 ms
18,264 KB |
testcase_92 | AC | 28 ms
12,432 KB |
testcase_93 | AC | 90 ms
28,140 KB |
testcase_94 | AC | 85 ms
27,688 KB |
testcase_95 | AC | 89 ms
27,384 KB |
testcase_96 | AC | 119 ms
35,376 KB |
testcase_97 | AC | 45 ms
15,292 KB |
testcase_98 | AC | 118 ms
29,524 KB |
testcase_99 | AC | 63 ms
23,148 KB |
testcase_100 | AC | 128 ms
37,492 KB |
testcase_101 | AC | 24 ms
10,568 KB |
testcase_102 | AC | 13 ms
7,344 KB |
testcase_103 | AC | 27 ms
11,552 KB |
testcase_104 | AC | 39 ms
15,264 KB |
testcase_105 | AC | 90 ms
27,184 KB |
testcase_106 | AC | 51 ms
18,788 KB |
testcase_107 | AC | 126 ms
37,904 KB |
testcase_108 | AC | 122 ms
32,408 KB |
testcase_109 | AC | 94 ms
26,812 KB |
testcase_110 | AC | 84 ms
25,688 KB |
testcase_111 | AC | 90 ms
26,172 KB |
testcase_112 | AC | 36 ms
13,628 KB |
testcase_113 | AC | 79 ms
26,392 KB |
testcase_114 | AC | 50 ms
18,952 KB |
testcase_115 | AC | 17 ms
8,100 KB |
testcase_116 | AC | 59 ms
21,200 KB |
testcase_117 | AC | 36 ms
14,448 KB |
testcase_118 | AC | 120 ms
32,696 KB |
testcase_119 | AC | 65 ms
22,804 KB |
testcase_120 | AC | 110 ms
33,656 KB |
testcase_121 | AC | 30 ms
11,900 KB |
testcase_122 | AC | 57 ms
20,500 KB |
testcase_123 | AC | 1 ms
4,372 KB |
testcase_124 | AC | 142 ms
33,480 KB |
testcase_125 | AC | 151 ms
33,320 KB |
ソースコード
#include"bits/stdc++.h" using namespace std; #define ALL(x) begin(x),end(x) #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; #define mod 1000000007 using ll=long long; const int INF=1000000000; const ll LINF=1001002003004005006ll; int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; // ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;} struct IOSetup{ IOSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(12); } } iosetup; 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==(int)v.size()?"":" "); return os; } template<typename T> istream &operator>>(istream &is,vector<T>&v){ for(T &x:v)is>>x; return is; } // graph template // ref : https://ei1333.github.io/library/graph/graph-template.cpp template<typename T=int> struct Edge{ int from,to; T w; int idx; Edge()=default; Edge(int from,int to,T w=1,int idx=-1):from(from),to(to),w(w),idx(idx){} operator int() const{return to;} }; template<typename T=int> struct Graph{ vector<vector<Edge<T>>> g; int V,E; Graph()=default; Graph(int n):g(n),V(n),E(0){} int size(){ return (int)g.size(); } void resize(int k){ g.resize(k); V=k; } inline const vector<Edge<T>> &operator[](int k)const{ return (g.at(k)); } inline vector<Edge<T>> &operator[](int k){ return (g.at(k)); } void add_directed_edge(int from,int to,T cost=1){ g[from].emplace_back(from,to,cost,E++); } void add_edge(int from,int to,T cost=1){ g[from].emplace_back(from,to,cost,E); g[to].emplace_back(to,from,cost,E++); } void read(int m,int pad=-1,bool weighted=false,bool directed=false){ for(int i=0;i<m;i++){ int u,v;cin>>u>>v; u+=pad,v+=pad; T w=T(1); if(weighted) cin>>w; if(directed) add_directed_edge(u,v,w); else add_edge(u,v,w); } } }; /* Namori Graph loop_vertex[i] - loop_edge[i] loop_vertex[i+1] forest : loop_vertexからぶら下がる木 loop_vertexをroot, 0としてidふり直し */ template<typename T> struct Namori{ Graph<T> G; vector<int> loop_vertex; vector<Edge<T>> loop_edge; vector<Graph<int>> forest; Namori(Graph<T> G):G(G){ int N=G.size(); // loop 取り出し vector<bool> used(N, false); { vector<int> deg(N); queue<int> que; for(int i=0;i<N;i++){ deg[i]=G[i].size(); if(deg[i]==1){ que.push(i); used[i]=true; } } while(not que.empty()){ int cur=que.front();que.pop(); for(auto &e:G[cur])if(not used[e]){ deg[e]--; if(deg[e]==1){ que.push(e); used[e]=true; } } } } // loop順序 { queue<int> que; vector<bool> visited(N, false); for(int i=0;i<N;i++){ if(not used[i]){ que.push(i); visited[i]=true; loop_vertex.push_back(i); break; } } while(not que.empty()){ int cur=que.front();que.pop(); for(auto &e:G[cur])if((not used[e]) and (not visited[e])){ visited[e]=true; que.push(e); loop_vertex.push_back(e); loop_edge.emplace_back(e.from, e.to, e.w, e.idx); break; } } for(auto &e:G[loop_vertex.back()]) if(minmax(e.from, e.to)==minmax(loop_vertex[0], loop_vertex.back())) loop_edge.push_back(e); } // forest 構築 { vector<int> id(N, -1); for(int root:loop_vertex){ vector<Edge<T>> es; int V=0; function<void(int,int)> dfs=[&](int par, int cur){ for(auto &e:G[cur])if(par!=e and (used[e])){ if(id[e]==-1) id[e]=V++; es.emplace_back(id[cur], id[e], e.w, e.idx); dfs(cur, e); } }; id[root]=V++; dfs(-1, root); Graph<T> g(V); for(auto &e:es) g.add_edge(e.from, e.to, e.w); forest.push_back(g); } } } }; signed main(){ int N;cin>>N; Graph<int> G(N); rep(i, N){ int u,v;cin>>u>>v;u--,v--; G.add_edge(u, v); } Namori<int> namori(G); // debug(namori.loop_vertex); cout<<namori.loop_edge.size()<<"\n"; rep(i, namori.loop_edge.size()) cout<<namori.loop_edge[i].idx+1<<(i+1==namori.loop_edge.size()?"\n":" "); return 0; }