poj 2274

 

The Race

Time Limit: 15000MS		Memory Limit: 65536K
Total Submissions: 2380		Accepted: 460
Case Time Limit: 3000MS

Description

During the Annual Interstellar Competition for Tuned Spaceships, N spaceships will be competing. Each spaceship i is tuned in such a way that it can accelerate in zero time to its maximum speed Vi and remain cruising at that speed. Due to past achievements, each spaceship starts at a starting position Xi, specifying how many kilometers the spaceship is away from the starting line. 
The race course is infinitely long. Because of the high speeds of the spaceships, the race course goes straight all the time. On that straight course, spaceships can pass one another very easily, without interfering with each other. 
Many people in the audience have not realized yet that the outcome of the race can be determined in advance. It is your task to show this to them, by telling them how many times spaceships will pass one another, and by predicting the first 10 000 times that spaceships pass in chronological order. 
You may assume that each spaceship starts at a different position. Furthermore, there will never be more than two spaceships at the same position of the course at any time. 

Input

The first line of the input specifies the number of spaceshipsN (0 < N <= 250 000) that are competing. Each of the next N lines describe the properties of one spaceship. The i+1th line describes the ith ship with two integers Xi and Vi, representing the starting position and the velocity of the ith spaceship (0 <= Xi <= 1 000 000, 0 < Vi < 100). The spaceships are ordered according to the starting position, i.e. X1 < X2 < . . . < XN. The starting position is the number of kilometers past the starting line where the spaceship starts, and the velocity is given in kilometers per second.

Output

The first line of the output should contain the number of times that spaceships pass one another during the race modulo 1 000 000. By publishing the number of passes only modulo 1 000 000, you can at the same time prove your knowledge of it and don't spoil the party for the less intelligent people in the audience.
Each of the subsequent lines should represent one passing, in chronological order. If there would be more than 10 000 passings, only output the first 10 000 passings. If there are less than 10 000 passings, output all passings. Each line should consist of two integers i and j, specifying that spaceship i passes spaceship j. If multiple passings occur at the same time, they have to be sorted by their position on the course. This means that passings taking place closer to the starting line must be listed first. The time of a passing is the time when the two spaceships are at the same position.

Sample Input

4 0 2 2 1 3 8 6 3

Sample Output

2 3 4 1 2

Source

CEOI 2003

分析：本题纯粹练排序，用归并求第一个解，用堆求第二个解。。。具体很水，就是实现起来太麻烦~~~

            最郁闷的是，因为没有特判出现n=1的情况，浪费一天啊~~~哭死我了

#include <stdio.h> const int mn=250002; const int mm=10001; struct data1 { int v,p; } car[mn],tt[mn]; struct data2 { int a,b; } outdata[mm]; struct gg { double t,p; } w[mn]; int p[mn],d[mn],s[mn],n,nn,ans; inline void get(int& a) { char ch=getchar(); while (ch<'0'||ch>'9') ch=getchar(); for (a=0; ch>='0'&&ch<='9'; ch=getchar()) a=a*10+ch-48; } void out(int a) { if(a>=10)out(a/10); putchar(a%10+'0'); } inline void swap(int &a,int &b) { int c=a; a=b; b=c; } inline void downsift(int k) { int i=k,j; while(i<=nn>>1) { j=i<<1; if((j<nn)&&(w[j].t>w[j+1].t||(w[j].t==w[j+1].t&& w[j].p>w[j+1].p)))++j; if(w[i].t>w[j].t||(w[i].t==w[j].t&& w[i].p>w[j].p)) { w[0]=w[i]; w[i]=w[j]; w[j]=w[0]; swap(p[i],p[j]),d[p[i]]=i,d[p[j]]=j; i=j; } else return; } } inline void upsift(int k) { int i=k,j; while(i>1) { j=i>>1; if(w[i].t<w[j].t||(w[i].t==w[j].t&&w[i].p<w[j].p)) { w[0]=w[i]; w[i]=w[j]; w[j]=w[0]; swap(p[i],p[j]),d[p[i]]=i,d[p[j]]=j; i=j; } else return; } } void mergesort(int l,int r) { int i,j,k,m=(l+r)>>1,g=0; if(l<m)mergesort(l,m); if(m+1<r)mergesort(m+1,r); for(i=l,j=m+1,k=l; k<=r; ++k) { if(i>m)tt[k]=car[j++]; else if(j>r)tt[k]=car[i++],ans=(ans+g)%1000000; else if(car[i].v>car[j].v)tt[k]=car[j++],++g; else tt[k]=car[i++],ans=(ans+g)%1000000; } for(k=l; k<=r; ++k)car[k]=tt[k]; } inline void count(int a,int b,int x) { if(car[a].v<=car[b].v) { w[x].t=1e300; w[x].p=1e300; return; } w[x].t=(double)(car[b].p-car[a].p)/(car[a].v-car[b].v); w[x].p=(double)(car[a].v*car[b].p-car[a].p*car[b].v)/(car[a].v-car[b].v); } int main(int argc, char* argv[]) { int i,k,tot=0; get(n); for(i=1; i<=n; ++i)get(car[i].p),get(car[i].v),s[i]=i; ans=0; if(n>1) { nn=n-1; for(i=1; i<n; ++i)count(i,i+1,i),p[i]=d[i]=i; for(i=nn>>1; i>0; --i)downsift(i); while(1) { if(w[1].t==1e300)break; k=p[1]; outdata[++tot].a=s[k]; outdata[tot].b=s[k+1]; if(tot==10000)break; swap(s[k],s[k+1]); w[1].t=1e300; w[1].p=1e300; downsift(1); if(k-1>0) { count(s[k-1],s[k],d[k-1]); downsift(d[k-1]); upsift(d[k-1]); } if(k+1<n) { count(s[k+1],s[k+2],d[k+1]); downsift(d[k+1]); upsift(d[k+1]); } } if(w[1].t!=1e300)mergesort(1,n); else ans=tot; } out(ans);putchar('/n'); for(i=1; i<=tot; ++i)out(outdata[i].a),putchar(' '),out(outdata[i].b),putchar('/n');; return 0; }