結果

問題 No.2739 Time is money
ユーザー みしあみしあ
提出日時 2024-04-23 01:29:57
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 413 ms / 2,000 ms
コード長 10,751 bytes
コンパイル時間 9,099 ms
コンパイル使用メモリ 343,552 KB
実行使用メモリ 51,672 KB
最終ジャッジ日時 2024-04-23 01:30:17
合計ジャッジ時間 15,336 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 151 ms
21,836 KB
testcase_03 AC 310 ms
38,452 KB
testcase_04 AC 139 ms
20,992 KB
testcase_05 AC 214 ms
27,588 KB
testcase_06 AC 279 ms
32,308 KB
testcase_07 AC 413 ms
51,672 KB
testcase_08 AC 404 ms
51,316 KB
testcase_09 AC 400 ms
50,816 KB
testcase_10 AC 280 ms
33,748 KB
testcase_11 AC 392 ms
50,840 KB
testcase_12 AC 373 ms
51,080 KB
testcase_13 AC 380 ms
51,076 KB
testcase_14 AC 323 ms
51,084 KB
testcase_15 AC 234 ms
37,272 KB
testcase_16 AC 238 ms
40,540 KB
testcase_17 AC 385 ms
46,652 KB
testcase_18 AC 377 ms
46,656 KB
testcase_19 AC 262 ms
37,668 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region Macros
#if defined(ONLINE_JUDGE)
#include <atcoder/all>
#endif
#if defined(LOCAL) || defined(_DEBUG)
#include "template.hpp"
#else
#include <bits/stdc++.h>
#include <boost/format.hpp>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define O(...)
#define OP(...)
#define START()
#define STOP()
#define MEMORY()
#define massert(x, msec) if(!(x)) {\
    while(msec > chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now() - _MY_START_TIME).count()); \
    cerr << "assert [" << __FUNCTION__ << ":" << to_string(__LINE__) << "] : " << string(#x) << el; exit(1);\
}
/******************************************* マクロ等 **************************************************/
#define REP(i, n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(ll i=(n); i>=0; --i)
#define FOR(i, n, m) for(ll i=(m), i##_len=(n); i<i##_len; ++i)
#define EACH(i, v) for(auto&& i : v)
#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
#define FILL(v, h) memset((v), h, sizeof(v))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
vector<long long> __FREP_CNT_ARRAY;
#define FREP(i, n) ;__FREP_CNT_ARRAY.push_back(n); REP(i, n) {
#define FREPR(i, n) ;__FREP_CNT_ARRAY.push_back((n)+1); REPR(i, n) {
#define FFOR(i, n, m) ;__FREP_CNT_ARRAY.push_back((n)-(m)); FOR(i, n, m) {
#define FEACH(a, as) ;__FREP_CNT_ARRAY.push_back((as).size()); EACH(a, as) {
#define THEN __FREP_CNT_ARRAY.back()--;} if(bool frep_tmp = !__FREP_CNT_ARRAY.back(); __FREP_CNT_ARRAY.pop_back(), frep_tmp)
#define DPINIT(name) name; bool __SEEN_##name;
#define DP(name) name;if(__SEEN_##name)return name;__SEEN_##name=true;
template<class T, class U>bool chmax(T &a, const U &b) { if (a<(T)b) { a=(T)b; return 1; } return 0; }
template<class T, class U>bool chmin(T &a, const U &b) { if (b<(T)a) { a=(T)b; return 1; } return 0; }
#define cmp3(a, x, b) ((a) <= (x) && (x) < (b))
#define vec vector
#define umap unordered_map
#define uset unordered_set
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<ll, ll>;
using Tup = tuple<ll, ll, ll>;
using vl = vec<ll>;
using vvl = vec<vl>;
#define fi first
#define se second
#define pb push_back
#define el '\n'
constexpr ll INF = numeric_limits<ll>::max()/4-1;
/******************************************* 入力 **************************************************/
template<class T> istream &operator>>(istream &stream, vec<T>& o){REP(i, o.size())stream >> o[i];return stream;}
template<class T, class U> istream &operator>>(istream &stream, pair<T, U>& o){cin >> o.fi >> o.se; return stream;}
namespace myinput {
    void input() {}
    template<class T, class... Ts> void input(T&& o, Ts&&... args){cin >> o;input(forward<Ts>(args)...);}
    void assign_vl(size_t) {};
    template<class T, class... Ts> void assign_vl(size_t siz, T&& o, Ts&&... args){o.resize(siz);assign_vl(siz, forward<Ts>(args)...);}
    void input_horizon_sub(size_t) {};
    template<class T, class... Ts> void input_horizon_sub(size_t index, T&& o, Ts&&... args) {cin>>o[index];input_horizon_sub(index, forward<Ts>(args)...);}
    template<class... Ts> void input_horizon(size_t siz, Ts&&... args){REP(i, siz) input_horizon_sub(i, forward<Ts>(args)...);}
}
#define _I(T, ...) ;myinput::input(__VA_ARGS__);
#define I(T, ...) ;T __VA_ARGS__;_I(T, __VA_ARGS__);
#define _Iv(T, siz, ...) ;myinput::assign_vl(siz, __VA_ARGS__);myinput::input(__VA_ARGS__);
#define Iv(T, siz, ...) ;vec<T> __VA_ARGS__;_Iv(T, siz, __VA_ARGS__);
#define _Ih(T, siz, ...) ;myinput::assign_vl(siz, __VA_ARGS__);myinput::input_horizon(siz, __VA_ARGS__);
#define Ih(T, siz, ...) ;vec<T> __VA_ARGS__;_Ih(T, siz, __VA_ARGS__);
chrono::system_clock::time_point _MY_START_TIME;
/******************************************* 出力 **************************************************/
namespace __PrintHelper {
    template <char Separator = ' ', typename T>
    void printValue(std::ostream& os, const T& value) { os << value; }
    template <char Separator = ' ', typename T1, typename T2>
    void printValue(std::ostream& os, const std::pair<T1, T2>& value) { os << value.first << Separator << value.second; }
    template <char Separator = ' ', typename... Args, std::size_t... Is>
    void printTuple(std::ostream& os, const std::tuple<Args...>& value, std::index_sequence<Is...>) { ((os << (Is == 0 ? "" : string(1, Separator)) << std::get<Is>(value)), ...); }
    template <char Separator = ' ', typename... Args>
    void printValue(std::ostream& os, const std::tuple<Args...>& value) { printTuple<Separator>(os, value, std::index_sequence_for<Args...>{}); }
    template <char Separator = ' ', typename T>
    void printValue(std::ostream& os, const std::vector<T>& value) { for (std::size_t i = 0; i < value.size(); ++i) os << (i == 0 ? "" : string(1, Separator)) << value[i]; }
};
template <char Separator = ' ', typename Arg, typename... Args>
void OO(const Arg &x, const Args&... args) {
    __PrintHelper::printValue<Separator>(cout, x);
    if constexpr (sizeof...(args) > 0) {
        cout << Separator;
        OO<Separator>(args...);
    }
    else { cout << el; }
}
#define YN_1(b) {cout << ((b) ? "Yes" : "No") << el;}
#define YN_3(b, y, n) {if(b) cout << (y) << el; else cout << (n) << el;}
#define GET_MACRO(_1,_2,_3,NAME,...) NAME
#define YN(...) GET_MACRO(__VA_ARGS__, YN_3, _, YN_1)(__VA_ARGS__)
#define YNc(d, i, n) YN((d).contains(i), d.at(i), n);
/******************************************* 配列操作 **************************************************/
namespace __ArrayHelper {
    template <typename... Args>
    auto flatten(const std::tuple<Args...>& t);
    template <typename T, std::size_t... Indices>
    auto flattenHelper(const T& t, std::index_sequence<Indices...>) { return std::make_tuple(std::get<Indices>(t)...); }
    template <typename T, typename U>
    auto flatten(const std::pair<T, U>& p) { return flatten(std::make_tuple(p.first, p.second)); }
    template <typename T>
    auto flatten(const T& value) { return std::make_tuple(value); }
    template <typename... Args, std::size_t... Indices>
    auto flattenTupleHelper(const std::tuple<Args...>& t, std::index_sequence<Indices...>) { return std::tuple_cat(flatten(std::get<Indices>(t))...); }
    template <typename... Args>
    auto flatten(const std::tuple<Args...>& t) { return flattenTupleHelper(t, std::index_sequence_for<Args...>{}); }
    template <typename Container>
    auto __flatten(const Container& container) {
        using ValueType = typename Container::value_type;
        using ResultType = decltype(__ArrayHelper::flatten(std::declval<ValueType>()));
        std::vector<ResultType> result;
        for (const auto& item : container) { result.emplace_back(__ArrayHelper::flatten(item)); }
        return result;
    }
    template <class T>
    auto __enumrate(const vec<T> &v) {
        vec<pair<ll, T>> ret(v.size());
        REP(i, v.size()) ret[i] = {i, v[i]};
        return ret;
    }
}
constexpr auto flatten = [](auto&& x) { return __ArrayHelper::__flatten(x); };
constexpr auto enumrate = [](auto&& x) { return __ArrayHelper::__enumrate(x); };
template <typename... Args>
auto zip(const Args&... args) {
    size_t minSize = std::min({args.size()...});
    std::vector<std::tuple<typename Args::value_type...>> result;
    for (size_t i = 0; i < minSize; ++i) { result.emplace_back(std::make_tuple(args[i]...)); }
    return result;
}
template <typename Arg>
Arg compose(Arg arg) { return arg; }
template <typename Arg, typename Func>
auto compose(Arg arg, Func func) { return func(arg); }
template <typename Arg, typename Func, typename... Funcs>
auto compose(Arg arg, Func func, Funcs... funcs) { return compose(compose(arg, func), funcs...); }
/******************************************* Main **************************************************/
#endif
#pragma endregion
using Point = complex<ll>;
void Main();

int main(){
    _MY_START_TIME = std::chrono::system_clock::now();
    std::cin.tie(nullptr);
    std::cout << std::fixed << std::setprecision(15);
    std::cerr << std::fixed << std::setprecision(15);
    Main();
    MEMORY();
    return 0;
}

#pragma region graph
struct edge{
    ll from, to, cost;
    bool operator<(const edge& r) const{return cost<r.cost;}
    bool operator>(const edge& r) const{return cost>r.cost;}
};
struct graph{
    ll V;
    vector<vector<edge> > G;
    ll height, width;
    graph(ll n){ init(n); }
    graph(ll n, vl &as, vl &bs, bool isDiedge = false) { vl t; graph(n, as, bs, t, isDiedge); }
    graph(ll n, vl &as, vl &bs, vl &cs, bool isDiedge = false) {
        const ll m = max({as.size(), bs.size(), cs.size()}); init(n);
        if(isDiedge) REP(i, m) add_diedge(as[i]-1, bs[i]-1, cs[i]);
        else         REP(i, m) add_edge(as[i]-1, bs[i]-1, cs[i]);
    }
    void init(ll n){
        V = n;
        G.resize(V);
    }
    // 無向グラフ
    void add_edge(ll s, ll t, ll cost = 1){
        add_diedge(s, t, cost);
        add_diedge(t, s, cost);
    }
    void add_edge(Point s, Point t, ll cost = 1) { add_edge(pos(s), pos(t), cost); }
    // 有向グラフ
    void add_diedge(ll s, ll t, ll cost = 1){
        if(s < 0 || t < 0 || s >= V || t >= V) return;
        G[s].push_back({s, t, cost});
    }
    void add_diedge(Point s, Point t, ll cost = 1) { add_diedge(pos(s), pos(t), cost); }
    ll pos(ll y, ll x) { return ((0 <= y && y < height && 0 <= x && x < width) ? y*width + x : -1); }
    ll pos(Point p) { return pos(p.real(), p.imag()); }
    auto pos2d(ll h, ll w){ height = h; width = w; }
    int size() { return V; }
};
#pragma endregion

// O(|E|log|V|)
pair<umap<ll, ll>, vector<ll>> dijkstra(const graph& g, ll s){
    vector<ll> d(g.V, INF), prev(g.V, -1);
    umap<ll, ll> ret;
    ret[s] = d[s] = 0;
    priority_queue<P,vector<P>, greater<P>> que;
    que.push({0, s});
    while(!que.empty()){
        auto [c, v] = que.top(); que.pop();
        if(d[v]<c) continue;
        for(auto e : g.G[v]){
            if(d[e.to]>d[v]+e.cost){
                ret[e.to] = d[e.to] = d[v]+e.cost;
                prev[e.to] = v;
                que.push({d[e.to],e.to});
            }
        }
    }
    return {ret, prev};
}
vector<ll> get_path(const vector<ll> &prev, ll t) {
    vector<ll> path;
    for (int cur = t; cur != -1; cur = prev[cur]) {
        path.push_back(cur);
    }
    reverse(path.begin(), path.end());
    return path;
}

int xyz[100][100];

void Main() {
    I(ll, n, m, x);
    Ih(ll, m, us, vs, cs, ts);
    vl costs(m);
    REP(i, m) costs[i] = cs[i] + ts[i] * x;
    graph g(n, us, vs, costs);
    auto [d, _] = dijkstra(g, 0);
    YN(d.contains(n-1), (d.at(n-1) + x - 1) / x, -1);
}
0