【CodeForces】【311C】Fetch the Treasures

最短路

---

　　神题一道……

 //CF 311C
 #include<queue>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #define rep(i,n) for(int i=0;i<n;++i)
 #define F(i,j,n) for(int i=j;i<=n;++i)
 #define D(i,j,n) for(int i=j;i>=n;--i)
 #define pii pair<int,int>
 #define mk make_pair
 using namespace std;
 typedef long long LL;
 LL getint(){
     LL v=,sign=; char ch=getchar();
     while(ch<''||ch>'') {if (ch=='-') sign=-; ch=getchar();}
     while(ch>=''&&ch<='') {v=v*+ch-''; ch=getchar();}
     return v*sign;
 }
 const int N=,INF=~0u>>;
 /*******************tamplate********************/
 priority_queue<pii >H;
 LL a[N],d[N],data[],z;
 int n,m,k,x,y,L,ed[],f[N*],c[N];
 bool b[N];

 void add(){
     z=getint();
     data[++L]=z/k; ed[L]=z%k;
     int h=,t=; rep(i,k) f[++t]=i;
     while(h<t){
         x=f[++h],b[x]=;
         F(i,,L){
             y=x+ed[i],z=d[x]+data[i]; if(y>=k) y-=k,z++;
             if (z<d[y]) {d[y]=z;if(!b[y]) b[y]=,f[++t]=y;}
         }
     }
     while(!H.empty()) H.pop();
     F(i,,n)
         if(d[a[i]%k]<=a[i]/k && c[i]) H.push(mk(c[i],-i));
 }
 void dec(){
     x=getint(); y=getint();c[x]-=y;
     if (d[a[x]%k]<=a[x]/k) H.push(mk(c[x],-x));
 }
 void pop(){
     while(){
         if(H.empty()){puts("");return;}
         pii o=H.top(); H.pop(); x=-o.second,y=o.first;
         if (c[x]==y) {printf("%d\n",y),c[x]=; return;}
     }
 }
 int main(){
 #ifndef ONLINE_JUDGE
     freopen("input.txt","r",stdin);
 //    freopen("output.txt","w",stdout);
 #endif
     getint(); n=getint();
     m=getint(); k=getint();
     memset(d,,sizeof d); d[]=;
     F(i,,n){
         a[i]=getint(); c[i]=getint();
         if (a[i]%k==) H.push(mk(c[i],-i));
     }
     int ch;
     F(i,,m){
         ch=getint();
         if (ch==) add();
         else if(ch==) dec();
         else pop();
     }
     return ;
 }