Submission #3564501

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream& operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream& operator<<(ostream &os, vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream& operator<<(ostream &os, set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream& operator<<(ostream &os, pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream& operator<<(ostream &os, map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

vector<pint> to[2500];
int N, M, R, T;
constexpr lint INF = 1E9;

vector<int> dij(int a)
{
    vector<int> ans(N, INF);
    ans[a] = 0;
    priority_queue<pint, vector<pint>, greater<pint>> pq;
    for (auto pa : to[a]) pq.push(pa);

    while (!pq.empty())
    {
        pint pa = pq.top();
        pq.pop();
        if (ans[pa.second] < pa.first) continue;
        ans[pa.second] = pa.first;
        for (auto pan : to[pa.second])
        {
            if (ans[pan.second] > pa.first + pan.first) pq.push(pint(pa.first + pan.first, pan.second));
        }
    }
    return ans;
}

int main()
{
    cin >> N >> M >> R >> T;

    REP(_, M)
    {
        int a, b, c;
        cin >> a >> b >> c;
        to[a - 1].push_back(pint(c, b - 1));
        to[b - 1].push_back(pint(c, a - 1));
    }

    lint ans = 0;
    REP(a, N) // 目的地がa
    {
        vector<int> dist = dij(a);
        vector<int> dist_sorted = dist;
        sort(dist_sorted.begin(), dist_sorted.end());
        for (auto &v : dist_sorted) v *= T;
        for (auto d : dist) if (d)
        {
            ans += distance(upper_bound(dist_sorted.begin(), dist_sorted.end(), d * R), dist_sorted.end());
            if (R < T) ans--;
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result