結果
問題 | No.1254 補強への架け橋 |
ユーザー | heno239 |
提出日時 | 2020-10-09 21:41:48 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 99 ms / 2,000 ms |
コード長 | 3,596 bytes |
コンパイル時間 | 1,243 ms |
コンパイル使用メモリ | 120,348 KB |
実行使用メモリ | 85,188 KB |
最終ジャッジ日時 | 2023-09-27 15:54:38 |
合計ジャッジ時間 | 14,883 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 19 ms
68,824 KB |
testcase_01 | AC | 20 ms
68,820 KB |
testcase_02 | AC | 20 ms
68,904 KB |
testcase_03 | AC | 19 ms
68,900 KB |
testcase_04 | AC | 20 ms
68,884 KB |
testcase_05 | AC | 19 ms
68,816 KB |
testcase_06 | AC | 20 ms
69,008 KB |
testcase_07 | AC | 19 ms
68,852 KB |
testcase_08 | AC | 20 ms
68,908 KB |
testcase_09 | AC | 20 ms
68,816 KB |
testcase_10 | AC | 19 ms
68,912 KB |
testcase_11 | AC | 19 ms
68,816 KB |
testcase_12 | AC | 19 ms
68,848 KB |
testcase_13 | AC | 19 ms
68,976 KB |
testcase_14 | AC | 19 ms
68,920 KB |
testcase_15 | AC | 20 ms
68,988 KB |
testcase_16 | AC | 19 ms
68,820 KB |
testcase_17 | AC | 20 ms
68,904 KB |
testcase_18 | AC | 19 ms
68,816 KB |
testcase_19 | AC | 19 ms
69,096 KB |
testcase_20 | AC | 20 ms
69,104 KB |
testcase_21 | AC | 20 ms
68,908 KB |
testcase_22 | AC | 20 ms
68,848 KB |
testcase_23 | AC | 20 ms
68,908 KB |
testcase_24 | AC | 20 ms
68,828 KB |
testcase_25 | AC | 20 ms
68,900 KB |
testcase_26 | AC | 19 ms
68,828 KB |
testcase_27 | AC | 20 ms
68,912 KB |
testcase_28 | AC | 20 ms
69,108 KB |
testcase_29 | AC | 20 ms
68,848 KB |
testcase_30 | AC | 19 ms
68,944 KB |
testcase_31 | AC | 19 ms
68,976 KB |
testcase_32 | AC | 19 ms
68,912 KB |
testcase_33 | AC | 19 ms
68,924 KB |
testcase_34 | AC | 19 ms
68,832 KB |
testcase_35 | AC | 19 ms
68,964 KB |
testcase_36 | AC | 20 ms
68,916 KB |
testcase_37 | AC | 20 ms
69,000 KB |
testcase_38 | AC | 20 ms
68,924 KB |
testcase_39 | AC | 19 ms
68,816 KB |
testcase_40 | AC | 20 ms
68,824 KB |
testcase_41 | AC | 20 ms
68,948 KB |
testcase_42 | AC | 19 ms
69,052 KB |
testcase_43 | AC | 20 ms
68,952 KB |
testcase_44 | AC | 19 ms
68,976 KB |
testcase_45 | AC | 19 ms
69,032 KB |
testcase_46 | AC | 19 ms
68,964 KB |
testcase_47 | AC | 19 ms
68,852 KB |
testcase_48 | AC | 19 ms
68,892 KB |
testcase_49 | AC | 19 ms
68,828 KB |
testcase_50 | AC | 20 ms
68,972 KB |
testcase_51 | AC | 19 ms
68,968 KB |
testcase_52 | AC | 20 ms
68,968 KB |
testcase_53 | AC | 20 ms
68,996 KB |
testcase_54 | AC | 20 ms
68,876 KB |
testcase_55 | AC | 20 ms
69,124 KB |
testcase_56 | AC | 19 ms
68,912 KB |
testcase_57 | AC | 19 ms
68,936 KB |
testcase_58 | AC | 20 ms
69,140 KB |
testcase_59 | AC | 20 ms
68,984 KB |
testcase_60 | AC | 19 ms
69,000 KB |
testcase_61 | AC | 20 ms
69,008 KB |
testcase_62 | AC | 19 ms
68,908 KB |
testcase_63 | AC | 23 ms
69,376 KB |
testcase_64 | AC | 21 ms
69,184 KB |
testcase_65 | AC | 21 ms
69,232 KB |
testcase_66 | AC | 21 ms
69,236 KB |
testcase_67 | AC | 20 ms
69,040 KB |
testcase_68 | AC | 21 ms
69,140 KB |
testcase_69 | AC | 22 ms
69,140 KB |
testcase_70 | AC | 21 ms
69,212 KB |
testcase_71 | AC | 21 ms
69,120 KB |
testcase_72 | AC | 22 ms
69,260 KB |
testcase_73 | AC | 20 ms
69,092 KB |
testcase_74 | AC | 21 ms
69,244 KB |
testcase_75 | AC | 22 ms
69,308 KB |
testcase_76 | AC | 20 ms
68,924 KB |
testcase_77 | AC | 21 ms
69,228 KB |
testcase_78 | AC | 23 ms
69,268 KB |
testcase_79 | AC | 23 ms
69,220 KB |
testcase_80 | AC | 22 ms
69,144 KB |
testcase_81 | AC | 22 ms
69,284 KB |
testcase_82 | AC | 22 ms
69,256 KB |
testcase_83 | AC | 67 ms
74,448 KB |
testcase_84 | AC | 62 ms
74,268 KB |
testcase_85 | AC | 42 ms
72,140 KB |
testcase_86 | AC | 53 ms
73,568 KB |
testcase_87 | AC | 56 ms
73,996 KB |
testcase_88 | AC | 25 ms
69,568 KB |
testcase_89 | AC | 62 ms
74,708 KB |
testcase_90 | AC | 44 ms
72,432 KB |
testcase_91 | AC | 38 ms
71,640 KB |
testcase_92 | AC | 30 ms
70,132 KB |
testcase_93 | AC | 54 ms
73,316 KB |
testcase_94 | AC | 49 ms
72,944 KB |
testcase_95 | AC | 48 ms
73,012 KB |
testcase_96 | AC | 64 ms
74,320 KB |
testcase_97 | AC | 35 ms
71,068 KB |
testcase_98 | AC | 63 ms
74,268 KB |
testcase_99 | AC | 43 ms
72,156 KB |
testcase_100 | AC | 64 ms
74,520 KB |
testcase_101 | AC | 28 ms
69,984 KB |
testcase_102 | AC | 24 ms
69,396 KB |
testcase_103 | AC | 29 ms
70,248 KB |
testcase_104 | AC | 32 ms
70,876 KB |
testcase_105 | AC | 51 ms
73,192 KB |
testcase_106 | AC | 38 ms
71,432 KB |
testcase_107 | AC | 62 ms
74,536 KB |
testcase_108 | AC | 60 ms
74,616 KB |
testcase_109 | AC | 53 ms
73,260 KB |
testcase_110 | AC | 46 ms
72,916 KB |
testcase_111 | AC | 55 ms
73,208 KB |
testcase_112 | AC | 32 ms
70,540 KB |
testcase_113 | AC | 46 ms
72,688 KB |
testcase_114 | AC | 38 ms
71,404 KB |
testcase_115 | AC | 25 ms
69,488 KB |
testcase_116 | AC | 41 ms
71,544 KB |
testcase_117 | AC | 34 ms
70,540 KB |
testcase_118 | AC | 58 ms
74,000 KB |
testcase_119 | AC | 44 ms
71,836 KB |
testcase_120 | AC | 57 ms
73,944 KB |
testcase_121 | AC | 31 ms
70,476 KB |
testcase_122 | AC | 39 ms
71,636 KB |
testcase_123 | AC | 20 ms
68,848 KB |
testcase_124 | AC | 98 ms
85,148 KB |
testcase_125 | AC | 99 ms
85,188 KB |
ソースコード
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> #include<array> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acosl(-1.0); ll mod_pow(ll x, ll n, ll m = mod) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 22; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } void solve() { int n; cin >> n; vector<int> a(n), b(n); vector<vector<int>> G(n); rep(i, n) { cin >> a[i] >> b[i]; a[i]--; b[i]--; G[a[i]].push_back(b[i]); G[b[i]].push_back(a[i]); } vector<int> vs; vector<bool> used(n); int las = 0; function<bool(int, int)> dfs = [&](int id, int fr)->bool { used[id] = true; for (int to : G[id])if (to != fr) { if (used[to]) { vs.push_back(id); las = to; return true; } if (dfs(to, id)) { vs.push_back(id); return true; } } return false; }; dfs(0, -1); vector<bool> inc(n, false); rep(i, vs.size()) { inc[vs[i]] = true; if (vs[i] == las)break; } vector<int> ans; rep(i, n) { if (inc[a[i]] && inc[b[i]]) { ans.push_back(i); } } cout << ans.size() << "\n"; rep(i, ans.size()) { if (i > 0)cout << " "; cout << ans[i] + 1; } cout << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(15); //init_f(); //init(); //expr(); //int t; cin >> t; rep(i, t) solve(); return 0; }