text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int a[100010];
long long dp[100010];
int main () {
int n, E, T; scanf("%d%d%d", &n, &E, &T);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
int pos = 0;
long long minj = 0x3f3f3f3f3f3f3f3f;
for (int i = 1; i <= n; i++) {
while (2 * (a[i] - a[pos + 1]) >= T) minj = min(minj, dp[pos] - 2 * a[pos + 1]), pos++;
dp[i] = minj + 2 * a[i];
if (pos != i) dp[i] = min(dp[i], dp[pos] + T);
}
printf("%lld\n", dp[n] + E);
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define TRACE(x) cout << #x << " = " << x << endl
#define _ << " _ " <<
typedef long long llint;
const int MAX = 100100;
const llint inf = 1e18;
int x[MAX];
llint f[MAX];
int main(void) {
int N, E, T;
scanf("%d %d %d", &N, &E, &T);
REP(i, N) scanf("%d", &x[i]);
f[0] = 0;
multiset<llint> S2;
S2.insert(f[0]);
int j = 0;
llint best = inf;
for (int i = 1; i <= N; ++i) {
while (2*(x[i-1] - x[j]) > T) {
S2.erase(S2.find(f[j]));
best = min(best, f[j] - 2*x[j]);
j++;
}
f[i] = min(best + 2*x[i-1], *S2.begin() + T);
S2.insert(f[i]);
}
llint ans = E + f[N];
//printf("%lld\n", ans);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 100010;
const LL INF = 0x3f3f3f3f3f3f3f3fLL;
int at[MAXN], T, n, E;
LL f[MAXN];
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n >> E >> T;
int cur = 0; LL pre = INF;
for (int i = 1; i <= n; ++i) {
std::cin >> at[i];
while (2 * (at[i] - at[cur + 1]) >= T)
pre = std::min(pre, f[cur] - 2 * at[cur + 1]), ++cur;
f[i] = std::min(pre + 2 * at[i], f[cur] + T);
}
std::cout << f[n] + E << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,m,t,x[100010];
long long f[100010],k;
int main()
{
int i,j;
scanf("%d%d%d",&n,&m,&t);
for(i=1;i<=n;i++)
scanf("%d",&x[i]);
for(i=1,j=0,k=1e18;i<=n;i++)
{
for(;2*(x[i]-x[j+1])>t;j++)
k=min(k,f[j]-2*x[j+1]);
f[i]=min(k+2*x[i],f[j]+t);
}
cout<<f[n]+m<<"\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const int MAXN = 1e5+5;
ll n, dp[MAXN], x[MAXN], e, t, ct;
set<pii> dp1, dp2;
int main() {
cin >> n >> e >> t;
for (int i = 0; i < n; ++i)
cin >> x[i];
x[n] = e;
dp[0] = x[0];
dp1.insert(pii(dp[0]-x[0], 0));
for (int j = 1; j <= n; ++j) {
dp[j] = 1e18;
while (2*(x[j-1]-x[ct]) > t) {
dp1.erase(pii(dp[ct]-x[ct], ct));
dp2.insert(pii(dp[ct]-3*x[ct], ct));
++ct;
}
if (!dp1.empty())
dp[j] = min(dp[j], (*dp1.begin()).first+t+x[j]);
if (!dp2.empty())
dp[j] = min(dp[j], (*dp2.begin()).first+x[j]+2*x[j-1]);
dp1.insert(pii(dp[j]-x[j], j));
}
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template<typename P, typename Q>
ostream& operator << (ostream& os, pair<P, Q> p)
{
os << "(" << p.first << "," << p.second << ")";
return os;
}
int main(int argc, char *argv[])
{
const int N = 100000 + 10;
int n;
lli e, t;
while (cin >> n >> e >> t) {
lli x[N];
for (int i = 0; i < n; ++i) {
cin >> x[i];
}
x[n] = e;
lli dp[N];
fill(dp, dp + N, 1LL << 60);
dp[0] = 0;
lli mn = 1LL << 60;
for (int i = 0, j = -1; i < n; ++i) {
while (t < 2 * (x[i] - x[j + 1])) {
mn = min(mn, dp[j] - 2 * x[j + 1]);
++j;
}
dp[i] = min(dp[j] + t, 2 * x[i] + mn);
}
cout << dp[n - 1] + e << endl;
}
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <cassert>
using namespace std;
multiset<long long> s;
const int N = 1e5 + 7;
const long long INF = 1LL << 60;
int n, t, e;
long long pos[N], f[N];
int main() {
scanf("%d %d %d", &n, &e, &t);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
pos[i] = x;
}
pos[0] = 0;
f[0] = 0;
long long min_v = INF;
s.insert(f[0] - pos[0]);
for (int i = 1, j = 0; i <= n; i++) {
while (2 * pos[j + 1] + t < 2 * pos[i]) {
min_v = min(min_v, f[j] - 2 * pos[j + 1] - pos[j]);
if (s.size()) {
s.erase(s.find(f[j] - pos[j]));
}
j++;
}
f[i] = min_v + 3 * pos[i];
if (s.size()) {
f[i] = min(f[i], *(s.begin()) + pos[i] + t);
}
s.insert(f[i] - pos[i]);
}
cout << f[n] + e - pos[n] << endl;
} |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
#define gpf(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long ll;
ll n, e, T;
ll x[110000], f[110000];
ll ans;
int main(){
scanf("%lld%lld%lld", &n, &e, &T);
rep(i, 1, n) scanf("%lld", x + i);
ll tmn = 1ll << 60;
int j = 1;
rep(i, 1, n){
while (j <= n && (x[i] - x[j]) * 2 > T){
tmn = min(tmn, f[j - 1] - 2 * x[j]);
j++;
}
f[i] = f[i - 1] + T;
f[i] = min(f[i], f[j - 1] + T);
f[i] = min(f[i], tmn + 2 * x[i]);
}
printf("%lld\n", f[n] + e);
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define iiii pair<int,pii >
#define ld double
#define MAXN 100100
#define inf 1000000000000000000ll
using namespace std;
ll Dp[MAXN],e,t,q=inf,a[MAXN];
int n,p;
int main()
{
scanf("%d%lld%lld",&n,&e,&t);
for(int i=1;i<=n;i++)scanf("%lld",a+i);
for(int i=1;i<=n;i++)
{
while ((a[i]-a[p+1])*2>=t)
{
q=min(q,Dp[p]-a[p+1]*2-a[p]);
p++;
}
Dp[i]=min(3ll*a[i]+q,Dp[p]+a[i]-a[p]+t);
}
printf("%lld\n",Dp[n]-a[n]+e);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll read(){
ll a=0,b=getchar(),c=1;
while(!isdigit(b))c=b=='-'?-1:1,b=getchar();
while(isdigit(b))a=a*10+b-'0',b=getchar();
return a*c;
}
ll n,t,e,x,ab,a[200005],dp[200005];
int main(){
n=read(),e=read(),t=read();
for(int i=1;i<=n;i++)
a[i]=read();
a[n+1]=e;
for(int i=1;i<=n;i++){
while((a[i]-a[ab+1])*2>t)
x=min(x,dp[ab]-2*a[ab+1]),ab++;
dp[i]=min((ll)(1e18),dp[ab]+t);
if(ab)dp[i]=min(dp[i],2*a[i]+x);
}
printf("%lld",dp[n]+e);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 1e5 + 10;
constexpr int MOD = 1e9 + 7;
long long t, n, a[N], mn, dp[N], e, en, ps[N];
void upd (int x) {
if (!mn)
mn = x;
long long ghabli = 2 * a[mn] + a[mn + 1] + dp[mn + 1];
long long jadid = 2 * a[x] + a[x + 1] + dp[x + 1];
if (jadid < ghabli)
mn = x;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> e >> t;
for (int i = 1; i <= n; i++)
cin >> a[i];
en = n;
a[n + 1] = e;
for (int i = n; i; i--) {
while (2 * (a[en] - a[i]) > t) {
upd (en);
en--;
}
// ta en berim va bargardim
dp[i] = t + a[en + 1] - a[i] + dp[en + 1];
// ta min berim va bargardim
if (mn)
dp[i] = min (dp[i], 2 * a[mn] + a[mn + 1] + dp[mn + 1] - 3 * a[i]);
}
cout << dp[1] + a[1] << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
long long dp[N], x[N], premin[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, T;
cin>>n>>m>>T;
premin[0] = 1e18;
for (int i=1; i<=n; i++) {
cin>>x[i];
premin[i] = min(dp[i-1]-2*x[i], premin[i-1]);
int idx = upper_bound(x+1, x+i, x[i]-(T+1)/2)-x-1;
dp[i] = min(premin[idx]+2*x[i], dp[idx]+T);
// cout<<i<<" "<<x[i]<<" --> "<<dp[i-1]-2*x[i]<<" "<<premin[i]<<" \t "<<x[i]-T/2<<" "<<idx<<" \t= "<<dp[i]<<endl;
}
cout<<dp[n]+m<<endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#define lol(i,n) for(ll i=0;i<n;i++)
#define mod 1000000007
#define chmin(a,b) a=min(a,b);
typedef long long ll;
using namespace std;
#define N 200010
ll n,d[N],t,e;
ll BN(ll key){
ll l=-1,r=n,m=(l+r)/2;
for(;l<r-1;m=(l+r)/2){
if(d[m]*2<key)l=m;
else r=m;
}
return l;
}
ll f[N],g[N];
int main(){
cin>>n>>e>>t;
lol(i,n)cin>>d[i];
lol(i,N)f[i]=1e18; f[0]=0,g[0]=-2*d[0];
for(ll i=1;i<=n;i++){
ll surf=BN(d[i-1]*2-t);
ll res=1e17;
if(surf+1<i)chmin(res,f[surf+1]+t);
if(~surf)chmin(res,g[surf]+2*d[i-1]);
f[i]=res;
g[i]=min(g[i-1],f[i]-2*d[i]);
}
cout<<f[n]+e<<endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 100000;
const ll INF = (1ll<<60);
ll dp[MAXN + 5], a[MAXN + 5], T;
int que[MAXN + 5], s, t;
ll f1(int x) {
return dp[x] - a[x] - 2*a[x+1];
}
ll f2(int x) {
return T + 2*a[x+1];
}
int main() {
int N, M;
scanf("%d%d%lld", &N, &M, &T);
for(int i=1;i<=N;i++)
scanf("%lld", &a[i]);
a[N+1] = M; ll p = INF;
s = 1, t = 0;
for(int i=1;i<=N+1;i++) {
dp[i] = INF;
while( s <= t && f1(que[t]) + f2(que[t]) >= f1(i-1) + f2(i-1) )
t--;
que[++t] = i-1;
while( s <= t && f2(que[s])-2*a[i] <= 0 ) {
p = min(p, f1(que[s]));
s++;
}
dp[i] = min(p, f1(que[s]) + f2(que[s]) - 2*a[i]) + 3*a[i];
}
printf("%lld\n", min(dp[N+1], dp[N]+M-a[N]));
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100100;
const ll inf=1e18;
ll a[N],f[N],mn,T,L;
int n,q[N];
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>L>>T;
for(int i=1;i<=n;++i)cin>>a[i],f[i]=i*T;
mn=inf;
int t=0,w=0;q[0]=0;
for(int i=1,j=0;i<=n;++i){
for(;j<i&&2*(a[i]-a[j+1])>T;++j)mn=min(mn,f[j]-2*a[j+1]);
f[i]=min(f[i],mn+2*a[i]);
for(;t<=w&&2*(a[i]-a[q[t]+1])>T;++t);
if(t<=w)f[i]=min(f[i],f[q[t]]+T);
for(;t<=w&&f[q[w]]>f[i];--w);
q[++w]=i;
}
cout<<L+f[n]<<'\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = (1e5)+1;
int n;
long long E, T, x[MAX], dp[MAX], f[MAX];
multiset<long long> l, m;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> E >> T;
l.insert(f[0] = T);
for(int i = 1, j = 0; i <= n; i++) {
cin >> x[i];
while(j < i && 2*(x[i]-x[j+1]) >= T) {
l.erase(l.find(f[j]));
f[j] = f[j]-T-2*(x[j+1]);
m.insert(f[j]);
j++;
}
dp[i] = LLONG_MAX;
if(!l.empty()) dp[i] = min(x[i]+*l.begin(), dp[i]);
if(!m.empty()) dp[i] = min(3*x[i]+*m.begin(), dp[i]);
l.insert(f[i] = dp[i]-x[i]+T);
}
cout << dp[n]+E-x[n];
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200200;
long long f[maxn], x[maxn];
int main(){
int n, E, T;
cin >> n >> E >> T;
for(int i = 1; i <= n; i++) cin >> x[i];
multiset<long long> small, bigger;
int j = 1;
for(int i = 1; i <= n; i++){
while(j < i && 2*(x[i] - x[j]) > T){
small.erase(small.find(f[j - 1]));
bigger.insert(f[j - 1] - 2 * x[j]);
j++;
}
f[i] = T + f[i - 1];
if(!small.empty()) f[i] = min(f[i], *small.begin() + T);
if(!bigger.empty()) f[i] = min(f[i], *bigger.begin() + 2 * x[i]);
small.insert(f[i - 1]);
}
cout << f[n] + E << endl;
return 0;
}
|
#include <cstdio>
#include <algorithm>
int N, E, T, a[100001];
long long f[100001], g[100001];
int main()
{
scanf("%d%d%d", &N, &E, &T);
for (int i = 1; i <= N; i++)
scanf("%d", a + i);
g[0] = 2 * -a[1];
for (int i = 1, j = 0; i <= N; i++)
{
while (2 * (a[i] - a[j + 1]) > T)
j++;
f[i] = f[j] + T;
if (j)
f[i] = std::min(f[i], 2 * a[i] + g[j - 1]);
if (i < N)
g[i] = std::min(g[i - 1], f[i] - 2 * a[i + 1]);
}
printf("%lld\n", f[N] + E);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef pair<int,int> PII;
int n, E, T, a[1<<17];
long long dp[1<<17], dp2[1<<17], mdp2 = (1<<30);
int main() {
cin >> n >> E >> T;
for (int i = 1; i <= n; i++) cin >> a[i];
dp2[0] = -2*a[1];
for (int i = 1, it = 1; i <= n; i++) {
while (2 * (a[i] - a[it]) > T) it++, mdp2 = min(mdp2, dp2[it-2]);
dp[i] = min(dp[it-1] + T, mdp2 + 2*a[i]);
dp2[i] = dp[i] - 2 * a[i+1];
}
cout << dp[n] + E;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=100009;
const ll Inf=1e18;
int n,t,e;
int x[N];
ll f[N],smn,ff[N];
inline int read()
{
int x=0;char ch=getchar();
while(ch<'0' || '9'<ch)ch=getchar();
while('0'<=ch && ch<='9')x=x*10+(ch^48),ch=getchar();
return x;
}
inline void chkmin(ll &a,ll b){if(a>b)a=b;}
int main()
{
n=read();
e=read();
t=read();
for(int i=1;i<=n;i++)
x[i]=read();
f[0]=0;
ff[0]=-2*x[1];
int ptr=0;
for(int i=1;i<=n;i++)
{
while(2ll*(x[i]-x[ptr+1])>t)ptr++;
f[i]=f[ptr]+t;
if(ptr)chkmin(f[i],2*x[i]+ff[ptr-1]);
ff[i]=min(f[i]-2*x[i+1],ff[i-1]);
}
printf("%lld\n",f[n]+e);
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
const int MAXN=100005 ;
int n , E, T , dis[MAXN] ;
long long dp[MAXN] ;
multiset<long long> st;
multiset<long long>::iterator it ;
long long calc_1(int j){
return dp[j]-2*dis[j+1]-dis[j] ;
}
long long calc_2(int j){
return dp[j]-dis[j] ;
}
int main(){
scanf("%d%d%d",&n,&E,&T) ;
memset(dp,0x3f,sizeof(dp)) ;
for(int i=1;i<=n;++i) scanf("%d",&dis[i]) ;
dp[0]=0 ;
int last=0 ; //第一个满足边界的
st.insert(calc_2(0)) ;
long long minn=(1ll<<60)-1 ;
for(int i=1;i<=n;++i){
while(last<i && 2*(dis[i]-dis[last+1])>=T){
long long tmp=calc_2(last) ;
it=st.find(tmp) , st.erase(it) ;
minn=min(minn,calc_1(last)) , ++last ;
}
dp[i]=minn+(long long)3*dis[i] ;
if(!st.empty()) dp[i]=min(dp[i],(*st.begin())+T+dis[i]) ;
st.insert(calc_2(i)) ;
}
cout << dp[n]+E-dis[n] << '\n' ;
return 0 ;
} |
//In the name of Allah
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxN = 1000 * 100 + 10;
ll a[maxN];
const ll inf = 1e18;
ll dp[maxN];
set<pair<ll,int>> curr1, curr2;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
a[0] = 0;
int n,e,T; cin >> n >> e >> T;
for( int i = 0 ; i < n ; i++ ) cin >> a[i+1];
curr1.insert( { inf , -1 } ) ;
curr2.insert( { inf , -1 } ) ;
fill( dp , dp + n + 1 , inf ) ;
dp[0] = 0;
int last = 0;
curr1.insert( { 0ll , 0 } );
for( int i = 1 ; i <= n ; i++ ) {
while( last < i && 2ll * (a[i] - a[last+1]) >= T ) {
curr1.erase( { 0ll + dp[last] , last } ) ;
curr2.insert( { 0ll + dp[last] - 2ll * a[last+1] , last } );
last++;
}
dp[i] = min( 0ll + curr1.begin()->first + T ,
0ll + curr2.begin()->first + 2ll * a[i] );
curr1.insert( { dp[i] , i } );
}
cout << dp[n] + e << endl;
}
|
/* --- author: dxm --- */
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 2147483647
#define Inf 1e18
#define rep(i,n) for(int (i)=0;(i)<n;i++)
#define REP(i,n) for(int (i)=1;(i)<=n;i++)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
inline void Fail(){
printf("0");
exit(0);
}
const int maxn=100005;
int n,e,t,l=-1;
ll cur=Inf;
ll dp[maxn];
int x[maxn];
int main(){
scanf("%d%d%d",&n,&e,&t);
rep(i,n)scanf("%d",&x[i]);
rep(i,n){
while(2LL*(x[i]-x[l+1])>=t){
cur=min(cur,(l<0?0:dp[l])-2LL*x[l+1]);
l++;
}
dp[i]=min(cur+2LL*x[i],(l<0?0:dp[l])+t);
}
printf("%lld",e+dp[n-1]);
return 0;
}
/*
Input:
-----------------
Output:
*/ |
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
using namespace std;
int x[1000005];
long long int dp[1000005];
int main(){
int n,e,t;
scanf("%d %d %d",&n,&e,&t);
for(int i=0;i<n;i++)
dp[i]=1e18;
dp[0]=t;
scanf("%d",&x[0]);
for(int i=1;i<n;i++)
scanf("%d",&x[i]),x[i]-=x[0];
x[0]=0;
int last=0,lastt=0;
for(int i=0;i<n;i++){
dp[i]=max(t,x[i]*2);
if(lastt!=0)
dp[i]=min(dp[i],(x[i]-x[last+1])*2+dp[last]);
for(int j=lastt;j<i;j++){
dp[i]=min(dp[i],max(t,(x[i]-x[j+1])*2)+dp[j]);
if((x[i]-x[j+1])*2<t)
{
lastt=j;
break;
}
if(dp[i]==(x[i]-x[j+1])*2+dp[j])
last=j;
}
//printf("%d %lld\n",i,dp[i]);
}
printf("%lld",dp[n-1]+e);
} |
#include <cstdio>
#include <algorithm>
int N, T, E, pl, x[100009]; long long dp[100009];
int main() {
scanf("%d%d%d", &N, &E, &T);
for (int i = 0; i < N; i++) scanf("%d", &x[i]);
long long best = 1LL << 60;
for (int i = 0; i < N; i++) {
while (x[pl] + T / 2 < x[i]) best = std::min(best, dp[pl]), pl++;
dp[i + 1] = std::min(dp[pl] + T + x[pl] * 2, best + x[i] * 2) - x[i + 1] * 2;
}
printf("%lld\n", dp[N] + E - x[0] * 2);
return 0;
} |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 2e5 + 10;
const LL inf = 1e18;
int n;
LL E, t, a[N], dp[N], pre[N];
int main() {
cin >> n >> E >> t;
for (int i = 1; i <= n; ++i)
scanf("%lld", &a[i]);
dp[0] = 0;
pre[0] = inf;
for (int i = 1, j = 1; i <= n; ++i) {
dp[i] = inf;
while (2 * (a[i] - a[j]) > t) ++j;
dp[i] = min(dp[i], dp[j - 1] + t);
dp[i] = min(dp[i], 2 * a[i] + pre[j - 1]);
pre[i] = min(pre[i - 1], dp[i - 1] - 2 * a[i]);
}
printf("%lld\n", dp[n] + E);
return 0;
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define R register
#define MIN(_A,_B) (_A<_B?_A:_B)
using namespace std;
long long n,m,t,s[3000010],kl=-1;
long long f[3000010],g=192608170817;
long long read()
{
R long long x=0;R char ch=getchar();
for(;ch>'9'||ch<'0';ch=getchar());
for(;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';return x;
}
int main()
{
n=read(),m=read(),t=read();
for(R int i=1;i<=n;i++) s[i]=read();
sort(s+1,s+n+1);
for(R int i=1;i<=n;i++){
while(kl<i&&2*(s[i]-s[kl+2])>=t){
kl++;
g=MIN(g,f[kl]-s[kl]-2*s[kl+1]);
}
f[i]=MIN(g+3*s[i],f[kl+1]+s[i]-s[kl+1]+t);
}
printf("%lld\n",f[n]+m-s[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (l);i < (r);i++)
#define ALL(x) (x).begin(),(x).end()
template<typename T> bool chmax(T& a,const T& b){return a < b ? (a = b,true) : false;}
template<typename T> bool chmin(T& a,const T& b){return b < a ? (a = b,true) : false;}
typedef long long ll;
ll N,E,T;
ll dp1 [100001];
ll dp2 [100001];
const ll INF = 1e17;
int main()
{
scanf("%lld%lld%lld",&N,&E,&T);
vector<ll> X(N + 1);
for(int i = 1;i <= N;i++){
scanf("%lld",&X [i]);
}
fill_n(dp1,N + 1,INF);
fill_n(dp2,N + 1,INF);
dp1 [0] = 0;
int j = 1;
for(int i = 1;i <= N;i++){
while(j < i && (X [i] - X [j]) * 2 > T) j++;
chmin(dp1 [i],dp1 [j - 1] + T);
chmin(dp1 [i],dp2 [j - 1] + X [i] * 2);
chmin(dp2 [i],min(dp2 [i - 1],dp1 [i - 1] - X [i] * 2));
}
printf("%lld\n",dp1 [N] + E);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define fi first
#define se second
const int N=100005;
set<pair<int ,int> >s;
int n,e,t,x[N],f[N],dp[N],d[N];
signed main(){
scanf("%lld%lld%lld",&n,&e,&t);
for (int i=1;i<=n;i++)scanf("%lld",&x[i]);
e-=x[n];x[n+1]=e;
for (int i=n;i;i--)x[i]-=x[i-1];
for (int i=1;i<=n;i++)f[i]=f[i-1]+x[i];
int l=0,r=-1,k=0;
s.insert(mp(0,0));
for (int i=1;i<=n;i++){
while (k<i&&(f[i]-f[k+1])*2>t){
s.erase(mp(x[k+1]-f[k+1]+dp[k],k));
while (l<=r&&-3*f[k+1]+x[k+1]+dp[k]<=-3*f[d[r]+1]+x[d[r]+1]+dp[d[r]])r--;
d[++r]=k;
k++;
}
pair<int ,int > now=*s.begin();
dp[i]=t+now.fi+f[i];
if (l<=r)dp[i]=min(dp[i],f[i]*3-3*f[d[l]+1]+x[d[l]+1]+dp[d[l]]);
s.insert(mp(x[i+1]-f[i+1]+dp[i],i));
}
printf("%lld\n",dp[n]+e);
} |
#include <bits/stdc++.h>
using namespace std;
const int DIM = 200005;
long long pos[DIM], dp1[DIM], dp2[DIM];
int main(void)
{
int n, e, t;
cin >> n >> e >> t;
for (int i = 1; i <= n; ++i)
cin >> pos[i];
dp2[0] = 1e17;
for (int i = 1, p = 1; i <= n; ++i) {
while ((pos[i] - pos[p]) * 2 >= t)
++p;
dp1[i] = min(dp1[p - 1] + t, dp2[p - 1] + pos[i] * 2);
dp2[i] = min(dp2[i - 1], dp1[i - 1] - pos[i] * 2);
}
cout << dp1[n] + e << endl;
return 0;
} |
// luogu-judger-enable-o2
#include<bits/stdc++.h>
#define FOR(i,a,b) for (register ll i=(a);i<=(b);i++)
#define For(i,a,b) for (register ll i=(a);i>=(b);i--)
#define mem(i,j) memset(i,j,sizeof(i))
using namespace std;
typedef long long ll;
const ll N=2e5+5;
ll n,E,T,x[N],f[N],Ans,k=1e18;
ll l=1,r=1,q[N];
ll read()
{
ll x=0,f=1;
char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=(x<<1)+(x<<3)+c-'0';c=getchar();}
return f*x;
}
int main()
{
mem(f,0x3f);
n=read(),E=read(),T=read();
FOR(i,1,n) x[i]=read();
f[0]=0;
FOR(i,1,n)
{
while (l<=r&&2*(x[i]-x[q[l]+1])>T)
{
k=min(k,f[q[l]]-2*x[q[l]+1]);
l++;
}
f[i]=min(f[i],f[q[l]]+T);
f[i]=min(f[i],k+2*x[i]);
q[++r]=i;
}
Ans=f[n]+E;
printf("%lld\n",Ans);
return 0;
} |
#include <iostream>
using namespace std;
#define ll long long int
const int mx = 1e5+1 , inf = 1e9;
ll n,e,t;
ll x[mx];
ll dp[mx];
ll mn=inf;
ll ptr=-1;
int main()
{
cin >> n >> e >> t;
e*=2;
t*=2;
for(int i=0;i<n;i++)
{
cin >> x[i];
x[i]*=2;
}
for(int i=0;i<n;i++)
{
while(x[ptr+1]<x[i]-t/2)
{
ptr++;
if(ptr>0)
mn=min(mn, dp[ptr-1]-2*x[ptr]);
else
mn=min(mn, 0-2*x[ptr]);
}
if(mn==inf)
{
dp[i]=t;
continue;
}
dp[i]=mn+2*x[i];
if(ptr>=0)
dp[i]=min(dp[i],dp[ptr]+t);
}
cout << (dp[n-1] + e)/2;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
long long f[101010];
long long a[101010];
int main()
{
int n,e,t,now=1;
long long mi=21474836478ll;
scanf("%d%d%d",&n,&e,&t);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
f[0]=0;
f[1]=t;
for(int i=2;i<=n;i++)
{
while((a[i]-a[now])*2>t)
{
mi=min(mi,f[now-1]-2*a[now]);
now++;
}
f[i]=f[now-1]+t;
f[i]=min(f[i],mi+2*a[i]);
}
printf("%lld",(long long)e+f[n]);
return 0;
} |
// +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\
#include <bits/stdc++.h>
#define int ll
#define F first
#define S second
#define _sz(x) (int)x.size()
using namespace std ;
using ll = long long ;
using ld = long double ;
using pii = pair <int , int> ;
int const N = 1e5 + 20 , inf = 1e18 + 20;
int n , e , t , x[N] , dp[N] , p , mn = inf ;
int32_t main(){
ios::sync_with_stdio(false) , cin.tie(0) , cout.tie(0) ;
cin >> n >> e >> t ;
for (int i = 0 ; i < n ; i ++) cin >> x[i] ;
p = n ;
dp[n - 1] = e - x[n - 1] + t ;
for (int i = n - 2 ; ~i ; i --) {
while (2 * (x[p - 1] - x[i]) > t){
p -- ;
mn = min(mn , dp[p + 1] + ((p == n - 1 ? e : x[p + 1]) - x[p]) + 3 * x[p]) ;
}
dp[i] = mn - 3 * x[i] ;
int len = x[p - 1] - x[i] ;
dp[i] = min(dp[i] , 3 * len + (t - 2 * len) + (p == n ? e - x[n - 1] : x[p] - x[p - 1] + dp[p])) ;
}
cout << x[0] + dp[0] << '\n';
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N, E, T;
while(cin >> N >> E >> T){
long long res = E;
vector<int> x(N);
for(int i=0;i<N;i++) cin >> x[i];
vector<long long> dp(N+1);
vector<long long> dp2(N);
dp[N-1] = E+T; dp[N] = E;
dp2[N-1] = dp[N] + 2*x[N-1];
int thr = N-1;
for(int i=N-2;i>=0;i--){
while(2*(x[thr] - x[i]) > T) --thr;
dp[i] = T+dp[thr+1];
if(thr+1 < N) dp[i] = min(dp[i], dp2[thr+1]-2*x[i]);
dp2[i] = min(dp2[i+1], dp[i+1] + 2*x[i]);
}
cout << dp[0] << endl;
}
}
|
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
inline int read()
{
int res, ok = 1;
char ch;
for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
ok = -1;
res = ch - '0';
for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())
res = res * 10 + ch - '0';
return res * ok;
}
int n, t, e, a[100005], last;
long long ans[100005], minn = 1LL << 60;
int main()
{
n = read();
e = read();
t = read();
for (int i = 1; i <= n; i++)
a[i] = read();
ans[0] = 0;
ans[1] = t;
for (int i = 2; i <= n; i++)
{
while (2LL * (a[i] - a[last + 1]) > t)
{
long long now = ans[last] - 2LL * a[last + 1];
minn = min (minn, now);
last++;
}
ans[i] = ans[i - 1] + t;
if (last > 0)
ans[i] = min (ans[i], minn + 2LL * a[i]);
ans[i] = min (ans[i], ans[last] + t);
}
printf ("%lld\n", ans[n] + e);
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
long long d[100003],a[100003],q[100003];
int n,m,T,s,t;
int main(){
cin>>n>>m>>T;
for(int i=1;i<=n;i++){
cin>>a[i];
d[i]=1e15;
}
s=1,t=1;
long long z=1e15;
for(int i=1;i<=n;i++){
while(s<=t&&2*(a[i]-a[q[s]+1])>T){
z=min(z,d[q[s]]-a[q[s]]-2*a[q[s]+1]);
s++;
}
d[i]=min(d[i],a[i]+z+2*a[i]);
d[i]=min(d[i],d[q[s]]+a[i]-a[q[s]]+T);
while(s<=t&&d[q[s]]-a[q[s]]>=d[i]-a[i]){
t--;
}
q[++t]=i;
}
long long ans=d[n]+m-a[n];
cout<<ans<<endl;
return 0;
} |
#include <algorithm>
#include <cstring>
#include <cstdio>
long long dp[100005], mn = 1e18;
int arr[100005], que[100005];
int main()
{
// freopen("AGC007-D.in", "r", stdin);
int n, e, t, he = 0, ta = 0;
scanf("%d%d%d", &n, &e, &t);
for (int i = 1; i <= n; i++)
scanf("%d", arr + i);
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 1, pos = 0; i <= n; i++)
{
while (pos < i && (arr[i] - arr[pos + 1] << 1) >= t)
{
if (he <= ta && que[he] <= pos)
he++;
mn = std::min(mn, dp[pos] - (arr[pos + 1] << 1));
pos++;
}
dp[i] = mn + (arr[i] << 1);
if (he <= ta)
dp[i] = std::min(dp[i], dp[que[he]] + t);
while (he <= ta && dp[que[ta]] >= dp[i])
ta--;
que[++ta] = i;
}
printf("%lld\n", dp[n] + e);
return 0;
}
|
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int a[100010],q[100010];
ll dp[100010],ma[100010];
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int n,E,T;scanf("%d%d%d",&n,&E,&T);
for (int i=1;i<=n;i++) scanf("%d",&a[i]);a[0]=0;
dp[0]=0;ma[0]=-a[1]*2;int f=1,r=1,k=0;q[1]=0;
for (int i=1;i<=n;i++)
{
while (2*(a[i]-a[k+1])>T)
{
if (q[f]==k) f++;
k++;
}
dp[i]=dp[q[f]]+a[q[f]+1]-a[q[f]]+T+a[i]-a[q[f]+1];
if (k) dp[i]=min(dp[i],ma[k-1]+ll(a[i])*3);
ma[i]=min(ma[i-1],dp[i]-a[i]-a[i+1]-a[i+1]);
while (f<=r&&dp[q[r]]-a[q[r]]>=dp[i]-a[i]) r--;
q[++r]=i;
}
cout<<dp[n]+E-a[n]<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
constexpr LL INF = 1e18;
LL dp[100001], dp2[100001];
LL N, T, E;
LL x[100001];
int main() {
scanf("%lld %lld %lld", &N, &E, &T);
for(int i = 1; i<=N; ++i) scanf("%lld", x+i);
int now = 1;
LL mn = -2*x[1];
for(int i = 1; i<=N; ++i) {
if( 2*(x[i] - x[1]) <= T ) {
dp[i] = T;
continue;
}
while( 2*(x[i]-x[now+1]) > T ) {
mn = min(mn, dp[now]-2*x[now+1]);
++now;
}
dp[i] = min(dp[now]+T, mn+2*x[i]);
}
printf("%lld\n", dp[N]+E);
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
ll E,T;
ll X[100010];
ll dp[100010] = {0};
int id = 0;
ll INF = 1001001001001001;
ll MIN;
int main()
{
scanf("%d%lld%lld",&N,&E,&T);
MIN = INF;
for(int i = 1; i <= N; i++)
{
scanf("%lld",X + i);
while(id != i && (X[i] - X[id + 1]) * 2 >= T)
{
MIN = min(MIN,dp[id] - X[id + 1] * 2);
id++;
}
dp[i] = MIN + X[i] * 2;
if(id != i)dp[i] = min(dp[i],dp[id] + T);
}
printf("%lld\n",dp[N] + E);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=100005;
int read(){
int x=0;
char ch=getchar();
while (!isdigit(ch))
ch=getchar();
while (isdigit(ch))
x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
return x;
}
int n,T,E;
int x[N];
LL dp[N],Min=1LL<<50;
int main(){
n=read(),E=read(),T=read();
for (int i=1;i<=n;i++)
x[i]=read();
int j=1;
dp[0]=0;
for (int i=1;i<=n;i++){
while (2LL*(x[i]-x[j])>=T){
Min=min(Min,dp[j-1]-2LL*x[j]);
j++;
}
dp[i]=min(Min+2LL*x[i],dp[max(j-1,0)]+T);
}
printf("%lld",dp[n]+E);
return 0;
} |
#include<iostream>
#include<cstdio>
#define MN 100000
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int x[MN+5],T,n,q[MN+5],top,tail;
long long f[MN+5];
int main()
{
n=read();x[n+1]=read();T=read();
for(int i=1;i<=n;++i) x[i]=read();
f[0]=x[1];q[top=tail=1]=0;long long mn=1e18;
for(int i=1,j=0;i<=n;++i)
{
while(j<i&&(x[i]-x[j+1])*2>=T) mn=min(mn,f[j]-3LL*x[j+1]),++j;
while(top>=tail&&(x[i]-x[q[tail]+1])*2>=T) ++tail;
f[i]=min(mn+3LL*x[i],top>=tail?f[q[tail]]-x[q[tail]+1]+x[i]+T:(long long)1e18);
f[i]=min(f[i],f[i-1]+T);f[i]+=x[i+1]-x[i];
// cout<<i<<" "<<mn<<" "<<(top>=tail?q[tail]:-1)<<" "<<f[i]<<endl;
while(top>=tail&&f[i]-x[i+1]<=f[q[top]]-x[q[top]+1]) --top;q[++top]=i;
}
printf("%lld\n",f[n]);
return 0;
}
|
#include <algorithm>
#include <cstdio>
#define REDIRECT(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout)
#define CLOSEALL() fclose(stdin), fclose(stdout)
const int MAXN = 1e5 + 10;
typedef long long i64;
i64 tmp = 0x7F7F7F7F7F7F7F7F;
i64 N, M, T;
i64 a[MAXN];
i64 dp[MAXN];
int main()
{
//REDIRECT("computer");
i64 t = 0;
scanf("%lld%lld%lld", &N, &M, &T);
for (int i = 1; i <= N; i++)
scanf("%lld", &a[i]);
for (int i = 1; i <= N; i++)
{
while (T <= (a[i] - a[t + 1]) * 2)
tmp = std::min(tmp, dp[t] - 2 * a[t + 1]), t++;
dp[i] = std::min(dp[t] + T, tmp + 2 * a[i]);
}
printf("%lld\n", dp[N] + M);
CLOSEALL();
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <cstring>
#include <cstdio>
using namespace std;
typedef long long int64;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 2e5+5;
const int64 INF = 0x3f3f3f3f3f3f3f3f;
int n, t, e, px[N];
int64 f[N], w = INF;
int main()
{
n = read(), e = read(), t = read();
for(int i = 1; i <= n; ++i) px[i] = read();
for(int i = 1, j = 0; i <= n; ++i)
{
while(2*(px[i]-px[j+1]) >= t) w = min(f[j]-2*px[j+1], w), ++j;
f[i] = min(w+2*px[i], f[j]+t);
}
printf("%lld\n", f[n]+e);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
class MQ {
private:
deque<ll> q;
public:
void push(ll val) {
while(!(q.empty()) && q.back() > val) {
q.pop_back();
}
q.push_back(val);
}
void pop(ll val) {
if(!q.empty() && q.front() == val) {
q.pop_front();
}
}
ll front() {
return q.front();
}
};
vl w,dp;
int main() {
ll n,ti,ed;
cin >> n >> ed >> ti;
for(int i=0;i<n;i++) {
ll t;
cin >> t;
w.push_back(t);
}
w.push_back(ed);
dp.assign(w.size(),1e18);
dp.back() = 0;
ll rv = 1e18;
MQ q;
ll pt = dp.size()-1;
q.push(0);
for(int i=n-1;i>=0;i--) {
while(pt > i && (w[pt-1]-w[i])*2 > ti) {
q.pop(dp[pt]);
rv = min(rv,dp[pt]+(w[pt-1]-w[i])*2);
pt--;
}
dp[i] = min(q.front()+ti,rv);
q.push(dp[i]);
if(i > 0) {
rv += 2*(w[i]-w[i-1]);
}
}
//what
cout << dp[0]+ed << '\n';
}
|
#include<bits/stdc++.h>
using namespace std;
const long long INF=0x3f3f3f3f3f3f3f3fLL;
const int M=100005;
long long dp[M];
int P[M],Q[M];
long long mi=INF;
int n,e,t,l,r;
int main(){
scanf("%d%d%d",&n,&e,&t);
for(int i=1;i<=n;++i)
scanf("%d",P+i);
Q[r++]=0;
for(int i=0,j=1;j<=n;++j){
while(t<=2*(P[j]-P[i+1])){
mi=min(mi,dp[i]-P[i]-2*P[i+1]);
if(l<r && Q[l]<=i)
++l;
++i;
}
dp[j]=3LL*P[j]+mi;
if(l<r)
dp[j]=min(dp[j],dp[Q[l]]+P[j]-P[Q[l]]+t);
while(l<r && dp[j]-P[j]<=dp[Q[r-1]]-P[Q[r-1]])
--r;
Q[r++]=j;
}
printf("%lld\n",dp[n]+e-P[n]);
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#define N 100010
using namespace std;
int n,t;
long long m;
long long f[N],x[N];
int main()
{
scanf("%d%lld%d",&n,&m,&t);
for(int i=1;i<=n;i++) scanf("%lld",&x[i]),f[i]=100000000000;
long long minn=100000000000;
int r=0;
for(int i=1;i<=n;i++)
{
while(r<i && (x[i]-x[r+1])*2>=t)
{
minn=min(minn,f[r]-2*x[r+1]);
r++;
}
f[i]=min(f[r]+t,minn+2*x[i]);
}
printf("%lld",f[n]+m);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 123456;
const long long llinf = 1e18;
int n, e, t, p[N], q[N], l, r;
long long dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> e >> t;
for (int i = 1; i <= n; ++i) {
cin >> p[i];
}
q[l = r = 0] = 0;
long long pre_min = llinf;
for (int i = 1, j = 0; i <= n; ++i) {
dp[i] = llinf;
while (l <= r && 2 * (p[i] - p[q[l] + 1]) > t) {
++l;
}
if (l <= r) {
dp[i] = min(dp[i], dp[q[l]] - p[q[l]] + p[i] + t);
}
while (2 * (p[i] - p[j + 1]) > t) {
pre_min = min(pre_min, dp[j] - p[j] - 2 * p[j + 1]);
++j;
}
dp[i] = min(dp[i], pre_min + 3ll * p[i]);
while (l <= r && dp[i] - p[i] <= dp[q[r]] - p[q[r]]) {
--r;
}
q[++r] = i;
}
cout << dp[n] + e - p[n] << '\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n, T, E;
ll x[N], dp[N];
int main() {
scanf("%d %d %d", &n, &E, &T);
for (int i = 1; i <= n; i++) scanf("%lld", &x[i]);
x[n + 1] = E;
ll mv = 1ll * n * T + E;
for (int i = 1, j = 1; i <= n; i++) {
dp[i] = dp[i - 1] + x[i] - x[i - 1] + T;
for (; 2 * (x[i] - x[j]) >= T; j++)
mv = min(mv, dp[j - 1] - x[j - 1] - 2 * x[j]);
dp[i] = min(dp[i], mv + x[i] * 3);
if (j < i) {
dp[i] = min(dp[i], dp[j - 1] + x[i] - x[j - 1] + T);
}
}
printf("%lld\n", dp[n] + E - x[n]);
return 0;
} |
#include<cstdio>
#include<algorithm>
#define INF 2100000006
#define MAXN 100006
using namespace std;
long long m,T,minone,a[MAXN],d[MAXN];
int n,l[MAXN],last;
int find(int x)
{
int l=1,r=x;
while(l<r)
{
int mid=(l+r)/2;
if(T-2*(a[x]-a[mid])>0) r=mid;
else l=mid+1;
}
return l;
}
int main()
{
//freopen("computer.in","r",stdin);
//freopen("computer.out","w",stdout);
scanf("%d%lld%lld",&n,&m,&T);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
for(int i=1;i<=n;i++)
l[i]=find(i);
minone=INF;
for(int i=1;i<=n;i++)
{
while(last<l[i]-1)
{
last++;
minone=min(minone,d[last-1]-a[last-1]-2*a[last]);
}
long long len=a[i]-a[l[i]];
d[i]=d[l[i]-1]+a[l[i]]-a[l[i]-1]+len+T;
d[i]=min(d[i],minone+3*a[i]);
}
printf("%lld",d[n]+m-a[n]);
} |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define MP make_pair
#define PB push_back
#define PH push
#define fst first
#define snd second
typedef double db;
typedef long double ldb;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
const ll INF = 1e18;
int n, e, t;
int x[maxn];
ll dp[maxn];
int main(){
scanf("%d%d%d", &n, &e, &t);
dp[0] = 0;
REP(i, 1, n)
scanf("%d", x + i);
ll mn = INF;
for(int i = 1, j = 1; i <= n; ++i){
if(2 * (x[i] - x[1]) <= t)
dp[i] = t;
else{
mn = min(mn, -2ll * x[1]);
for(; 2 * (x[i] - x[j + 1]) > t; ++j){
mn = min(mn, dp[j] - 2 * x[j + 1]);
}
dp[i] = mn + 2 * x[i];
dp[i] = min(dp[i], dp[j] + t);
}
}
printf("%lld\n", dp[n] + e);
return 0;
} |
#include<iostream>
using namespace std;
int n,e,t,x[200000];
long long dp[200000];
int main()
{
cin>>n>>e>>t;
for(int i=1;i<=n;i++)cin>>x[i];
for(long long i=1,j=0,buf=1ll<<40;i<=n;i++)
{
while(t<(x[i]-x[j+1])*2)
{
buf=min(buf,dp[j]-x[j]-x[j+1]*2);
j++;
}
dp[i]=min(buf+x[i]*3ll,dp[j]+x[i]-x[j]+t);
//for(int j=0;j<i;j++)dp[i]=min(dp[i],dp[j]+x[i]-x[j]+max(t,(x[i]-x[j+1])<<1));
}
cout<<dp[n]+e-x[n]<<endl;
return 0;
}
|
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#define LL long long
#define N 110000
using namespace std;
LL x[N],f[N],s[N],inf=1ll<<50,ans,ed,t;
int p[N],head,tail,n;
int main()
{
scanf("%d%lld%lld",&n,&ed,&t);
for(int i=1;i<=n;i++) scanf("%lld",&x[i]);
s[0]=t;
int j=0;
head=tail=1;p[1]=0;
s[0]=-2*x[1];
for(int i=1;i<=n;i++)
{
f[i]=inf;
while(2*(x[i]-x[j+1])>t) j++;
if(j>0) f[i]=3*x[i]+s[j-1];
while(head<=tail && p[head]<j) head++;
if(head<=tail) f[i]=min(f[i],f[p[head]]+x[i]-x[p[head]]+t);
while(head<=tail && f[p[tail]]-x[p[tail]]>=f[i]-x[i]) tail--;
p[++tail]=i;
s[i]=min(s[i-1],f[i]-x[i]-2*x[i+1]);
}
ans=f[n]+ed-x[n];
printf("%lld\n",ans);
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 100000
#define INF 1000000000000000000LL
using namespace std;
typedef long long LL;
LL p[MAXN+5];
LL dp[MAXN+5];
int N;
LL M;
LL T;
void Init()
{
memset(dp,-1,sizeof(dp));
}
LL GetVal(int i,int j)
{
return dp[j-1]+T-2LL*(p[i]-p[j])+3LL*(p[i]-p[j])+p[j]-p[j-1];
}
int main()
{
// freopen("computer.in","r",stdin);
// freopen("computer.out","w",stdout);
Init();
dp[0]=0;
scanf("%d %lld %lld",&N,&M,&T);
for(int i=1;i<=N;i++)
scanf("%lld",&p[i]);
LL minval=INF;
int pn=-1;
dp[0]=0;
for(int i=1;i<=N;i++)
{
int pos=lower_bound(p+1,p+1+N,p[i]-T/2)-p;
if(2*(p[i]-p[pos])==T)
pos++;
if(2*(p[i]-p[pos-1])>=T)
while(pn<pos-1)
{
pn++;
if(pn!=0) minval=min(dp[pn-1]-2LL*p[pn]-p[pn-1],minval);
else minval=min(-3LL*p[pn],minval);
}
dp[i]=GetVal(i,pos);
dp[i]=min(dp[i],minval+3LL*p[i]);
}
printf("%lld\n",dp[N]+M-p[N]);
return 0;
} |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
const int maxn = 1e5 + 10;
int n , T , E;
int a[maxn];
ll dp[maxn];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen(taskname".INP" , "r"))
freopen(taskname".INP","r",stdin),
freopen(taskname".OUT","w",stdout);
cin >> n >> E >> T;
for(int i = 1 ; i <= n ; ++i)cin >> a[i];
int j = 0;ll pref = 1e18;
for(int i = 1 ; i <= n ; ++i){
dp[i] = 1e18;
while(j < i && 2 * (a[i] - a[j + 1]) > T){
pref = min(pref,dp[j]-2*a[j + 1]);
++j;
}
dp[i] = min(pref+2*a[i],dp[j]+T);
// cout << dp[i] << " ";
}
cout << dp[n] + E;
}
|
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define sec second
using namespace std;
const int MAXN=1e5+100;
const ll INF=2e18;
ll x[MAXN],dp[MAXN],dp2[MAXN];
int main() {
// cout << "HI" <<endl;
ll n,E,T;
cin>>n>>E>>T;
x[0]=0;
for(int i=1;i<=n;i++){
cin>>x[i];
x[i]*=2;
dp[i]=INF;
}
E*=2;
dp[0]=0;
dp2[0]=-x[1]*2;
for(int i=1;i<=n;i++){
int j=lower_bound(x+1,x+n+1,(x[i]-T))-x;
if(x[j]>x[i]-T&&j){
j--;
}
dp[i]=dp[j]+T*2;
if(j>0){
dp[i]=min(dp[i],dp2[j-1]+x[i]*2);
}
dp2[i]=min(dp2[i-1],dp[i]-x[i+1]*2);
// cout<<i<<' '<<dp[i]<<' '<<dp2[i]<<' '<<j<<endl;
}
cout<<(dp[n]+E)/2<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
const int maxN = 1e5 + 100;
int n;
int q[maxN + 1];
LL x[maxN + 1], T, E, f[maxN + 1], ans;
int main()
{
scanf("%d %lld %lld", &n, &E, &T);
for(int i = 1; i <= n; i++) scanf("%lld", &x[i]), ans += x[i] - x[i - 1];
ans += E - x[n];
int now = 0, head = 1, tail = 0;
LL minT = 1e18; q[++ tail] = 0;
for(int i = 1; i <= n; i++)
{
while(head <= tail && 2 * (x[i] - x[ q[head] + 1 ]) >= T) head ++;
while(now < i && 2 * (x[i] - x[now + 1]) >= T)
minT = min(minT, f[now] - 2 * x[now + 1]), now ++;
f[i] = minT + 2 * x[i];
if(head <= tail) f[i] = min(f[i], f[ q[head] ] + T);
while(head <= tail && f[i] <= f[ q[tail] ]) tail --;
q[++ tail] = i;
}
printf("%lld", ans + f[n]);
return 0;
} |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#include<cctype>
#include<set>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long LL;
inline int read() {
int x=0,f=1;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;
for(;isdigit(ch);ch=getchar())x=x*10+ch-'0';return x*f;
}
const int N = 1000005;
LL f[N], p[N];
int main() {
// freopen("a.in", "r", stdin);
int n = read(), E = read(), T = read();
for (int i = 1; i <= n; ++i) p[i] = read();
LL Mn = 1e18;
int j = 0;
for (int i = 1; i <= n; ++i) {
while (j <= i && 2 * (p[i] - p[j + 1]) > T) {
Mn = min(Mn, f[j] - 2 * p[j + 1]);
++ j;
}
if (j < i) f[i] = f[j] + T;
f[i] = min(f[i], Mn + 2 * p[i]);
}
cout << f[n] + E;
return 0;
} |
#include <cstdio>
using namespace std;
#define dmin(_a, _b) ((_a) < (_b) ? (_a) : (_b))
#define cmin(_a, _b) (_a > (_b) ? _a = (_b) : 0)
long long f[100008];
int x[100008];
int main(){
register int n, e, t, i, j;
register long long fmin = 3000000000ll;
scanf("%d %d %d", &n, &e, &t);
for (i = 1; i <= n; ++i) scanf("%d", &x[i]);
f[0] = 0;
for (j = 0, i = 1; i <= n; ++i) {
while (2 * (x[i] - x[j + 1]) > t) {
cmin(fmin, f[j] - x[j + 1] * 2);
++j;
}
f[i] = dmin(fmin + 2 * x[i], f[j] + t);
}
printf("%lld\n", f[n] + e);
return 0;
} |
#include<stdio.h>
#include<algorithm>
using namespace std;
long long p[1100000];
long long dp[1100000];
long long dp2[1100000];
long long T;
long long calc(int a,int b){
long long ret=max(T,(p[b]-p[a+1])*2);
// printf("%d %d: %lld\n",a,b,ret);
return ret;
}
int main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
T=c;
for(int i=0;i<a;i++)scanf("%lld",p+i+1);
for(int i=0;i<=a;i++)dp[i]=dp2[i]=99999999999999999LL;
dp[0]=0;
//dp2[0]=0;
int t=1;
for(int i=1;i<=a;i++){
while((p[i]-p[t])*2>T){
t++;
}
dp[i]=min(dp[t-1]+T,dp2[t-1]+p[i]*2);
dp2[i]=min(dp2[i-1],dp[i-1]-p[i]*2);
// printf("%lld %lld\n",dp[i],dp2[i]);
}
printf("%lld\n",dp[a]+b);
} |
#include <bits/stdc++.h>
using namespace std;
#define debug(a) cerr << #a << ": " << a << endl
typedef long long ll;
typedef pair<int, int> ii;
#define x first
#define y second
const int N = 1e5 + 10;
int n, e, t;
int x[N];
ll dp[N];
ll suffix_min[N];
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
cin >> n >> e >> t;
for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
suffix_min[n + 1] = 2 * x[n];
dp[n] = t;
suffix_min[n] = min(suffix_min[n + 1], dp[n] + 2 * x[n - 1]);
for (int i = n - 1; i >= 1; i--) {
ll &res = dp[i];
int nxt = upper_bound(x + 1, x + n + 1, x[i] + t / 2) - x;
if (nxt > n) res = t;
else {
res = dp[nxt] + t;
res = min(res, suffix_min[nxt + 1] - 2 * x[i]);
}
suffix_min[i] = min(suffix_min[i + 1], res + 2 * x[i - 1]);
}
cout << dp[1] + e << endl;
return 0;
} |
#include<iostream>
using namespace std;
typedef long long ll;
int main(){
static ll N,E,T;
static ll x[100010];
scanf("%lld%lld%lld",&N,&E,&T);
for(int i = 1 ; i <= N ; i ++){
scanf("%lld",&x[i]);
}
static ll dp1[100010];
static ll dp2[100010];
for(int i = 0 ; i < 100010 ; i ++){
dp1[i] = dp2[i] = 1000000000000000000;
}
dp1[0] = 0;
int r = 1;
for(int i = 1 ; i <= N ; i ++){
dp1[i-1] = min( dp1[i-1] , dp2[i-1] );
dp2[i] = min( dp2[i] , dp2[i-1]+2*(x[i]-x[i-1]) );
while(r+1 <= N && 2*(x[r+1]-x[i]) <= T)r ++;
dp1[r] = min( dp1[r] , dp1[i-1]+T );
if(r+1 <= N)dp2[r+1] = min( dp2[r+1] , dp1[i-1]+2*(x[r+1]-x[i]) );
}
cout << min(dp1[N],dp2[N])+E << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define P pair<LL,LL>
const LL inf = 0x3f3f3f3f;
const LL mod = 924844033;
const LL N = 1e5+10;
template <typename tp> inline void read(tp &x)
{
x=0;char c=getchar();int f=0;
for(;c>'9'||c<'0';f|=(c=='-'),c=getchar());
for(;c<='9'&&c>='0';x=(x<<3)+(x<<1)+c-'0',c=getchar());
if(f) x=-x;
}
LL n,e,t;
LL x[N],dp[N];
signed main()
{
read(n),read(e),read(t);
for(int i=1;i<=n;i++) read(x[i]);
memset(dp,inf,sizeof(dp));
LL flag=inf;dp[0]=0;
for(int i=1,now=0;i<=n;i++)
{
while(t<=2*(x[i]-x[now+1]))
flag=min(flag,dp[now]-2*x[now+1]),now++;
dp[i]=min(dp[now]+t,flag+2*x[i]);
}
printf("%lld\n",dp[n]+e);
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
const int MAXN = 101010;
int N , E , T;
int x[MAXN];
ll f[MAXN];
int head = 1 , tail = 0;
ll minn = 1000000000000ll;
int q[MAXN];
ll t[MAXN];
void push(int p , ll now){
while(head <= tail && now <= t[tail])
tail --;
q[++ tail] = p;
t[tail] = now;
}
int main(){
ios::sync_with_stdio(0);
cin >> N >> E >> T;
for(int i = 1 ; i <= N ; ++ i)
cin >> x[i];
f[N + 1] = 0;
x[N + 1] = E;
for(int i = N ; i >= 1 ; -- i){
while(head <= tail && 2 * (x[q[head]] - x[i]) >= T){
minn = min(minn , f[q[head] + 1] + 2ll * x[q[head]] + x[q[head] + 1]);
head ++;
}
push(i , f[i + 1] + x[i + 1]);
f[i] = minn - 3ll * x[i];
if(head <= tail) f[i] = min(f[i] , t[head] + T - x[i]);
}
cout << f[1] + x[1] << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,m,t,x[100010];
long long f[100010],k=1e18;
int main()
{
scanf("%d%d%d",&n,&m,&t);
for(int i=1;i<=n;i++)
scanf("%d",&x[i]);
for(int i=1,j=0;i<=n;i++)
{
for(;2*(x[i]-x[j+1])>t;j++)
k=min(k,f[j]-2*x[j+1]);
f[i]=min(k+2*x[i],f[j]+t);
}
cout<<f[n]+m<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define INF 1000000000000000007ll
using namespace std;
int n,e,t,a[100010],dp[100010];
signed main()
{
ios::sync_with_stdio(false);
cin>>n>>e>>t;
for(int i=1;i<=n;i++) cin>>a[i];
int minv=INF,pos=0;
for(int i=1;i<=n;i++){
while(2*(a[i]-a[pos+1])>t){
minv=min(minv,dp[pos]-2*a[pos+1]);
pos++;
}
dp[i]=min(minv+2*a[i],dp[pos]+t);
}
cout<<dp[n]+e<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define pb push_back
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
const ll INFTY=1e18;
int main() {
ll i, n, e, t, l, r, m;
scanf("%lld%lld%lld", &n, &e, &t);
vll x(n+2);
for(i=1; i<=n; i++) scanf("%lld", &x[i]);
x[n+1]=e;
vll opt(n+2), dp(n+2);
dp[n+1]=INFTY;
for(i=n; i>=1; i--) {
l=i+1; r=n+1;
while(l<r) {
m=(l+r)/2;
if(2*(x[m]-x[i])<=t) l=m+1;
else r=m;
}
opt[i]=min(t+x[l]-x[i]+opt[l], -3*x[i]+dp[l]);
dp[i]=min(2*x[i]+x[i+1]+opt[i+1], dp[i+1]);
}
printf("%lld\n", x[1]+opt[1]);
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
const ll linf = 0x3f3f3f3f3f3f3f3f;
inline void chk_min(ll &a,ll b){ if(a>b) a=b;}
struct Queue
{
int q[MAXN],hd,tl;
Queue(void){ hd=tl=0;}
inline bool empty(void){ return hd>=tl;}
inline int front(void){ return q[hd+1];}
inline int back(void){ return q[tl];}
inline void push(int x){ q[++tl]=x;}
inline void pop(void){ ++hd;}
}q;
int a[MAXN];
ll dp[MAXN];
int main(void)
{
int n,e,t;
scanf("%d%d%d",&n,&e,&t);
for(int i=1; i<=n; ++i) scanf("%d",&a[i]);
memset(dp,0x3f,sizeof(dp));
dp[0]=0;
q.push(0);
ll mn=linf;
for(int i=1; i<=n; ++i)
{
while(!q.empty() && (a[i]-a[q.front()+1])*2 > t)
chk_min(mn, dp[q.front()] - 2*a[q.front()+1]),
q.pop();
if(!q.empty()) chk_min(dp[i], dp[q.front()]+t);
chk_min(dp[i], mn+2*a[i]);
q.push(i);
}
printf("%lld\n",dp[n]+e);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn=200008;
int n,e;
int T;
int a[maxn];
int q[maxn];
long long f[maxn];
int main(){
cin>>n>>e>>T;
for (int i=1;i<=n;i++)
scanf("%d",&a[i]);
long long mn=2e9;
int r=0; int l=0;
for (int i=1;i<=n;i++)
{
r++;
q[r]=i;
while (2*(a[i]-a[q[l]])>=T)
{
mn=min(mn,f[q[l]-1]-2*a[q[l]]);
l++;
}
f[i]=f[q[l]-1]+T;
f[i]=min(f[i],2*a[i]+mn);
}
cout<<f[n]+e<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int n, E, T, r;
int a[maxn];
ll Min1, Min2 = 1e18, f[maxn];
int main()
{
deque<ll> Q;
scanf("%d%d%d", &n, &E, &T);
for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
Q.push_back(0);
for(int i = 1; i <= n; ++i)
{
while((a[i] - a[r + 1]) * 2 >= T)
{
Min2 = min(Min2, f[r] - 2 * a[r + 1]);
if(Q.front() <= r) Q.pop_front();
++r;
}
f[i] = min(Min1 + 1ll * i * T, Min2 + 2 * a[i]);
if(!Q.empty()) f[i] = min(f[i], f[Q.front()] + T);
Min1 = min(Min1, f[i] - 1ll * i * T);
while(!Q.empty() && f[i] <= f[Q.back()]) Q.pop_back();
Q.push_back(i);
}
printf("%lld\n", f[n] + E);
return 0;
} |
#include<cstdio>
#include<algorithm>
const int N=1e5+5;
typedef long long LL;
int n,E,T,p[N];
LL dp[N];
int q[N],h,t;
int main(){
scanf("%d%d%d",&n,&E,&T);
for(int i=1;i<=n;++i)scanf("%d",p+i),dp[i]=0x7fffffffffffffff;
int pre=0,mpos=0;
for(int i=1;i<=n;++i){
const int TL=T-2*p[i];
while(h<t&&TL<=-2*p[q[h]+1])++h;
int j=q[h];
dp[i]=dp[j]-p[j]+std::max(TL,-2*p[j+1])+3LL*p[i];
while(pre<i&&TL<=-2*p[pre+1]){
if(dp[mpos]-p[mpos]-2LL*p[mpos+1]>dp[pre]-p[pre]-2LL*p[pre+1])
mpos=pre;
++pre;
}
j=mpos;
dp[i]=std::min(dp[i],dp[j]-p[j]+std::max(TL,-2*p[j+1])+3LL*p[i]);
while(h<=t&&dp[q[t]]-p[q[t]]>=dp[i]-p[i])--t;
q[++t]=i;
}
printf("%lld\n",dp[n]+E-p[n]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
int n, e, T, q[N], h, t;
using ll = long long;
ll f[N], a[N], p[N], d[N];
int main () {
scanf("%d%d%d", &n, &e, &T); p[0] = -0x3f3f3f3f3f3f3f3f;
for (int i = h = 1, k = 0; i <= n; ++i) {
scanf("%lld", &a[i]); f[i] = 0x3f3f3f3f3f3f3f3f;
d[i] = f[i - 1] - a[i - 1];
while (h <= t && d[i] < d[q[t]]) --t; q[++t] = i;
while (2 * (a[i] - a[k]) > T) if (q[h] == k++) ++h;
f[i] = min(f[i], T + a[i] + d[q[h]]);
if (k > 1) f[i] = min(f[i], 3ll * a[i] - p[k - 1]);
p[i] = max(p[i - 1], 2ll * a[i] + a[i - 1] - f[i - 1]);
}
printf("%lld\n", f[n] + e - a[n]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL INF = 1e18;
const int N = 100010;
LL f[N];
int x[N];
int n, T, E;
int main() {
scanf("%d %d %d", &n, &E, &T);
for (int i = 1; i <= n; i++) {
scanf("%d", &x[i]);
}
int p = 0;
LL mn = INF;
for (int i = 1; i <= n; i++) {
f[i] = INF;
while(2 * (x[i] - x[p + 1]) > T) {
mn = min(f[p] - 2 * x[p + 1], mn);
++p;
}
f[i] = min(f[i], mn + 2 * x[i]);
f[i] = min(f[i], f[p] + T);
}
cout << f[n] + E << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl;
typedef double db;
typedef long long ll;
typedef pair<int,int> P;
const int MAXN=1e5+10;
int q[MAXN],l,r;
ll d[MAXN],dp[MAXN];int n,E,T;
int main()
{
scanf("%d%d%d",&n,&E,&T);
for(int i=1;i<=n;i++)
scanf("%d",&d[i]),dp[i]=1ll<<60;
ll mn=1ll<<60;l=r=1;
for(int i=1;i<=n;i++)
{
while(l<=r&&2*(d[i]-d[q[l]+1])>T)
mn=min(mn,dp[q[l]]-d[q[l]]-2*d[q[l]+1]),l++;
dp[i]=min(dp[i],3*d[i]+mn);
if(l<=r)dp[i]=min(dp[i],d[i]+T+dp[q[l]]-d[q[l]]);
while(l<=r&&dp[i]-d[i]<=dp[q[r]]-d[q[r]]) r--;
q[++r]=i;
}
printf("%lld",dp[n]+E-d[n]);
return 0;
} |
#include<bits/stdc++.h>
#define INTMAX 2147483647LL
#define PII pair<int,int>
#define MK make_pair
#define re register
using namespace std;
typedef long long ll;
const double Pi=acos(-1.0);
const int Inf=0x3f3f3f3f;
const int MAXN=1e5+10;
inline int read(){
re int x=0,f=1,ch=getchar();
while(!isdigit(ch))f=ch=='-'?-1:1,ch=getchar();
while(isdigit(ch))x=x*10+ch-48,ch=getchar();
return x*f;
}
inline ll readll(){
re ll x=0,f=1,ch=getchar();
while(!isdigit(ch))f=ch=='-'?-1:1,ch=getchar();
while(isdigit(ch))x=x*10+ch-48,ch=getchar();
return x*f;
}
int n;
ll E,T;
ll a[MAXN],f[MAXN];
int main(){
n=read();E=readll();T=readll();
for(int i=1;i<=n;++i) a[i]=readll();
f[0]=0;
int now=0;ll mn=1e18+7;
for(int i=1;i<=n;++i){
while(T<=2*(a[i]-a[now+1])){
mn=min(mn,f[now]-2*a[now+1]);++now;
}
f[i]=min(f[now]+T,mn+2*a[i]);
}
printf("%lld",E+f[n]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,t,e,a[100100],f[100100],mn=0x3f3f3f3f;
deque<int>q;
signed main(){
scanf("%lld%lld%lld",&n,&e,&t);
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
q.push_back(0);
for(int i=1,j=0;i<=n;i++){
while(j+1<i&&t-2*a[i]+2*a[j+1]<0)mn=min(mn,f[j]-a[j]-2*a[j+1]),j++;
while(!q.empty()&&q.front()<j)q.pop_front();
while(!q.empty()&&f[i-1]-a[i-1]<=f[q.back()]-a[q.back()])q.pop_back();
q.push_back(i-1);
f[i]=min(f[q.front()]-a[q.front()]+a[i]+t,mn+3*a[i]);
}
printf("%lld\n",f[n]+e-a[n]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
template<typename T> inline void chkmin(T &a, const T &b) { a = a < b ? a : b; }
template<typename T> inline void chkmax(T &a, const T &b) { a = a > b ? a : b; }
const int MAXN = 100005;
int que[MAXN], x[MAXN], n, T, E;
LL f[MAXN];
int main() {
scanf("%d%d%d", &n, &E, &T);
int he = 1, ta = 0;
LL mn = 1e18;
que[++ta] = 0;
for (int i = 1, pos = 0; i <= n; i++) {
scanf("%d", x + i);
for (; 2 * (x[i] - x[pos + 1]) >= T; ++pos)
chkmin(mn, f[pos] - x[pos] - 2 * x[pos + 1]);
f[i] = mn + 3ll * x[i];
while (he <= ta && que[he] < pos) ++he;
chkmin(f[i], f[que[he]] - x[que[he]] + x[i] + T);
while (he <= ta && f[i] - x[i] <= que[ta]) --ta;
que[++ta] = i;
}
printf("%lld\n", f[n] + E - x[n]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100100, mod = 1e9 + 7, maxa = 1e6 + 100, maxb = 23;
const long long inf = 2e18 + 13;
int max(int x, int y){return (x > y ? x : y);}
int min(int x, int y){return (x < y ? x : y);}
long long dp[maxn];
long long pm[maxn];
long long x[maxn];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, e, t;
cin >> n >> e >> t;
fill(dp, dp + maxn, inf);
t *= 2;
e *= 2;
int p1 = 0;
for(int i = 1; i <= n; i++){cin >> x[i]; x[i] *= 2;}
dp[0] = 0;
for(int i = 1; i <= n; i++)
{
while(p1 + 1 < i && x[p1 + 1] <= x[i] - t / 2){p1++;}
if(!p1){dp[i] = t;}
else{dp[i] = min(dp[p1] + t, pm[p1] + x[i] * 2);}
pm[i] = min(pm[i - 1], dp[i - 1] - 2 * x[i]);
// cout << p1<<" "<< i << ' ' << dp[i] << ' ' << pm[i] << endl;
}
cout << (dp[n] + e) / 2 << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define N 200100
using namespace std;
long long dp[N];
int x[N],l[N];
int main(){
int n,e,t,cl=-1;
scanf("%d%d%d",&n,&e,&t);
for(int i=1;i<=n;i++) scanf("%d",&x[i]);
dp[0]=0;
l[n+1]=n;
for(int i=n;i>=1;i--){
l[i]=min(l[i+1],i);
while(l[i]&&2*(x[i]-x[l[i]])<=t) l[i]--;
}
for(int i=1;i<=n;i++){
dp[i]=dp[l[i]]+t;
for(int j=l[i-1];j<l[i];j++){
if(cl<0||dp[j]+2*(x[i]-x[j+1])<dp[cl]+2*(x[i]-x[cl+1])){
cl=j;
}
}
if(cl>=0) dp[i]=min(dp[i],dp[cl]+2*(x[i]-x[cl+1]));
}
printf("%lld\n",dp[n]+e);
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define MAX 100100
#define ll long long
inline int read()
{
int x=0;bool t=false;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')t=true,ch=getchar();
while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
return t?-x:x;
}
int n,E,T,x[MAX];
ll ans,f[MAX],mn=1e18;
int main()
{
n=read();E=read();T=read();
for(int i=1;i<=n;++i)x[i]=read();
memset(f,63,sizeof(f));f[0]=0;
for(int i=1,j=0;i<=n;++i)
{
for(;T<=(x[i]-x[j+1])<<1;++j)mn=min(mn,f[j]-2*x[j+1]);
if(j<i)f[i]=min(f[i],f[j]+T);
f[i]=min(f[i],mn+2*x[i]);
}
cout<<f[n]+E<<endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
const int MAXN = 1e5 + 10;
long long e, t, dp[MAXN], mn = 1e17;
int n, x[MAXN];
int main() {
cin >> n >> e >> t;
for (int i = 1; i <= n; i++)
cin >> x[i];
dp[1] = t;
int j = 1;
for (int i = 2; i <= n; i++) {
while ((x[i] - x[j]) * 2 > t) {
mn = min(mn, dp[j - 1] - 2 * x[j]);
j++;
}
dp[i] = min(mn + 2 * x[i], dp[j - 1] + t);
}
cout << dp[n] + e;
}
|
#include<bits/stdc++.h>
#define ll long long
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
using namespace std;
int n,E,T,t,a[100005];
ll dp[100005];
int main(){
scanf("%d%d%d",&n,&E,&T);
For(i,1,n) scanf("%d",&a[i]);
ll mn=1ll<<60;
For(i,1,n){
for (;T<=2*(a[i]-a[t+1]);t++)
mn=min(mn,dp[t]-2*a[t+1]);
dp[i]=min(dp[t]+T,mn+2*a[i]);
}
printf("%lld",E+dp[n]);
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 10000000000000000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, e, t;
cin >> n >> e >> t;
vector<ll> x(n);
for (int i = 0; i < n; i++) cin >> x[i];
ll ans = e;
vector<ll> dp(n + 1, INF);
dp[0] = 0;
vector<ll> dp2(n + 1, INF);
for (int i = 1; i <= n; i++) {
dp2[i] = min(dp2[i - 1], dp[i - 1] - x[i - 1] * 2);
int j = upper_bound(x.begin(), x.begin() + i, (2 * x[i - 1] - t) / 2) - x.begin();
dp[i] = min(dp[j] + t, 2 * x[i - 1] + dp2[j]);
}
ans += dp[n];
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 101010;
int n,e,t;
long long s[N],dp[N];
struct g{
long long v;
int pos;
}q[N];
int l,r;
long long tmp;
int main(){
scanf("%d",&n);
scanf("%lld%d",&s[n+1],&t);
for (int i=1;i<=n;i++)
scanf("%lld",&s[i]);
l=1;r=0;tmp=(1LL<<50);
q[++r].pos=1;
q[r].v=t;
for (int i=1;i<=n;i++){
while ((s[i]-s[q[l].pos])*2>t)
{
tmp=min(tmp,q[l].v-t-2*s[q[l].pos]);
l++;
}
dp[i]=(1LL<<50);
dp[i]=min(dp[i],q[l].v+s[i]);
dp[i]=min(dp[i],tmp+3*s[i]);
while ((l<=r)&&(dp[i]-s[i]+t<=q[r].v)) r--;
q[++r].pos=i+1;
q[r].v=dp[i]-s[i]+t;
}
printf("%lld\n",dp[n]+s[n+1]-s[n]);
} |
//Δ
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
const int N = 1e5+15;
const LL inf = 1e18+N;
int n,e,t,a[N];
LL dp[N];
int main()
{
int i,x;
LL y,z;
scanf("%d%d%d",&n,&e,&t);
for(i=1;i<=n;i=i+1)
scanf("%d",a+i);
a[0]=0,a[n+1]=e;
dp[1]=0;
x=1;
y=inf;
for(i=1;i<=n;i=i+1){
while(2*(a[i]-a[x])>t){
y=min(y,dp[x]-2*a[x]);
x++;
}
dp[i+1]=min(dp[x]+t,y+2*a[i]);
//cout<<i+1<<' '<<x<<' '<<dp[i+1]<<endl;
}
cout<<dp[n+1]+e<<endl;
return 0;
}
/*
2 1000000000 1000000000
1 999999999
*/ |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long LL;
inline int read()
{
char c=getchar();int num=0,f=1;
for(;!isdigit(c);c=getchar())
f=c=='-'?-1:f;
for(;isdigit(c);c=getchar())
num=num*10+c-'0';
return num*f;
}
const int N=1e5+5;
int n,E,T,x[N];
LL f[N];
int main()
{
n=read(),E=read(),T=read();
for(int i=1;i<=n;++i) x[i]=read();
LL mn=1ll<<60;
for(int i=1,j=0;i<=n;++i)
{
while(T<=2*(x[i]-x[j+1])) mn=min(mn,f[j]-2*x[j+1]),++j;
if(i!=j) f[i]=min(mn+2*x[i],f[j]+T);
else f[i]=mn+2*x[i];
}
cout<<f[n]+E;
return 0;
} |
#include<stdio.h>
#include<algorithm>
#include<set>
using namespace std;
multiset<long long>Set1, Set2;
int n, E, T, w[101000];
long long D[101000];
int main(){
int i, pv = 1;
scanf("%d%d%d",&n,&E,&T);
for(i=1;i<=n;i++){
scanf("%d",&w[i]);
}
w[n+1] = E;
D[1] = w[1];
for(i=1;i<=n;i++){
long long r = 1e15, tp;
Set2.insert(D[i] - w[i]);
while(pv<=i && (w[i] - w[pv]) * 2 > T){
Set2.erase(Set2.find(D[pv] - w[pv]));
Set1.insert(D[pv] - 1ll*3*w[pv]);
pv++;
}
if(!Set1.empty()){
tp = *Set1.begin();
if(r > tp + w[i]*3ll) r = tp + w[i]*3ll;
}
tp = *Set2.begin();
if(r > tp + w[i] + T) r = tp + w[i] + T;
D[i+1] = w[i+1] - w[i] + r;
}
printf("%lld\n",D[n+1]);
}
|
#include<bits/stdc++.h>
using namespace std;
#define RI register int
int read() {
int q=0;char ch=' ';
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9') q=q*10+ch-'0',ch=getchar();
return q;
}
typedef long long LL;
const int N=100005;
int n;LL f[N],d[N],mi,E,T;
int main()
{
n=read(),E=read(),T=read();
for(RI i=1;i<=n;++i) d[i]=read();
mi=1e15;
for(RI i=1,j=0;i<=n;++i) {
while(j<i&&(d[i]-d[j+1])*2>T) mi=min(mi,f[j]-2*d[j+1]),++j;
f[i]=mi+2*d[i];
if(j<i&&f[j]+T<f[i]) f[i]=f[j]+T;
}
printf("%lld\n",f[n]+E);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 100005;
int n, e, T;
int x[MAXN];
void input()
{
scanf("%d%d%d", &n, &e, &T);
for(int i = 1; i <= n; i++)
scanf("%d", &x[i]);
}
ll f[MAXN];
void solve()
{
f[0] = 0;
ll minv = 1e18;
int j = 0;
for(int i = 1; i <= n; i++)
{
f[i] = f[i - 1] + T;
while(2 * (x[i] - x[j + 1]) > T)
{
minv = min(minv, f[j] - 2 * x[j + 1]);
j++;
}
f[i] = min(f[i], f[j] + T);
f[i] = min(f[i], minv + 2 * x[i]);
}
}
void output()
{
printf("%lld\n", f[n] + e);
}
int main()
{
input();
solve();
output();
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,S,T,i,la,now,f[200001],a[200001];
int main(){
scanf("%lld%lld%lld",&n,&S,&T);
for(i=1;i<=n;i++)scanf("%lld",&a[i]);
la=0;now=1e9;
for(i=1;i<=n;i++){
while(la<i&&2*(a[i]-a[la+1])>T){
now=min(now,f[la]-2*a[la+1]);
la++;
}
f[i]=min(2*a[i]+now,f[la]+T);
}
f[n]+=a[n]+abs(a[n]-S);
printf("%lld",f[n]);
}
/*
最后肯定被分成一段段
*/ |
#include <cstdio>
#include <set>
#include <algorithm>
typedef long long i64;
const int N = 100000 + 10;
const i64 INF = 1LL << 60;
int n, t, e, x[N];
i64 f[N];
int main() {
scanf("%d%d%d", &n, &e, &t);
for (int i = 1; i <= n; ++i) scanf("%d", &x[i]);
std::multiset<i64> a, b;
for (int i = 1, j = 1; i <= n; ++i) {
b.insert(f[i - 1]);
for (; 2 * (x[i] - x[j]) > t; ++j) {
b.erase(b.find(f[j - 1]));
a.insert(f[j - 1] - 2 * x[j]);
}
f[i] = INF;
if (!a.empty()) f[i] = 2 * x[i] + *a.begin();
if (!b.empty()) f[i] = std::min(f[i], *b.begin() + t);
}
printf("%lld\n", f[n] + e);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MaxN = 100003;
LL dp[MaxN];
int n,e,t,x[MaxN];
int main() {
scanf("%d%d%d",&n,&e,&t);
for (int i=1;i<=n;i++) scanf("%d",x+i);
int ptr=1;
LL mn=0x7fffffff;
dp[0]=0;
for (int i=1;i<=n;i++) {
while (ptr<=n && 2*(x[i]-x[ptr])>t) {
mn=min(mn,dp[ptr-1]-x[ptr]*2);
ptr++;
}
dp[i]=min(dp[ptr-1]+t,mn+x[i]*2);
}
printf("%lld\n",e+dp[n]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n, t, e;
int x[111111];
long long f[111111], g[111111];
int main(){
// freopen("input.inp", "r", stdin);
scanf("%d%d%d",&n,&e,&t);
for(int i = 1; i <= n; ++i) scanf("%d",&x[i]);
int p = 0;
g[0] = - 2 * x[1];
for(int i = 1; i <= n; ++i){
while (2ll * (x[i] - x[p + 1]) > t) ++p;
f[i] = f[p] + t;
if (p) f[i] = min(f[i], g[p - 1] + 2 * x[i]);
g[i] = min(f[i] - 2 * x[i + 1], g[i - 1]);
}
printf("%lld",f[n] + e);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
// cout << fixed << setprecision(20);
int N, E, T;
int x[110000], dp[110000];
signed main() {
cin >> N >> E >> T;
for (int i = 0; i < N; i++)cin >> x[i];
x[N] = E;
dp[N] = 0;
int rmin = 1e14;
int lidx = N;
for (int i = N - 1; i >= 0; i--) {
rmin += 2 * (x[i + 1] - x[i]);
while (T < 2 * (x[lidx - 1] - x[i]))rmin = min(rmin, dp[lidx] + 2 * (x[lidx - 1] - x[i])), lidx--;
dp[i] = min(rmin, dp[lidx] + T);
}
cout << E + dp[0] << endl;;
}
|
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define ll long long
using namespace std;
inline void cmin(ll &x,ll y){y<x?x=y:0;}
const int N=1e5+10;
const ll inf=1e18;
int n,e,t,a[N]; ll f[N],mi;
int main(){
scanf("%d%d%d",&n,&e,&t);
rep (i,1,n) scanf("%d",&a[i]);
memset(f,0x3f,sizeof(f)),f[0]=0;
int p=0; mi=inf;
rep (i,1,n){
while (p<=i&&2ll*(a[i]-a[p+1])>t)
mi=min(mi,f[p]-2*a[p+1]),p++;
cmin(f[i],mi+2ll*a[i]);
if (p<i) cmin(f[i],f[p]+t);
}
printf("%lld\n",f[n]+e);
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 100005
typedef long long LL;
int n,x[maxn],T,E;
LL f[maxn],ans;
int main()
{
scanf("%d%d%d",&n,&E,&T);
for (int i=1;i<=n;i++) scanf("%d",x+i);
for (int i=1;i<=n;i++) f[i]=1e16;
/* for (int i=1;i<=n;i++)
for (int j=1;j<=i;j++)
f[i]=min(f[i],f[j-1]+max(T,(x[i]-x[j])*2));*/
int p=1;LL t=1e16;;
for (int i=1;i<=n;i++)
{
while ((x[i]-x[p])*2>T&&p<=i)
{
t=min(t,f[p-1]-2*x[p]);
p++;
}
f[i]=min(f[i],min(f[p-1]+T,t+2*x[i]));
}
ans=E+f[n];
printf("%lld\n",ans);
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 100010
#define LL long long
LL dp[MAXN],a[MAXN],T,tmp=1000000000000000LL;
int n,m,t;
int main()
{
scanf("%d%d%lld",&n,&m,&T);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
for(int i=1;i<=n;i++)
{
while(T<=2*(a[i]-a[t+1]))
tmp=min(tmp,dp[t]-2*a[t+1]),t++;
dp[i]=min(tmp+2*a[i],dp[t]+T);
}
printf("%lld\n",dp[n]+m);
} |
#include<cstdio>
#include<iostream>
using namespace std;
int p[100001],s[100001],l,r;
long long f[100001];
int main(){
int n,e,t;scanf("%d%d%d",&n,&e,&t);
for(int i=1;i<=n;i++)scanf("%d",&p[i]);
long long z=2e9;
for(int i=1;i<=n;i++){
s[++r]=i;
for(;2*(p[i]-p[s[l]])>=t;l++)
z=min(z,f[s[l]-1]-2*p[s[l]]);
f[i]=f[s[l]-1]+t;
f[i]=min(f[i],2*p[i]+z);
}
cout<<f[n]+e;
} |
#include <bits/stdc++.h>
typedef long long LL;
const LL inf = 0x3f3f3f3f3f3f3f3f;
const int N = 100005;
int n, e, t, x[N];
LL dp[N];
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> n >> e >> t;
for (int i = 1; i <= n; ++i) std::cin >> x[i];
int k = 0; LL left_min = inf;
for (int i = 1; i <= n; ++i) {
while (2 * (x[i] - x[k + 1]) > t) left_min = std::min(left_min, dp[k] - 2 * x[k + 1]), ++k;
dp[i] = std::min(left_min + 2 * x[i], dp[k] + t);
}
std::cout << dp[n] + e << '\n';
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.