Submission #3609386
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i, j, n) for(int i=j;i<n;++i) #define all(i) i.begin(),i.end() #define rall(i) i.rbegin(),i.rend() #define INF 1e9 const int mod = 1e9 + 7; typedef long long i64; typedef pair<int, int> pi; template <class T> using vt = vector<T>; template <class T> using vvt = vector<vector<T>>; i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));} i64 lcm(i64 n, i64 m) {return (n / gcd(n, m) * m);} int dx[] = {0, 1, 0, -1}; int dy[] = {1, 0, -1, 0}; struct edge { int to, idx; }; vvt<edge> e; vt<i64> dijkstra(int s, vt<i64> &cost) { vt<i64> dist(101000, 1e18); priority_queue<pair<int, i64>, vt<pair<int, i64>>, greater<pair<int, i64>>> que; que.push({s, 0}); while(!que.empty()) { int v = que.top().first; i64 d = que.top().second; que.pop(); if(dist[v] < d) continue; dist[v] = d; for(auto &nxt : e[v]) { que.push({nxt.to, dist[v] + cost[nxt.idx]}); } } return dist; } int main() { cin.tie(0); ios::sync_with_stdio(false); int n, m, s, t; cin >> n >> m >> s >> t; s--; t--; vt<i64> a(m), b(m); e.resize(n); rep(i, 0, m) { int u, v; cin >> u >> v >> a[i] >> b[i]; u--; v--; e[u].push_back({v, i}); e[v].push_back({u, i}); } auto dist1 = dijkstra(s, a); auto dist2 = dijkstra(t, b); vt<i64> ans; i64 res = 0; for(int i = n - 1; i >= 0; --i) { res = max(res, (i64)1e15 - dist1[i] - dist2[i]); ans.push_back(res); } for(int i = n - 1; i >= 0; --i) cout << ans[i] << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Saving Snuuk |
User | playroller |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1632 Byte |
Status | TLE |
Exec Time | 2105 ms |
Memory | 1055948 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sampleRnd.txt, sampleT.txt |
All | 00yorimichi.txt, 11_0.txt, 11_1.txt, 11_2.txt, 11_3.txt, 11_4.txt, 1n1m1.txt, 1oo_0.txt, 1oo_1.txt, 1oo_2.txt, 1oo_3.txt, 1oo_4.txt, dangou_0.txt, dangou_1.txt, dangou_2.txt, dangou_3.txt, dangou_4.txt, edge.txt, high_0.txt, high_1.txt, high_2.txt, high_3.txt, high_4.txt, low_0.txt, low_1.txt, low_2.txt, low_3.txt, low_4.txt, oo1_0.txt, oo1_1.txt, oo1_2.txt, oo1_3.txt, oo1_4.txt, path_0.txt, path_1.txt, path_2.txt, path_3.txt, path_4.txt, path_5.txt, rnd_0.txt, rnd_1.txt, rnd_2.txt, rnd_3.txt, rnd_4.txt, sampleRnd.txt, sampleT.txt, slast_0.txt, slast_1.txt, slast_2.txt, slast_3.txt, slast_4.txt, tlast_0.txt, tlast_1.txt, tlast_2.txt, tlast_3.txt, tlast_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00yorimichi.txt | AC | 208 ms | 11380 KB |
11_0.txt | AC | 1044 ms | 22808 KB |
11_1.txt | AC | 1263 ms | 35784 KB |
11_2.txt | AC | 1027 ms | 32920 KB |
11_3.txt | AC | 548 ms | 12560 KB |
11_4.txt | AC | 839 ms | 22484 KB |
1n1m1.txt | TLE | 2105 ms | 1055948 KB |
1oo_0.txt | AC | 937 ms | 22696 KB |
1oo_1.txt | AC | 1085 ms | 23728 KB |
1oo_2.txt | TLE | 2104 ms | 56416 KB |
1oo_3.txt | AC | 802 ms | 16152 KB |
1oo_4.txt | AC | 851 ms | 21156 KB |
dangou_0.txt | TLE | 2105 ms | 1055596 KB |
dangou_1.txt | AC | 830 ms | 21224 KB |
dangou_2.txt | AC | 613 ms | 15140 KB |
dangou_3.txt | TLE | 2104 ms | 266328 KB |
dangou_4.txt | AC | 519 ms | 12728 KB |
edge.txt | AC | 242 ms | 11380 KB |
high_0.txt | AC | 250 ms | 11556 KB |
high_1.txt | AC | 377 ms | 19460 KB |
high_2.txt | AC | 669 ms | 12920 KB |
high_3.txt | AC | 14 ms | 2704 KB |
high_4.txt | AC | 270 ms | 9056 KB |
low_0.txt | AC | 899 ms | 31980 KB |
low_1.txt | AC | 1037 ms | 31796 KB |
low_2.txt | AC | 645 ms | 13368 KB |
low_3.txt | AC | 565 ms | 11392 KB |
low_4.txt | AC | 600 ms | 14928 KB |
oo1_0.txt | AC | 953 ms | 21988 KB |
oo1_1.txt | AC | 915 ms | 21624 KB |
oo1_2.txt | AC | 1031 ms | 23656 KB |
oo1_3.txt | AC | 1171 ms | 33400 KB |
oo1_4.txt | AC | 971 ms | 22464 KB |
path_0.txt | AC | 200 ms | 9976 KB |
path_1.txt | AC | 198 ms | 9976 KB |
path_2.txt | AC | 96 ms | 5880 KB |
path_3.txt | AC | 121 ms | 6908 KB |
path_4.txt | AC | 66 ms | 4732 KB |
path_5.txt | AC | 170 ms | 8948 KB |
rnd_0.txt | AC | 678 ms | 20448 KB |
rnd_1.txt | AC | 738 ms | 14272 KB |
rnd_2.txt | AC | 120 ms | 6076 KB |
rnd_3.txt | AC | 709 ms | 15684 KB |
rnd_4.txt | AC | 804 ms | 21808 KB |
sampleRnd.txt | AC | 2 ms | 1792 KB |
sampleT.txt | AC | 2 ms | 1792 KB |
slast_0.txt | AC | 833 ms | 21836 KB |
slast_1.txt | AC | 441 ms | 14324 KB |
slast_2.txt | AC | 658 ms | 16492 KB |
slast_3.txt | AC | 788 ms | 22280 KB |
slast_4.txt | AC | 729 ms | 16012 KB |
tlast_0.txt | AC | 512 ms | 21308 KB |
tlast_1.txt | AC | 855 ms | 20548 KB |
tlast_2.txt | AC | 668 ms | 16940 KB |
tlast_3.txt | AC | 518 ms | 12728 KB |
tlast_4.txt | AC | 555 ms | 12688 KB |