0_0_20614584_31634.cpp:8:17: error: stray '#' in program
(y)?(x):(y))#define min(x,y) ((x)<(y)?(x):(y))#define P pair<int,int>#define LL long longusing namespace std; int a[MAXN];LL buy[MAXN],sell[MAXN];int len[MAXN];LL now[MAXN];int q[MAXN];void work(){ int st=0,ed=0; int n,c; scanf("%d%d",&n,&c); for(int i=1;i<=n;++i)scanf("%d",&a[i]); for(int i=0;i<=n;++i)scanf("%I64d%I64d",&buy[i],&sell[i]); now[0]=c; q[ed++]=0; LL ans=c*buy[0]; for(int i=1;i<=n;++i){ int dis=a[i]-a[i-1]; LL sum=c-dis; while(dis){ int x=q[st]; if(now[x]>dis){ now[x]-=dis; dis=0; }else{ dis-=now[x]; now[x]=0; st++; } } int era=0; while(st<ed){ int x=q[st]; if(buy[x]<sell[i]){ era+=now[x]; st++; }else break; } if(era!=0){ st--; now[q[st]]=era; buy[q[st]]=sell[i]; } bool flag=true; while(flag&&st<ed){ flag=false; int x=q[ed-1]; if(buy[x]>=buy[i]){ flag=true; ans-=now[x]*buy[x]; sum-=now[x]; now[x]=0; ed--; } } q[ed++]=i; now[i]=c-sum; ans+=(c-sum)*buy[i]; } while(st<ed){ int x=q[st++]; ans-=now[x]*buy[x]; } printf("%I64d\n",ans);}int main(){ len[0]=len[1]=0; for(int i=2;i<MAXN;++i){ int k=0; while((1<<k)<=i)k++; len[i]=k-1; } int tt; scanf("%d",&tt); while(tt--){ work(); }}
^
0_0_20614584_31634.cpp:8:51: error: stray '#' in program
(y)?(x):(y))#define min(x,y) ((x)<(y)?(x):(y))#define P pair<int,int>#define LL long longusing namespace std; int a[MAXN];LL buy[MAXN],sell[MAXN];int len[MAXN];LL now[MAXN];int q[MAXN];void work(){ int st=0,ed=0; int n,c; scanf("%d%d",&n,&c); for(int i=1;i<=n;++i)scanf("%d",&a[i]); for(int i=0;i<=n;++i)scanf("%I64d%I64d",&buy[i],&sell[i]); now[0]=c; q[ed++]=0; LL ans=c*buy[0]; for(int i=1;i<=n;++i){ int dis=a[i]-a[i-1]; LL sum=c-dis; while(dis){ int x=q[st]; if(now[x]>dis){ now[x]-=dis; dis=0; }else{ dis-=now[x]; now[x]=0; st++; } } int era=0; while(st<ed){ int x=q[st]; if(buy[x]<sell[i]){ era+=now[x]; st++; }else break; } if(era!=0){ st--; now[q[st]]=era; buy[q[st]]=sell[i]; } bool flag=true; while(flag&&st<ed){ flag=false; int x=q[ed-1]; if(buy[x]>=buy[i]){ flag=true; ans-=now[x]*buy[x]; sum-=now[x]; now[x]=0; ed--; } } q[ed++]=i; now[i]=c-sum; ans+=(c-sum)*buy[i]; } while(st<ed){ int x=q[st++]; ans-=now[x]*buy[x]; } printf("%I64d\n",ans);}int main(){ len[0]=len[1]=0; for(int i=2;i<MAXN;++i){ int k=0; while((1<<k)<=i)k++; len[i]=k-1; } int tt; scanf("%d",&tt); while(tt--){ work(); }}
^
0_0_20614584_31634.cpp:8:74: error: stray '#' in program
(y)?(x):(y))#define min(x,y) ((x)<(y)?(x):(y))#define P pair<int,int>#define LL long longusing namespace std; int a[MAXN];LL buy[MAXN],sell[MAXN];int len[MAXN];LL now[MAXN];int q[MAXN];void work(){ int st=0,ed=0; int n,c; scanf("%d%d",&n,&c); for(int i=1;i<=n;++i)scanf("%d",&a[i]); for(int i=0;i<=n;++i)scanf("%I64d%I64d",&buy[i],&sell[i]); now[0]=c; q[ed++]=0; LL ans=c*buy[0]; for(int i=1;i<=n;++i){ int dis=a[i]-a[i-1]; LL sum=c-dis; while(dis){ int x=q[st]; if(now[x]>dis){ now[x]-=dis; dis=0; }else{ dis-=now[x]; now[x]=0; st++; } } int era=0; while(st<ed){ int x=q[st]; if(buy[x]<sell[i]){ era+=now[x]; st++; }else break; } if(era!=0){ st--; now[q[st]]=era; buy[q[st]]=sell[i]; } bool flag=true; while(flag&&st<ed){ flag=false; int x=q[ed-1]; if(buy[x]>=buy[i]){ flag=true; ans-=now[x]*buy[x]; sum-=now[x]; now[x]=0; ed--; } } q[ed++]=i; now[i]=c-sum; ans+=(c-sum)*buy[i]; } while(st<ed){ int x=q[st++]; ans-=now[x]*buy[x]; } printf("%I64d\n",ans);}int main(){ len[0]=len[1]=0; for(int i=2;i<MAXN;++i){ int k=0; while((1<<k)<=i)k++; len[i]=k-1; } int tt; scanf("%d",&tt); while(tt--){ work(); }}
^
0_0_20614584_31634.cpp:8:8: error: expected constructor, destructor, or type conversion before '?' token
(y)?(x):(y))#define min(x,y) ((x)<(y)?(x):(y))#define P pair<int,int>#define LL long longusing namespace std; int a[MAXN];LL buy[MAXN],sell[MAXN];int len[MAXN];LL now[MAXN];int q[MAXN];void work(){ int st=0,ed=0; int n,c; scanf("%d%d",&n,&c); for(int i=1;i<=n;++i)scanf("%d",&a[i]); for(int i=0;i<=n;++i)scanf("%I64d%I64d",&buy[i],&sell[i]); now[0]=c; q[ed++]=0; LL ans=c*buy[0]; for(int i=1;i<=n;++i){ int dis=a[i]-a[i-1]; LL sum=c-dis; while(dis){ int x=q[st]; if(now[x]>dis){ now[x]-=dis; dis=0; }else{ dis-=now[x]; now[x]=0; st++; } } int era=0; while(st<ed){ int x=q[st]; if(buy[x]<sell[i]){ era+=now[x]; st++; }else break; } if(era!=0){ st--; now[q[st]]=era; buy[q[st]]=sell[i]; } bool flag=true; while(flag&&st<ed){ flag=false; int x=q[ed-1]; if(buy[x]>=buy[i]){ flag=true; ans-=now[x]*buy[x]; sum-=now[x]; now[x]=0; ed--; } } q[ed++]=i; now[i]=c-sum; ans+=(c-sum)*buy[i]; } while(st<ed){ int x=q[st++]; ans-=now[x]*buy[x]; } printf("%I64d\n",ans);}int main(){ len[0]=len[1]=0; for(int i=2;i<MAXN;++i){ int k=0; while((1<<k)<=i)k++; len[i]=k-1; } int tt; scanf("%d",&tt); while(tt--){ work(); }}
^
0_0_20614584_31634.cpp:8:121: error: 'MAXN' was not declared in this scope
(y)?(x):(y))#define min(x,y) ((x)<(y)?(x):(y))#define P pair<int,int>#define LL long longusing namespace std; int a[MAXN];LL buy[MAXN],sell[MAXN];int len[MAXN];LL now[MAXN];int q[MAXN];void work(){ int st=0,ed=0; int n,c; scanf("%d%d",&n,&c); for(int i=1;i<=n;++i)scanf("%d",&a[i]); for(int i=0;i<=n;++i)scanf("%I64d%I64d",&buy[i],&sell[i]); now[0]=c; q[ed++]=0; LL ans=c*buy[0]; for(int i=1;i<=n;++i){ int dis=a[i]-a[i-1]; LL sum=c-dis; while(dis){ int x=q[st]; if(now[x]>dis){ now[x]-=dis; dis=0; }else{ dis-=now[x]; now[x]=0; st++; } } int era=0; while(st<ed){ int x=q[st]; if(buy[x]<sell[i]){ era+=now[x]; st++; }else break; } if(era!=0){ st--; now[q[st]]=era; buy[q[st]]=sell[i]; } bool flag=true; while(flag&&st<ed){ flag=false; int x=q[ed-1]; if(buy[x]>=buy[i]){ flag=true; ans-=now[x]*buy[x]; sum-=now[x]; now[x]=0; ed--; } } q[ed++]=i; now[i]=c-sum; ans+=(c-sum)*buy[i]; } while(st<ed){ int x=q[st++]; ans-=now[x]*buy[x]; } printf("%I64d\n",ans);}int main(){ len[0]=len[1]=0; for(int i=2;i<MAXN;++i){ int k=0; while((1<<k)<=i)k++; len[i]=k-1; } int tt; scanf("%d",&tt); while(tt--){ work(); }}
^
0_0_20614584_31634.cpp:8:127: error: 'LL' does not name a type
(y)?(x):(y))#define min(x,y) ((x)<(y)?(x):(y))#define P pair<int,int>#define LL long longusing namespace std; int a[MAXN];LL buy[MAXN],sell[MAXN];int len[MAXN];LL now[MAXN];int q[MAXN];void work(){ int st=0,ed=0; int n,c; scanf("%d%d",&n,&c); for(int i=1;i<=n;++i)scanf("%d",&a[i]); for(int i=0;i<=n;++i)scanf("%I64d%I64d",&buy[i],&sell[i]); now[0]=c; q[ed++]=0; LL ans=c*buy[0]; for(int i=1;i<=n;++i){ int dis=a[i]-a[i-1]; LL sum=c-dis; while(dis){ int x=q[st]; if(now[x]>dis){ now[x]-=dis; dis=0; }else{ dis-=now[x]; now[x]=0; st++; } } int era=0; while(st<ed){ int x=q[st]; if(buy[x]<sell[i]){ era+=now[x]; st++; }else break; } if(era!=0){ st--; now[q[st]]=era; buy[q[st]]=sell[i]; } bool flag=true; while(flag&&st<ed){ flag=false; int x=q[ed-1]; if(buy[x]>=b
|
