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

提出ソース

結果

問題	No.1254 補強への架け橋
ユーザー	FF256grhy
提出日時	2023-08-24 07:58:13
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	134 ms / 2,000 ms
コード長	7,158 bytes
コンパイル時間	2,980 ms
コンパイル使用メモリ	219,456 KB
実行使用メモリ	22,784 KB
最終ジャッジ日時	2024-12-22 19:39:41
合計ジャッジ時間	16,449 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	2 ms 6,816 KB
testcase_06	AC	2 ms 6,816 KB
testcase_07	AC	2 ms 6,816 KB
testcase_08	AC	2 ms 6,820 KB
testcase_09	AC	2 ms 6,816 KB
testcase_10	AC	2 ms 6,820 KB
testcase_11	AC	2 ms 6,816 KB
testcase_12	AC	2 ms 6,816 KB
testcase_13	AC	2 ms 6,816 KB
testcase_14	AC	2 ms 6,820 KB
testcase_15	AC	2 ms 6,816 KB
testcase_16	AC	2 ms 6,820 KB
testcase_17	AC	2 ms 6,820 KB
testcase_18	AC	2 ms 6,816 KB
testcase_19	AC	2 ms 6,820 KB
testcase_20	AC	2 ms 6,816 KB
testcase_21	AC	2 ms 6,820 KB
testcase_22	AC	2 ms 6,820 KB
testcase_23	AC	2 ms 6,816 KB
testcase_24	AC	2 ms 6,820 KB
testcase_25	AC	2 ms 6,816 KB
testcase_26	AC	2 ms 6,816 KB
testcase_27	AC	2 ms 6,816 KB
testcase_28	AC	2 ms 6,824 KB
testcase_29	AC	2 ms 6,824 KB
testcase_30	AC	2 ms 6,816 KB
testcase_31	AC	2 ms 6,816 KB
testcase_32	AC	2 ms 6,816 KB
testcase_33	AC	2 ms 6,816 KB
testcase_34	AC	3 ms 6,820 KB
testcase_35	AC	2 ms 6,816 KB
testcase_36	AC	2 ms 6,820 KB
testcase_37	AC	2 ms 6,816 KB
testcase_38	AC	2 ms 6,816 KB
testcase_39	AC	2 ms 6,820 KB
testcase_40	AC	2 ms 6,820 KB
testcase_41	AC	2 ms 6,816 KB
testcase_42	AC	2 ms 6,820 KB
testcase_43	AC	2 ms 6,820 KB
testcase_44	AC	2 ms 6,816 KB
testcase_45	AC	2 ms 6,820 KB
testcase_46	AC	3 ms 6,820 KB
testcase_47	AC	3 ms 6,816 KB
testcase_48	AC	2 ms 6,816 KB
testcase_49	AC	2 ms 6,816 KB
testcase_50	AC	3 ms 6,816 KB
testcase_51	AC	3 ms 6,816 KB
testcase_52	AC	3 ms 6,820 KB
testcase_53	AC	2 ms 6,816 KB
testcase_54	AC	3 ms 6,816 KB
testcase_55	AC	2 ms 6,816 KB
testcase_56	AC	2 ms 6,816 KB
testcase_57	AC	2 ms 6,820 KB
testcase_58	AC	3 ms 6,816 KB
testcase_59	AC	2 ms 6,820 KB
testcase_60	AC	2 ms 6,820 KB
testcase_61	AC	2 ms 6,816 KB
testcase_62	AC	2 ms 6,820 KB
testcase_63	AC	10 ms 6,816 KB
testcase_64	AC	4 ms 6,816 KB
testcase_65	AC	7 ms 6,816 KB
testcase_66	AC	6 ms 6,816 KB
testcase_67	AC	3 ms 6,816 KB
testcase_68	AC	6 ms 6,816 KB
testcase_69	AC	8 ms 6,820 KB
testcase_70	AC	4 ms 6,816 KB
testcase_71	AC	4 ms 6,816 KB
testcase_72	AC	8 ms 6,816 KB
testcase_73	AC	4 ms 6,816 KB
testcase_74	AC	7 ms 6,816 KB
testcase_75	AC	6 ms 6,816 KB
testcase_76	AC	3 ms 6,820 KB
testcase_77	AC	5 ms 6,816 KB
testcase_78	AC	10 ms 6,816 KB
testcase_79	AC	9 ms 6,816 KB
testcase_80	AC	8 ms 6,816 KB
testcase_81	AC	10 ms 6,816 KB
testcase_82	AC	9 ms 6,816 KB
testcase_83	AC	100 ms 14,336 KB
testcase_84	AC	93 ms 13,952 KB
testcase_85	AC	57 ms 9,984 KB
testcase_86	AC	81 ms 12,672 KB
testcase_87	AC	89 ms 13,440 KB
testcase_88	AC	14 ms 6,816 KB
testcase_89	AC	93 ms 14,312 KB
testcase_90	AC	60 ms 10,368 KB
testcase_91	AC	48 ms 8,832 KB
testcase_92	AC	25 ms 6,816 KB
testcase_93	AC	76 ms 12,032 KB
testcase_94	AC	67 ms 11,264 KB
testcase_95	AC	67 ms 11,392 KB
testcase_96	AC	92 ms 13,696 KB
testcase_97	AC	41 ms 8,064 KB
testcase_98	AC	94 ms 13,824 KB
testcase_99	AC	54 ms 9,856 KB
testcase_100	AC	100 ms 14,464 KB
testcase_101	AC	22 ms 6,816 KB
testcase_102	AC	12 ms 6,820 KB
testcase_103	AC	24 ms 6,820 KB
testcase_104	AC	32 ms 7,296 KB
testcase_105	AC	76 ms 12,032 KB
testcase_106	AC	42 ms 8,448 KB
testcase_107	AC	98 ms 14,336 KB
testcase_108	AC	95 ms 14,080 KB
testcase_109	AC	75 ms 11,904 KB
testcase_110	AC	64 ms 11,136 KB
testcase_111	AC	72 ms 11,648 KB
testcase_112	AC	31 ms 7,040 KB
testcase_113	AC	65 ms 10,880 KB
testcase_114	AC	43 ms 8,320 KB
testcase_115	AC	15 ms 6,816 KB
testcase_116	AC	50 ms 9,088 KB
testcase_117	AC	32 ms 7,040 KB
testcase_118	AC	84 ms 13,568 KB
testcase_119	AC	53 ms 9,600 KB
testcase_120	AC	86 ms 13,312 KB
testcase_121	AC	26 ms 6,816 KB
testcase_122	AC	46 ms 8,960 KB
testcase_123	AC	2 ms 6,820 KB
testcase_124	AC	134 ms 22,632 KB
testcase_125	AC	133 ms 22,784 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define incII(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };
auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a <  r); };
auto inXI = [](auto a, auto l, auto r) -> bool { return (l <  a && a <= r); };
auto inXX = [](auto a, auto l, auto r) -> bool { return (l <  a && a <  r); };
auto setmin   = [](auto & a, auto b) -> bool { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) -> bool { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };
using LL = long long int;
using LD = long double;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define RV(a) reverse(ALL(a))
#define ST(a) sort(ALL(a))
#define RST(a) sort(RALL(a))
#define SC static_cast
#define SI(a) SC<int>(a.size())
#define SL(a) SC<LL>(a.size())
#define RF(e, ...) for(auto && e: __VA_ARGS__)
#define SF(a, ...) for(auto && [__VA_ARGS__]: a)
#define until(...) while(not(__VA_ARGS__))
#define if_not(...) if(not(__VA_ARGS__))
#define ef else if
#define UR assert(false)
template<typename A>             istream & operator>>(istream & is, vector<A>          & v);
template<typename A>             ostream & operator<<(ostream & os, vector<A>    const & v);
template<typename A, size_t N>   istream & operator>>(istream & is, array<A, N>        & a);
template<typename A, size_t N>   ostream & operator<<(ostream & os, array<A, N>  const & a);
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>         & p);
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B>   const & p);
template<typename ... A>         istream & operator>>(istream & is, tuple<A ...>       & t);
template<typename ... A>         ostream & operator<<(ostream & os, tuple<A ...> const & t);
template<int I = 0, typename T> void tin_ (istream & is, T       & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } }
template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }
template<typename A>             istream & operator>>(istream & is, vector<A>          & v) { for(auto && e: v) { is >> e; } return is; }
template<typename A>             ostream & operator<<(ostream & os, vector<A>    const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }
template<typename A, size_t N>   istream & operator>>(istream & is, array<A, N>        & a) { for(auto && e: a) { is >> e; } return is; }
template<typename A, size_t N>   ostream & operator<<(ostream & os, array<A, N>  const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; }
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B>         & p) { return is >> p.first >> p.second; }
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B>   const & p) { return os << p.first << " " << p.second; }
template<typename ... A>         istream & operator>>(istream & is, tuple<A ...>       & t) { tin_ (is, t); return is; }
template<typename ... A>         ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }
auto * IS = & cin;
auto * OS = & cout;
template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }
#define IN(...) __VA_ARGS__; in(__VA_ARGS__)
template<typename A                > auto make_v(A a) { return a; }
template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }
template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }
void                                      out_([[maybe_unused]] string const & s) { }
template<typename A                > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }
template<typename A, typename ... B> void out_(                 string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }
auto outF  = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; };
auto outN  = [](auto const & ... a) { outF(""  , ""  , a ...); };
auto outS  = [](auto const & ... a) { outF(" " , " " , a ...); };
auto outL  = [](auto const & ... a) { outF("\n", "\n", a ...); };
auto outSN = [](auto const & ... a) { outF(" " , ""  , a ...); };
auto outNL = [](auto const & ... a) { outF(""  , "\n", a ...); };
auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); };
auto out   = outSL;
template<typename A                > void disp_(A const & a) { * OS << a; }
template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } }
auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };
auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };
auto dispL = [](auto const & a,                 auto const & ... t) { dispT(a, "\n", t ...); };
struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;

// ---- ----

int main() {
	using Graph = vector<vector<pair<int, int>>>;
	
	function<vector<int>(Graph, int)> find_cycle_edge = [](auto g, int s) {
		int n = SI(g);
		vector<bool> vis(n, false);
		vector<int> cycle_edge;
		int orig;
		function<bool(int, int)> dfs = [&](int v, int pid) {
			if(vis[v]) { if(vis[v]) { orig = v; return true; } }
			vis[v] = true;
			
			SF(g[v], w, id) {
				if(id == pid) { continue; }
				
				if(dfs(w, id)) {
					if(orig != -1) { cycle_edge.PB(id); }
					if(orig == v) { orig = -1; }
					return true;
				}
			}
			return false;
		};
		dfs(s, -1);
		RV(cycle_edge);
		return cycle_edge;
	};
	
	int IN(n);
	Graph g(n);
	inc(i, n) {
		int IN(a, b);
		a--; b--;
		g[a].EB(b, i);
		g[b].EB(a, i);
	}
	
	auto ans = find_cycle_edge(g, 0);
	RF(e, ans) { e++; }
	sort(ALL(ans));
	outL(SI(ans), ans);
}

yukicoder

結果

テストケース

ソースコード