Language: C++

#include<bits/stdc++.h>
//using namespace std;
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(ll)(key)))
#define pb push_back
#define mp std::make_pair
#define endl "\n"
using std::cin;
using std::cout;
using std::vector;
using std::string;
using std::upper_bound;
using std::lower_bound;
using vi=vector<ll>;
using vii=vector<vi>;
using pii=std::pair<ll,ll>;
const ll MOD=1e9+7;
//const ll MOD=998244353;
//const ll MOD=100000;
const ll MAX=1e7;
const ll INF=(1ll<<60);
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
/*struct Binary_indexed_tree{
    int N;
    vi bit;
    Binary_indexed_tree(int n):N(n){
        bit.resize(N+1,0);
    }
    void add(int x,int a){
        for(x;x<=N;x+=(x&-x)) bit[x]+=a;
    }
    ll sum(int x){
        ll ret=0;
        for(x;x>0;x-=(x&-x)) ret+=bit[x];
        return ret;
    }
};
struct Union_Find{
    ll N;
    vi par;
    vi siz;
    Union_Find(int n):N(n){
        par.resize(N);
        siz.resize(N,1);
        rep(i,0,N) par[i]=i;
    }
    ll root(ll X){
        if(par[X]==X) return X;
        return par[X]=root(par[X]);
    }
    bool same(ll X,ll Y){
        return root(X)==root(Y);
    }
    void unite(ll X,ll Y){
        X=root(X);
        Y=root(Y);
        if(X==Y) return;
        par[X]=Y;
        siz[Y]+=siz[X];
        siz[X]=0;
    }
    ll size(ll X){
        return siz[root(X)];
    }
};
ll modpow(ll X,ll Y){
    ll sum=X,cnt=1;
    vi A;
    while(cnt<=Y){
        A.pb(sum);
        sum*=sum;
        sum%=MOD;
        cnt*=2;
    }
    int M=A.size();
    ll ret=1;
    REP(i,1,M){
        if(Y>=(1ll<<M-i)){
            Y-=(1ll<<M-i);
            ret*=A[M-i];
            ret%=MOD;
        }
    }
    return ret;
}
ll fac[MAX],finv[MAX],inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
ll COM(ll n,ll r){
    if(n<r||n<0||r<0) return 0;
    return fac[n]*finv[r]%MOD*finv[n-r];
}*/
signed main(){
    #pragma GCC target("avx2")
    #pragma GCC optimize("O3")
    #pragma GCC optimize("unroll-loops")
    ll N,M,S; scanf("%lld %lld %lld\n",&N,&M,&S);
    const ll max=2500;
    vector<vector<std::pair<ll,pii>>> edge(N);
    rep(i,0,M){
        ll A,B,C,D; scanf("%lld %lld %lld %lld\n",&A,&B,&C,&D);
        edge[A-1].pb(mp(B-1,mp(C,D)));
        edge[B-1].pb(mp(A-1,mp(C,D)));
    }
    vi C(N),T(N);
    rep(i,0,N) cin>>C[i]>>T[i];
    vector<vii> dp(N,vii(N,vi(max+1,INF)));
    dp[0][0][0]=0;
    vi ans(N,INF);
    prique<std::pair<pii,pii>> que;
    que.push(mp(mp(0,0),mp(0,0)));
    while(!que.empty()){
        ll X=que.top().second.first,Y=que.top().second.second,A=que.top().first.first,B=que.top().first.second;
        que.pop();
        ll x=std::max(0ll,B-S);
        ans[X]=std::min(ans[X],(x+C[Y]-1)/C[Y]*T[Y]+A);
        if(dp[X][Y][B]<A) continue;
        rep(i,0,edge[X].size()){
            ll Z=edge[X][i].first,coin=edge[X][i].second.first+B,time=edge[X][i].second.second+A;
            if(coin>max){
                continue;
            }
            if(dp[Z][Y][coin]>time){
                dp[Z][Y][coin]=time;
                que.push(mp(mp(time,coin),mp(Z,Y)));
            }
        }
        if(B>S){
            A+=(B-S+C[Y]-1)/C[Y]*T[Y];
            B=S;
        }
        Y=X;
        if(dp[X][Y][B]<=A) continue;
        dp[X][Y][B]=A;
        rep(i,0,edge[X].size()){
            ll Z=edge[X][i].first,coin=edge[X][i].second.first+B,time=edge[X][i].second.second+A;
            if(coin>max){
                continue;
            }
            if(dp[Z][Y][coin]>time){
                dp[Z][Y][coin]=time;
                que.push(mp(mp(time,coin),mp(Z,Y)));
            }
        }
    }
    rep(i,1,N) cout<<ans[i]<<endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:108:13: error: '#pragma GCC option' is not allowed inside functions
  108 |     #pragma GCC target("avx2")
      |             ^~~
a.cc:109:13: error: '#pragma GCC optimize' is not allowed inside functions
  109 |     #pragma GCC optimize("O3")
      |             ^~~
a.cc:110:13: error: '#pragma GCC optimize' is not allowed inside functions
  110 |     #pragma GCC optimize("unroll-loops")
      |             ^~~