#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T1, typename T2>
using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using indexed_set = indexed_map<T, null_type>;
#define loop(x, i) for (int i = 0; i < (x); i++)
#define loop1(x, i) for (int i = 1; i <= (x); i++)
#define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--)
#define itloop(x) for (auto it = begin(x); x != end(x); it++)
#define itrev(x) for (auto it = rbegin(x); x != rend(x); it++)
// #define int long long
#define INF ((int64_t)(4e18 + 1))
#define INF32 ((int32_t)(2e9 + 1))
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define existsIn(x, l) (count(ALL(l), x) > 0)
#define removeIn(x, l) l.erase(find(ALL(l), x))
#define pb push_back
#define sz(x) (int)(x).size()
#define F first
#define S second
#define var const auto &
#define foreach(l) for (var e : l)
typedef int8_t in8;
typedef int16_t in16;
typedef int32_t in32;
typedef int64_t in64;
typedef pair<int, int> ii;
typedef tuple<in64, int, int> iii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vii> vvii;
typedef vector<viii> vviii;
typedef set<int> si;
typedef set<ii> sii;
typedef set<iii> siii;
typedef vector<si> vsi;
typedef vector<sii> vsii;
typedef vector<vsi> vvsi;
typedef vector<string> vstr;
typedef vector<vector<string>> vvstr;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vi::iterator viit;
typedef si::iterator siit;
void solve()
{
int h, w;
cin >> h >> w;
vi a(h), b(w);
loop(h, i) cin >> a[i];
loop(w, i) cin >> b[i];
priority_queue<iii, vector<iii>, greater<iii>> q;
q.push({0, 0, 0});
sii maxX, maxY;
// vi costX(h, INF), costY(w, INF);
while (!q.empty())
{
auto [c, y, x] = q.top();
q.pop();
if (y == h - 1 && x == w - 1)
{
cout << c << endl;
return;
}
auto mxY = maxY.lower_bound({x, -1});
auto mxX = maxX.lower_bound({y, -1});
if ((mxY == maxY.end() || y > mxY->S) && (mxX == maxX.end() || x > mxX->S))
{
for (auto it = maxY.upper_bound({x, INF}); it != maxY.end() && y > it->S; it = maxY.upper_bound({x, INF}))
{
maxY.erase(it);
}
for (auto it = maxX.upper_bound({y, INF}); it != maxX.end() && y > it->S; it = maxX.upper_bound({y, INF}))
{
maxX.erase(it);
}
maxX.insert({y, x});
maxY.insert({x, y});
if (x + 1 < w /*&& y > maxY[x + 1]*/)
{
auto mxY = maxY.lower_bound({x, -1});
if (mxY == maxY.end() || y > mxY->S)
q.push({c + (in64)a[y], y, x + 1});
}
if (y + 1 < h /*&& x > maxX[y + 1]*/)
{
auto mxX = maxX.lower_bound({y, -1});
if (mxX == maxX.end() || y > mxX->S)
q.push({c + (in64)b[x], y + 1, x});
}
}
}
}
signed main()
{
cin.tie(0)->sync_with_stdio(0);
solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
