#915460 (C++17) No.1898 Battle and Exchange

提出ソース

結果

問題	No.1898 Battle and Exchange
ユーザー	FF256grhy
提出日時	2023-09-23 12:59:40
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	938 ms / 5,000 ms
コード長	7,401 bytes
コンパイル時間	2,303 ms
コンパイル使用メモリ	223,876 KB
実行使用メモリ	11,784 KB
最終ジャッジ日時	2024-07-16 12:37:15
合計ジャッジ時間	21,740 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	4 ms 6,940 KB
testcase_07	AC	3 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	17 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	3 ms 6,940 KB
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	3 ms 6,940 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	3 ms 6,940 KB
testcase_17	AC	21 ms 6,940 KB
testcase_18	AC	96 ms 6,944 KB
testcase_19	AC	184 ms 6,944 KB
testcase_20	AC	121 ms 6,940 KB
testcase_21	AC	489 ms 9,216 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,944 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	3 ms 6,940 KB
testcase_26	AC	2 ms 6,944 KB
testcase_27	AC	7 ms 6,944 KB
testcase_28	AC	9 ms 6,940 KB
testcase_29	AC	21 ms 6,944 KB
testcase_30	AC	4 ms 6,940 KB
testcase_31	AC	2 ms 6,940 KB
testcase_32	AC	209 ms 6,944 KB
testcase_33	AC	223 ms 7,040 KB
testcase_34	AC	174 ms 6,940 KB
testcase_35	AC	289 ms 6,940 KB
testcase_36	AC	152 ms 6,944 KB
testcase_37	AC	70 ms 6,940 KB
testcase_38	AC	938 ms 11,784 KB
testcase_39	AC	269 ms 10,220 KB
testcase_40	AC	817 ms 11,016 KB
testcase_41	AC	210 ms 9,932 KB
testcase_42	AC	28 ms 6,944 KB
testcase_43	AC	210 ms 7,936 KB
testcase_44	AC	2 ms 6,940 KB
testcase_45	AC	59 ms 6,940 KB
testcase_46	AC	245 ms 6,940 KB
testcase_47	AC	33 ms 6,940 KB
testcase_48	AC	35 ms 6,940 KB
testcase_49	AC	8 ms 6,944 KB
testcase_50	AC	8 ms 6,944 KB
testcase_51	AC	8 ms 6,944 KB
testcase_52	AC	12 ms 6,940 KB
testcase_53	AC	56 ms 6,940 KB
testcase_54	AC	77 ms 6,940 KB
testcase_55	AC	133 ms 6,940 KB
testcase_56	AC	72 ms 6,944 KB
testcase_57	AC	658 ms 10,088 KB
testcase_58	AC	692 ms 10,080 KB
testcase_59	AC	554 ms 9,984 KB
testcase_60	AC	673 ms 9,984 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>>;

#define SUM(a) accumulate(ALL(a), 0)

int main() {
	int IN(n, m);
	vector<vector<int>> g(n + 1);
	inc(i, m) {
		int IN(a, b);
		g[a].PB(b);
		g[b].PB(a);
		if(a > b) { swap(a, b); }
		if(a == 1) { g[0].PB(b); }
	}
	
	vector<array<int, 3>> c(n + 1);
	inc1(i, n) { in(c[i]); }
	ST(c[1]);
	int c12 = c[1][2];
	
	auto f = [&](int x) -> bool {
		LPQ<pair<int, int>> q;
		vector<bool> vis(n + 1, false);
		auto add = [&](int v) {
			if(vis[v]) { return; }
			vis[v] = true;
			q.emplace(SUM(c[v]), v);
		};
		
		multiset<int> ms = { 1, c12, x - 2 };
		add(0);
		until(q.empty()) {
			auto [s, v] = q.top(); q.pop();
			if(SUM(ms) <= s) { return false; }
			if(v == n) { return true; }
			
			RF(e, c[v]) { ms.insert(e); }
			inc(i, 3) { ms.erase(ms.begin()); }
			RF(w, g[v]) { add(w); }
		}
		UR;
	};
	
	int ng = SUM(c[1]), ok = 0;
	RF(a, c) { setmax(ok, SUM(a) + 1); }
	c[1][2] = 1;
	until(abs(ok - ng) <= 1) {
		int mid = (ok + ng) / 2;
		(f(mid) ? ok : ng) = mid;
	}
	out(1, 1, ok - 2);
}

yukicoder

結果

テストケース

ソースコード