結果

問題 No.2739 Time is money
ユーザー hamathhamath
提出日時 2024-04-20 17:50:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,664 bytes
コンパイル時間 3,367 ms
コンパイル使用メモリ 237,248 KB
実行使用メモリ 43,956 KB
最終ジャッジ日時 2024-10-12 13:47:32
合計ジャッジ時間 9,007 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
10,496 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 113 ms
16,128 KB
testcase_03 WA -
testcase_04 AC 80 ms
15,616 KB
testcase_05 WA -
testcase_06 TLE -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 172 ms
24,192 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 179 ms
23,552 KB
testcase_15 TLE -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/functional:59,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:71,
                 from main.cpp:9:
In copy constructor 'std::function<_Res(_ArgTypes ...)>::function(const std::function<_Res(_ArgTypes ...)>&) [with _Res = bool; _ArgTypes = {std::pair<long long int, long long int>, std::pair<long long int, long long int>}]',
    inlined from 'std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = std::pair<long long int, long long int>; _Sequence = std::vector<std::pair<long long int, long long int> >; _Compare = std::function<bool(std::pair<long long int, long long int>, std::pair<long long int, long long int>)>]' at /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_queue.h:566:28,
    inlined from 'void dijkstra(const std::vector<std::vector<std::pair<long long int, long long int> > >&, ll, Vec&)' at main.cpp:97:6:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/std_function.h:391:17: warning: '<anonymous>' may be used uninitialized [-Wmaybe-uninitialized]
  391 |             __x._M_manager(_M_functor, __x._M_functor, __clone_functor);
      |             ~~~~^~~~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/std_function.h: In function 'void dijkstra(const std::vector<std::vector<std::pair<long long int, long long int> > >&, ll, Vec&)':
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/std_function.h:267:7: note: by argument 2 of type 'const std::_Any_data&' to 'static bool std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_manager(std::_Any_data&, const std::_Any_data&, std::_Manager_operation) [with _Res = bool; _Functor = dijkstra(const std::vector<std::vector<std::pair<long long int, long long int> > >&, ll, Vec&)::<lambda(P, P)>; _ArgTypes = {std::pair<long long i

ソースコード

diff # 

#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#endif

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<VP> VVP;
typedef vector<Vec> VV;
typedef vector<Vi> VVi;
typedef vector<Vc> VVc;
typedef vector<VV> VVV;
typedef vector<VVV> VVVV;
typedef vector<VVVV> VVVVV;
typedef vector<VVVV> VVVVVV;
#define MAKEVV(variable, a, ...) VV variable(a, Vec(__VA_ARGS__))
#define MAKEVVc(variable, a, ...) VVc variable(a,Vc(__VA_ARGS__))
#define MAKEVVV(variable, a, b, ...) VVV variable(a, VV(b, Vec(__VA_ARGS__)))
#define MAKEVVVV(variable, a, b, c, ...) VVVV variable(a, VVV(b, (VV(c, Vec(__VA_ARGS__)))))
#define MAKEVVVVV(variable, a, b, c, d, ...) VVVVV variable(a, VVVV(b, (VVV(c, VV(d, Vec(__VA_ARGS__))))))
#define MAKEVVVVVV(variable, a, b, c, d, e, ...) VVVVVV variable(a, VVVVV(b, (VVVV(c, VVV(d, VV(e, Vec(__VA_ARGS__)))))))

#define endl '\n'
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 4'000'000'000'000'000'010LL;
const ll MOD=998244353;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#define SUM(a) accumulate(ALL(a),0LL)
#define outminusone(a) cout<< ( a==INF ? -1 : a ) <<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T, class S>bool chmax(T &a, const S &b) { if (a<b) { a=b; return true; } return false; }
template<class T, class S>bool chmin(T &a, const S &b) { if (b<a) { a=b; return true; } return false; }
template<class T>auto lb(vector<T> &X, T x){return lower_bound(ALL(X),x) - X.begin();}
template<class T>auto ub(vector<T> &X, T x){return upper_bound(ALL(X),x) - X.begin();}
ll popcnt(ll x){return __builtin_popcount(x);}
ll topbit(ll t){return t==0?-1:63-__builtin_clzll(t);}
ll floor(ll y,ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return (y-x+1)/x;}return y/x;};
ll ceil(ll y, ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return y/x;}return (y+x-1)/x;};
auto hasbit = [](ll x, ll i )->bool{return (1LL<<i) & x;};//xにi番目のbitが立っているか

template<typename T1, typename T2>istream &operator>>(istream &i, pair<T1, T2> &p) { return i>>p.first>>p.second; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T1, typename T2>ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {bool f = false;for(const auto &d: v) {if(f) os<<" ";f = true;
//        #ifdef LOCAL
//            if(d == INF){os<<"X";}else if(d == -INF){os<<"-X";}else{os<<d;}
//        #else
//            os<<d;
//        #endif
        os<<d;
}return os;}
template <class T> ostream& operator<<(ostream& os, const set<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}
template <class T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}
template<class T, class U>ostream &operator<<(ostream &os, const map<T, U> &s) {bool f = false;os<<endl;for(auto p: s) {if(f) os<<endl;f = true;os<<p.first<<": "<<p.second;}return os<<endl;}
void out() { cout << endl; }
template <class Head, class... Tail> void out(const Head &head, const Tail &...tail) {cout << head;if(sizeof...(tail)) cout << ' ';out(tail...);}

#ifdef LOCAL
template<typename T>ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {int len=vv.size();for(int i=0; i<len; ++i) {if(i==0)s<<endl;s<<i<<":"<<vv[i];if(i!=len-1)s<<endl;}return s;}
struct PrettyOS {ostream& os;bool first;template <class T> auto operator<<(T&& x) {if (!first) os << ", ";first = false;os << x;return *this;}};
template <class... T> void dbg0(T&&... t) {(PrettyOS{cerr, true} << ... << t);}
#define dbg(...)do {cerr << #__VA_ARGS__ << ":  ";dbg0(__VA_ARGS__);cerr << endl;} while (false);
#else
#define dbg(...)
#endif

void dijkstra(const vector<VP> &g, ll start, Vec &dist) {
    priority_queue<P, vector<P>, function<bool(P, P)>> q([](P a, P b)->ll {
        return a.second > b.second;
    });
    dist[start] = 0;
    q.push(mp(start, 0));
    while (!q.empty()) {
        auto[now, d] = q.top();
        q.pop();
        if(dist[now] < d) continue;
        for(auto[nx, nd]: g[now]) {
            if(chmin(dist[nx], d+nd)) {
                q.emplace(nx, d+nd);
            }
        }
    }
}

using PP = pair<ll,pair<ll,ll>>;

int solve(){
    ll n;
    cin>>n;
    ll m;
    cin>>m;
    ll x;
    cin>>x;
    vector<vector<PP>> g(n);
    rep(i,m){
        ll u,v,c,t;
        cin>>u>>v>>c>>t;
        u--;v--;
        g[u].emplace_back(v,mp(t,c));
        g[v].emplace_back(u,mp(t,c));
    }

    VP dist(n,{INF,0});
    priority_queue<PP, vector<PP>, function<bool(PP, PP)>> q([](PP a, PP b)->ll {
        if(a.second.fi == b.second.fi){
            return a.se.se < b.se.se;
        }
        return a.second.fi > b.second.fi;
    });
    dist[0] = {0,0};
    q.push(mp(0, mp(0,0)));
    while (!q.empty()) {
        auto[now, p] = q.top();
        q.pop();
        auto [d, money] = p;
        if(dist[now].fi < d) continue;
        for(auto[nx, np]: g[now]) {
            auto [nd, nc] = np;
            ll ndist = d + nd;
            ll nokori = 0;
            if (money >= nc){
                nokori = money - nc;
            }else{
                ndist += ceil(nc - money, x);
                nokori = money + ceil(nc - money, x) * x - nc;
            }
            if(dist[nx].fi > ndist || dist[nx].se < nokori){
                dist[nx] = mp(ndist,nokori);
                q.emplace(nx, mp(ndist,nokori));
            }
        }
    }
    outminusone(dist[n-1].fi);
    return  0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(20);
//    ll T;
//    cin>>T;
//    while(T--)
    solve();
}
0