luogu 2827 NOIP2016蚯蚓

luogu 2827 NOIP2016蚯蚓

​​N 11000000#define inf 0x3f3f3f3fusing namespace std;inline char gc(){ static char now[1<<16],*S,*T; if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;} return *S++;}inline int read(){ int x=0,f=1;char ch=gc(); while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=gc();} while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();} return x*f;}inline bool cmp(int a,int b){return a>b;}int op[4],cl[4],q[4][N],qq,n,m,u,v,t;inline int get(){ int id=0,tmp=-inf; for (int i=1;i<=3;++i){if (op[i]<=cl[i]&&q[i][op[i]]>tmp){tmp=q[i][op[i]];id=i;}} op[id]++;return tmp;}int main(){ freopen("2827.in","r",stdin); n=read();m=read();qq=read();u=read();v=read();t=read(); for (int i=1;i<=n;++i) q[2][i]=read(); sort(q[2]+1,q[2]+n+1,cmp);int step=0;op[2]=1;cl[2]=n;op[1]=1;op[3]=1;cl[1]=0;cl[3]=0; for (int i=1;i<=m;++i){ int x=get()+step; if (i%t==0) printf("%d,x);step+=qq; int xx=(double)u*x/v,yy=x-xx;xx-=step;yy-=step; if (xx>yy)q[1][++cl[1]]=xx,q[3][++cl[3]]=yy;else q[3][++cl[3]]=xx,q[1][++cl[1]]=yy; }int num=0;printf("\n"); while (1){bool flag=0;++num; for (int i=1;i<=3;++i){ if (op[i]<=cl[i]) flag=1; }int tmp=get();if (!flag) break; if (num%t==0) printf("%d,tmp+step); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。