Submission #3609322
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; void dijkstra(int s, vt<i64> &cost, vt<i64> &dist) { 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]}); } } } 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}); } vt<i64> dist1(n, 1e18), dist2(n, 1e18); dijkstra(s, a, dist1); dijkstra(t, b, dist2); 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); } reverse(all(ans)); for(auto &it : ans) cout << it << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Saving Snuuk |
User | playroller |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1622 Byte |
Status | TLE |
Exec Time | 2106 ms |
Memory | 1056716 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 | 206 ms | 11380 KB |
11_0.txt | AC | 1067 ms | 22480 KB |
11_1.txt | AC | 1316 ms | 34248 KB |
11_2.txt | AC | 1034 ms | 30252 KB |
11_3.txt | AC | 556 ms | 12560 KB |
11_4.txt | AC | 870 ms | 21588 KB |
1n1m1.txt | TLE | 2106 ms | 1056716 KB |
1oo_0.txt | AC | 969 ms | 21328 KB |
1oo_1.txt | AC | 1116 ms | 21564 KB |
1oo_2.txt | TLE | 2104 ms | 53624 KB |
1oo_3.txt | AC | 825 ms | 15624 KB |
1oo_4.txt | AC | 868 ms | 21668 KB |
dangou_0.txt | TLE | 2105 ms | 1054416 KB |
dangou_1.txt | AC | 840 ms | 21480 KB |
dangou_2.txt | AC | 625 ms | 15548 KB |
dangou_3.txt | TLE | 2104 ms | 265820 KB |
dangou_4.txt | AC | 515 ms | 12728 KB |
edge.txt | AC | 239 ms | 11380 KB |
high_0.txt | AC | 250 ms | 10264 KB |
high_1.txt | AC | 378 ms | 17276 KB |
high_2.txt | AC | 654 ms | 12536 KB |
high_3.txt | AC | 13 ms | 1040 KB |
high_4.txt | AC | 274 ms | 8672 KB |
low_0.txt | AC | 910 ms | 30444 KB |
low_1.txt | AC | 1039 ms | 29300 KB |
low_2.txt | AC | 654 ms | 13792 KB |
low_3.txt | AC | 567 ms | 11008 KB |
low_4.txt | AC | 607 ms | 13932 KB |
oo1_0.txt | AC | 955 ms | 22052 KB |
oo1_1.txt | AC | 919 ms | 21848 KB |
oo1_2.txt | AC | 1065 ms | 23784 KB |
oo1_3.txt | AC | 1186 ms | 31948 KB |
oo1_4.txt | AC | 977 ms | 21312 KB |
path_0.txt | AC | 200 ms | 9720 KB |
path_1.txt | AC | 194 ms | 9720 KB |
path_2.txt | AC | 94 ms | 4984 KB |
path_3.txt | AC | 118 ms | 6140 KB |
path_4.txt | AC | 65 ms | 3580 KB |
path_5.txt | AC | 171 ms | 8564 KB |
rnd_0.txt | AC | 685 ms | 20704 KB |
rnd_1.txt | AC | 743 ms | 14112 KB |
rnd_2.txt | AC | 121 ms | 4540 KB |
rnd_3.txt | AC | 714 ms | 15428 KB |
rnd_4.txt | AC | 810 ms | 21908 KB |
sampleRnd.txt | AC | 1 ms | 256 KB |
sampleT.txt | AC | 1 ms | 256 KB |
slast_0.txt | AC | 843 ms | 22376 KB |
slast_1.txt | AC | 447 ms | 13300 KB |
slast_2.txt | AC | 678 ms | 16724 KB |
slast_3.txt | AC | 798 ms | 21640 KB |
slast_4.txt | AC | 722 ms | 15884 KB |
tlast_0.txt | AC | 519 ms | 20216 KB |
tlast_1.txt | AC | 857 ms | 19396 KB |
tlast_2.txt | AC | 675 ms | 16368 KB |
tlast_3.txt | AC | 519 ms | 12728 KB |
tlast_4.txt | AC | 555 ms | 12556 KB |