Submission #3271735
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
typedef __int128_t Int;
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
#define fi first
#define se second
#define eb emplace_back
using pii = pair<int, int>;
// template<class T> ostream &operator<<(ostream &os,T &t){dump(t);return os;}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> void printvv(const vector<vector<T>> &v) {
cerr << endl;
rep(i, 0, v.size()) rep(j, 0, v[i].size()) {
if (typeid(v[i][j]) == typeid(INF) and v[i][j] == INF) {
cerr << "INF";
} else
cerr << v[i][j];
cerr << (j == v[i].size() - 1 ? '\n' : ' ');
}
cerr << endl;
}
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 parse(string &s) {
__int128 ret = 0;
for (int i = 0; i < s.length(); i++)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
#ifndef _DEBUG
#define printvv(...)
#endif
void YES(bool f) { cout << (f ? "YES" : "NO") << endl; }
void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using Weight = int;
using Flow = int;
struct Edge {
int s, d;
Weight w;
Flow c;
Edge(){};
Edge(int s, int d, Weight w = 1) : s(s), d(d), w(w), c(w){};
};
bool operator<(const Edge &e1, const Edge &e2) { return e1.w < e2.w; }
bool operator>(const Edge &e1, const Edge &e2) { return e2 < e1; }
inline ostream &operator<<(ostream &os, const Edge &e) {
return (os << '(' << e.s << ", " << e.d << ", " << e.w << ')');
}
using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;
inline ostream &operator<<(ostream &os, const Edges &es) {
os << "[";
for (int i = 0; i < es.size(); i++) {
os << es[i] << (i == es.size() - 1 ? "" : ", ");
}
os << "]";
return os;
}
inline ostream &operator<<(ostream &os, const Graph &g) {
os << "{";
for (int i = 0; i < g.size(); i++) {
os << g[i] << (i == g.size() - 1 ? "" : ", ");
}
os << "}";
return os;
}
void addArc(Graph &g, int s, int d, Weight w = 1) {
g[s].emplace_back(s, d, w);
}
void addEdge(Graph &g, int a, int b, Weight w = 1) {
addArc(g, a, b, w);
addArc(g, b, a, w);
}
vector<int> dijkstra(const Graph &g, int s, Array &dist) {
int n = g.size();
assert(s < n);
enum { WHITE, GRAY, BLACK };
vector<int> color(n, WHITE);
color[s] = GRAY;
vector<int> prev(n, -1);
dist.assign(n, INF);
dist[s] = 0;
using State = tuple<Weight, int, int>; //始点からの最短距離 子 親
priority_queue<State, vector<State>, greater<State>> pq;
pq.emplace(0, s, -1);
while (pq.size()) {
Weight d;
int v, u;
tie(d, v, u) = pq.top();
pq.pop();
if (dist[v] < d)
continue;
color[v] = BLACK;
prev[v] = u;
for (auto &e : g[v]) {
if (color[e.d] == BLACK)
continue;
if (dist[e.d] > dist[v] + e.w) {
dist[e.d] = dist[v] + e.w;
pq.emplace(dist[e.d], e.d, v);
color[e.d] = GRAY;
}
}
}
return prev;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N, M;
cin >> N >> M;
int R, T;
cin >> R >> T;
Graph g(N);
rep(i, 0, M) {
int a, b, c;
cin >> a >> b >> c;
a--, b--;
addEdge(g, a, b, c);
}
int ans = 0;
rep(i, 0, N) {
vector<int> dist;
dijkstra(g, i, dist);
sort(all(dist));
vector<int> v(dist);
dump(v);
rep(j, 0, N) { v[j] *= T; }
dump(v);
rep(j, 0, N) {
if (dist[j] == 0)
continue;
dump(dist[j], dist[j] * R);
auto up = upper_bound(v.begin(), v.end(), dist[j] * R);
int idx = up - v.begin();
dump(idx);
ans += N - idx-(idx<=j);
dump(ans);
}
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - ウサギとカメ |
User |
norma |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
5150 Byte |
Status |
AC |
Exec Time |
1212 ms |
Memory |
640 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample-01.txt, subtask0_sample-02.txt |
All |
subtask0_sample-01.txt, subtask0_sample-02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample-01.txt |
AC |
1 ms |
256 KB |
subtask0_sample-02.txt |
AC |
1 ms |
256 KB |
subtask1_01.txt |
AC |
1 ms |
256 KB |
subtask1_02.txt |
AC |
1 ms |
256 KB |
subtask1_03.txt |
AC |
1 ms |
256 KB |
subtask1_04.txt |
AC |
1 ms |
256 KB |
subtask1_05.txt |
AC |
7 ms |
256 KB |
subtask1_06.txt |
AC |
9 ms |
384 KB |
subtask1_07.txt |
AC |
35 ms |
640 KB |
subtask1_08.txt |
AC |
41 ms |
512 KB |
subtask1_09.txt |
AC |
368 ms |
640 KB |
subtask1_10.txt |
AC |
329 ms |
512 KB |
subtask1_11.txt |
AC |
152 ms |
512 KB |
subtask1_12.txt |
AC |
1086 ms |
640 KB |
subtask1_13.txt |
AC |
1083 ms |
640 KB |
subtask1_14.txt |
AC |
1207 ms |
640 KB |
subtask1_15.txt |
AC |
842 ms |
640 KB |
subtask1_16.txt |
AC |
1212 ms |
640 KB |