Submission #3609351
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}; vvt<pair<int, int>> edge; 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 : edge[v]) { que.push({nxt.first, dist[v] + cost[nxt.second]}); } } 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); edge.resize(n); rep(i, 0, m) { int u, v; cin >> u >> v >> a[i] >> b[i]; u--; v--; edge[u].push_back({v, i}); edge[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 | 1626 Byte |
Status | TLE |
Exec Time | 2105 ms |
Memory | 1055692 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 | 211 ms | 11380 KB |
11_0.txt | AC | 1044 ms | 22028 KB |
11_1.txt | AC | 1225 ms | 36020 KB |
11_2.txt | AC | 1015 ms | 31964 KB |
11_3.txt | AC | 547 ms | 12560 KB |
11_4.txt | AC | 832 ms | 21460 KB |
1n1m1.txt | TLE | 2105 ms | 1055692 KB |
1oo_0.txt | AC | 936 ms | 23180 KB |
1oo_1.txt | AC | 1093 ms | 22344 KB |
1oo_2.txt | TLE | 2104 ms | 55420 KB |
1oo_3.txt | AC | 787 ms | 16220 KB |
1oo_4.txt | AC | 847 ms | 21796 KB |
dangou_0.txt | TLE | 2105 ms | 1054160 KB |
dangou_1.txt | AC | 816 ms | 23016 KB |
dangou_2.txt | AC | 621 ms | 15208 KB |
dangou_3.txt | TLE | 2104 ms | 267096 KB |
dangou_4.txt | AC | 513 ms | 12728 KB |
edge.txt | AC | 240 ms | 11380 KB |
high_0.txt | AC | 245 ms | 11820 KB |
high_1.txt | AC | 368 ms | 19076 KB |
high_2.txt | AC | 654 ms | 12792 KB |
high_3.txt | AC | 14 ms | 2704 KB |
high_4.txt | AC | 271 ms | 9056 KB |
low_0.txt | AC | 870 ms | 32364 KB |
low_1.txt | AC | 998 ms | 30792 KB |
low_2.txt | AC | 650 ms | 13332 KB |
low_3.txt | AC | 564 ms | 11904 KB |
low_4.txt | AC | 601 ms | 15980 KB |
oo1_0.txt | AC | 958 ms | 22432 KB |
oo1_1.txt | AC | 896 ms | 22136 KB |
oo1_2.txt | AC | 1017 ms | 23624 KB |
oo1_3.txt | AC | 1155 ms | 34188 KB |
oo1_4.txt | AC | 963 ms | 22592 KB |
path_0.txt | AC | 199 ms | 9976 KB |
path_1.txt | AC | 197 ms | 9976 KB |
path_2.txt | AC | 96 ms | 5880 KB |
path_3.txt | AC | 123 ms | 6908 KB |
path_4.txt | AC | 67 ms | 4732 KB |
path_5.txt | AC | 173 ms | 8948 KB |
rnd_0.txt | AC | 676 ms | 21856 KB |
rnd_1.txt | AC | 742 ms | 14312 KB |
rnd_2.txt | AC | 116 ms | 6076 KB |
rnd_3.txt | AC | 713 ms | 16116 KB |
rnd_4.txt | AC | 797 ms | 22448 KB |
sampleRnd.txt | AC | 2 ms | 1792 KB |
sampleT.txt | AC | 2 ms | 1792 KB |
slast_0.txt | AC | 831 ms | 22132 KB |
slast_1.txt | AC | 427 ms | 14452 KB |
slast_2.txt | AC | 658 ms | 17128 KB |
slast_3.txt | AC | 778 ms | 21864 KB |
slast_4.txt | AC | 720 ms | 16012 KB |
tlast_0.txt | AC | 496 ms | 21412 KB |
tlast_1.txt | AC | 846 ms | 21316 KB |
tlast_2.txt | AC | 672 ms | 16096 KB |
tlast_3.txt | AC | 526 ms | 12728 KB |
tlast_4.txt | AC | 560 ms | 12688 KB |