結果
問題 | No.1254 補強への架け橋 |
ユーザー | suta28407928 |
提出日時 | 2020-10-09 22:58:55 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 321 ms / 2,000 ms |
コード長 | 3,262 bytes |
コンパイル時間 | 1,901 ms |
コンパイル使用メモリ | 139,120 KB |
実行使用メモリ | 33,408 KB |
最終ジャッジ日時 | 2024-07-20 13:42:27 |
合計ジャッジ時間 | 17,546 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 123 |
ソースコード
#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <iostream>#include <string>#include <cstdlib>#include <cmath>#include <vector>#include <unordered_map>#include <map>#include <set>#include <algorithm>#include <queue>#include <stack>#include <functional>#include <bitset>#include <assert.h>#include <unordered_map>#include <fstream>#include <ctime>#include <complex>using namespace std;typedef long long ll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<char> vc;typedef vector<string> vs;typedef vector<bool> vb;typedef vector<double> vd;typedef pair<ll,ll> P;typedef pair<int,int> pii;typedef vector<P> vpl;typedef tuple<ll,ll,ll> tapu;#define rep(i,n) for(int i=0; i<(n); i++)#define REP(i,a,b) for(int i=(a); i<(b); i++)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()const int inf = 1<<30;const ll linf = 1LL<<62;const int MAX = 510000;ll dy[8] = {1,-1,0,0,1,-1,1,-1};ll dx[8] = {0,0,1,-1,1,-1,-1,1};const double pi = acos(-1);const double eps = 1e-10;template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a = b; return true;}else return false;}template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a = b; return true;}else return false;}template<typename T> inline void print(T &a){for(auto itr = a.begin(); itr != a.end(); itr++){cout << *itr << " ";}cout << "\n";}template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << "debug: " << a << " " << b << "\n";}template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){cout << "debug: " << a << " " << b << " " << c << "\n";}void mark() {cout << "#" << "\n";}ll pcount(ll x) {return __builtin_popcountll(x);}const int mod = 1e9 + 7;//const int mod = 998244353;template< typename G >struct LowLink {const G &g;vector< int > used, ord, low;vector< int > articulation;vector< pair< int, int > > bridge;LowLink(const G &g) : g(g) {}int dfs(int idx, int k, int par) {used[idx] = true;ord[idx] = k++;low[idx] = ord[idx];bool is_articulation = false;int cnt = 0;for(auto &to : g[idx]) {if(!used[to]) {++cnt;k = dfs(to, k, idx);low[idx] = min(low[idx], low[to]);is_articulation |= ~par && low[to] >= ord[idx];if(ord[idx] < low[to]) bridge.emplace_back(minmax(idx, (int) to));} else if(to != par) {low[idx] = min(low[idx], ord[to]);}}is_articulation |= par == -1 && cnt > 1;if(is_articulation) articulation.push_back(idx);return k;}virtual void build() {used.assign(g.size(), 0);ord.assign(g.size(), 0);low.assign(g.size(), 0);int k = 0;for(int i = 0; i < g.size(); i++) {if(!used[i]) k = dfs(i, k, -1);}}};map<P,int> mp;int main(){int n; cin >> n;vvl G(n);rep(i,n){int a,b; cin >> a >> b; a--; b--;G[a].push_back(b);G[b].push_back(a);mp[{a,b}] = i;mp[{b,a}] = i;}LowLink<vvl> low(G);low.build();set<int> se;rep(i,n) se.insert(i+1);for(auto i : low.bridge){se.erase(mp[i]+1);}cout << se.size() << "\n";print(se);}