oj.uz

Submission #1055294

# Submission time Handle Problem Language Result Execution time Memory
1055294 2024-08-12T16:33:35 Z Boas Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 2000 ms 2040 KB 
#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> q;
    q.push({0, 0, 0});
    vi maxX(h, -1), maxY(w, -1);
    // 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;
        }
        // if (y > maxY[x] && x > maxX[y])
        {
            maxX[y] = x;
            maxY[x] = y;
            if (x + 1 < w && y > maxY[x + 1])
            {
                q.push({c - (in64)a[y], y, x + 1});
                maxY[x + 1] = y;
            }
            if (y + 1 < h && x > maxX[y + 1])
            {
                q.push({c - (in64)b[x], y + 1, x});
                maxX[y + 1] = x;
            }
        }
    }
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 83 ms 348 KB Output is correct
12 Correct 17 ms 348 KB Output is correct
13 Correct 841 ms 1492 KB Output is correct
14 Correct 29 ms 348 KB Output is correct
15 Correct 19 ms 528 KB Output is correct
16 Correct 1994 ms 1436 KB Output is correct
17 Correct 121 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 354 ms 1036 KB Output is correct
4 Execution timed out 2070 ms 2040 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 83 ms 348 KB Output is correct
12 Correct 17 ms 348 KB Output is correct
13 Correct 841 ms 1492 KB Output is correct
14 Correct 29 ms 348 KB Output is correct
15 Correct 19 ms 528 KB Output is correct
16 Correct 1994 ms 1436 KB Output is correct
17 Correct 121 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 354 ms 1036 KB Output is correct
32 Execution timed out 2070 ms 2040 KB Time limit exceeded
33 Halted 0 ms 0 KB -