結果

問題 No.3013 ハチマキ買い星人
ユーザー 佐藤孝紀
提出日時 2025-02-22 01:46:48
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 243 ms / 2,000 ms
コード長 3,033 bytes
コンパイル時間 4,071 ms
コンパイル使用メモリ 228,572 KB
実行使用メモリ 22,528 KB
最終ジャッジ日時 2025-02-22 01:47:04
合計ジャッジ時間 13,409 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 45
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using lll = __int128_t;
using ld = long double;
using P = pair<ll, ll>;
using vi = vector<ll>;
using vd = vector<ld>;
using vP = vector<P>;
using vS = vector<string>;
using vvi = vector<vi>;
using vvd = vector<vd>;
using vvP = vector<vP>;
using v3i = vector<vvi>;
using v3d = vector<vvd>;
using v3P = vector<vvP>;
using v4i = vector<v3i>;
using v5i = vector<v4i>;
using v6i = vector<v5i>;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using Mint = modint1000000007;
using vm = vector<mint>;
using vM = vector<Mint>;
using vvm = vector<vm>;
using vvM = vector<vM>;
using v3m = vector<vvm>;
using v3M = vector<vvM>;
using v4m = vector<v3m>;
using v5m = vector<v4m>;
#endif
template <typename T>
using rp_Q = priority_queue<T, vector<T>, greater<T>>;
#define rrep(i, n) for (ll i = (n)-1; (i) >= 0; --(i))
#define rep(i, n) for (ll i = 0; (i) < (n); ++(i))
#define loop(i, a) for(ll i = a; true; ++(i))
#define reps(i, n) for (ll i = 1; (i) <= (n); ++(i))
#define Rep(i,a,b) for(ll i = (a); i <= (b); i++)
#define all(a) (a).begin(),(a).end()
const ll MOD = 998244353;
const ll Hash = 10000000000000061;
#define Yes(b) ((b)?cout << "Yes" << endl:cout << "No" << endl)
#define YES(b) ((b)?cout << "YES" << endl:cout << "NO" << endl)
#define Aoki(b) ((b)?cout << "Aoki" << endl:cout << "Takahashi" << endl)
#define out(x) cout << (x) << endl
#define vout(v) for(ll x : (v)) cout << x << endl
#define vin(v) rep(i, (v).size()) cin >> (v)[i]
#define ft first
#define sd second
#define vInP(v) rep(i, (v).size()) cin >> (v)[i].ft >> (v)[i].sd
bool chmin(ll& a, ll b) { return a > b ? a = b, 1 : 0; }
bool chmax(ll& a, ll b) { return a < b ? a = b, 1 : 0; }
vi s90 = { 0, 1, 0, -1 }, c90 = { 1, 0, -1, 0 };
vi s45 = { 0, 1, 1, 1, 0, -1, -1, -1 }, c45 = { 1, 1, 0, -1, -1, -1, 0, 1 };
void solve();
signed main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int t = 1;
    // cin >> t;
    rep(i, t) solve();
}
void solve(){
    ll N, M, Q, Y; cin >> N >> M >> Q >> Y;
    vvP G(N+1);
    rep(i, M){
        ll u, v, w; cin >> u >> v >> w;
        G[u].push_back({v, w});
        G[v].push_back({u, w});
    }
    vi dis, vis;
    dis.assign(N+1, 4e18); dis[1] = 0;
    vis.assign(N+1, 0);
    priority_queue<P, vP, greater<P>> pQ; pQ.push({0, 1});
    while(!pQ.empty()){
        ll p = pQ.top().sd; pQ.pop();
        if(vis[p]) continue;
        vis[p] = 1;
        for(P u : G[p]){
            ll nx = u.ft, cst = u.sd;
            if(dis[nx] > dis[p] + cst){
                dis[nx] = dis[p] + cst;
                pQ.push({dis[nx], nx});
            }
        }
    }
    ll ans = 0;
    rep(i, Q){
        ll d, e; cin >> d >> e;
        ll yen = max(0ll, Y - dis[d]);
        ll x = yen / e;
        chmax(ans, x);
    }
    out(ans);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0