Language: C++

#include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<P> vp;
typedef vector<PL> vpl;
typedef vector<vector<P>> vvp;
typedef vector<vector<PL>> vvpl;
const int INF = 1001001001;
const ll LINF = 1e16;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for(ll i = (a); i < b; i++)
#define RFOR(i, a, b) for(ll i = (a); i > b; i--)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define RREP(i, n) for(ll i = n-1; i > -1; i--)
#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back

template <typename T>
T gcd(T a, T b) {
    return (a == 0) ? b : gcd(b%a, a);
}
template <typename T>
T lcm(T a, T b) {
    return a / gcd(a, b) * b;
}

bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};
bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};
bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};
bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};
template <typename T>
vector<T> uniquen(vector<T> vec){
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    return vec;
}

struct edge {ll to, cost;};

int main(){
    ll N, M, s, t; cin >> N >> M >> s >> t; s--; t--;
    const ll mx = 1e5+100;
    vector<edge> ed_jpy[mx], ed_snu[mx];
    REP(i, M){
        ll u, v, a, b; cin >> u >> v >> a >> b; u--; v--;
        ed_jpy[u].epb(v, a); ed_snu[u].epb(v, b);
        ed_jpy[v].epb(u, a); ed_snu[v].epb(u, b);
    }
//
//    vl dist_jpy(N, LINF);
//    priority_queue<PL,vector<PL>, greater<PL>> q;
//    dist_jpy[s] = 0; q.push({0,s});
//    while(!q.empty()){
//        auto qq = q.top(); q.pop();
//        ll now = qq.ss, dist = - qq.ff;
//        if(dist > dist_jpy[now]) continue;
//        for(auto& e : ed_jpy[now]){
//            if(dist_jpy[e.to] > dist + e.cost){
//                dist_jpy[e.to] = dist + e.cost;
//                q.emplace( - dist_jpy[e.to], e.to);
//            }
//        }
//    }
//
//    vl dist_snu(N, LINF);
//    priority_queue<PL,vector<PL>, greater<PL>> qs;
//    dist_snu[t] = 0; qs.push({0,t});
//    while(!qs.empty()){
//        auto qq = qs.top(); qs.pop();
//        ll now = qq.ss, dist = - qq.ff;
//        if(dist > dist_snu[now]) continue;
//        for(auto& e : ed_snu[now]){
//            if(dist_snu[e.to] > dist + e.cost){
//                dist_snu[e.to] = dist + e.cost;
//                qs.emplace(- dist_snu[e.to], e.to);
//            }
//        }
//    }
//
//    map<ll, ll> ans;
//    REP(x, N){
//        ll d = dist_jpy[x] + dist_snu[x];
//        ans[d] = max(ans[d], x+1);
//    }
//    ll year = 0;
//    FORMAP(it, ans){
//        if(year == N) break;
//        ll dist = 1e15-it->ff;
//        ll ye = it->ss;
//        while(year < ye){
//            cout << dist << endstr;
//            year++;
//        }
//    }
    return 0;
}


Compiler output:
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/c++allocator.h:33,
                 from /usr/include/c++/14/bits/allocator.h:46,
                 from /usr/include/c++/14/vector:63,
                 from a.cc:1:
/usr/include/c++/14/bits/new_allocator.h: In instantiation of 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = edge; _Args = {long long int&, long long int&}; _Tp = edge]':
/usr/include/c++/14/bits/alloc_traits.h:575:17:   required from 'static void std::allocator_traits<std::allocator<_Tp1> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = edge; _Args = {long long int&, long long int&}; _Tp = edge; allocator_type = std::allocator<edge>]'
  575 |           __a.construct(__p, std::forward<_Args>(__args)...);
      |           ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/vector.tcc:117:30:   required from 'std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {long long int&, long long int&}; _Tp = edge; _Alloc = std::allocator<edge>; reference = edge&]'
  117 |             _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118 |                                      std::forward<_Args>(__args)...);
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:84:22:   required from here
   84 |         ed_jpy[u].epb(v, a); ed_snu[u].epb(v, b);
      |         ~~~~~~~~~~~~~^~~~~~
/usr/include/c++/14/bits/new_allocator.h:191:11: error: new initializer expression list treated as compound expression [-fpermissive]
  191 |         { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); }
      |           ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/new_allocator.h:191:11: error: no matching function for call to 'edge::edge(long long int&)'
a.cc:76:8: note: candidate: 'edge::edge()'
   76 | struct edge {ll to, cost;};
      |        ^~~~
a.cc:76:8: note:   candidate expects 0 arguments, 1 provided
a.cc:76:8: note: candidate: 'constexpr edge::edge(const edge&)'
a.cc:76:8: note:   no known conversion for argument 1 from 'long long int' to 'const edge&'
a.cc:76:8: note: candidate: 'constexpr edge::edge(edge&&)'
a.cc:76:8: note:   no known conversion for argument 1 from 'long long int' to 'edge&&'