Language: C++

#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
    long long c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
long long po(long a, long b){
    if(b==0){
        return 1;
    }
    
    long long z = po(a,b/2);
    z = mod(z*z);
    if(b%2!=0){
        z = mod(a*z);
    }
    return z;
}
 
bool prime_(int n){
  if(n==1){
    return false;
  }else if(n==2){
    return true;
  }else{
    for(int i=2;i<=std::sqrt(n);i++){
      if(n%i==0){
        return false;
      }
    }
    return true;
  }
}
 
long long gcd_(long long a, long long b){
  if(a<b){
    std::swap(a,b);
  }
  if(a%b==0){
    return b;
  }else{
    return gcd_(b,a%b);
  }
}
 
long long lcm_(long long x, long long y){
  return (x/gcd_(x,y))*y;
}
 
using namespace std;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;

struct edge {
    long long to, cost;
};

typedef pair<long long, long long> P;

void dijkstra(long long s, vector<vector<edge>>& G, vector<long long>& d) {//始点、隣接リスト、距離を渡す
    priority_queue<P, vector<P>, greater<P>> que;
    d[s] = 0;
    que.push(P(0, s));
    while (!que.empty()) {
        P p = que.top();
        que.pop();
        long long v = p.second;
        if (d[v] < p.first) continue;
        for (long long i = 0; i < G[v].size(); i++) {
            edge e = G[v][i];
            if (d[e.to] > d[v] + e.cost) {
                d[e.to] = d[v] + e.cost;
                que.push(P(d[e.to], e.to));
            }
        }
    }
}

vector<edge> G[60 * 2501];
vector<long long> dist(60 * 2501, INF);

int main(){
  
  int n, m, s;
  cin>>n>>m>>s;
  int u[m], v[m], a[m], b[m];
  REP(i, m){
    cin>>u[i]>>v[i]>>a[i]>>b[i];
    u[i]--;v[i]--;
    REP(silver, 2501){
      if(silver == 2500){
        G[u[i] * 2501 + silver].push_back({v[i] * 2501 + silver, b[i]});
        G[v[i] * 2501 + silver].push_back({u[i] * 2501 + silver, b[i]});
      }else{
        if(silver - a[i] < 0) continue;
        G[u[i] * 2501 + silver].push_back({v[i] * 2501 + silver - a[i], b[i]});
        G[v[i] * 2501 + silver].push_back({u[i] * 2501 + silver - a[i], b[i]});
      }
    }
  }
  int c[n], d[n];
  REP(i, n) cin>>c[i]>>d[i];
  REP(state, n * 2501){
    int i = state / 2501;
    int silver = state % 2501;
    if(silver == 2500) continue;
    int ns = silver + c[i];
    ns = min(ns, 2500);
    G[state].push_back({i * 2501 + ns, d[i]});
  }
  
  int start = 0 + min(s, 2500);
  dijkstra(start, G, dist);
  vector<long long> ans(n, INF);
  REP(state, n * 2501){
    int i = state / 2501;
    int silver = state % 2501;
    ans[i] = min(ans[i], dist[state]);
  }
  REP(i, n){
    if(i == 0) continue;
    cout << ans[i] <<endl; 
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:128:19: error: invalid initialization of reference of type 'std::vector<std::vector<edge> >&' from expression of type 'std::vector<edge> [150060]'
  128 |   dijkstra(start, G, dist);
      |                   ^
a.cc:75:50: note: in passing argument 2 of 'void dijkstra(long long int, std::vector<std::vector<edge> >&, std::vector<long long int>&)'
   75 | void dijkstra(long long s, vector<vector<edge>>& G, vector<long long>& d) {//始点、隣接リスト、距離を渡す
      |                            ~~~~~~~~~~~~~~~~~~~~~~^