Submission #3563629
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3")
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x)
#endif
const int INF = 1e9; const LL LINF = 1e16;
const LL MOD = 1000000007; const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
/* ----- __MAKE_TIME__ Problem: __PROBLEM__ / Link: __CONTEST_URL__ ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
using VL = vector<double>;
VL Dijkstra(vector<vector<PLL>>& G, int s) {
VL dist(SZ(G), LINF);
dist[s] = 0;
priority_queue<PLL, vector<PLL>, greater<PLL>> que;
que.push(PLL(0LL, s));
while (!que.empty()) {
PLL p = que.top(); que.pop();
int v; long long d;
tie(d, v) = p;
if (d > dist[v]) continue;
FOR(i, 0, (int)G[v].size()) {
int nv = G[v][i].first;
if (dist[nv] > dist[v] + G[v][i].second) {
dist[nv] = dist[v] + G[v][i].second;
que.push(PLL(dist[nv], nv));
}
}
}
return dist;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
LL N, M, R, T; cin >> N >> M >> R >> T;
vector<vector<PLL>> G(N);
FOR(i, 0, M) {
int a, b, c; cin >> a >> b >> c;
a--, b--;
G[a].push_back(PLL(b, c));
G[b].push_back(PLL(a, c));
}
// A!=B && B!=C && C!=A
LL ans = 0;
FOR(A, 0, N) {
VL distlist = Dijkstra(G, A);
LL subans = 0;
SORT(distlist);
// binary search
// 1いる…??
// 異なるという制約をどうするか。
// 1はいらない
// 大小の包含があるため、T/Rが1以上であれば key自身を含む。
//
DD(de(A); De(distlist));
FOR(i, 1, N) {
double key = (distlist[i] *1.0* T) / R;// きりあげなくてもいい?? -> double
LL idx = lower_bound(ALL(distlist), key) - distlist.begin();
DD(de(i, key,idx));
// key??
idx--;
if (T > R)idx--;
subans += idx;
}
ans += subans;
}
cout << ans << "\n";
return 0;
}
Submission Info
Submission Time |
|
Task |
C - ウサギとカメ |
User |
vjudge4 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2514 Byte |
Status |
AC |
Exec Time |
1152 ms |
Memory |
512 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 |
6 ms |
256 KB |
subtask1_06.txt |
AC |
9 ms |
256 KB |
subtask1_07.txt |
AC |
30 ms |
384 KB |
subtask1_08.txt |
AC |
38 ms |
384 KB |
subtask1_09.txt |
AC |
333 ms |
512 KB |
subtask1_10.txt |
AC |
316 ms |
384 KB |
subtask1_11.txt |
AC |
138 ms |
384 KB |
subtask1_12.txt |
AC |
1062 ms |
512 KB |
subtask1_13.txt |
AC |
1060 ms |
512 KB |
subtask1_14.txt |
AC |
1142 ms |
512 KB |
subtask1_15.txt |
AC |
757 ms |
512 KB |
subtask1_16.txt |
AC |
1152 ms |
512 KB |