#908305 (C++17) No.1480 Many Complete Graphs

提出ソース

結果

問題	No.1480 Many Complete Graphs
ユーザー	FF256grhy
提出日時	2023-08-26 17:16:07
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	146 ms / 2,000 ms
コード長	7,260 bytes
コンパイル時間	2,409 ms
コンパイル使用メモリ	215,048 KB
実行使用メモリ	21,120 KB
最終ジャッジ日時	2024-06-07 12:50:52
合計ジャッジ時間	8,250 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	3 ms 5,376 KB
testcase_10	AC	3 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	21 ms 7,680 KB
testcase_14	AC	16 ms 6,016 KB
testcase_15	AC	34 ms 8,576 KB
testcase_16	AC	20 ms 7,296 KB
testcase_17	AC	21 ms 6,784 KB
testcase_18	AC	6 ms 5,888 KB
testcase_19	AC	21 ms 6,784 KB
testcase_20	AC	31 ms 7,168 KB
testcase_21	AC	25 ms 7,296 KB
testcase_22	AC	15 ms 5,376 KB
testcase_23	AC	53 ms 11,264 KB
testcase_24	AC	50 ms 8,960 KB
testcase_25	AC	65 ms 10,752 KB
testcase_26	AC	75 ms 11,648 KB
testcase_27	AC	54 ms 8,960 KB
testcase_28	AC	66 ms 13,412 KB
testcase_29	AC	67 ms 13,420 KB
testcase_30	AC	65 ms 12,800 KB
testcase_31	AC	65 ms 13,416 KB
testcase_32	AC	65 ms 13,544 KB
testcase_33	AC	64 ms 12,928 KB
testcase_34	AC	64 ms 13,412 KB
testcase_35	AC	63 ms 12,800 KB
testcase_36	AC	63 ms 12,800 KB
testcase_37	AC	64 ms 13,416 KB
testcase_38	AC	62 ms 12,928 KB
testcase_39	AC	62 ms 13,544 KB
testcase_40	AC	66 ms 12,800 KB
testcase_41	AC	68 ms 12,928 KB
testcase_42	AC	72 ms 13,416 KB
testcase_43	AC	65 ms 13,420 KB
testcase_44	AC	65 ms 13,416 KB
testcase_45	AC	66 ms 13,424 KB
testcase_46	AC	65 ms 13,544 KB
testcase_47	AC	146 ms 19,328 KB
testcase_48	AC	144 ms 19,200 KB
testcase_49	AC	146 ms 19,456 KB
testcase_50	AC	91 ms 18,816 KB
testcase_51	AC	145 ms 19,328 KB
testcase_52	AC	104 ms 16,004 KB
testcase_53	AC	104 ms 16,140 KB
testcase_54	AC	104 ms 15,976 KB
testcase_55	AC	104 ms 16,124 KB
testcase_56	AC	105 ms 16,148 KB
testcase_57	AC	94 ms 21,120 KB
testcase_58	AC	96 ms 20,372 KB
evil_aftercontest.txt	AC	199 ms 37,596 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_;

// ---- ----

template<typename T> using LPQ = priority_queue<T, vector<T>, greater<T>>;
template<typename T> vector<T> dijkstra(vector<vector<pair<int, T>>> const & g, int s) {
	int n = SI(g);
	vector<T> d(n, -1);
	LPQ<pair<T, int>> q;
	d[s] = 0; q.emplace(d[s], s);
	while(! q.empty()) {
		auto [dv, v] = q.top(); q.pop();
		if(d[v] != dv) { continue; }
		for(auto [w, dw]: g[v]) {
			if(d[w] == -1 || d[w] > dv + dw) { d[w] = dv + dw; q.emplace(d[w], w); }
		}
	}
	return d;
}

int main() {
	int IN(n, m);
	vector<vector<pair<int, LL>>> g(n + 4 * m);
	inc(i, m) {
		LL IN(k, c);
		int p = n + 4 * i;
		g[p    ].EB(p + 2, 2 * c    );
		g[p    ].EB(p + 3, 2 * c + 1);
		g[p + 1].EB(p + 2, 2 * c + 1);
		g[p + 1].EB(p + 3, 2 * c    );
		inc(kk_, k) {
			LL IN(s);
			g[s - 1].EB(p + 0 + s % 2, s);
			g[p + 2 + s % 2].EB(s - 1, s);
		}
	}
	LL ans = dijkstra(g, 0)[n - 1];
	if(ans != -1) { assert(ans % 2 == 0); ans /= 2; }
	out(ans);
}

yukicoder

結果

テストケース

ソースコード