結果

問題 No.2100 [Cherry Alpha C] Two-way Steps
ユーザー 👑 hitonanodehitonanode
提出日時 2022-10-14 21:55:53
言語 C++23(draft)
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 63 ms / 2,000 ms
コード長 8,288 bytes
コンパイル時間 3,664 ms
コンパイル使用メモリ 177,416 KB
実行使用メモリ 10,472 KB
最終ジャッジ日時 2023-09-08 21:04:02
合計ジャッジ時間 6,708 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 48 ms
7,488 KB
testcase_05 AC 40 ms
6,256 KB
testcase_06 AC 8 ms
4,384 KB
testcase_07 AC 10 ms
4,380 KB
testcase_08 AC 47 ms
8,840 KB
testcase_09 AC 39 ms
5,620 KB
testcase_10 AC 20 ms
4,376 KB
testcase_11 AC 36 ms
6,688 KB
testcase_12 AC 28 ms
5,200 KB
testcase_13 AC 28 ms
7,584 KB
testcase_14 AC 24 ms
4,612 KB
testcase_15 AC 32 ms
7,208 KB
testcase_16 AC 26 ms
4,676 KB
testcase_17 AC 19 ms
6,716 KB
testcase_18 AC 29 ms
7,528 KB
testcase_19 AC 54 ms
8,556 KB
testcase_20 AC 14 ms
4,496 KB
testcase_21 AC 27 ms
5,460 KB
testcase_22 AC 26 ms
4,428 KB
testcase_23 AC 43 ms
8,036 KB
testcase_24 AC 62 ms
9,588 KB
testcase_25 AC 59 ms
9,520 KB
testcase_26 AC 61 ms
9,660 KB
testcase_27 AC 63 ms
9,620 KB
testcase_28 AC 62 ms
9,592 KB
testcase_29 AC 60 ms
9,576 KB
testcase_30 AC 60 ms
9,680 KB
testcase_31 AC 59 ms
9,612 KB
testcase_32 AC 59 ms
9,688 KB
testcase_33 AC 60 ms
9,680 KB
testcase_34 AC 34 ms
4,848 KB
testcase_35 AC 30 ms
4,764 KB
testcase_36 AC 30 ms
4,560 KB
testcase_37 AC 28 ms
4,596 KB
testcase_38 AC 32 ms
4,628 KB
testcase_39 AC 25 ms
4,380 KB
testcase_40 AC 26 ms
4,380 KB
testcase_41 AC 25 ms
4,384 KB
testcase_42 AC 26 ms
4,380 KB
testcase_43 AC 26 ms
4,384 KB
testcase_44 AC 37 ms
10,432 KB
testcase_45 AC 37 ms
10,380 KB
testcase_46 AC 36 ms
10,400 KB
testcase_47 AC 38 ms
10,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> H(N);
    cin >> H;
    vector<vector<int>> to(N);
    while (M--) {
        int x, y;
        cin >> x >> y;
        --x, --y;
        to.at(y).push_back(x);
    }

    lint ret1;

    constexpr lint INF = 1LL << 60;

    vector<lint> dpup(N, -INF), dpdown(N, -INF);
    dpup[0] = dpdown[0] = 0;

    FOR(now, 1, N) {
        for (int prv : to.at(now)) {
            lint nup = max(0, H.at(now) - H.at(prv));
            if (nup <= 0) {
                chmax(dpup[now], dpdown[prv] + nup);
                chmax(dpdown[now], dpdown[prv] + nup);
                chmax(dpup[now], dpup[prv] + nup);
                chmax(dpdown[now], dpup[prv] + nup);
            } else {
                chmax(dpdown[now], dpup[prv] + nup);
            }
        }
    }

    ret1 = max(dpup.back(), dpdown.back());
    if (ret1 < 0) ret1 = -1;
    cout << ret1 << endl;

    dpup.assign(N, -INF);
    dpdown.assign(N, -INF);
    dpup[0] = dpdown[0] = 0;

    FOR(now, 1, N) {
        for (int prv : to.at(now)) {
            lint ndown = max(0, H.at(prv) - H.at(now));
            if (ndown <= 0) {
                chmax(dpup[now], dpdown[prv] + ndown);
                chmax(dpdown[now], dpdown[prv] + ndown);
                chmax(dpup[now], dpup[prv] + ndown);
                chmax(dpdown[now], dpup[prv] + ndown);
            } else {
                chmax(dpup[now], dpdown[prv] + ndown);
            }
        }
    }
    ret1 = max(dpup.back(), dpdown.back());
    if (ret1 < 0) ret1 = -1;
    cout << ret1 << endl;
}
0