#1039143 (C++17) No.3013 ハチマキ買い星人

• 問題: No.3013 ハチマキ買い星人
• ユーザー: shobonvip
• 提出日時: 2025-01-25 23:28:30
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 247 ms / 2,000 ms
• コード長: 1,870 bytes
• コンパイル時間: 4,369 ms
• コンパイル使用メモリ: 260,092 KB
• 実行使用メモリ: 20,832 KB
• 最終ジャッジ日時: 2025-01-25 23:28:50
• 合計ジャッジ時間: 11,166 ms
• ジャッジサーバーID （参考情報）: judge8 / judge10

ファイルパターン	結果
sample	AC * 1
other	AC * 45

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
/**
    author:  shobonvip
    created: 2025.01.25 23:16:58
**/
#include<bits/stdc++.h>
using namespace std;
//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/
/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/
typedef long long ll;
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()
template <typename T> bool chmin(T &a, const T &b) {
    if (a <= b) return false;
    a = b;
    return true;
}
template <typename T> bool chmax(T &a, const T &b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T> T max(vector<T> &a){
    assert(!a.empty());
    T ret = a[0];
    for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
    return ret;
}
template <typename T> T min(vector<T> &a){
    assert(!a.empty());
    T ret = a[0];
    for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
    return ret;
}
template <typename T> T sum(vector<T> &a){
    T ret = 0;
    for (int i=0; i<(int)a.size(); i++) ret += a[i];
    return ret;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n,m,p,y;
    cin >> n >> m >> p >> y;
    vector ikeru(n, vector<pair<int,ll>>(0));
    rep(i,0,m){
        int a, b; cin >> a >> b;
        a--; b--;
        ll c; cin >> c;
        ikeru[a].push_back(pair(b, c));
        ikeru[b].push_back(pair(a, c));
    }
    vector<ll> d(n, 1e18);
    d[0] = 0;
    priority_queue<pair<ll,int>> pq;
    pq.push(pair(0, 0));
    while(!pq.empty()) {
        auto [tmp, i] = pq.top();
        pq.pop();
        tmp = -tmp;
        if (tmp > d[i]) continue;
        for (auto [j, c]: ikeru[i]) {
            if (chmin(d[j], d[i] + c)) {
                pq.push(pair(-d[j],j));
            }
        } 
    }
    ll ans = 0;
    rep(i,0,p) {
        int x;
        ll e; cin >> x >> e;
        x--; 
        ll left = max(0LL, y - d[x]);
        chmax(ans, left / e);
    }
    cout << ans << '\n';
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX