diff options
author | Ta180m | 2019-07-16 13:56:59 -0700 |
---|---|---|
committer | GitHub | 2019-07-16 13:56:59 -0700 |
commit | e0e8c2a9927132a649a26c5de0c46c7e0796a911 (patch) | |
tree | d4d64648aad7026fe980e24a8e410e2d940613ab | |
parent | 22f6d04323669c2c53c23786f904bb7cb7e5a580 (diff) |
Create route.cpp
-rw-r--r-- | 2013/February/Gold/route.cpp | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/2013/February/Gold/route.cpp b/2013/February/Gold/route.cpp new file mode 100644 index 0000000..aab04ed --- /dev/null +++ b/2013/February/Gold/route.cpp @@ -0,0 +1,29 @@ +#include <algorithm> +#include <iostream> +using namespace std; +constexpr auto INF = (int)1e9; +typedef pair<int, int> ii; + +int l[40005], r[40005], dl[40005] = { 0 }, dr[40005] = { 0 }; +ii E[100005]; + +int main() { + int N, M, R; + cin >> N >> M >> R; + for (int i = 0; i < N; i++) cin >> l[i]; + for (int i = 0; i < M; i++) cin >> r[i]; + for (int i = 0; i < R; i++) cin >> E[i].first >> E[i].second; + + sort(E, E + R, [](const ii& a, const ii& b) { return a.first + a.second < b.first + b.second; }); + + for (int i = 0; i < N; i++) dl[i] = l[i]; + for (int i = 0; i < M; i++) dr[i] = r[i]; + + for (int i = 0; i < R; i++) { + int u = E[i].first, v = E[i].second, a = dl[--u], b = dr[--v]; + dl[u] = max(l[u] + b, dl[u]); + dr[v] = max(r[v] + a, dr[v]); + } + + cout << max(*max_element(dl, dl + N), *max_element(dr, dr + N)) << endl; +} |