結果

問題 No.2387 Yokan Factory
ユーザー au7777au7777
提出日時 2023-07-22 00:37:38
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 679 ms / 5,000 ms
コード長 4,159 bytes
コンパイル時間 4,355 ms
コンパイル使用メモリ 249,132 KB
実行使用メモリ 11,592 KB
最終ジャッジ日時 2024-09-22 01:53:18
合計ジャッジ時間 11,728 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 3 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 3 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 376 ms
11,384 KB
testcase_16 AC 260 ms
11,512 KB
testcase_17 AC 535 ms
11,592 KB
testcase_18 AC 451 ms
10,288 KB
testcase_19 AC 458 ms
7,940 KB
testcase_20 AC 350 ms
7,464 KB
testcase_21 AC 670 ms
9,924 KB
testcase_22 AC 328 ms
7,252 KB
testcase_23 AC 506 ms
8,216 KB
testcase_24 AC 330 ms
7,432 KB
testcase_25 AC 300 ms
6,236 KB
testcase_26 AC 579 ms
8,664 KB
testcase_27 AC 679 ms
9,476 KB
testcase_28 AC 5 ms
5,376 KB
testcase_29 AC 7 ms
5,376 KB
testcase_30 AC 6 ms
5,376 KB
testcase_31 AC 5 ms
5,376 KB
testcase_32 AC 4 ms
5,376 KB
testcase_33 AC 3 ms
5,376 KB
testcase_34 AC 6 ms
5,376 KB
testcase_35 AC 5 ms
5,376 KB
testcase_36 AC 3 ms
5,376 KB
testcase_37 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
using namespace std;
typedef pair<ll, ll> P;
using namespace atcoder;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define USE998244353
#ifdef USE998244353
const ll MOD = 998244353;
// const double PI = 3.141592653589;
using mint = modint998244353;
#else
const ll MOD = 1000000007;
using mint = modint1000000007;
#endif
const int MAX = 2000001;
long long 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;
    }
}
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm(ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    // 
    ll m = 0;
    ll M = 3000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll num, ll arity) {
    ll ret = 0;
    while (num) {
        num /= arity;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    // n > 0, m > 0
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}
ll pow_ll(ll x, ll n) {
    if (n == 0) return 1;
    if (n % 2) {
        return pow_ll(x, n - 1) * x;
    }
    else {
        ll tmp = pow_ll(x, n / 2);
        return tmp * tmp;
    }
}
vector<ll> compress(vector<ll>& v) {
    // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] 
    vector<ll> u = v;
    sort(u.begin(), u.end());
    u.erase(unique(u.begin(),u.end()),u.end());
    map<ll, ll> mp;
    for (int i = 0; i < u.size(); i++) {
        mp[u[i]] = i;
    }
    for (int i = 0; i < v.size(); i++) {
        v[i] = mp[v[i]];
    }
    return v;
}

vector<ll> Eratosthenes( const ll N )
{
    vector<bool> is_prime( N + 1 );
    for( ll i = 0; i <= N; i++ )
    {
        is_prime[ i ] = true;
    }
    vector<ll> P;
    for( ll i = 2; i <= N; i++ )
    {
        if( is_prime[ i ] )
        {
            for( ll j = 2 * i; j <= N; j += i )
            {
                is_prime[ j ] = false;
            }
            P.emplace_back( i );
        }
    }
    return P;
}

const ll INF = (ll)2e18;
bool movable(int n, int m, ll x, ll cur, vector<int>& u, vector<int>& v, vector<ll>& a, vector<ll>& b) {
    // cerr << cur << '\n';
    vector<vector<pair<int, int>>> edge(n);
    for (int i = 0; i < m; i++) {
        if (b[i] >= cur) {
            edge[u[i]].push_back({v[i], i});
            edge[v[i]].push_back({u[i], i});
        }
    }
    vector<ll> minTime(n, INF);
    min_priority_queue<pair<ll, int>> que;
    minTime[0] = 0;
    que.push({0, 0});
    while (que.size()) {
        auto p = que.top();
        que.pop();
        ll curCost = get<0>(p);
        int ver = get<1>(p);
        if (minTime[ver] < curCost) continue;
        for (auto e : edge[ver]) {
            int nex = e.first;
            int id = e.second;
            if (minTime[nex] > curCost + a[id]) {
                minTime[nex] = curCost + a[id];
                que.push({minTime[nex], nex});
            }
        }
    }
    if (minTime[n - 1] <= x) return true;
    else return false;
}

int main() {
    int n, m;
    ll x;
    cin >> n >> m >> x;
    vector<int> u(m);
    vector<int> v(m);
    vector<ll> a(m);
    vector<ll> b(m);
    for (int i = 0; i < m; i++) {
        cin >> u[i] >> v[i] >> a[i] >> b[i];
        u[i]--;
        v[i]--;
    }
    ll OK = 0;
    ll NO = INF;
    while (NO - OK > 1) {
        ll mid = (NO + OK) / 2;
        if (movable(n, m, x, mid, u, v, a, b)) {
            OK = mid;
        }
        else {
            NO = mid;
        }
    }
    if (OK == 0) {
        cout << -1 << endl;
    }
    else {
        cout << OK << endl;
    }
    return 0;
}
0