HDU 6136 Death Podracing（优先队列+循环链表）

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int inf =(int)1e9+7;
struct node{
    int d,v,i;
}p[111111];
int pre[111111],nxt[111111];
bool cmp(const node &a,const node &b){return a.d<b.d;}
struct fs{
    int fm,fz;
    fs(){}fs(int _fz,int _fm){fz=_fz;fm=_fm;}
    bool operator < (const fs &a)const{return 1ll*fz*a.fm<1ll*a.fz*fm;}
    bool operator > (const fs &a)const{return 1ll*fz*a.fm>1ll*a.fz*fm;}
};
struct ban{
    int a,b;fs t;
    ban(){}ban(int _a,int _b,fs _t){a=_a;b=_b;t=_t;}
    bool operator < (const ban &x)const{return t>x.t;}
};

int n,l;
priority_queue<ban>q;
fs get_t(const node &a,const node &b){
    int dv=a.v-b.v,dd=b.d-a.d;
    if(dd<0)dd+=l;
    if(dv<0){
        dv=-dv;
        dd=l-dd;
    }
    if(dv==0)return fs(inf,1);
    int gg=__gcd(dv,dd);
    return fs(dd/gg,dv/gg);
}
int mark[111111];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){    
        scanf("%d%d",&n,&l);
        for(int i=0;i<n;i++)mark[i]=0;
        for(int i=0;i<n;i++)scanf("%d",&p[i].d),p[i].i=i;
        for(int i=0;i<n;i++)scanf("%d",&p[i].v);
        sort(p,p+n,cmp);
        for(int i=0;i<n;i++){
            nxt[i]=(i+1)%n;
            pre[i]=(i-1+n)%n;
            q.push(ban(i,nxt[i],get_t(p[i],p[nxt[i]])));
        }
        int rud=n;
        fs ans;
        while(!q.empty()){
            ban now=q.top();q.pop();
            if(mark[now.a]||mark[now.b])continue;
            rud--;
            if(rud==1){    
                ans=now.t;
                break;
            }
            if(p[now.a].i>p[now.b].i){
                mark[now.b]=1;
                nxt[now.a]=nxt[now.b];
                pre[nxt[now.a]]=now.a;
                q.push(ban(now.a,nxt[now.a],get_t(p[now.a],p[nxt[now.a]])));
            }
            else {
                mark[now.a]=1;
                pre[now.b]=pre[now.a];
                nxt[pre[now.b]]=now.b;
                q.push(ban(pre[now.b],now.b,get_t(p[now.b],p[pre[now.b]])));
            }
        }
        printf("%d/%d\n",ans.fz,ans.fm);
        while(!q.empty())q.pop();
    }
    return 0;
}