結果
問題 | No.2100 [Cherry Alpha C] Two-way Steps |
ユーザー |
|
提出日時 | 2022-10-14 22:18:30 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 210 ms / 2,000 ms |
コード長 | 4,061 bytes |
コンパイル時間 | 1,295 ms |
コンパイル使用メモリ | 120,876 KB |
最終ジャッジ日時 | 2025-02-08 04:14:38 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 48 |
ソースコード
#include <cstdio>#include <cstdint>#include <cmath>#include <cstring>#include <iostream>#include <iomanip>#include <vector>#include <map>#include <unordered_map>#include <set>#include <unordered_set>#include <queue>#include <algorithm>#include <numeric>#include <cassert>using namespace std;namespace atcoder{};using namespace atcoder;using ull = uint64_t;using ll = int64_t;using vi = vector<int>;using vll = vector<ll>;using vs = vector<string>;using ld = long double;using P = pair<ll,ll>;using G = vector<vector<int>>;#ifdef MYDEBUGtemplate<class C> string join(const C& c){stringstream ss; for(auto it=c.begin(); it!=c.end();it++){ss << *it;if(it!=c.end())ss<<", ";}return ss.str();}template<class C> ostream &operator<<(ostream &os, const vector<C>& c){for(auto it=c.begin(); it!=c.end();it++){os << *it;if(it!=c.end())os<<", ";}return os;}#define LO(...) fprintf(stderr, __VA_ARGS__)#define debug(x) cerr << "\033[33m(line:" << __LINE__ << ") " << #x << ": " << x << "\033[m" << endl#else#define LO(...) (void)0#define debug(x) (void)0#endif#define reps(i,a,n) for(ll i##_len = (ll)(n), i = (a); i < i##_len; ++i)#define rep(i,n) reps(i,0,n)#define rrep(i,n) reps(i,1,n+1)#define repd(i,n) for(ll i=n-1;i>=0;i--)#define rrepd(i,n) for(ll i=n;i>=1;i--)#define inp(i) ll i; cin >> i;#define inps(s) string s; cin >> s;#define inpp(p) cin >> (p).first >> (p).second#define inpv(v,N) vll v(N);rep(i,N)cin>>v[i];#define inpg(g,N,M) g.resize(N);rep(i,M){inp(a);inp(b);a--,b--;g[a].push_back(b);g[b].push_back(a);}#define all(v) begin(v),end(v)#define YESNO(b) cout<<(b?"YES\n":"NO\n")#define yesno(b) cout<<(b?"yes\n":"no\n")#define YesNo(b) cout<<(b?"Yes\n":"No\n")#define YES cout<<"YES\n"#define NO cout<<"NO\n"#define yes cout<<"yes\n"#define no cout<<"no\n"#define Yes cout<<"Yes\n"#define No cout<<"No\n"#define SP cout << " "#define ENDL cout << "\n"#define ou(i) cout << (i)#define ous(i) cout << (i) << " "#define oul(i) cout << (i) << "\n"#define setfp() cout << fixed << setprecision(16)template<typename C> void ouv(const C &v){for(auto &&e:v){cout << e;if(&e != &v.back()) cout << ' ';}cout << "\n";}template<typename C> void ouvadd(const C &v){for(auto &&e:v){cout << e+1;if(&e != &v.back()) cout << ' ';}cout << "\n";}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; }inline ll lg(ll __n) { return sizeof(ll) * __CHAR_BIT__ - 1 - __builtin_clzl(__n); }int dx[8]={1,0,-1,0,1,-1,-1,1};int dy[8]={0,1,0,-1,1,1,-1,-1};constexpr ll INF = 1e18;ll dpa[101000][2];ll dpb[101000][2];int main(){inp(N);inp(M);inpv(H,N);G g;inpg(g,N,M);rep(i,N){dpa[i][0] = -INF;dpa[i][1] = -INF;dpb[i][0] = -INF;dpb[i][1] = -INF;}dpa[0][0] = 0;rep(i,N-1){ll mx0 = -INF;ll mx1 = -INF;for(int d : g[i+1]){if(d > i+1)continue;LO("%ld <> %ld\n", i+1,d);if(H[i+1] > H[d]){chmax(mx1, dpa[d][0] + H[i+1] - H[d]);}else{chmax(mx0, dpa[d][0]);chmax(mx0, dpa[d][1]);}}dpa[i+1][0] = mx0;dpa[i+1][1] = mx1;LO("%ld -> %ld %ld\n",i, dpa[i+1][0], dpa[i+1][1]);}ll an = max(dpa[N-1][0], dpa[N-1][1]);if(an < -1e16){oul(-1);}else{oul(an);}dpb[N-1][0] = 0;for(ll i = N-2; i>=0; i--){ll mx0 = -INF;ll mx1 = -INF;for(int d : g[i]){if(d < i)continue;if(H[i] > H[d]){chmax(mx1, dpb[d][0] + H[i] - H[d]);}else{chmax(mx0, dpb[d][0]);chmax(mx0, dpb[d][1]);}}dpb[i][0] = mx0;dpb[i][1] = mx1;}an = max(dpb[0][0], dpb[0][1]);if(an < -1e16){oul(-1);}else{oul(an);}return 0;}