結果

問題 No.2100 [Cherry Alpha C] Two-way Steps
ユーザー a16784542a16784542
提出日時 2022-10-14 22:34:39
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 185 ms / 2,000 ms
コード長 4,480 bytes
コンパイル時間 4,960 ms
コンパイル使用メモリ 263,952 KB
実行使用メモリ 21,808 KB
最終ジャッジ日時 2023-09-08 22:45:10
合計ジャッジ時間 12,075 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,384 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,384 KB
testcase_03 AC 2 ms
4,384 KB
testcase_04 AC 134 ms
16,256 KB
testcase_05 AC 107 ms
12,452 KB
testcase_06 AC 21 ms
5,596 KB
testcase_07 AC 27 ms
6,600 KB
testcase_08 AC 136 ms
19,616 KB
testcase_09 AC 104 ms
10,832 KB
testcase_10 AC 53 ms
5,860 KB
testcase_11 AC 99 ms
13,768 KB
testcase_12 AC 74 ms
8,824 KB
testcase_13 AC 84 ms
15,756 KB
testcase_14 AC 64 ms
7,040 KB
testcase_15 AC 89 ms
15,088 KB
testcase_16 AC 70 ms
7,364 KB
testcase_17 AC 60 ms
14,036 KB
testcase_18 AC 86 ms
15,888 KB
testcase_19 AC 157 ms
19,064 KB
testcase_20 AC 35 ms
6,940 KB
testcase_21 AC 73 ms
9,400 KB
testcase_22 AC 68 ms
6,936 KB
testcase_23 AC 123 ms
17,160 KB
testcase_24 AC 178 ms
21,792 KB
testcase_25 AC 173 ms
21,808 KB
testcase_26 AC 174 ms
21,424 KB
testcase_27 AC 181 ms
21,436 KB
testcase_28 AC 182 ms
21,652 KB
testcase_29 AC 185 ms
21,564 KB
testcase_30 AC 178 ms
21,768 KB
testcase_31 AC 172 ms
21,492 KB
testcase_32 AC 173 ms
21,488 KB
testcase_33 AC 176 ms
21,688 KB
testcase_34 AC 95 ms
7,984 KB
testcase_35 AC 82 ms
7,556 KB
testcase_36 AC 82 ms
7,228 KB
testcase_37 AC 77 ms
7,440 KB
testcase_38 AC 87 ms
7,184 KB
testcase_39 AC 67 ms
8,076 KB
testcase_40 AC 67 ms
8,116 KB
testcase_41 AC 67 ms
8,020 KB
testcase_42 AC 68 ms
8,144 KB
testcase_43 AC 67 ms
8,368 KB
testcase_44 AC 113 ms
20,244 KB
testcase_45 AC 112 ms
20,180 KB
testcase_46 AC 110 ms
20,112 KB
testcase_47 AC 110 ms
20,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if !__INCLUDE_LEVEL__

#include __FILE__

struct Solver {
void solve() {
    int n,m;cin>>n>>m;
    V<int> h(n);
    cin>>h;
    V<V<int>> g(n);
    rep(i,m){
        int a,b;cin>>a>>b;
        a--;b--;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
    }

    V<V<int>> col1(n,V<int>(2,-1));
    col1[0][0]=col1[0][1]=0;
    rep(i,n){
        for(auto j:g[i]){
            if(j<i)continue;
            if(h[i]<h[j]){
                if(0ll<=col1[i][0])chmax(col1[j][1],col1[i][0]+h[j]-h[i]);
            }
            else{
                if(0ll<=col1[i][0])chmax(col1[j][0],col1[i][0]);
                if(0ll<=col1[i][1])chmax(col1[j][0],col1[i][1]);
            }
        }
    }
    ll ans=max(col1[n-1][0],col1[n-1][1]);
    cout<<ans<<endl;
    
    V<V<int>> col2(n,V<int>(2,-1));
    col2[n-1][0]=col2[n-1][1]=0;
    rrep(i,n){
        for(auto j:g[i]){
            if(j>i)continue;
            if(h[i]<h[j]){
                if(0ll<=col2[i][0])chmax(col2[j][1],col2[i][0]+h[j]-h[i]);
            }
            else{
                if(0ll<=col2[i][0])chmax(col2[j][0],col2[i][0]);
                if(0ll<=col2[i][1])chmax(col2[j][0],col2[i][1]);
            }
        }
    }
    ll ans2=max(col2[0][0],col2[0][1]);
    cout<<ans2<<endl;
}};

signed main() {
    int ts = 1;
    // scanf("%lld",&ts);
    rep(ti,ts) {
        Solver solver;
        solver.solve();
    }
  return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

#define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;
template <class T> using V = vector<T>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}

const int INF = 1001001001;
const ll INFL = 3e18;
const int MAX = 2e6+5;


#endif
0