text stringlengths 49 983k |
|---|
#include<bits/stdc++.h>
using namespace std;
int K, N, V, sz[20], x[200009], maxPref[200009], pf[400009], sf[400009], lft[19][200009], rgt[19][200009];
int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);
scanf ("%d %d", &N, &V);
for (int i=1; i<=N; i++)
scanf ("%d", &x[i]);
for (int i=0; (1 << i) <= V; i++)
sz[i] = V >> i, K = i;
sz[++K] = 0;
for (int i=0; i<=K; i++)
{
lft[i][1] = 1, lft[i][0] = 0;
for (int j=2; j<=N; j++)
if (x[j] - x[j - 1] <= sz[i]) lft[i][j] = lft[i][j - 1];
else lft[i][j] = j;
rgt[i][N] = N, rgt[i][N + 1] = N + 1;
for (int j=N - 1; j>=1; j--)
if (x[j + 1] - x[j] <= sz[i]) rgt[i][j] = rgt[i][j + 1];
else rgt[i][j] = j;
}
int lim = 1 << K;
for (int i=0; i < lim; i++)
sf[i] = N + 1;
for (int msk = 0; msk < lim; msk ++)
for (int i=0; i<K; i++)
if ((msk & (1 << i)) == 0)
pf[msk | (1 << i)] = max (pf[msk | (1 << i)], (pf[msk] <= N ? rgt[i + 1][pf[msk] + 1] : N + 1)),
sf[msk | (1 << i)] = min (sf[msk | (1 << i)], (sf[msk] >= 1 ? lft[i + 1][sf[msk] - 1] : 0));
for (int i=0; i<=N + 1; i++)
maxPref[i] = -N;
for (int i=0; i<lim; i++)
maxPref[sf[i]] = max (maxPref[sf[i]], pf[(lim - 1) ^ i]);
for (int i=1; i<=N + 1; i++)
maxPref[i] = max (maxPref[i - 1], maxPref[i]);
for (int i=1; i<=N; i++)
if (maxPref[rgt[0][i] + 1] >= lft[0][i] - 1) printf ("Possible\n");
else printf ("Impossible\n");
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std ;
#define l first
#define r second
const int M = 40 ;
const int N = 1200010 ;
const int MAX = 1001000001 ;
int dep ;
int maxn ;
int ans[N] ;
int n, m, k ;
int base[N] ;
int L[M][N] ;
int R[M][N] ;
int farfrl[N] ;
int farfrr[N] ;
pair<int, int> rg[N] ;
void Init_dp(){
for (int j = m ; j >= 0 ; j >>= 1){
R[++ dep][n + 1] = n + 1 ;
for (int i = 1 ; i <= n ; ++ i)
L[dep][i] = (base[i] - base[i - 1] > j) ? i : L[dep][i - 1] ;
for (int i = n ; i >= 1 ; -- i)
R[dep][i] = (base[i + 1] - base[i] > j) ? i : R[dep][i + 1] ;
if (!j) break ;
}
return ;
}
void Auxiliary_dp(){
for (int i = 0 ; i <= maxn ; i += 2)
for (int j = 1 ; j <= dep ; ++ j)
if (1 << (j - 1) & i){
farfrl[i] = max(farfrl[i], R[j][ farfrl[i ^ (1 << (j - 1))] + 1]) ;
farfrr[i] = min(farfrr[i], L[j][ farfrr[i ^ (1 << (j - 1))] - 1]) ;
}
return ;
}
int main(){
cin >> n >> m ;
base[0] = -MAX ;
base[n + 1] = MAX ; k = -1 ;
for (int i = 1 ; i <= n ; ++ i)
scanf("%d", &base[i]) ; Init_dp() ;
for (int i = 1 ; i <= n ; ++ i)
rg[i].l = L[1][i], rg[i].r = R[1][i] ;
sort(rg + 1, rg + n + 1) ; maxn = (1 << dep) - 1 ;
for (int i = 0 ; i <= maxn ; ++ i) farfrr[i] = n + 1 ;
k += unique(rg + 1, rg + n + 1) - rg ; Auxiliary_dp() ;
for (int i = 1 ; i <= k ; ++ i)
for (int j = 0 ; j <= maxn ; j += 2)
if (farfrl[j] + 1 >= rg[i].l && farfrr[(maxn ^ j) ^ 1] - 1 <= rg[i].r)
{ for (int o = rg[i].l ; o <= rg[i].r ; ++ o) ans[o] = 1 ; break ; }
for (int i = 1 ; i <= n ; ++ i) puts(ans[i] ? "Possible" : "Impossible") ; return 0 ;
}
/*
0 8
0 8
1 7
0 8
1 7
0 8
2 6
0 8
*/
|
#include <bits/stdc++.h>
using namespace std;
const int L = 20, N = 201010;
int n, V, x[N], fa[L][N], siz[L][N], ans[N], lt[1 << L], rt[1 << L];
vector<int> v[N];
int Find(int k, int x) {
return fa[k][x] == x ? x : fa[k][x] = Find(k, fa[k][x]);
}
void Merge(int k, int x, int y) {
x = Find(k, x), y = Find(k, y);
fa[k][y] = x;
siz[k][x] += siz[k][y];
}
int main(void) {
scanf("%d%d", &n, &V);
for(int i = 1; i <= n; i++)
scanf("%d", &x[i]);
int now = V, m;
for(int o = L - 1; ; now >>= 1, o = (o + 1) % L) {
for(int i = 1; i <= n; i++)
fa[o][i] = i, siz[o][i] = 1;
for(int i = 1; i <= n; i++) {
int j = i;
while(j < n && x[j + 1] - x[j] <= now) j++;
for(int k = i + 1; k <= j; k++)
Merge(o, i, k);
i = j;
}
if(now == 0) { m = o + 1; break; }
}
for(int i = 0; i < (1 << m); i++)
rt[i] = n + 1;
for(int i = 0; i < (1 << m); i++) {
for(int j = 0; j < m; j++)
if(~i >> j & 1) {
lt[i | (1 << j)] = max(lt[i | (1 << j)], lt[i] + siz[j][lt[i] + 1]);
rt[i | (1 << j)] = min(rt[i | (1 << j)], Find(j, rt[i] - 1));
}
}
// cerr << lt[27] <<" " << rt[4] << endl;
int all = (1 << m) - 1;
for(int i = 0; i < (1 << m); i++) {
v[lt[i]].push_back(rt[all ^ i]);
// cerr << lt[i] << " " << rt[all ^ i] << endl;
}
int mi = n + 2;
for(int i = 0; i < v[n].size(); i++)
mi = min(v[n][i], mi);
for(int i = n; i >= 1; i--) {
for(int j = 0; j < v[i - 1].size(); j++)
mi = min(v[i - 1][j], mi);
if(fa[L - 1][i] != i) continue;
//cerr << i + siz[L - 1][i] << endl;
ans[i] = mi <= i + siz[L - 1][i];
}
for(int i = 1; i <= n; i++)
puts(ans[Find(L - 1, i)] ? "Possible" : "Impossible");
return 0;
}
|
#include<bits/stdc++.h>
#define MAXN 1000000
#define INF 2000000000
using namespace std;
int n,V,x[MAXN+5];
int cnt[25];
int l[25][MAXN+5],r[25][MAXN+5];
int f1[MAXN*5+5],f2[MAXN*5+5];//如思路中的定义
bool ans[MAXN+5];//ans记录的是对于某一条线段的答案，不是某个绿洲的答案
void Init()
{
for(int i=0;i<=MAXN*5+3;i++)
f1[i]=0,f2[i]=INF;
}
int UpFind(int id,int pos)//找l在pos+1的左边的线段，也就是能够向右扩展的最靠右的线段
{
pos++;
int p=upper_bound(l[id]+1,l[id]+cnt[id]+1,pos)-l[id];
p--;
if(p<=0)
return pos;
return max(r[id][p],pos-1);
}
int LowFind(int id,int pos)//找r在pos-1的右边的线段，也就是能够向左扩展的最靠左的线段
{
pos--;
int p=lower_bound(r[id]+1,r[id]+cnt[id]+1,pos)-r[id];
if(p>=cnt[id]+1)
return pos;
return min(l[id][p],pos+1);
}
int main()
{
Init();
scanf("%d %d",&n,&V);
int logV=0;
for(logV=0;(1<<logV)<=V;logV++);//求出来的实际上是logV+1
for(int i=1;i<=n;i++)
scanf("%d",&x[i]);
x[n+1]=INF;
x[0]=-INF;//便于操作
for(int LG=0;LG<=logV;LG++)
{
int d=V/(1<<LG);
cnt[LG]=1;
l[LG][1]=1;
//求线段
for(int i=1;i<=n;i++)
{
r[LG][cnt[LG]]=i;
if(x[i+1]-x[i]>d)
{
cnt[LG]++;
l[LG][cnt[LG]]=i+1;
}
}
cnt[LG]--;
}
if(cnt[0]>logV+1)//特判
{
for(int i=1;i<=n;i++)
printf("Impossible\n");
return 0;
}
int all=(1<<(logV+1));
f1[0]=0,f2[0]=n+1;//预处理两个f数组
for(int s=0;s<all;s+=2)
for(int i=0;i<=logV;i++)
{
if(!(s&(1<<i)))
continue;
f1[s]=max(f1[s],UpFind(i,f1[s-(1<<i)]));
f2[s]=min(f2[s],LowFind(i,f2[s-(1<<i)]));
}
for(int i=1;i<=cnt[0];i++)
{
int ln=l[0][i],rn=r[0][i];
for(int s1=0;s1<all;s1+=2)
{
int s2=all-1-s1-1;
int lpos=f1[s1];
int rpos=f2[s2];
if(lpos>=ln-1&&rpos<=rn+1)
{
ans[i]=true;
break;
}
}
}
int pos=1;
for(int i=1;i<=n;i++)
{
if(ans[pos]==true)
printf("Possible\n");
else
printf("Impossible\n");
if(x[i+1]-x[i]>V)
pos++;
}
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 1000000
#define INF 2000000000
using namespace std;
int n,V,x[MAXN+5];
int cnt[25];
int l[25][MAXN+5],r[25][MAXN+5];
int f1[MAXN*5+5],f2[MAXN*5+5];
bool ans[MAXN+5];
void Init()
{
for(int i=0;i<=MAXN*5+3;i++)
f1[i]=0,f2[i]=INF;
}
int UpFind(int id,int pos)
{
pos++;
int p=upper_bound(l[id]+1,l[id]+cnt[id]+1,pos)-l[id];
p--;
if(p<=0)
return pos;
return max(r[id][p],pos-1);
}
int LowFind(int id,int pos)
{
pos--;
int p=lower_bound(r[id]+1,r[id]+cnt[id]+1,pos)-r[id];
if(p>=cnt[id]+1)
return pos;
return min(l[id][p],pos+1);
}
int main()
{
// freopen("oase.in","r",stdin);
// freopen("oase.out","w",stdout);
Init();
scanf("%d %d",&n,&V);
int logV=0;
for(logV=0;(1<<logV)<=V;logV++);
for(int i=1;i<=n;i++)
scanf("%d",&x[i]);
x[n+1]=INF;
x[0]=-INF;
for(int LG=0;LG<=logV;LG++)
{
int d=V/(1<<LG);
cnt[LG]=1;
l[LG][1]=1;
for(int i=1;i<=n;i++)
{
r[LG][cnt[LG]]=i;
if(x[i+1]-x[i]>d)
{
cnt[LG]++;
l[LG][cnt[LG]]=i+1;
}
}
cnt[LG]--;
}
if(cnt[0]>logV+1)
{
for(int i=1;i<=n;i++)
printf("Impossible\n");
return 0;
}
int all=(1<<(logV+1));
f1[0]=0,f2[0]=n+1;
for(int s=0;s<all;s+=2)
for(int i=0;i<=logV;i++)
{
if(!(s&(1<<i)))
continue;
f1[s]=max(f1[s],UpFind(i,f1[s-(1<<i)]));
f2[s]=min(f2[s],LowFind(i,f2[s-(1<<i)]));
}
for(int i=1;i<=cnt[0];i++)
{
int ln=l[0][i],rn=r[0][i];
for(int s1=0;s1<all;s1+=2)
{
int s2=all-1-s1-1;
int lpos=f1[s1];
int rpos=f2[s2];
if(lpos>=ln-1&&rpos<=rn+1)
{
ans[i]=true;
break;
}
}
}
int pos=1;
for(int i=1;i<=n;i++)
{
if(ans[pos]==true)
printf("Possible\n");
else
printf("Impossible\n");
if(x[i+1]-x[i]>V)
pos++;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int N = 2e5 + 7;
int n, k, a[N], val[19];
int l[19][N], r[19][N];
int pref[1 << 19], suf[1 << 19], mis[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
int bit = 0, sv = k;
while(sv > 0){
val[bit++] = sv;
sv /= 2;
}
val[bit++] = 0;
int pos = 1;
for(int i = 0; i < bit; i++){
pos = 1;
for(int j = 1; j <= n; j++){
if(pos < j) pos = j;
while(pos < n && a[pos + 1] - a[pos] <= val[i]) pos++;
r[i][j] = pos;
}
pos = n;
for(int j = n; j >= 1; j--){
if(pos > j) pos = j;
while(pos > 1 && a[pos] - a[pos - 1] <= val[i]) pos--;
l[i][j] = pos;
}
}
for(int mask = 0; mask < (1 << bit); mask++) suf[mask] = n + 1;
for(int i = 1; i <= n; i++) mis[i] = n + 1;
for(int mask = 0; mask < (1 << bit); mask++){
for(int i = 0; i < bit; i++){
if((mask & (1 << i))) continue;
pref[mask ^ (1 << i)] = max(pref[mask ^ (1 << i)], r[i][min(n, pref[mask] + 1)]);
suf[mask ^ (1 << i)] = min(suf[mask ^ (1 << i)], l[i][max(1, suf[mask] - 1)]);
}
}
int msk = (1 << bit) - 1;
bool ok = false;
for(int mask = 0; mask < (1 << bit); mask++){
if(!(mask & (1 << 0))) continue;
int rv = (msk ^ mask);
int now = (mask ^ (1 << 0));
if(pref[now] + 1 >= suf[rv] - 1) ok = true;
else mis[pref[now] + 1] = min(mis[pref[now] + 1], suf[rv] - 1);
}
for(int i = n - 1; i >= 1; i--) mis[i] = min(mis[i], mis[i + 1]);
for(int i = 1; i <= n; i++){
if(ok || mis[l[0][i]] <= r[0][i]) cout << "Possible\n";
else cout << "Impossible\n";
}
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
#define fr first
#define se second
#define pr pair<int,int>
#define mp make_pair
#define N 300000
int n,m,i,j,mask,a[N],l[20][N],r[20][N],k,f[N<<1],g[N<<1],id;
pr b[N<<1];
bool c[N];
int main()
{
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++) scanf("%d",&a[i]);int psz=0,jj=-1;
for (j=m;j!=jj;jj=j,j>>=1){
int lst=1;
for (i=2;i<=n;i++) if (a[i]-a[i-1]>j){
for (k=lst;k<i;k++) l[psz][k]=lst,r[psz][k]=i-1;
lst=i;
}
for (k=lst;k<=n;k++) l[psz][k]=lst,r[psz][k]=n;
psz++;
}
for (mask=0;mask<(1<<psz);mask++)
for (i=0;i<psz;i++) if (!(mask&(1<<i))) f[mask|(1<<i)]=max(f[mask|(1<<i)],r[i][f[mask]+1]);
for (mask=0;mask<(1<<psz);mask++) g[mask]=n+1;
for (mask=0;mask<(1<<psz);mask++)
for (i=0;i<psz;i++) if (!(mask&(1<<i))) g[mask|(1<<i)]=min(g[mask|(1<<i)],l[i][g[mask]-1]);
for (mask=0;mask<(1<<psz);mask++) if (!(mask&1)) b[++id]=mp(g[mask],mask);
for (i=1;i<=n;i++) b[++id]=mp(r[0][i]+1,i+(1<<psz));
sort(b+1,b+id+1);int wtf=-1;
for (i=1;i<=id;i++) if (b[i].se>(1<<psz)){
b[i].se-=(1<<psz);
if (wtf>=l[0][b[i].se]-1) c[b[i].se]=true;
}else wtf=max(wtf,f[b[i].se^((1<<psz)-2)]);
for (i=1;i<=n;i++) if (c[i]) puts("Possible");else puts("Impossible");
return 0;
} |
#include <algorithm>
#include <cstdio>
#define fo(i, a, b) for (i = a; i <= b; i++)
#define fd(i, a, b) for (i = a; i >= b; i--)
using namespace std;
const int maxn = 200000 + 10, lgn = 20;
int f[maxn * 5], g[maxn * 5], mi[maxn], left[maxn][lgn + 10];
int right[maxn][lgn + 10], v[lgn + 10], x[maxn];
int i, j, k, l, r, s, t, n, m, tot, top;
int main() {
scanf("%d%d", &n, &t);
fo(i, 1, n) scanf("%d", &x[i]);
v[0] = t, t /= 2;
while (t) v[++top] = t, t /= 2;
v[++top] = 0, reverse(v, v + top + 1);
fo(j, 0, top) {
left[1][j] = 1;
fo(i, 2, n) if (x[i] - x[i - 1] <= v[j]) left[i][j] = left[i - 1][j];
else left[i][j] = i;
right[n][j] = n;
fd(i, n - 1, 1) if (x[i + 1] - x[i] <= v[j]) right[i][j] = right[i + 1][j];
else right[i][j] = i;
}
f[0] = 0, g[0] = n + 1;
fo(s, 1, (1 << (top + 1)) - 1) {
f[s] = 0, g[s] = n + 1;
fo(i, 0, top) if (s & (1 << i)) {
r = s ^ (1 << i);
if (f[r] == n)
f[s] = n;
else
f[s] = max(f[s], right[f[r] + 1][i]);
if (g[r] == 1)
g[s] = 1;
else
g[s] = min(g[s], left[g[r] - 1][i]);
}
}
fo(i, 0, n) mi[i] = n + 2;
fo(i, 0, (1 << top) - 1) {
r = ((1 << top) - 1) ^ i;
mi[f[i]] = min(mi[f[i]], g[r]);
}
fd(i, n - 1, 0) mi[i] = min(mi[i], mi[i + 1]);
fo(i, 1, n) {
l = left[i][top];
r = right[i][top];
if (mi[l - 1] <= r + 1)
printf("Possible\n");
else
printf("Impossible\n");
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
int L[20][222222],R[20][222222];
int N,V;
int X[222222];
int dp1[1<<18];
int dp2[1<<18];
int acc[222222];
signed main(){
cin>>N>>V;
rep(i,N)cin>>X[i];
rep(k,20){
rep(i,N){
L[k][i]=i;
if(i&&X[i]-X[i-1]<=(V>>k))L[k][i]=L[k][i-1];
}
for(int i=N-1;i>=0;i--){
R[k][i]=i;
if(i+1!=N&&X[i+1]-X[i]<=(V>>k))R[k][i]=R[k][i+1];
}
}
rep(i,1<<18){
rep(j,18){
if(i>>j&1)continue;
if((V>>j)==0)chmax(dp1[i|(1<<j)],dp1[i]);
else if(dp1[i]==N)dp1[i|(1<<j)]=N;
else chmax(dp1[i|(1<<j)],R[j+1][dp1[i]]+1);
}
}
rep(i,1<<18)dp2[i]=N-1;
rep(i,1<<18){
rep(j,18){
if(i>>j&1)continue;
if((V>>j)==0)chmin(dp2[i|(1<<j)],dp2[i]);
else if(dp2[i]==-1)dp2[i|(1<<j)]=-1;
else chmin(dp2[i|(1<<j)],L[j+1][dp2[i]]-1);
}
}
rep(i,1<<18){
int j=(1<<18)-1-i;
if(dp1[i]>dp2[j]){
acc[0]++;
continue;
}
if(R[0][dp1[i]]>=dp2[j]){
acc[L[0][dp1[i]]]++;
acc[R[0][dp1[i]]+1]--;
}
}
rep(i,N){
acc[i+1]+=acc[i];
if(acc[i]){
puts("Possible");
}
else{
puts("Impossible");
}
}
return 0;
}
|
// #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
// }}}
// #define {{{
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
// }}}
const int N = 2e5 + 10 , LG = 19;
int n , V , x[N] , toR[LG][N] , toL[LG][N] , len;
int fL[1<<LG] , fR[1<<LG];
void prepare(int toR[][N] , int *fL , const vi&x) {
int V = ::V;
len = 0;
while(V >= 0) {
toR[len][n]=toR[len][n+1]=n;
per(i,1,n) toR[len][i]=abs(x[i]-x[i+1])<=V?toR[len][i+1]:i;
len++;
if(V==0) break;
V >>= 1;
}
rep(i,0,1<<len) fL[i]=0;
rep(i,0,1<<len) {
rep(j,0,len) if(~i>>j&1)
fL[i|1<<j]=max(fL[i|1<<j],toR[j][fL[i]+1]);
}
}
int main(){
scanf("%d%d",&n,&V);
rep(i,1,n+1) scanf("%d",x+i);
vi v(x,x+1+n);
prepare(toR , fL , v);
reverse(v.begin()+1,v.begin()+1+n);
prepare(toL , fR , v);
vector<pii> seg;
int full=(1<<len)-1-1;
rep(i,0,1<<len) if(~i&1) {
seg.pb(mp(-fR[i],fL[full^i]));
}
sort(all(seg));
int cur=0,leftmost=-1;
rep(i,1,n+1) {
int left=n+1-toL[0][n+1-i];
int right=toR[0][i];
while(cur<sz(seg)&&-seg[cur].fi+right>=n) {
leftmost=max(leftmost,seg[cur].se);
cur++;
}
if(leftmost+1>=left) puts("Possible");
else puts("Impossible");
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int x[maxn];
int l[maxn], r[maxn];
int lb[18][maxn], rb[18][maxn], dpl[1<<18], dpr[1<<18];
int bound[maxn];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,v;
cin >> n >> v;
for(int i=1;i<=n;i++)
cin >> x[i];
for(int i=0;i<=n;i++)
bound[i] = 1e9;
l[1] = 1;
for(int i=2;i<=n;i++)
if(x[i] - x[i-1] <= v)
l[i] = l[i-1];
else
l[i] = i;
r[n] = n;
for(int i=n-1;i>=1;i--)
if(x[i+1] - x[i] <= v)
r[i] = r[i+1];
else
r[i] = i;
vector<int> cap;
{
int z = v/2;
while(z){
cap.emplace_back(z);
z/=2;
}
cap.emplace_back(0);
}
int N = cap.size();
for(int i=0;i<N;i++){
lb[i][0] = lb[i][1] = 1;
for(int j=2;j<=n;j++)
if(x[j] - x[j-1] <= cap[i])
lb[i][j] = lb[i][j-1];
else
lb[i][j] = j;
rb[i][n+1] = rb[i][n] = n;
for(int j=n-1;j>=1;j--)
if(x[j+1] - x[j] <= cap[i])
rb[i][j] = rb[i][j+1];
else
rb[i][j] = j;
}
dpl[0] = 0;
for(int i=0;i<(1<<N);i++)
for(int j=0;j<N;j++)
if(!((i>>j)&1))
dpl[1<<j|i] = max(dpl[1<<j|i], rb[j][dpl[i]+1]);
for(int i=0;i<(1<<N);i++)
dpr[i] = n+1;
for(int i=0;i<(1<<N);i++)
for(int j=0;j<N;j++)
if(!((i>>j)&1))
dpr[1<<j|i] = min(dpr[1<<j|i], lb[j][dpr[i]-1]);
for(int i=0;i<(1<<N);i++)
bound[dpl[i]] = min(bound[dpl[i]], dpr[(1<<N) - 1 - i]);
for(int i=n-1;i>=0;i--)
bound[i] = min(bound[i], bound[i+1]);
for(int i=1;i<=n;i++)
if(bound[l[i] - 1] <= r[i] + 1)
cout << "Possible\n";
else
cout << "Impossible\n";
}
|
#include <algorithm>
#include <cstdio>
int arr[200005], pre[200005][25], nxt[200005][25], dp_l[800005], dp_r[800005];
int main()
{
// freopen("AGC012-E.in", "r", stdin);
int n, v, len = 0;
scanf("%d%d", &n, &v);
for (int i = 1; i <= n; i++)
scanf("%d", arr + i);
while (true)
{
pre[0][len] = pre[1][len] = 0;
for (int i = 2; i <= n; i++)
pre[i][len] = arr[i] - arr[i - 1] <= v ? pre[i - 1][len] : i - 1;
nxt[n + 1][len] = nxt[n][len] = n + 1;
for (int i = n - 1; i; i--)
nxt[i][len] = arr[i + 1] - arr[i] <= v ? nxt[i + 1][len] : i + 1;
len++;
if (!v)
break;
v >>= 1;
}
for (int i = 0; i < 1 << len; i++)
{
dp_l[i] = 1;
dp_r[i] = n;
}
for (int i = 0; i < 1 << len; i++)
{
for (int j = 0; j < len; j++)
{
if (i & (1 << j))
continue;
dp_l[i | (1 << j)] = std::max(dp_l[i | (1 << j)], nxt[dp_l[i]][j]);
dp_r[i | (1 << j)] = std::min(dp_r[i | (1 << j)], pre[dp_r[i]][j]);
}
}
if (dp_l[(1 << len) - 1] <= n)
{
for (int i = 0; i < n; i++)
puts("Impossible");
return 0;
}
for (int l = 1; l <= n; l = nxt[l][0])
{
bool flg = false;
int r = nxt[l][0];
for (int i = 0; i < 1 << len && !flg; i++)
{
if (i & 1)
continue;
flg |= l <= dp_l[i] && dp_r[(1 << len) - 2 ^ i] < r;
}
for (int i = l; i < r; i++)
puts(flg ? "Possible" : "Impossible");
}
return 0;
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
const int MAXN = 200010;
const int LG = 22;
int x[MAXN], p[MAXN][LG], f[MAXN * 3], v[MAXN], vs = 0;
int f2[MAXN * 3], p2[MAXN][LG];
int main()
{
int n;
scanf("%d%d", &n, v);
vs = 0;
while (v[vs] > 0)
{
v[vs + 1] = v[vs] / 2;
vs++;
}
vs++;
for (int i = 0; i < n; i++)
scanf("%d", x + i);
for (int i = 0; i < vs; i++)
{
p[n][i] = p[n - 1][i] = n;
for (int j = n - 2; j >= 0; j--)
{
if (x[j + 1] - x[j] > v[i]) p[j][i] = j + 1;
else p[j][i] = p[j + 1][i];
}
}
for (int i = 0; i < vs; i++)
{
p2[0][i] = p2[1][i] = 0;
for (int j = 2; j <= n; j++)
{
if (x[j - 1] - x[j - 2] > v[i]) p2[j][i] = j - 1;
else p2[j][i] = p2[j - 1][i];
}
}
memset(f, 0, sizeof(f));
for (int i = 0; i < (1 << vs); i++)
for (int j = 0; j < vs; j++)
{
if (i & (1 << j)) continue;
int nv = i + (1 << j);
f[nv] = max(f[nv], p[f[i]][j]);
}
for (int i = 0; i < (1 << vs); i++) f2[i] = n;
for (int i = 0; i < (1 << vs); i++)
for (int j = 0; j < vs; j++)
{
if (i & (1 << j)) continue;
int nv = i + (1 << j);
f2[nv] = min(f2[nv], p2[f2[i]][j]);
}
int msk = (1 << vs) - 1;
int l, r;
for (l = 0; l != n; l = r)
{
r = p[l][0];
bool ok = false;
for (int i = 0; i < (1 << vs); i++)
{
if (i & 1) continue;
if ((f[i] >= l) && (f2[msk - 1 - i] <= r))
ok = true;
}
for (int i = l; i < r; i++)
if (!ok) printf("Impossible\n");
else printf("Possible\n");
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
using namespace std;
struct UnionFind{
int size;
vector<int> parent;
UnionFind(){}
UnionFind(int size){
this->size = size;
parent.resize(size+1);
init();
}
void init(){
for(int i = 1; i <= size; i++) parent[i] = i;
}
int root(int i){
if(parent[i] == i) return i;
return parent[i] = root(parent[i]);
}
bool same(int i, int j){
return root(i) == root(j);
}
void unite(int i, int j){
int root_i = root(i), root_j = root(j);
if(root_i == root_j) return;
if(root_i > root_j) root_i ^= root_j, root_j ^= root_i, root_i ^= root_j;
parent[root_i] = root_j;
}
};
int N, V;
int x[200005];
int v[20], vnum;
UnionFind uf[20];
int dp[1<<18];
int main(void)
{
cin >> N >> V;
for(int i = 1; i <= N; i++) cin >> x[i];
int tmp = V;
for(int i = 0; ; i++){
v[i] = tmp;
if(tmp == 0){
vnum = i+1;
break;
}
tmp /= 2;
}
for(int i = 0; i < vnum; i++) uf[i] = UnionFind(N);
for(int i = 0; i < vnum; i++){
for(int j = 1; j < N; j++){
if(x[j+1] - x[j] <= v[i]) uf[i].unite(j, j+1);
}
}
set<int> S;
for(int i = 1; i <= N; i++) S.insert(uf[0].root(i));
if(S.size() > vnum){
for(int i = 1; i <= N; i++) cout << "Impossible" << endl;
return 0;
}
for(int p = 1; p <= N; p++){
int l = p, r = uf[0].root(p), n = 1<<(vnum-1);
for(int i = 0; i < n; i++) dp[i] = 0;
for(int i = 0; i < n; i++){
if(dp[i] == l-1) dp[i] = r;
if(dp[i] >= N) continue;
for(int j = 0; j < vnum-1; j++){
if(i & (1<<j)) continue;
dp[i|(1<<j)] = max(dp[i|(1<<j)], uf[j+1].root(dp[i]+1));
}
}
bool ans = false;
for(int i = 0; i < n; i++){
if(dp[i] >= N){
ans = true;
break;
}
}
for(int i = l; i <= r; i++){
if(ans) cout << "Possible" << endl;
else cout << "Impossible" << endl;
}
p = r;
}
return 0;
} |
const bool submit = 1;
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) if(!submit) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
bool B(int x,int i){return (x>>i)&1;}
int N,V;
const int MN=200000;
const int MD=20;
int D;
int x_[MN];
int d[MN-1];
int xv2id[MN][MD];
const int MX=MN*MD;
int id2v[MX];
int id2l[MX];
int id2r[MX];
int I;
bool ans[MN];
int dp[1<<20];
int main(){
cin>>N>>V;
rep(i,N) cin>>x_[i];
rep(i,N-1) d[i]=x_[i+1]-x_[i];
rep(v,MD){
int l=0;
rep(x,N){
if(x==N-1 || d[x]>V){
for(int i=l;i<=x;i++) xv2id[i][v]=I;
id2v[I]=v;
id2l[I]=l;
id2r[I]=x+1;
// show(I);
// show(v);
// printf("(%d,%d]\n",l,x+1);
// puts("");
I++;
l=x+1;
}
}
if(V==0){
D=v+1;
break;
}
V/=2;
}
int K = xv2id[N-1][0]+1;
if(K>D){
rep(i,N){
puts("Impossible");
}
return 0;
}
show(D);
show(K);
rep(elim,K){
rep(b,1<<D) dp[b]=0;
bool ok=0;
rep(b,1<<D){
int x = dp[b];
if(x==N){
ok=1;
break;
}
rep(i,D) if(!B(b,i)){
int id = xv2id[x][i];
if(i==0&&id!=elim) continue;
int nx=max(x,id2r[id]);
chmax(dp[b|(1<<i)],nx);
}
// printf("dp[%d]=%d\n",b,dp[b]);
}
int l = id2l[elim];
int r = id2r[elim];
for(int x=l;x<r;x++) ans[x]=ok;
}
rep(i,N){
if(ans[i]) puts("Possible");
else puts("Impossible");
}
}
|
#include<bits/stdc++.h>
using namespace std;
template <class I>
inline void read(I &x){
int f=1;
char c;
for(c=getchar();c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
for(x=0;c>='0'&&c<='9';x=(x<<3)+(x<<1)+(c&15),c=getchar());
x*=f;
}
const int N=270000,LOG=20;
int x[N],v[N],L[LOG][N],R[LOG][N],val[N],Lf[N],Rf[N],n,k,tot;
int main(){
read(n);
read(v[0]);
while(v[k]) v[k+1]=v[k]>>1,k++;
tot=(1<<k)-1;
for(int i=1;i<=n;i++)
read(x[i]);
for(int i=0;i<=k;i++){
L[i][1]=1;
for(int j=2;j<=n;j++)
if(x[j]-x[j-1]<=v[i])
L[i][j]=L[i][j-1];
else L[i][j]=j;
R[i][n]=n;
for(int j=n-1;j>=0;j--)
if(x[j+1]-x[j]<=v[i])
R[i][j]=R[i][j+1];
else R[i][j]=j;
}
for(int i=1;i<=tot;i++)
Lf[i]=1,Rf[i]=n;
Lf[0]=0,Rf[0]=n+1;
for(int i=0;i<=tot;i++)
for(int j=1;j<=k;j++)
if(!((i>>(j-1))&1)) {
Lf[i|(1<<(j-1))]=max(Lf[i|(1<<(j-1))],R[j][Lf[i]+1]);
Rf[i|(1<<(j-1))]=min(Rf[i|(1<<(j-1))],L[j][Rf[i]-1]);
}
for(int i=0;i<=n+1;i++)
val[i]=2*n;
for(int i=0;i<=tot;i++)
val[Lf[i]]=min(val[Lf[i]],Rf[tot^i]);
for(int i=n;i>=0;i--)
val[i]=min(val[i],val[i+1]);
for(int i=1;i<=n;i++)
printf(val[L[0][i]-1]<=R[0][i]+1?"Possible\n":"Impossible\n");
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define MAX(x,y) x=max(x,y)
#define MIN(x,y) x=min(x,y)
#define inf 0x3f3f3f3f
using namespace std;
const int N=400005;
int n,v,g[N*2],f[N*2],bin[25],tot,len[25],lef[25][N],rig[25][N],a[N],bel[N],p1[N],p2[N];
bool ans[N];
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;
}
void dp()
{
bin[0]=1;
for (int i=1;i<=tot;i++) bin[i]=bin[i-1]*2;
for (int i=0;i<bin[tot];i++) g[i]=n+1;
for (int i=0;i<bin[tot];i++)
for (int j=0;j<=tot;j++)
if (!(i&bin[j])) MAX(f[i+bin[j]],rig[j][f[i]+1]),MIN(g[i+bin[j]],lef[j][g[i]-1]);
for (int i=0;i<bin[tot];i++)
{
int l=f[i],r=g[i^(bin[tot]-1)];
if (l+1>=r)
{
for (int j=1;j<=n;j++) ans[j]=1;
return;
}
if (p1[bel[l+1]]<=l+1&&p2[bel[l+1]]>=r-1) ans[bel[l+1]]=1;
}
}
int main()
{
n=read();v=read();
for (int i=1;i<=n;i++) a[i]=read();
tot=0;len[0]=0;
while (v) len[++tot]=v,v>>=1;
sort(len,len+tot+1);
memset(lef,inf,sizeof(lef));
for (int i=0;i<tot;i++)
for (int j=1;j<=n;j++)
{
int l=j;
while (l<n&&a[l+1]-a[l]<=len[i]) l++;
rig[i][j]=l;lef[i][l]=j;j=l;
}
int id=0;
for (int j=1;j<=n;j++)
{
int l=j;bel[j]=++id;
while (l<n&&a[l+1]-a[l]<=len[tot]) l++,bel[l]=id;
p1[id]=j;p2[id]=l;j=l;
}
dp();
for (int i=1;i<=n;i++) puts(ans[bel[i]]?"Possible":"Impossible");
return 0;
}
/*
考虑最后走过的区间肯定只有log段，那么我们就状压表示从左到右（和从右到左）用了哪些段能走到的最远距离
*/ |
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
#include <vector>
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 = 200200;
const int MAXK = 20;
int a[MAX];
int l[MAX][MAXK], r[MAX][MAXK];
int fl[1 << MAXK], fr[1 << MAXK];
int main(void) {
ios_base::sync_with_stdio(false);
int N, V;
cin >> N >> V;
REP(i, N) cin >> a[i];
int K = 0;
int v[MAXK];
while (V > 0) {
v[K++] = V;
V /= 2;
}
v[K++] = 0;
REP(i, N) {
REP(j, K) {
if (i > 0 && a[i] - a[i - 1] <= v[j]) {
l[i][j] = l[i - 1][j];
} else {
l[i][j] = i;
}
}
}
for (int i = N - 1; i >= 0; --i) {
REP(j, K) {
if (i < N - 1 && a[i + 1] - a[i] <= v[j]) {
r[i][j] = r[i + 1][j];
} else {
r[i][j] = i;
}
}
}
REP(s, 1 << K) fl[s] = 0, fr[s] = N - 1;
REP(s, 1 << K) {
REP(j, K) {
if (!(s & (1 << j))) {
int ns = s | (1 << j);
int nfl = fl[s] == N ? N : r[fl[s]][j] + 1;
fl[ns] = max(fl[ns], nfl);
int nfr = fr[s] == -1 ? -1 : l[fr[s]][j] - 1;
fr[ns] = min(fr[ns], nfr);
}
}
}
vector<bool> can(N, false);
int all = (1 << K) - 1 - 1;
bool all_can = false;
REP(s, 1 << K) {
if ((s & all) == s) {
int a = fl[s];
int b = fr[all ^ s];
if (a > b) {
all_can = true;
break;
}
if (r[a][0] >= b) can[l[a][0]] = true;
}
}
REP(i, N) {
if (can[l[i][0]] || all_can) {
cout << "Possible\n";
} else {
cout << "Impossible\n";
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
int n,m,v,x[maxn],Lg[19][maxn],Rg[19][maxn];
int L[1<<18],R[1<<18];
int main()
{
#ifdef h10
freopen("E.in","r",stdin);
freopen("E.out","w",stdout);
#endif
int i,j,v0,S;
scanf("%d%d",&n,&v);
for (i=1;i<=n;i++)
scanf("%d",&x[i]);
x[0]=x[1]-23333333;
x[n+1]=x[n]+23333333;
for (v0=v,m=0;;v0>>=1,m++)
{
j=1;
for (i=j=1;i<=n;i++)
{
j=max(i,j);
while (x[j+1]-x[j]<=v0) j++;
Rg[m][i]=j;
}
for (i=j=n;i>=1;i--)
{
j=min(i,j);
while (x[j]-x[j-1]<=v0) j--;
Lg[m][i]=j;
}
if (!v0) break;
}
int cnt=0;
for (i=1;i<=n;i=j+1)
j=Rg[0][i],cnt++;
if (cnt>m+1)
{
for (i=1;i<=n;i++)
puts("Impossible");
return 0;
}
for (S=0;S<1<<m;S++)
R[S]=0,L[S]=n+1;
for (S=1;S<1<<m;S++)
{
for (i=0;i<m;i++)
if ((S>>i)&1)
{
R[S]=max(R[S],Rg[i+1][R[S-(1<<i)]+1]);
L[S]=min(L[S],Lg[i+1][L[S-(1<<i)]-1]);
}
}
for (i=1;i<=n;i=j+1)
{
j=Rg[0][i];
bool flag=0;
for (S=0;S<1<<m;S++)
flag|=R[S]+1>=i&&L[(1<<m)-1-S]-1<=j;
for (int x=i;x<=j;x++)
puts(flag?"Possible":"Impossible");
}
}
|
# include <bits/stdc++.h>
using namespace std;
# define REP(i, a, b) for(int i = a; i <= b; ++ i)
# define REPD(i, a, b) for(int i = a; i >= b; -- i)
# define CLR(i, a) memset(i, a, sizeof(i))
# define REPG(i, h, x) for(int i = h[x]; ~i; i = edge[i].next)
const int N = 2e5 + 5, N_ = 19, S_ = (1 << 19) - 1;
int r[N_ + 3][N], cnt[N_ + 3];
int f1[S_ + 5], f2[S_ + 5];
int n, v, len = -1;
int d[N], S;
int main() {
scanf("%d%d", &n, &v);
REP(i, 1, n) scanf("%d", &d[i]);
int x = v << 1;
while(x) {
x >>= 1, ++ len;
REP(i, 1, n - 1) {
if(d[i + 1] - d[i] <= x) continue;
r[len][++ cnt[len]] = i;
} r[len][++ cnt[len]] = n;
}
S = (1 << len) - 1;
if(cnt[0] > len + 1){
REP(i, 1, n) puts("Impossible"), exit(0);
}
REP(i, 0, S) f2[i] = n + 1;
REP(i, 0, S) {
REP(j, 1, len) if(i & (1 << j - 1)) {
f1[i] = max(f1[i], *upper_bound(r[j] + 1, r[j] + cnt[j] + 1, f1[i ^ (1 << j - 1)]));
f2[i] = min(f2[i], r[j][lower_bound(r[j] + 1, r[j] + cnt[j] + 1, f2[i ^ (1 << j - 1)] - 1) - r[j] - 1] + 1);
}
}
REP(i, 1, cnt[0]) {
bool okay = 0;
REP(s, 0, S) {
if(f1[s] >= r[0][i - 1] && f2[S - s] <= r[0][i] + 1) { okay = 1; break; }
}
REP(j, r[0][i - 1] + 1, r[0][i]) puts(okay ? "Possible" : "Impossible");
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0' || '9'<ch){if(ch=='-')f=-1;ch=getchar();}
while('0'<=ch && ch<='9')x=x*10+(ch^48),ch=getchar();
return x*f;
}
inline void chkmax(int &a,int b){if(a<b)a=b;}
inline void chkmin(int &a,int b){if(a>b)a=b;}
#define guo cerr<<"guo"<<endl
const int N=2e5+9;
const int K=22;
const int M=1<<K;
int n,m,v;
int x[N];
int vs[K],vtop;
int pre[K][N],suf[K][N];
int pr[M],su[M],mp[M];
int main()
{
if(fopen("vj.in","r"))
{
freopen("vj.in","r",stdin);
freopen("vj.out","w",stdout);
}
n=read();v=read();
for(int i=1;i<=n;i++)
x[i]=read();
for(int a=v>>1;vs[vtop++]=a;a>>=1);
m=1<<vtop;vs[vtop]=v;
for(int k=0;k<=vtop;k++)
{
pre[k][0]=0,suf[k][n+1]=n+1;
for(int i=1,j=1;i<=n;i=j+1)
{
for(j=i;j+1<=n && x[j+1]-x[j]<=vs[k];j++);
for(int l=i;l<=j;l++)
pre[k][l]=i,suf[k][l]=j;
}
}
for(int i=0;i<m;i++)
su[i]=n+1;
for(int i=1;i<m;i++)
for(int j=0;j<vtop;j++)
if(i&(1<<j))
{
chkmin(su[i],pre[j][su[i^(1<<j)]-1]);
chkmax(pr[i],suf[j][pr[i^(1<<j)]+1]);
}
for(int i=0;i<m;i++)
chkmax(mp[su[m-1-i]-1],pr[i]+1);
for(int i=0;i<=n;i++)
chkmax(mp[i+1],mp[i]);
for(int i=1;i<=n;i++)
{
if(mp[suf[vtop][i]]>=pre[vtop][i])
puts("Possible");
else
puts("Impossible");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n, m, a[N];
int lb[20][N], rb[20][N], cnt;
int fl[1058576], fr[1058576], mx, s[N];
void init() {
lb[cnt][1] = 1;
for(int i = 2; i <= n; i++) lb[cnt][i] = (a[i] - a[i - 1] > m) ? i : lb[cnt][i - 1];
rb[cnt][n] = n;
for(int i = n - 1; i; i--) rb[cnt][i] = (a[i + 1] - a[i] > m) ? i : rb[cnt][i + 1];
lb[cnt][0] = 1, rb[cnt][n + 1] = n;
}
int main() {
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
for(; m; m /= 2) init(), ++cnt; init();
fr[0] = n + 1, mx = (1 << cnt) - 1;
for(int i = 1; i <= mx; i++) {
fr[i] = n;
for(int j = 0; j < cnt; j++) if(i & (1 << j)) {
fl[i] = max(fl[i], rb[j + 1][fl[i ^ (1 << j)] + 1]);
fr[i] = min(fr[i], lb[j + 1][fr[i ^ (1 << j)] - 1]);
}
}
for(int i = 0; i <= mx; i++) {
int x = lb[0][fr[mx ^ i] - 1], y = rb[0][fl[i] + 1];
if(x <= y) ++s[x], --s[y + 1];
}
for(int i = 1; i <= n; i++)
s[i] += s[i - 1], puts(s[i] ? "Possible" : "Impossible");
return 0;
} |
//Love and Freedom.
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
#define inf 20021225
#define N 100100
using namespace std;
int read()
{
int s=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f=-1; ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return f*s;
}
ll f[N],mn; int t,e,n,p[N];
int main()
{
n=read(),e=read(),t=read();
int l=0; mn=1e18;
for(int i=1;i<=n;i++) p[i]=read();
for(int i=1;i<=n;i++)
{
while(l<=i && 2*(p[i]-p[l+1])>t)
mn=min(mn,f[l]-2*p[l+1]), l++;
if(l<i) f[i]=f[l]+t;
f[i]=min(f[i],mn+2*p[i]);
}
printf("%lld\n",f[n]+e);
return 0;
} |
#include<iostream>
#include<queue>
using namespace std;
long long f[101010];
long long x[101010];
long long E,T;
long long calc(int i,int j)
{
return max(f[j-1]+T,f[j-1]+2*x[i]-2*x[j]);
}
priority_queue<long long> Q;
int main()
{
int n;
cin>>n>>E>>T;
for(int i=1;i<=n;i++)
cin>>x[i];
f[1]=T;
int now=0;
for(int i=2;i<=n;i++)
{
f[i]=f[i-1]+T;
int l=1,r=i-1;
while(r>l)
{
int m=(l+r)/2;
if(T-2*x[i]+2*x[m]>=0)
r=m;
else
l=m+1;
}
f[i]=min(f[i],max(f[l-1]+T,f[l-1]+2*x[i]-2*x[l]));
if(l>1)
{
while(now<l-1)
{
now++;
Q.push(2*x[now]-f[now-1]);
}
f[i]=min(f[i],2*x[i]-Q.top());
}
}
cout<<f[n]+E<<endl;
return 0;
} |
#include <algorithm>
#include <cstring>
#include <cstdio>
int arr[100005], que[100005], he = 0, ta = 0;
long long dp[100005], mn = 1e18;
int main()
{
// freopen("AGC007-D.in", "r", stdin);
int n, e, t;
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, cur = 0; i <= n; i++)
{
while (cur < i && (arr[i] - arr[cur + 1] << 1) >= t)
{
if (he <= ta && que[he] == cur)
he++;
mn = std::min(mn, dp[cur] - (arr[cur + 1] << 1));
cur++;
}
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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int M = 100100;
int n;
ll t, e;
ll x[M], d[M];
void read() {
cin >> n >> e >> t;
x[0] = 0;
for (int i = 1; i <= n; ++i)
cin >> x[i];
}
void kill() {
d[0] = 0;
int l = 0;
ll mn = 1e18;
for (int i = 1; i <= n; ++i) {
d[i] = d[i - 1] + t;
/*
for (int j = 0; j < i; ++j)
d[i] = min(d[i], d[j] + max(t, 2 * (x[i] - x[j + 1])));
continue;
*/
while (l < i && 2 * (x[i] - x[l + 1]) >= t) {
mn = min(mn, d[l] - 2 * x[l + 1]);
++l;
}
//cerr << "i = " << i << ", l = " << l << endl;
d[i] = min(d[i], d[l] + t);
d[i] = min(d[i], mn + 2 * x[i]);
}
ll ans = d[n] + e;
cout << ans << endl;
}
int main() {
cout.precision(20);
cout << fixed;
ios_base::sync_with_stdio(false);
read();
kill();
}
|
#include <cstdio>
#include <algorithm>
typedef long long LL;
const LL Infll = 0x3f3f3f3f3f3f3f3f;
const int MN = 200005;
int N, E, T, A[MN];
LL f[MN], g[MN];
int main() {
scanf("%d%d%d", &N, &E, &T);
for (int i = 1; i <= N; ++i) scanf("%d", &A[i]);
g[0] = Infll;
for (int i = 1, j = 1; i <= N; ++i) {
while (2 * (A[i] - A[j]) > T) ++j;
f[i] = std::min(f[j - 1] + T, 2 * A[i] + g[j - 1]);
g[i] = std::min(g[i - 1], f[i - 1] - 2 * A[i]);
}
printf("%lld\n", E + f[N]);
return 0;
} |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
#define min(a,b) ((a)<(b)?(a):(b))
using namespace std;
int n,m,t,x[100010];
long long f[100010];
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int i,j;
long long k;
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;
#define ll long long
#define pb push_back
const int maxn = 1e5 + 100;
const ll inf = 2e18 + 13;
ll dp[maxn] , partial_min[maxn] , a[maxn];
int main()
{
fill(dp , dp + maxn , inf);
ll n , e , T;
cin >> n >> e >> T;
e *= 2;
T *= 2;
for(int i = 1; i <= n; i++)
cin >> a[i] , a[i] *= 2;
dp[0] = 0;
int pt = 0;
for(int i = 1; i <= n; i++)
{
while(pt + 1 < i && a[pt + 1] <= a[i] - T / 2)
pt++;
if(!pt)
dp[i] = T;
else
dp[i] = min(dp[pt] + T , partial_min[pt] + a[i] * 2);
partial_min[i] = min(partial_min[i - 1] , dp[i - 1] - 2 * a[i]);
}
cout << (dp[n] + e) / 2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long f[112345];
int n,pp,s,t,d[112345];
int main(){
scanf("%d%d%d",&n,&s,&t);
for (int i = 1; i <= n; i++)
scanf("%d",&d[i]);
pp = 1;
long long mi = (1 << 31) - 1;
f[0] = 0;
for (int i = 1; i <= n; i++){
while (pp <= n && 2 * (d[i] - d[pp]) > t){
mi = min(mi,f[pp - 1] - d[pp] * 2);
pp++;
}
f[i] = min(f[pp - 1] + t,mi + d[i] * 2);
}
printf("%lld\n",s + f[n]);
} |
#include<bits/stdc++.h>
using namespace std;
long long n,m,t,x[100005],dp[100005];
multiset<long long>s;
int main()
{
scanf("%lld%lld%lld",&n,&m,&t);
for(long long i=1;i<=n;i++)scanf("%lld",&x[i]);
dp[0]=0;
long long mn=1e18,pos=1;
for(long long i=1;i<=n;i++)
{
s.insert(dp[i-1]);
while(pos<=i&&2*(x[i]-x[pos])>t)
{
mn=min(mn,dp[pos-1]-2*x[pos]);
s.erase(s.find(dp[pos-1]));
pos++;
}
dp[i]=min(*s.begin()+t,mn+2*x[i]);
}
printf("%lld\n",dp[n]+m);
return 0;
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <set>
#define N 100010
#define LL long long
using namespace std;
int n, e, t;
int x[N];
LL dp[N];
multiset<LL> st1;
multiset<LL> st2;
int main() {
scanf("%d%d%d", &n, &e, &t);
for (int i = 1; i <= n; ++i) {
scanf("%d", &x[i]);
}
dp[0] = 0;
x[0] = 0;
int last = 0;
st1.insert(- 2LL * x[1]);
st2.insert(t);
for (int i = 1; i <= n; ++i) {
while (last + 1 <= i && 2LL * (x[i] - x[last + 1]) >= t) {
st1.insert(dp[last] - x[last] - 2LL * x[last + 1]);
st2.erase(st2.find(dp[last] - x[last] + t));
++last;
}
if (last - 1 >= 0) dp[i] = min(*st1.begin() + 3LL * x[i], *st2.begin() + x[i]);
else dp[i] = *st2.begin() + x[i];
st2.insert(dp[i] - x[i] + t);
//cout << dp[i] << ' ';
}
//cout << endl;
cout << dp[n] + e - x[n];
return 0;
} |
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXN=100005;
const ll INF=1e18;
int n,m,T;
int a[MAXN];
ll d[MAXN],mine=INF;
int main(){
scanf("%d%d%d",&n,&m,&T);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),d[i]=INF;
for(int i=1,last=0;i<=n;i++){
while(T<=2*(a[i]-a[last+1])){
mine=min(mine,d[last]-2*a[last+1]);
last++;
}
d[i]=d[last]+T;
d[i]=min(d[i],mine+2*a[i]);
}
printf("%lld",m+d[n]);
fclose(stdin);
fclose(stdout);
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int n, E, T, pos;
int a[maxn];
ll f[maxn], mn = 1e18;
int main()
{
scanf("%d%d%d", &n, &E, &T);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for(int i = 1; i <= n; i++)
{
while(T < 2 * (a[i] - a[pos + 1]))
{
mn = min(mn, f[pos] - 2 * a[pos + 1]);
pos++;
}
f[i] = min(f[i - 1] + T, mn + 2 * a[i]);
f[i] = min(f[pos] + T, f[i]);
}
printf("%lld\n", f[n] + E);
return 0;
} |
/*
数据不清空，爆零两行泪。
多测不读完，爆零两行泪。
边界不特判，爆零两行泪。
贪心不证明，爆零两行泪。
D P 顺序错，爆零两行泪。
大小少等号，爆零两行泪。
变量不统一，爆零两行泪。
越界不判断，爆零两行泪。
调试不注释，爆零两行泪。
溢出不 l l，爆零两行泪。
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf=0x3f3f3f3f3f3f3f3f;
const int N=100000;
int n,m,s;
int a[N+1];
int dp[N+1];
int q[N],head,tail;
signed main(){
cin>>n>>m>>s;
for(int i=1;i<=n;i++)cin>>a[i];
q[tail++]=0;
int now=-1,mn=inf;
for(int i=1;i<=n;i++){
while(now+1<i&&2*a[now+2]<2*a[i]-s)now++,mn=min(mn,dp[now]-a[now]-2*a[now+1]);
while(head<tail&&q[head]<=now)head++;
while(head<tail&&dp[q[tail-1]]-a[q[tail-1]]>=dp[i-1]-a[i-1])tail--;
q[tail++]=i-1;
dp[i]=mn+3*a[i];
if(head<tail)dp[i]=min(dp[i],dp[q[head]]-a[q[head]]+a[i]+s);
}
cout<<dp[n]+m-a[n]<<"\n";
return 0;
}
/*1
3 9 1
1 3 8
*/
/*2
3 9 3
1 3 8
*/
/*3
2 1000000000 1000000000
1 999999999
*/ |
#include <vector>
#include <cstdio>
using namespace std;
int n;
long long e,t;
long long x[100005];
long long dp[100005];
int main(){
scanf("%d%lld%lld", &n,&e,&t);
for(int i=0; i<n; ++i){
scanf("%lld", &x[i]);
x[i]<<=1;
}
x[n] = e<<1;
long long w = 1ll<<57;
for(int i=0, j=0; i<n; ++i){
while(j<i && t < (x[i] - x[j]) ){
w = min(w, dp[j] + (x[i] - x[j]) );
j++;
}
dp[i+1] = min(w, dp[j] + max((x[i]-x[j]) ,t));
w += (x[i+1] - x[i]);
}
printf("%lld\n", dp[n] + e);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
long long int dp[100010];
int x[100010];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,e,t;
cin>>n>>e>>t;
for(int i=1;i<=n;i++)
cin>>x[i];
long long int trans = 1e18;
int p=0;
for(int i=1;i<=n;i++)
dp[i]=1e18;
for(int i=1;i<=n;i++){
while(p+1<=i&&(x[i]-x[p+1])*2>=t)
trans=min(trans,dp[p]-2*x[p+1]),p++;
dp[i]=min(x[i]*2+trans,dp[i]);
if(p!=i)
dp[i]=min(dp[i],t+dp[p]);
}
cout<<dp[n]+e<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const ll maxn=100003;
ll pos,n,T,E,x[maxn],mn=0x3f3f3f3f3f3f3f3f,f[maxn];
int main(){
scanf("%lld%lld%lld",&n,&E,&T);
for(ll i=1;i<=n;++i){
scanf("%d",&x[i]);
while(pos<i&&2*(x[i]-x[pos+1])>T){
mn=min(mn,f[pos]-2*x[pos+1]);
++pos;
}
// printf("%lld %lld !\n",pos,f[pos]+T);
f[i]=min(mn+2*x[i],f[pos]+T);
}
printf("%lld\n",f[n]+E);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
long long x[N],d[N],z=INT_MAX,e,t;
int main()
{
int n;
scanf("%d%lld%lld",&n,&e,&t);
for(int i=1;i<=n;i++) scanf("%lld",&x[i]);
for(int i=1,j=0;i<=n;i++)
{
while((x[i]-x[j+1])*2>t){z=min(z,d[j]-x[j+1]*2);j++;}
d[i]=min(z+x[i]*2,d[j]+t);
}
printf("%lld\n",d[n]+e);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int N, E, T;
int A[100002];
long long dp[100002];
long long f[100002];
long long g[100002];
int main()
{
scanf("%d%d%d", &N, &E, &T);
for(int i=1; i<=N; i++)
scanf("%d", A+i);
A[N+1]=E;
dp[0]=A[1];
f[0]=dp[0]-3LL*A[1];
g[0]=dp[0]-A[1];
multiset<long long> s;
s.insert(g[0]);
int ptr=0;
for(int i=1; i<=N; i++)
{
dp[i]=0x3f3f3f3f3f3f3f3fLL;
while(ptr<i && T<2LL*(A[i]-A[ptr+1]))
{
s.erase(s.find(g[ptr]));
ptr++;
}
if(ptr>0)
dp[i]=min(dp[i], f[ptr-1]+2LL*A[i]);
if(!s.empty())
dp[i]=min(dp[i], *s.begin()+T);
dp[i]+=A[i+1];
f[i]=min(dp[i]-3LL*A[i+1], f[i-1]);
g[i]=dp[i]-A[i+1];
s.insert(g[i]);
}
printf("%lld\n", dp[N]);
return 0;
}
|
# include <cstdio>
# include <algorithm>
using namespace std;
# define REP(i, n) for (int i = 1; i <= n; ++ i)
# define NR 101000
typedef long long ll;
int n, E, T;
ll f[NR], x[NR];
int main() {
scanf ("%d%d%d", &n, &E, &T);
int p = 0;
ll s = 1e12;
REP (i, n) {
scanf ("%lld", &x[i]);
while (p < i && 2 * (x[i] - x[p + 1]) >= T) {
s = min (s, f[p] - x[p] - 2 * x[p + 1]);
++ p;
}
f[i] = s + 3 * x[i];
//printf ("(p:%d) ", p);
if (p != i) f[i] = min (f[i], f[p] - x[p] + x[i] + T);
//printf ("%I64d ", f[i]);
}
printf ("%lld\n", f[n] + E - x[n]);
return 0;
}
//j -> i -> j+1 -> i
//f[i] = f[j] + x[i] - x[j] + max(2 * (x[i] - x[j + 1]), T)
//f[i] = f[j] - x[j] + x[i] + T
//f[i] = f[j] - x[j] - 2 * x[j + 1] + 3 * x[i]
|
#include <stdio.h>
#include <algorithm>
using namespace std;
int N,E,T,X[100100];
long long D[100100],W[100100];
int main()
{
scanf ("%d %d %d",&N,&E,&T);
for (int i=1;i<=N;i++) scanf ("%d",&X[i]);
W[0] = -2 * X[1];
for (int i=1;i<=N;i++){
int j = lower_bound(X,X+i,X[i]-T/2) - X;
if (j){
j--;
D[i] = D[j] + T;
if (j){
j--;
if (D[i] > W[j] + 2 * X[i])
D[i] = W[j] + 2 * X[i];
}
}
else D[i] = T;
W[i] = D[i] - 2 * X[i+1];
if (W[i] > W[i-1])
W[i] = W[i-1];
}
printf ("%lld\n",D[N]+E);
return 0;
} |
#include <bits/stdc++.h>
typedef long long ll;
const int N = 100054;
int n, t;
int x[N];
ll f[N];
inline void down(ll &x, const ll y) {x > y ? x = y : 0;}
int main() {
int i, j = 0; ll ans, r = 0x3f3f3f3f3f3f3f3fll;
scanf("%d%lld%d", &n, &ans, &t);
for (i = 1; i <= n; ++i) {
for (scanf("%d", x + i); x[j + 1] < x[i] - t / 2; ++j)
down(r, f[j] - 2 * x[j + 1]);
down(f[i] = r + 2 * x[i], f[j] + t);
}
printf("%lld\n", ans + f[n]);
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cstring>
#define lowbit(x) (x&-x)
using namespace std;
const int MAXN = 100005;
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
ll t,e,n,d[MAXN];
ll c[MAXN],f[MAXN];
inline void update(int x,ll v)
{
for(;x<=n;x+=lowbit(x))
c[x]=min(c[x],v);
}
inline ll query(int x)
{
ll ret=INF;
for(;x;x-=lowbit(x))
ret=min(ret,c[x]);
return min(ret,(ll)-2*d[1]);
}
int main()
{
scanf("%lld%lld%lld",&n,&e,&t);
for(int i=1;i<=n;++i)scanf("%lld",d+i);
int p=0;
memset(f,0x3f,sizeof(f));
f[0]=0;
for(int i=1;i<=n;++i){
while(2*(d[i]-d[p+1])>=t)++p;
if(p>0)f[i]=min(f[i],query(p-1)+2*d[i]);
f[i]=min(f[i],f[p]+t);
update(i,f[i]-2*d[i+1]);
}
cout<<f[n]+e<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+1e4;
int n,E,T,l,r,Temp[N]; ll ans=1e16,a[N],f[N];
int rd(){
int s=0,ff=1;
char w=getchar();
while(!isdigit(w))
ff^=w=='-',w=getchar();
while(isdigit(w))
s=s*10+w-'0',w=getchar();
return ff?s:-s;
}
int main(){
n=rd(),E=rd(),T=rd(); l=1,r=0;
for(int i=1;i<=n;i++) a[i]=rd(),f[i]=1e16;
Temp[++r]=0;
for(int i=1;i<=n;i++){
while(2*a[i]-2*a[Temp[l]+1]>=T&&l<=r)
ans=min(ans,f[Temp[l]]-2*a[Temp[l]+1]-a[Temp[l]]),l++;
f[i]=min(f[i],3LL*a[i]+ans);
if(l<=r) f[i]=min(f[i],f[Temp[l]]+T+a[i]-a[Temp[l]]);
while(f[i]-a[i]<f[Temp[r]]-a[Temp[r]]&&l<=r) r--; Temp[++r]=i;
}
printf("%lld\n",f[n]+E-a[n]);
return 0;
} |
#include<bits/stdc++.h>
typedef long long ll;
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int x[100010];
ll f[100010];
int que[100010],hd,tl;
int main(){
#ifdef XZZSB
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
int n=gi(),E=gi(),T=gi();
for(int i=1;i<=n;++i)x[i]=gi();x[++n]=E;
ll MN=9e18;
for(int i=n-1;i;--i){
f[i]=9e18;
while((hd^tl)&&f[que[tl-1]]+x[que[tl-1]]>f[i+1]+x[i+1])--tl;
que[tl++]=i+1;
while((hd^tl)&&2*(x[que[hd]-1]-x[i])>T)MN=std::min(MN,f[que[hd]]+x[que[hd]]+2*x[que[hd]-1]),++hd;
if(hd^tl)f[i]=f[que[hd]]+x[que[hd]]-x[i]+T;
f[i]=std::min(f[i],MN-3ll*x[i]);
}
printf("%lld\n",f[1]+x[1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n, e, t;
cin >> n >> e >> t;
vector<ll> ps(n);
for(auto& x : ps) cin >> x;
vector<ll> d(n, 0);
ll best_left = 1000000001;
multiset<ll> inner_best;
auto get_dyn_minus_unu = [&](const ll x){
return x == 0 ? 0 : d[x-1]; };
for(ll i = 0, st = 0; i < n; ++i){
if(i != 0) best_left += 2 * (ps[i] - ps[i-1]);
inner_best.insert(get_dyn_minus_unu(i));
while(2 * (ps[i] - ps[st]) >= t){
inner_best.erase(inner_best.find(get_dyn_minus_unu(st)));
best_left = min(best_left, 2 * (ps[i] - ps[st]) + get_dyn_minus_unu(st));
++st; }
ll rez = best_left;
if(!inner_best.empty()){
rez = min(rez, *begin(inner_best) + t); }
d[i] = rez; }
cout << d.back() + e << endl;
return 0; }
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define mp make_pair
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
const ll INF=1LL<<30;
const ll LINF=1LL<<62;
const double eps=1e-9;
const ll MOD=1000000007LL;
template<typename T>void chmin(T &a,T b){a=min(a,b);};
template<typename T>void chmax(T &a,T b){a=max(a,b);};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
ll n,e,t;cin>>n>>e>>t;
vector<ll> x(n+10);
for(int i=1;i<=n;i++){
cin>>x[i];
}
vector<ll> dp(n+10,LINF);
dp[0]=0;
int id=0;
ll mix=LINF;
for(int i=1;i<=n;i++){
if(i>1)mix+=2LL*(x[i]-x[i-1]);
while(id<i&&2LL*(x[i]-x[id+1])>t){
chmin(mix,dp[id]+2LL*(x[i]-x[id+1]));
id++;
}
chmin(dp[i],mix);
chmin(dp[i],dp[id]+t);
}
cout<<e+dp[n]<<endl;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mxn=1e6+6;
int n,E,T,w[mxn];
ll d[mxn];
multiset<ll>s1,s2;
int main(){
ios_base::sync_with_stdio(false);
int pv=1;
cin>>n>>E>>T;
for(int i=1;i<=n;++i)cin>>w[i];
w[n+1]=E,d[1]=w[1];
for(int i=1;i<=n;++i){
ll r=1e15,tp;
s2.insert(d[i]-w[i]);
for(;pv<=i and (w[i]-w[pv])*2>T;){
s2.erase(s2.find(d[pv]-w[pv]));
s1.insert(d[pv]-1ll*3*w[pv]);
++pv;
}
if(!s1.empty()){
tp=*s1.begin();
if(r>tp+w[i]*3ll)r=tp+w[i]*3ll;
}
tp=*s2.begin();
if(r>tp+w[i]+T)r=tp+w[i]+T;
d[i+1]=w[i+1]-w[i]+r;
}
cout<<d[n+1]<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, e, t;
int x[100005];
ll f[100005];
int main()
{
scanf("%d%d%d", &n, &e, &t);
for(int i = 1; i <= n; i++)
{
scanf("%d", &x[i]);
}
ll tmp = 0x3f3f3f3f3f3f3f3f;
for(int i = 1, j = 1; i <= n; i++)
{
while(j <= n && (x[i] - x[j]) * 2 > t)
{
tmp = min(tmp, f[j - 1] - x[j] * 2);
j++;
}
f[i] = min(f[j - 1] + t, tmp + x[i] * 2);
}
printf("%lld\n", f[n] + e);
return 0;
} |
#include<iostream>
#include<string>
#include<ctime>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cstdio>
#include<map>
#include<string.h>
using namespace std;
long long x[100008],dp[100008];long long t,e;
void update(long long i,long long j)
{
dp[i]=min(dp[i],dp[j]+max(t,2*(x[i]-x[j+1])));
}
int main()
{
long long n;cin>>n;cin>>e>>t;
for(long long i=1;i<=n;i++) cin>>x[i];for(long long i=0;i<100005;i++) dp[i]=2e9;
dp[0]=0;long long j=0;long long mst=2e9,msi=0;
for(long long i=1;i<=n;i++)
{
update(i,i-1);
while((x[i]-x[j+1])*2>t)
{
long long tt=dp[j]+2*(x[0]-x[j+1]);
if(tt<mst) mst=tt,msi=j;j++;
}
update(i,j);update(i,max(j-1,(long long)0));update(i,j+1);
update(i,msi);
}
cout<<dp[n]+e;
}
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
typedef pair<ll, int> P;
int main(){
ll N, E, T; cin >> N >> E >> T;
ll x[N+1];
for(int i=0; i<N; i++) cin >> x[i];
x[N] = E;
ll dp[N+1];
dp[N-1] = T + E - x[N-1];
dp[N] = 0;
int now = N-1, prev = N-1;
priority_queue<ll, vector<ll>, greater<ll> > pq;
ll mi = 1e18;
for(int i=N-2; i>=0; i--){
while(2*(x[now] - x[i]) >= T){
now--;
}
for(; prev>=now+1; prev--){
// pq.push(dp[prev] + 2*x[prev-1] + x[prev]);
if(mi > dp[prev+1] + 2*x[prev] + x[prev+1]) mi = dp[prev+1] + 2*x[prev] + x[prev+1];
}
if(now != N-1){
dp[i] = min(mi - 3*x[i], T + x[now+1] - x[i] + dp[now+1]);
}else{
dp[i] = min(mi - 3*x[i], T + E - x[i]);
}
}
cout << dp[0] + x[0] << endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n,t,e,i,x[100005],dp[100005],ans=0,tr[2][100005],pos;
const ll inf=1e18;
ll lowbit(ll p){return p&-p;}
void modify(ll ty,ll p,ll v)
{
while(p<=n)
{
tr[ty][p]=min(tr[ty][p],v);
p+=lowbit(p);
}
}
ll ask(ll ty,ll p)
{
ll ans=inf;
while(p)
{
ans=min(ans,tr[ty][p]);
p-=lowbit(p);
}
return ans;
}
int main()
{
scanf("%lld%lld%lld",&n,&e,&t);ans=e;
for(i=1;i<=n;i++)scanf("%lld",&x[i]),tr[0][i]=tr[1][i]=inf;
pos=1;
for(i=1;i<=n;i++)
{
dp[i]=dp[i-1]+t;
while(pos<=n&&2*x[pos]<=2*x[i]-t)pos++;
if(pos<i)dp[i]=min(dp[i],t+ask(1,n-pos+1));
if(pos>1)dp[i]=min(dp[i],2LL*x[i]+ask(0,pos-1));
modify(0,i,dp[i-1]-2LL*x[i]);
modify(1,n-i+1,dp[i-1]);
//printf("%lld")
}
printf("%lld\n",ans+dp[n]);
return 0;
} |
#include <bits/stdc++.h>
#define maxn 100010
#define cmin(_a, _b) (_a > (_b) ? _a = (_b) : 0)
int a[maxn], q[maxn];
long long f[maxn];
int main()
{
int n,m,T;
scanf("%d%d%d",&n,&m,&T);
for (int i=1;i<=n;++i)scanf("%d",&a[i]);
int p = 1, head = 0, tail = 0;
long long fp = 1234567891234567ll;
for (int i = 1; i <= n; ++i)
{
while ((a[i] - a[p]) * 2 > T) cmin(fp, f[p - 1] - 2 * a[p]), ++p;
while (head < tail && (a[i] - a[q[head + 1]]) * 2 > T) ++head;
f[i] = 1ll * i * T;
cmin(f[i], fp + 2 * a[i]);
head < tail ? cmin(f[i], f[q[head + 1] - 1] + T) : 0;
cmin(f[i], f[i - 1] + T);
while (head < tail && f[q[tail] - 1] > f[i]) --tail;
q[++tail] = i;
}
printf("%lld\n", f[n] + m);
return 0;
} |
#include <bits/stdc++.h>
#define FO(i,a,b) for (int i = (a); i < (b); i++)
#define sz(v) int(v.size())
using namespace std;
typedef long long ll;
int n, e, t;
ll x[100005];
ll f[100005];
ll mf[100005];
int main() {
scanf("%d %d %d", &n, &e, &t);
FO(i,0,n) scanf("%lld", x+i);
x[n] = e;
f[n] = 0;
mf[n] = 1ll<<60;
for (int i = n-1; i >= 0; i--) {
f[i] = 1ll<<60;
int s = i, _e = n-1, b = i;
while (s <= _e) {
int m = (s+_e)/2;
if (2*(x[m]-x[i]) <= t) {
b = m;
s = m+1;
} else {
_e = m-1;
}
}
f[i] = min(f[i], f[b+1] + t+x[b+1]-x[i]);
f[i] = min(f[i], mf[b+1] - 3*x[i]);
mf[i] = min(mf[i+1], f[i+1] + 2*x[i]+x[i+1]);
}
printf("%lld\n", x[0]+f[0]);
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
const int maxn = 1e5 + 5;
ll dp[maxn];
ll pre1[maxn];
ll x[maxn];
int n;
ll T, E;
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> E >> T;
for(int i = 1;i <= n;i++){
cin >> x[i];
}
dp[0] = 0;
pre1[0] = dp[0] - 2 * x[1];
int l = -1;
for(int i = 1;i <= n;i++){
while(l + 1 < i and 2 * (x[i] - x[l + 2]) >= T){
l++;
}
dp[i] = 1e18;
if(l >= 0)
dp[i] = pre1[l] + 2 * x[i];
if(l + 1 < i){
dp[i] = min(dp[i], dp[l + 1] + T);
}
pre1[i] = pre1[i - 1];
pre1[i] = min(pre1[i - 1], dp[i] - 2 * x[i + 1]);
}
cout << E + dp[n] << endl;
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <algorithm>
typedef long long LL;
const int maxn = 1e5 + 20;
int N, E, T;
int x[maxn];
LL f[maxn];
int main()
{
scanf("%d%d%d", &N, &E, &T);
for(int i = 1; i <= N; i++)
{
scanf("%d", &x[i]);
}
LL pmin = 1ll << 60;
for(int i = 1, p = 1; i <= N; i++)
{
while(p <= N && (x[i] - x[p]) * 2 > T)
{
pmin = std::min(pmin, f[p - 1] - 2 * x[p]);
p++;
}
f[i] = f[i - 1] + T;
f[i] = std::min(f[i], f[p - 1] + T);
f[i] = std::min(f[i], pmin + 2 * x[i]);
}
printf("%lld\n", f[N] + E);
return 0;
} |
// <<<<GOD>>>> lET'S gO
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5 + 100, inF = 1e15;
ll n, e, t, mini = inF, a[N], dp[N];
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> n >> e >> t;
for (int i = 1; i <= n; i++)
cin >> a[i];
int p = 0;
for (int i = 1; i <= n; i++) {
while(2 * (a[i] - a[p]) > t) {
mini = min(mini, dp[p - 1] - 2 * a[p]);
p++;
}
dp[i] = dp[p - 1] + t;
dp[i] = min(dp[i], 2 * a[i] + mini);
}
cout << e + dp[n];
return 0;
} |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
ll x[120000];
int n;
ll e, t;
ll dp[120000];
int main() {
scanf("%d%lld%lld", &n, &e, &t);
for (int i = 0; i < n; ++i)
scanf("%lld", x + i);
int now = 0;
ll mn = 1e10;
for (int i = 0; i < n; ++i) {
if (2 * (x[i] - x[0]) <= t) {
dp[i] = t;
continue;
}
mn = min(mn, -2 * x[0]);
while (2 * (x[i] - x[now + 1]) > t) {
mn = min(mn, dp[now] - 2 * x[now + 1]);
now += 1;
}
dp[i] = mn + 2 * x[i];
dp[i] = min(dp[i], dp[now] + t);
}
cout << e + dp[n - 1] << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int N,E,T;
int x[100005];
long long f[100005];
int main(){
scanf("%d%d%d",&N,&E,&T);
for(int i=1;i<=N;i++) scanf("%d",&x[i]);x[0]=x[1];
long long ans=1e18,mn=1e18;
for(int i=1,p=1;i<=N;i++){
while(p<N&&(x[i]-x[p])>T/2) {
mn=min(mn,f[p-1]-x[p]*2-x[p-1]);
p++;
}
f[i]=min(f[p-1]+x[i]-x[p-1]+T,mn+x[i]*3LL);
}
ans=min(ans,f[N]+x[1]+E-x[N]);
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, e, t;
cin >> n >> e >> t;
vector<int> x(n + 1);
for (int i = 0; i < n; i++) {
cin >> x[i + 1];
}
vector<int> first(n + 1); // first no wait from right to left
for (int i = n, j = n; i >= 0; i--) {
while (j > 0 && 2 * x[i] - 2 * x[j] <= t) {
j--;
}
first[i] = j;
}
vector<long long> dp(n + 1, inf);
dp[0] = 0;
long long min_prefix = inf;
for (int i = 1, j = 0; i <= n; i++) {
while (j < first[i]) {
min_prefix = min(min_prefix, dp[j] - 2 * x[j + 1]);
j++;
}
dp[i] = min(t + dp[j], min_prefix + 2 * x[i]);
}
cout << dp[n] + e << '\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 100 ;
long long dp[MAXN] , tmp[MAXN] , nx[MAXN] , a[MAXN] ;
int32_t main(){
//ios_base::sync_with_stdio(0) ;
//cin . tie(0) ; cout . tie(0) ;
int n ; cin >> n ;
int e , t ; cin >> e >> t ;
for(int i = 0 ; i < n ; i ++)
cin >> a[i] ;
int l = n - 1 ;
//cout << "Hir" << endl ;
for(int i = n - 1 ; i >= 0 ; i --){
while(l > 0 && 2 * (a[i] - a[l - 1]) <= t)
l -- ;
nx[i] = l ;
}
//cout << "Hir" << endl ;
memset(dp , 63 , sizeof dp) ;
memset(tmp , 63 , sizeof tmp) ;
dp[0] = 0 ;
tmp[0] = -2 * a[0] ;
//cout << 0 << ' ' << dp[0]<< ' ' << tmp[0]<< ' ' << '\n' ;
for(int i = 1 ; i <= n ; i ++){
dp[i] = t + dp[nx[i - 1]] ;
if(nx[i - 1]) dp[i] = min(dp[i] , 2 * a[i - 1] + tmp[nx[i - 1] - 1]) ;
tmp[i] = min(tmp[i - 1] , dp[i] - 2 * a[i]) ;
//cout << i << ' ' << dp[i] << ' ' << tmp[i] << '\n' ;
}
cout << dp[n] + e ;
} |
//dp[i]=min(dp[j]+max(T,(s[i]-s[j+1])*2)+(s[i]-s[j]));
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
const long long inf=1LL<<60;
int s[maxn];
int n,E,T;
int head,tail,que[maxn];
long long dp[maxn];
long long tmp=inf;
int main()
{
scanf("%d%d%d",&n,&E,&T);
for(int i=1;i<=n;i++)scanf("%d",&s[i]);
head=1,tail=0;
que[++tail]=0;
for(int i=1;i<=n;i++)
{
while(head<=tail&&2*(s[i]-s[que[head]+1])>T)tmp=min(tmp,dp[que[head]]-2*s[que[head]+1]),head++;
dp[i]=min(dp[que[head]]+T,tmp+2*s[i]);
que[++tail]=i;
}
printf("%lld\n",dp[n]+E);
} |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
using vi=vector<int>;
#define PB push_back
#define ALL(x) x.begin()
using pi=pair<int,int>;
int read(){
int i;
scanf("%lld",&i);
return i;
}
int const inf=LLONG_MAX/3;
void chmin(int&a,int b){a=a<b?a:b;}
void chmax(int&a,int b){a=a>b?a:b;}
signed main(){
int n=read(),e=read(),t=read();
vi x{0};
REP(i,n)x.PB(read());
n++;
vi dp(n,inf);
priority_queue<pi,vector<pi>,greater<pi>> pq;
pq.push(pi(0,0));
int j=0;
REP(i,n){
int w;
while(1){
pi r=pq.top();
if(i<=r.second){
w=min(r.first,dp[i]);
break;
}else
pq.pop();
}
if(i==n-1){
cout<<w+e<<endl;
return 0;
}
chmin(dp[i+1],dp[i]+(x[i+1]-x[i])*2);
while(j<n&&(x[j]-x[i+1])*2<=t)j++;
pq.push(pi(w+t,j-1));
if(j<n)chmin(dp[j],w+(x[j]-x[i+1])*2);
}
}
|
#include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
using namespace std;
#define Set(a, b) memset(a, b, sizeof a)
typedef long long LL;
const LL Inf = LONG_LONG_MAX / 2;
const int N = 1e5 + 10;
int n, e, t;
LL f[N], p[N];
int main() {
scanf("%d %d %d", &n, &e, &t);
for (int i = 1; i <= n; ++i)
scanf("%lld", &p[i]);
Set(f, 60);
f[0] = 0;
LL mn = Inf;
for (int i = 1, j = 0; i <= n; ++i) {
for (; t <= 2 * (p[i] - p[j + 1]); ++j)
mn = min(mn, f[j] - 2 * p[j + 1]);
if (j < i)
f[i] = min(f[i], f[j] + t);
f[i] = min(f[i], mn + 2 * p[i]);
}
printf("%lld\n", e + f[n]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
int n,E,T,q[N],head,tail,x[N];ll dp[N];
ll cost(int i,int j){return dp[j]+x[i]-x[j]+T;}
int main()
{
scanf("%d%d%d",&n,&E,&T);
for (int i=1;i<=n;i++) scanf("%d",&x[i]);
int p=0;ll v=1e16;
q[head=tail=1]=0;
for (int i=1;i<=n;i++){
for (;p<i&&2*(x[i]-x[p+1])>=T;p++) v=min(v,dp[p]-x[p]-2*x[p+1]);
for (;head<=tail&&2*(x[i]-x[q[head]+1])>T;head++);
dp[i]=v+3ll*x[i];
if (head<=tail) dp[i]=min(dp[i],cost(i,q[head]));
for (;head<=tail&&cost(i,q[tail])>=cost(i,i);tail--);
q[++tail]=i;
}
printf("%lld\n",dp[n]+E-x[n]);
return 0;
} |
#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]);
// while (l<=r&&f[q[l]]-x[q[l]]>=f[i]-x[i]) r--;
q[++r]=i;
}
Ans=f[n]+E;
printf("%lld\n",Ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
long long n,E,T,t,a[100005],f[100005],M=1LL<<60;int main(){scanf("%lld%lld%lld",&n,&E,&T);for(int i=1;i<=n;i++)scanf("%lld",&a[i]);for(int i=1;i<=n;i++){for (;T<=2*(a[i]-a[t+1]);t++)M=min(M,f[t]-2*a[t+1]);f[i]=min(f[t]+T,M+2*a[i]);}printf("%lld",E+f[n]);} |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<set>
#define LL long long
using namespace std;
multiset<LL> s1, s2;
LL dp[110000], dp2[110000];
int x[110000], n, E, T;
int main(){
scanf("%d%d%d", &n, &E, &T);
dp2[0] = T;s1.insert(T);
for(int i = 1, j = 0; i <= n; i++){
scanf("%d", &x[i]);
while(j < i && 2 * (x[i] - x[j + 1]) >= T){
s1.erase(s1.find(dp2[j]));
dp2[j] = dp2[j] - T - 2 * (x[j + 1]);
s2.insert(dp2[j]);
j++;
}
dp2[i] = (((LL)1)<<50);
if(!s1.empty()) dp[i] = max(dp[i], *s1.begin() + x[i]);
if(!s2.empty()) dp[i] = min(dp[i], *s2.begin() + (LL)3 * x[i]);
dp2[i] = dp[i] - x[i] + T;
s1.insert(dp2[i]);
}
cout<<dp[n] - x[n] + E;
return 0;
} |
#include<iostream>
#include<cstdio>
#include<set>
using namespace std;
long long n,t,e,x[111111],mnp,pos,dp[111111];
multiset<long long> s;
int main()
{
scanf("%lld%lld%lld",&n,&e,&t);
for (long long i=1;i<=n;i++)
{
scanf("%lld",&x[i]);
}
dp[0]=0;
mnp=1e18;
pos=1;
for (long long i=1;i<=n;i++)
{
s.insert(dp[i-1]);
while(pos<=i)
{
if (2*(x[i]-x[pos])>t)
{
mnp=min(mnp,dp[pos-1]-2*x[pos]);
s.erase(s.find(dp[pos-1]));
pos++;
}
else break;
}
dp[i]=min(*s.begin()+t,mnp+2*x[i]);
}
printf("%lld\n",dp[n]+e);
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int n,t,e,a[100005];
long long f[100005];
int main(){
cin>>n>>e>>t;
for(int i=1;i<=n;i++){
cin>>a[i];
}
long long cur=1e18;
for(int i=1,l=1;i<=n;i++){
while(2*(a[i]-a[l])>=t){
cur=min(cur,f[l-1]-2*a[l]);
l++;
}
f[i]=min(f[l-1]+t,cur+2*a[i]);
}
cout<<f[n]+e<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
typedef long long ll;
const ll INF=1e15;
ll d[N],a[N];
int n,m,T,q[N],s,t;
int main() {
scanf("%d%d%d",&n,&m,&T); for(int i=1;i<=n;i++){ scanf("%lld",&a[i]); d[i]=INF; }
s=1,t=1;
ll z=INF;
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;
}
ll ans=d[n]+m-a[n];
printf("%lld\n",ans);
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <bitset>
using namespace std;
#define N 100010
typedef long long ll;
const ll INF=1e18;
int n,E,T;
int dis[N];
ll Dp[N];
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int main()
{
n=read();E=read();T=read();
for(int i=1;i<=n;i++)
dis[i]=read();
Dp[0]=0;
int pos=0;ll Min=INF;
for(int i=1;i<=n;i++)
{
Dp[i]=Dp[i-1]+T;
while(pos+1<=i&&2*(dis[i]-dis[pos+1])>T)
{
Min=min(Min,Dp[pos]-2*dis[pos+1]);
pos++;
}
Dp[i]=min(min(Dp[i],Dp[pos]+T),Min+2*dis[i]);
}
cout<<Dp[n]+E<<endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
typedef long long LL;
const int MAXN = 100000+10;
const int INF = 0x3f3f3f3f;
int n, t, e;
LL x[MAXN], f[MAXN];
int main(){
// freopen("t.in", "r", stdin);
scanf("%d%d%d", &n, &e, &t);
for(int i=1; i<=n; ++i) scanf("%lld", &x[i]);
int j=0;
LL mn = 1e14;
for(int i=1; i<=n; ++i){
while((x[i]-x[j+1])*2>=t){
mn = std::min(mn, f[j] - 2*x[j+1]);
j++;
}
f[i] = std::min(f[j]+t, mn + 2*x[i]);
}
printf("%lld\n", f[n]+e);
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=2e5+500;
const long long INF=1e18;
int head,tail,n,E,T,x[N],q[N];
long long f[N],g1[N],g2[N];
int main()
{
scanf("%d%d%d",&n,&E,&T);
long long mi=INF;
for(int i=1;i<=n;i++)scanf("%d",x+i);
int j=0;g1[0]=-2*x[1],g2[0]=T;
int head=1,tail=1;q[1]=0;
for(int i=1;i<=n;i++)
{
while(j<i&&2*x[j+1]<=2*x[i]-T)mi=min(mi,g1[j]),++j;
while(head<=tail&&q[head]<j)++head;
f[i]=3ll*x[i]+mi;
if(head<=tail)f[i]=min(f[i],x[i]+g2[q[head]]);
g1[i]=f[i]-x[i]-2*x[i+1];
g2[i]=f[i]+T-x[i];
while(head<=tail&&g2[i]<=g2[q[tail]])--tail;q[++tail]=i;
}
cout<<f[n]+E-x[n]<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long s64;
#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=1e5+5;
int x[N];s64 dp[N],mn[N];
int main()
{
//freopen("1.in","r",stdin);
int n,e,t;
cin>>n>>e>>t;
rep(i,1,n)scanf("%d",x+i);
mn[n+1]=1e18;
int j=n;
for(int i=n;i;--i)
{
while(2*(x[j]-x[i])>t)--j;
dp[i]=min(dp[j+1]+t,mn[j+1]-2*x[i]);
mn[i]=min(mn[i+1],dp[i+1]+2*x[i]);
}
cout<<dp[1]+e;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100010;
int n,e;
ll T;
int x[maxn];
ll f[maxn];
int main()
{
scanf("%d%d",&n,&e);
cin>>T;
for (int i=1;i<=n;i++)
scanf("%d",&x[i]);
f[0]=0;
f[1]=T;
int la=0;
ll minx=1LL<<60;
for (int i=2;i<=n;i++)
{
while (2LL*(x[i]-x[la+1])>T)
{
ll tmp=f[la]-2LL*x[la+1];
if (minx>tmp) minx=tmp;
la++;
}
f[i]=f[i-1]+T;
if (la>0)
f[i]=min(f[i],minx+2LL*x[i]);
f[i]=min(f[i],f[la]+T);
}
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()
{
multiset<ll> S;
scanf("%d%d%d", &n, &E, &T);
for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
S.insert(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]);
S.erase(S.find(f[r]));
++r;
}
f[i] = min(Min1 + 1ll * i * T, Min2 + 2 * a[i]);
if(!S.empty()) f[i] = min(f[i], *S.begin() + T);
Min1 = min(Min1, f[i] - 1ll * i * T);
S.insert(f[i]);
}
printf("%lld\n", f[n] + E);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 10 , inf = 2e18;
long long e , n , t , x[maxn] , dp[maxn] , p[maxn];
int main()
{
cin >> n >> e >> t;
for(int i=1 ; i<=n ; i++) cin >> x[i];
dp[0] = 0; p[0] = dp[0] - 2*x[1];
for(int i=1 ; i<=n ; i++)
{
int y = lower_bound(x,x+n , x[i]-(t/2))-x;
dp[i] = (y <= 1 ? t : min(p[y-2] + 2*x[i] , dp[y-1] + t));
p[i] = min(p[i-1] , dp[i] - 2*(x[i+1]));
}
cout << dp[n] + e;
} |
#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, j = 0; i <= n; ++i)
{
px[i] = read();
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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
ll n,t[200010][2],mx = 100000000000000,dp[100010],x[100010],y[100010];
void update(ll p,ll a,int x){
for(t[p+=n][x] = a;p>1;p >>= 1){
t[p>>1][x] = min(t[p][x],t[p^1][x]);
}
}
ll query(int l, int r,int x){
ll mn = mx;
for(l += n, r += n; l<r; l >>= 1,r >>= 1){
if(l&1) mn = min(mn,t[l++][x]);
if(r&1) mn = min(mn,t[--r][x]);
}
return mn;
}
int main(){
ll i,e,T;
cin >> n >> e >> T;
for(i=1;i<=n;i++){
cin >> x[i];
}
x[0] = 0; dp[0] = 0;
int l = -1;
for(i=0;i<=n;i++){
while(2*(x[i] - x[l + 1])>T && l<n-1) l++;
y[i] = l;
}
update(0,-x[0] - 2*x[1],0); update(0,-x[0],1);
for(i=1;i<=n;i++){
dp[i] = min(3*x[i] + query(0,y[i],0),x[i] + T + query(y[i],i,1));
update(i,dp[i] - x[i] - 2*x[i + 1],0);
update(i,dp[i] - x[i],1);
}
cout << dp[n] + e - x[n] << endl;
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
#define maxn 100005
#define INF (LL)1e16
using namespace std;
int n,m,t,x[maxn];
LL dp[maxn];
int main()
{
scanf("%d%d%d",&n,&m,&t);
for(int i=1;i<=n;i++) scanf("%d",&x[i]);
sort(x+1,x+n+1);
memset(dp,0x3f,sizeof(dp));
dp[0]=0;
LL mn=INF; int now=0;
for(int i=1;i<=n;i++)
{
dp[i]=dp[i-1]+t+x[i]-x[i-1];
while(2*(x[i]-x[now+1])>=t)
{
mn=min(mn,dp[now]-2ll*x[now+1]);
now++;
}
dp[i]=min(2*x[i]+mn,dp[now]+t);
}
printf("%lld\n",dp[n]+m);
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 1e5 + 10, INF = 2e18;
int x[MAXN], dp[MAXN];
int n, e, t;
int32_t main () {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> e >> t;
for (int i =0; i < n; ++i) {
cin >> x[i];
dp[i] = INF;
}
x[n] = e;
int mn = INF;
int point = n;
for (int i = n - 1; i >= 0; --i) {
while (x[point - 1] - x[i] > t / 2) {
mn = min(mn,dp[point] + x[point] + 2 * x[point - 1]);
--point;
}
dp[i] = min(mn - 3 * x[i], dp[point] + x[point] - x[i] + t);
}
cout << dp[0] + x[0];
return 0;
} |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <utility>
#include <map>
#include <set>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <sstream>
#include <cstring>
#include <bitset>
#include <stack>
using namespace std;
#define MP make_pair
#define PB push_back
const int INF=1e9;
int n,e,t,pos;
long long a[100005];
long long dp[100005],cur;
int main()
{
cin>>n>>e>>t;
for (int i=1;i<=n;i++) cin>>a[i];
dp[0]=0;
cur=1e18;
pos=0;
for (int i=1;i<=n;i++)
{
while (t<=2*(a[i]-a[pos+1]))
{
cur=min(cur,dp[pos]-2*a[pos+1]);
pos++;
}
dp[i]=min(cur+2*a[i],dp[pos]+t);
}
cout<<dp[n]+e;
return 0;
} |
#include <cstdio>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < int(n); ++(i))
#define repeat_reverse(i, n) for (int i = (n)-1; (i) >= 0; --(i))
using ll = long long;
using namespace std;
template <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }
constexpr ll inf = ll(1e18)+9;
int main() {
// input
int n, e, t; scanf("%d%d%d", &n, &e, &t);
vector<int> x(n); repeat (i, n) scanf("%d", &x[i]);
// solve
vector<ll> dp(n + 1, inf);
dp[n] = e;
int m = n;
ll acc = inf;
repeat_reverse (l, n) {
for (; m - 1 >= l + 1 and t <= 2ll * (x[m - 1] - x[l]); -- m) {
setmin(acc, 2ll * x[m - 1] + dp[m]);
}
dp[l] = min(acc - 2ll * x[l], t + dp[m]);
}
// output
printf("%lld\n", dp[0]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N 120000
#define INF 0x3f3f3f3f3f3f3f3fLL
LL a[N],n,m,t,f[N],g[N];
int main(){
scanf("%lld%lld%lld",&n,&m,&t);
for (LL i=1;i<=n;++i) scanf("%lld",a+i);
g[0]=-a[1]*2;
for (LL i=1,j=0;i<=n;++i){
for (;t<2*(a[i]-a[j+1]);++j);
f[i]=min(j>0?g[j-1]+a[i]*3:INF,f[j]+a[i]-a[j]+t);
g[i]=min(g[i-1],f[i]-a[i]-a[i+1]*2);
}
printf("%lld\n",f[n]+m-a[n]);
return 0;
}
|
#include <cstdio>
using namespace std;
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
typedef long long LL;
const int N = 1e5 + 10;
const LL inf = 1e18 + 10;
int n, e, t, x[N]; LL f[N], g[N];
template <class T> inline void in(T &x) {
x = 0; int f = 1; char ch = getchar();
for (; ch<'0' || ch>'9';) {if (ch=='-') f=-1; ch = getchar();}
for (; ch>='0' && ch<='9';) x = x*10 + ch-'0', ch = getchar();
x *= f;
}
int main() {
in(n), in(e), in(t), g[n + 1] = inf;
for (int i = 1; i <= n; ++i) in(x[i]);
for (int i = n, j = n; i; --i) {
for (;(x[j] - x[i] << 1) > t;) --j;
f[i] = min(f[j + 1] + t, g[j + 1] - 2 * x[i]);
g[i] = min(g[i + 1], f[i + 1] + 2 * x[i]);
}
printf("%lld\n", f[1] + e);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Nmax = 1e5 + 5;
int E, n, T, i, j, x[Nmax];
ll dp[Nmax], A[Nmax], B[Nmax];
deque<int> dq;
int main()
{
// freopen("input", "r", stdin);
cin.sync_with_stdio(false);
cin >> n >> E >> T;
for(i=1; i<=n; ++i) cin >> x[i];
for(i=1; i<=n; ++i)
{
A[i] = min(A[i-1], dp[i-1] - x[i-1] - 2 * x[i]);
B[i] = dp[i-1] - x[i-1];
while(j < i && 2 * (x[i] - x[j+1]) > T) ++j;
while(dq.size() && B[dq.back()] >= B[i]) dq.pop_back();
dq.push_back(i);
while(dq.size() && dq.front() <= j) dq.pop_front();
dp[i] = x[i] + min(dq.size() ? T + B[dq.front()] : (1LL<<60), j ? A[j] + 2 * x[i] : (1LL<<60));
}
cout << dp[n] + E - x[n] << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define nn 200006
#define ll long long
ll n,t,e;
ll x[nn];ll f[nn];
int main()
{
scanf("%lld%lld%lld",&n,&e,&t);
for(int i=1;i<=n;i++) scanf("%lld",&x[i]);
deque<int> q;ll oops=1e17;
q.push_back(0);x[0]=0;int ls=0;
for(int i=1;i<=n;i++)
{
while(ls<i and 2*(x[i]-x[ls+1])>t)
{
if(q.size() and ls==q.front()) q.pop_front();
oops=min(oops,f[ls]-x[ls+1]*2-x[ls]);
ls++;
}
if(q.size()) f[i]=f[q.front()]+t+x[i]-x[q.front()];
else f[i]=1e17;
f[i]=min(f[i],oops+x[i]*3);
while(q.size() and f[q.back()]-x[q.back()]>=f[i]-x[i])
q.pop_back();
q.push_back(i);
}
printf("%lld\n",f[n]+e-x[n]);
}
|
#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+1]*2<key)l=m;
else r=m;
}
return l;
}
ll f[N],g[N];
int main(){
cin>>n>>e>>t; d[0]=0;
lol(i,n)cin>>d[i+1];
lol(i,N)f[i]=1e18; f[0]=0,g[0]=-2*d[1];
for(ll i=1;i<=n;i++){
ll surf=BN(d[i]*2-t);
ll res=1e17;
if(surf+1<i)chmin(res,f[surf+1]+t);
if(~surf)chmin(res,g[surf]+2*d[i]);
f[i]=res;
g[i]=min(g[i-1],f[i]-2*d[i+1]);
}
cout<<f[n]+e<<endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
const int maxn = 100010;
typedef long long ll;
int n, e, t;
ll a[maxn], f[maxn];
int main(){
scanf("%d%d%d", &n, &e, &t);
for(int i = 1;i <= n;++i)scanf("%lld", &a[i]);
memset(f, 0x3f, sizeof(f));f[0] = 0;
ll mn = 0x3f3f3f3f3f3f3f3fLL;
for(int i = 1, j = 0;i <= n;++i){
while(j + 1 < i && t <= 2LL * (a[i] - a[j + 1])){
mn = min(mn, f[j] - 2LL * a[j + 1]);
j++;
}
if(t > 2LL * (a[i] - a[j + 1]))f[i] = f[j] + t;
f[i] = min(f[i], 2LL * a[i] + mn);
// cout<<"for "<<i<<' '<<f[i]<<endl;
}
printf("%lld\n", f[n] + e);
return 0;
}
|
/*
*/
#include <cstdio>
#include <cctype>
#include <algorithm>
#define gc() getchar()
#define MAXIN 300000
//#define gc() (SS==TT&&(TT=(SS=IN)+fread(IN,1,MAXIN,stdin),SS==TT)?EOF:*SS++)
typedef long long LL;
const int N=1e5+5;
int p[N];
LL f[N];
char IN[MAXIN],*SS=IN,*TT=IN;
inline int read()
{
int now=0;register char c=gc();
for(;!isdigit(c);c=gc());
for(;isdigit(c);now=now*10+c-'0',c=gc());
return now;
}
int main()
{
int n=read(),E=read(),T=read();
for(int i=1; i<=n; ++i) p[i]=read();
LL mn=1e16;
for(int i=1,j=0; i<=n; ++i)
{
while(T<=2*(p[i]-p[j+1])) mn=std::min(mn,f[j]-2*p[j+1]), ++j;
if(j!=i) f[i]=std::min(f[j]+T,2*p[i]+mn);
else f[i]=2*p[i]+mn;
}
printf("%lld\n",f[n]+E);
return 0;
} |
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
#define LL long long
using namespace std;
const int N=1e5+10;
int n;
LL e,t,x[N],dp[N],tt=1e18;
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'){x=x*10+ch-'0'; ch=getchar(); }
ot=x*f;}
template<typename I, typename... U> inline void read(I &x,U&... y){read(x); read(y...);}
template<typename I>inline I mi(const I&a,const I&b){return a<b ? a : b;}
int main()
{
// freopen("Shik and Game.in","r",stdin);
//freopen(".out","w",stdout);
read(n,e,t);
for(int i=1;i<=n;i++) read(x[i]), dp[i]=2e9;
for(int i=1,j=0;i<=n;i++)
{
while(2*(x[i]-x[j+1])>=t)
{
tt=mi(tt,dp[j]-2*x[j+1]);
j++;
}
dp[i]=mi(dp[j]+t,tt+2*x[i]);
}
printf("%lld\n",dp[n]+e);
//fclose(stdin); fclose(stdout);
return 0;
}
|
#include <cstdio>
#include <cctype>
#include <algorithm>
#define MAXIN 1000000
#define gc() (SS==TT&&(TT=(SS=IN)+fread(IN,1,MAXIN,stdin),SS==TT)?EOF:*SS++)
typedef long long LL;
const int N=1e5+5;
int p[N];
LL f[N];
char IN[MAXIN],*SS=IN,*TT=IN;
inline int read()
{
int now=0;register char c=gc();
for(;!isdigit(c);c=gc());
for(;isdigit(c);now=now*10+c-'0',c=gc());
return now;
}
int main()
{
int n=read(),E=read(),T=read();
for(int i=1; i<=n; ++i) p[i]=read();
LL mn=1e16;
for(int i=1,j=0; i<=n; ++i)
{
while(T<=2*(p[i]-p[j+1])) mn=std::min(mn,f[j]-2*p[j+1]), ++j;
if(j!=i) f[i]=std::min(f[j]+T,mn+2*p[i]);
else f[i]=mn+2*p[i];
}
printf("%lld\n",f[n]+E);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll MAX = 1e5 + 10, inf = 1e17+1;
ll n, e, t, dp[MAX], x[MAX], p[MAX];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
fill (dp, dp+MAX, inf);
fill (p, p+MAX, inf);
cin >> n >> e >> t;
for (int i = 0; i < n; i++)
cin >> x[i + 1];
dp[0] = 0;
p[0] = -2 * x[1];
for (int i = 1; i <= n; i++)
{
int j = lower_bound(x + 1, x + n + 1, x[i] - t / 2) - x;
j--;
if (j > 0)
dp[i] = p[j-1] + 2 * x[i];
dp[i] = min(dp[i], dp[j] + t);
p[i] = min(p[i-1], dp[i] - 2 * x[i+1]);
//cout << i << " " << j << " " << dp[i] << " " << p[i] << "\n";
}
cout << dp[n] + e << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
template<typename t>void chkmin(t&a,t b){if(a>b)a=b;}
typedef long long ll;
const int maxn=1e5+10;
int n,t,e,x[maxn],endd=0;
ll dp[maxn],val=1e18;
int main(){
cin>>n>>e>>t;
for(int i=1;i<=n;++i){
dp[i]=1e18;
cin>>x[i];
while(endd<i&&2*(x[i]-x[endd+1])>=t)
chkmin(val,dp[endd]-2*x[endd+1]),++endd;
chkmin(dp[i],val+2*x[i]);
if(endd<i)
chkmin(dp[i],dp[endd]+t);
}
printf("%lld\n",dp[n]+e);
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace :: std;
const ll maxn=1e5+500;
const ll inf=2e18+7;
ll dp[maxn];
ll a[maxn];
ll parminn[maxn];
int main(){
fill(dp,dp+maxn,inf);
ll n,e,t;
cin>>n>>e>>t;
t*=2;
e*=2;
for(ll i=1;i<=n;i++){
cin>>a[i];
a[i]*=2;
}
ll p=0;
dp[0]=0;
for(ll i=1;i<=n;i++){
while(p+1<i && a[i]-a[p+1]>=t/2){
p++;
}
if(p==0){
dp[i]=t;
}else{
dp[i]=min(dp[p]+t,parminn[p]+a[i]*2);
}
parminn[i]=min(parminn[i-1],dp[i-1]-a[i]*2);
}
cout<<(dp[n]+e)/2;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,T,E;
int a[100010];
long long ans;
long long f[100010],g[100010];
pair<int,long long> q[100010];
int main()
{int i,j,t,w;
scanf("%d%d%d",&n,&E,&T);
for(i=1;i<=n;i++) scanf("%d",&a[i]);
f[0]=0;
j=1;
a[n+1]=E;
t=1;
w=0;
for(i=1;i<=n;i++)
{ while(j+1<=i && (a[i]-a[j+1])*2>=T) j++;
if((a[i]-a[j])*2>=T) f[i]=max(f[i],(a[i+1]-a[i])*2+g[j-1]);
while(t<=w && (a[i]-a[q[t].first])*2>=T) t++;
while(t<=w && q[w].second<=f[i-1]-a[i]*2) w--;
q[++w]=make_pair(i,f[i-1]-a[i]*2);
if(t<=w) f[i]=max(f[i],q[t].second+2*a[i]+2*(a[i+1]-a[i])-T);
g[i]=max(g[i-1],f[i]);
//cout<<i<<" "<<f[i]<<endl;
}
ans=(ll)3*E-f[n]-2*a[1];
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const long long INF = 1e18;
int x[N];
long long f[N];
long long calc(int j) {
return f[j] - x[j];
}
int main() {
int n, E, T;
scanf("%d%d%d", &n, &E, &T);
for (int i = 1; i <= n; ++ i) scanf("%d", &x[i]);
deque<int> q;
x[0] = 0;
q.push_back(0);
long long MIN = INF;
int r = 0;
for (int i = 1; i <= n; ++ i) {
while (2 * (x[i] - x[r + 1]) >= T) {
MIN = min(MIN, - 2LL * x[r + 1] - x[r] + f[r]);
++ r;
}
while (q.front() < r) q.pop_front();
int t = q.front();
f[i] = min(3LL * x[i] + MIN, x[i] + T + calc(t));
while (!q.empty() && calc(q.back()) > calc(i)) q.pop_back();
q.push_back(i);
}
long long ans = E - x[n] + f[n];
printf("%lld\n", ans);
}
|
#include<iostream>
#include<cstdio>
#include<set>
using namespace std;
long long dp[100010];
int x[100010];
int n,e;
long long t;
int st;
multiset<long long>s1,s2;
int main()
{
scanf("%d%d%lld",&n,&e,&t);
for(int i=1;i<=n;i++)scanf("%d",x+i);
s2.insert(t);
for(int i=1;i<=n;i++)
{
while(st+1<i && 2*(x[i]-x[st+1])>=t)
{
s2.erase(s2.find(dp[st]-x[st]+t));
s1.insert(dp[st]-x[st]-2LL*x[st+1]);
st++;
}
dp[i]=4e18;
if(s1.size())dp[i]=min(dp[i],(*s1.begin())+3LL*x[i]);
if(s2.size())dp[i]=min(dp[i],x[i]+(*s2.begin())),
s2.insert(dp[i]-x[i]+t);
}
printf("%lld",dp[n]+e-x[n]);
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.