結果
問題 | No.2100 [Cherry Alpha C] Two-way Steps |
ユーザー | tokusakurai |
提出日時 | 2022-10-14 21:41:59 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 100 ms / 2,000 ms |
コード長 | 4,163 bytes |
コンパイル時間 | 2,174 ms |
コンパイル使用メモリ | 210,220 KB |
実行使用メモリ | 25,856 KB |
最終ジャッジ日時 | 2024-06-26 13:31:52 |
合計ジャッジ時間 | 6,383 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 67 ms
17,152 KB |
testcase_05 | AC | 53 ms
13,184 KB |
testcase_06 | AC | 12 ms
6,400 KB |
testcase_07 | AC | 14 ms
7,040 KB |
testcase_08 | AC | 73 ms
22,144 KB |
testcase_09 | AC | 56 ms
10,880 KB |
testcase_10 | AC | 25 ms
5,376 KB |
testcase_11 | AC | 51 ms
15,232 KB |
testcase_12 | AC | 36 ms
9,088 KB |
testcase_13 | AC | 45 ms
17,920 KB |
testcase_14 | AC | 31 ms
6,400 KB |
testcase_15 | AC | 50 ms
17,152 KB |
testcase_16 | AC | 33 ms
6,656 KB |
testcase_17 | AC | 32 ms
16,128 KB |
testcase_18 | AC | 47 ms
18,176 KB |
testcase_19 | AC | 82 ms
20,992 KB |
testcase_20 | AC | 19 ms
7,424 KB |
testcase_21 | AC | 35 ms
10,112 KB |
testcase_22 | AC | 32 ms
6,656 KB |
testcase_23 | AC | 66 ms
18,944 KB |
testcase_24 | AC | 94 ms
23,936 KB |
testcase_25 | AC | 98 ms
24,064 KB |
testcase_26 | AC | 100 ms
24,064 KB |
testcase_27 | AC | 93 ms
24,064 KB |
testcase_28 | AC | 99 ms
24,064 KB |
testcase_29 | AC | 92 ms
24,064 KB |
testcase_30 | AC | 94 ms
24,064 KB |
testcase_31 | AC | 94 ms
24,064 KB |
testcase_32 | AC | 95 ms
24,064 KB |
testcase_33 | AC | 93 ms
24,064 KB |
testcase_34 | AC | 43 ms
6,656 KB |
testcase_35 | AC | 38 ms
6,016 KB |
testcase_36 | AC | 38 ms
5,888 KB |
testcase_37 | AC | 35 ms
5,760 KB |
testcase_38 | AC | 42 ms
6,144 KB |
testcase_39 | AC | 30 ms
5,376 KB |
testcase_40 | AC | 30 ms
5,376 KB |
testcase_41 | AC | 29 ms
5,376 KB |
testcase_42 | AC | 29 ms
5,376 KB |
testcase_43 | AC | 29 ms
5,376 KB |
testcase_44 | AC | 64 ms
25,728 KB |
testcase_45 | AC | 63 ms
25,728 KB |
testcase_46 | AC | 62 ms
25,856 KB |
testcase_47 | AC | 63 ms
25,856 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; // const int MOD = 1000000007; const int MOD = 998244353; int main() { int N, M; cin >> N >> M; vector<ll> h(N); rep(i, N) cin >> h[i]; vector<vector<int>> es1(N), es2(N); rep(i, M) { int u, v; cin >> u >> v; u--, v--; if (u > v) swap(u, v); es1[u].eb(v), es2[v].eb(u); } vector<vector<ll>> dp1(N, vector<ll>(2, -INF)), dp2(N, vector<ll>(2, -INF)); dp1[0][0] = 0, dp2[N - 1][0] = 0; rep(i, N) { rep(j, 2) { if (dp1[i][j] == -INF) continue; each(e, es1[i]) { if (h[e] > h[i]) { if (j == 0) chmax(dp1[e][1], dp1[i][j] + h[e] - h[i]); } else { chmax(dp1[e][0], dp1[i][j]); } } } } per(i, N) { rep(j, 2) { if (dp2[i][j] == -INF) continue; each(e, es2[i]) { if (h[e] > h[i]) { if (j == 0) chmax(dp2[e][1], dp2[i][j] + h[e] - h[i]); } else { chmax(dp2[e][0], dp2[i][j]); } } } } ll X = *max_element(all(dp1[N - 1])); ll Y = *max_element(all(dp2[0])); cout << (X == -INF ? -1 : X) << '\n'; cout << (Y == -INF ? -1 : Y) << '\n'; }