#include using namespace std; #if __has_include() #include using namespace atcoder; #endif using ll = long long; using ld = long double; using ull = unsigned long long; #define endl "\n" typedef pair Pii; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i)) #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(x) begin(x), end(x) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define fore(i,a) for(auto &i:a) #define all(s) (s).begin(),(s).end() #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) #define rever(vec) reverse(vec.begin(), vec.end()) #define sor(vec) sort(vec.begin(), vec.end()) #define fi first #define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_)) #define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i)) #define se second #define pb push_back #define P pair #define PQminll priority_queue, greater> #define PQmaxll priority_queue,less> #define PQminP priority_queue, greater

> #define PQmaxP priority_queue,less

> #define NP next_permutation //const ll mod = 1000000009; const ll mod = 998244353; //const ll mod = 1000000007; const ll inf = 4100000000000000000ll; const ld eps = ld(0.00000000001); static const long double pi = 3.141592653589793; templatevoid vcin(vector &n){for(int i=0;i>n[i];} templatevoid vcin(vector &n,vector &m){for(int i=0;i>n[i]>>m[i];} templatevoid vcout(vector &n){for(int i=0;ivoid vcin(vector> &n){for(int i=0;i>n[i][j];}}} templatevoid vcout(vector> &n){for(int i=0;i= 0; --(i)) templateauto min(const T& a){ return *min_element(all(a)); } templateauto max(const T& a){ return *max_element(all(a)); } templatevoid print(pair a){cout<bool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b void ifmin(T t,T u){if(t>u){cout<<-1< void ifmax(T t,T u){if(t>u){cout<<-1<>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<>= 1; } return ret; } vector divisor(ll x){ vector ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; } ll pop(ll x){return __builtin_popcountll(x);} ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;} P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;} P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});} P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});} P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});} P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});} P Pgyaku(P a){ return hyou({a.se,a.fi});} template struct Sum{ vector data; Sum(const vector& v):data(v.size()+1){ for(ll i=0;i struct Sum2{ vector> data; Sum2(const vector> &v):data(v.size()+1,vector(v[0].size()+1)){ for(int i=0;i par; vector siz; UnionFind(ll sz_):par(sz_),siz(sz_,1ll){ for(int i=0;i> g; vector d; vector negative; vector diameter; vector topological_sort; ll diametercost; bool bipartitecheck; vector bipartite; graph(ll n){ init(n); } void init(ll n){ v=n; g.resize(n); d.resize(n); negative.resize(n); diameter.resize(n); bipartite.resize(n); for(int i=0;i,greater

> que; que.push(P(0,s)); while(!que.empty()){ P p=que.top(); que.pop(); ll V=p.second; if(d[V]d[V]+e.cost){ d[e.to]=d[V]+e.cost; que.push(P(d[e.to],e.to)); } } } } void BellmanFord(ll s){ for(int i=0;id[V]+e.cost){ d[e.to]=d[V]+e.cost; if(i==v-1){ negative[e.to]=true; negative[V]=true; } } } } } } void bfs(ll s){ for(int i=0;i q; q.push(s); while(q.size()){ ll v=q.front(); q.pop(); for(auto e:g[v]){ assert(e.cost==1); if(chmin(d[e.to],d[v]+1)) q.push(e.to); } } } void treediameter(){ bfs(0); ll p=0; ll q=0; for(int i=0;i>n>>m>>c; vector a(n); vcin(a); graph g(n+1); for(int i=0;i b(n+1); for(int i=1;i<=n;i++) b[i]+=b[i-1]+a[i-1]; for(int i=0;i>x>>y; x--; y--; g.addedge(x,y+1,c-(b[y+1]-b[x])); } g.dijkstra(0); cout<<-g.d[n]<