結果

問題 No.2100 [Cherry Alpha C] Two-way Steps
ユーザー FF256grhyFF256grhy
提出日時 2023-09-23 13:43:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 167 ms / 2,000 ms
コード長 6,934 bytes
コンパイル時間 1,985 ms
コンパイル使用メモリ 212,832 KB
実行使用メモリ 15,612 KB
最終ジャッジ日時 2023-09-23 13:43:59
合計ジャッジ時間 9,297 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 108 ms
11,268 KB
testcase_05 AC 90 ms
9,224 KB
testcase_06 AC 18 ms
5,016 KB
testcase_07 AC 24 ms
5,204 KB
testcase_08 AC 122 ms
13,620 KB
testcase_09 AC 87 ms
7,860 KB
testcase_10 AC 47 ms
4,848 KB
testcase_11 AC 84 ms
10,056 KB
testcase_12 AC 61 ms
6,732 KB
testcase_13 AC 75 ms
11,028 KB
testcase_14 AC 56 ms
5,664 KB
testcase_15 AC 76 ms
10,892 KB
testcase_16 AC 60 ms
5,688 KB
testcase_17 AC 54 ms
9,836 KB
testcase_18 AC 77 ms
11,128 KB
testcase_19 AC 143 ms
13,376 KB
testcase_20 AC 30 ms
5,792 KB
testcase_21 AC 60 ms
7,304 KB
testcase_22 AC 57 ms
5,628 KB
testcase_23 AC 108 ms
11,928 KB
testcase_24 AC 156 ms
15,084 KB
testcase_25 AC 151 ms
15,068 KB
testcase_26 AC 148 ms
15,208 KB
testcase_27 AC 152 ms
15,112 KB
testcase_28 AC 153 ms
15,200 KB
testcase_29 AC 147 ms
15,024 KB
testcase_30 AC 147 ms
15,072 KB
testcase_31 AC 144 ms
14,932 KB
testcase_32 AC 167 ms
15,052 KB
testcase_33 AC 154 ms
15,116 KB
testcase_34 AC 79 ms
5,960 KB
testcase_35 AC 74 ms
5,664 KB
testcase_36 AC 73 ms
5,648 KB
testcase_37 AC 67 ms
5,384 KB
testcase_38 AC 76 ms
5,884 KB
testcase_39 AC 59 ms
5,076 KB
testcase_40 AC 59 ms
5,088 KB
testcase_41 AC 60 ms
5,060 KB
testcase_42 AC 59 ms
5,516 KB
testcase_43 AC 58 ms
5,252 KB
testcase_44 AC 105 ms
15,432 KB
testcase_45 AC 103 ms
15,484 KB
testcase_46 AC 104 ms
15,612 KB
testcase_47 AC 109 ms
15,596 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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() {
	int IN(n, m);
	auto h = read_v<LL>(n);
	auto E = read_v<array<int, 2>>(m);
	SF(E, x, y) { x--; y--; }
	
	auto f = [&] {
		vector<vector<int>> g(n);
		SF(E, x, y) { g[x].PB(y); }
		
		auto dp = make_v<LL>(-1, n, 2);
		dp[0][0] = 0;
		inc(x, n) {
		inc(k, 2) {
			if(dp[x][k] == -1) { continue; }
			RF(y, g[x]) {
				int up = (h[x] < h[y] ? 1 : 0);
				if_not(k == 1 && up == 1) {
					setmax(dp[y][up], dp[x][k] + up * (h[y] - h[x]));
				}
			}
		}
		}
		out(* max_element(ALL(dp.BA)));
	};
	
	f();
	RV(h);
	SF(E, x, y) {
		x = n - 1 - x;
		y = n - 1 - y;
		swap(x, y);
	}
	f();
}
0