oj.uz

Submission #699095

# Submission time Handle Problem Language Result Execution time Memory
699095 2023-02-15T15:15:42 Z tengiz05 Abduction 2 (JOI17_abduction2) C++17
100 / 100
 1258 ms 93356 KB 
#include <bits/stdc++.h>

using i64 = long long;

constexpr int Log = 16;
constexpr int N = 50000;
int am[Log][N], bm[Log][N];

void chmax(i64 &a, i64 b) {
    if (a < b)
        a = b;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, m, q;
    std::cin >> n >> m >> q;
    
    std::vector<int> a(n), b(m);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        std::cin >> b[i];
    }
    
    for (int i = 0; i < n; i++)
        am[0][i] = a[i];
    for (int j = 0; (1 << (j + 1)) <= n; j++)
        for (int i = 0; i + (1 << (j + 1)) <= n; i++)
            am[j + 1][i] = std::max(am[j][i], am[j][i + (1 << j)]);
    for (int i = 0; i < m; i++)
        bm[0][i] = b[i];
    for (int j = 0; (1 << (j + 1)) <= m; j++)
        for (int i = 0; i + (1 << (j + 1)) <= m; i++)
            bm[j + 1][i] = std::max(bm[j][i], bm[j][i + (1 << j)]);
    
    std::unordered_map<i64, i64> dp;
    std::function<i64(int, int, int)> calc = [&](int x, int y, int t) {
        i64 state = x * 1LL * m + y + t * (1LL << 60);
        if (dp.count(state))
            return dp[state];
        i64 res = 0;
        if (t == 0) {
            int j = y + 1;
            for (int k = Log - 1; k >= 0; k--)
                if (j + (1 << k) <= m && bm[k][j] <= a[x])
                    j += 1 << k;
            if (j == m)
                chmax(res, m - 1 - y);
            else
                chmax(res, j - y + calc(x, j, !t));
            j = y;
            for (int k = Log - 1; k >= 0; k--)
                if (j - (1 << k) >= 0 && bm[k][j - (1 << k)] <= a[x])
                    j -= 1 << k;
            j--;
            if (j == -1)
                chmax(res, y);
            else
                chmax(res, y - j + calc(x, j, !t));
        } else {
            int i = x + 1;
            for (int k = Log - 1; k >= 0; k--)
                if (i + (1 << k) <= n && am[k][i] <= b[y])
                    i += 1 << k;
            if (i == n)
                chmax(res, n - 1 - x);
            else
                chmax(res, i - x + calc(i, y, !t));
            i = x;
            for (int k = Log - 1; k >= 0; k--)
                if (i - (1 << k) >= 0 && am[k][i - (1 << k)] <= b[y])
                    i -= 1 << k;
            i--;
            if (i == -1)
                chmax(res, x);
            else
                chmax(res, x - i + calc(i, y, !t));
        }
        return dp[state] = res;
    };
    
    while (q--) {
        int s, t;
        std::cin >> s >> t;
        s--;
        t--;
        std::cout << std::max(calc(s, t, 0), calc(s, t, 1)) << "\n";
    }
    
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 852 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 980 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 852 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 15 ms 6500 KB Output is correct
24 Correct 14 ms 6492 KB Output is correct
25 Correct 13 ms 6496 KB Output is correct
26 Correct 12 ms 6496 KB Output is correct
27 Correct 13 ms 6500 KB Output is correct
28 Correct 25 ms 12420 KB Output is correct
29 Correct 14 ms 7264 KB Output is correct
30 Correct 45 ms 11744 KB Output is correct
31 Correct 55 ms 14176 KB Output is correct
32 Correct 14 ms 6740 KB Output is correct
33 Correct 20 ms 8404 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 3 ms 852 KB Output is correct
9 Correct 3 ms 980 KB Output is correct
10 Correct 3 ms 916 KB Output is correct
11 Correct 3 ms 980 KB Output is correct

Subtask #5
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 852 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 15 ms 6500 KB Output is correct
24 Correct 14 ms 6492 KB Output is correct
25 Correct 13 ms 6496 KB Output is correct
26 Correct 12 ms 6496 KB Output is correct
27 Correct 13 ms 6500 KB Output is correct
28 Correct 25 ms 12420 KB Output is correct
29 Correct 14 ms 7264 KB Output is correct
30 Correct 45 ms 11744 KB Output is correct
31 Correct 55 ms 14176 KB Output is correct
32 Correct 14 ms 6740 KB Output is correct
33 Correct 20 ms 8404 KB Output is correct
34 Correct 2 ms 724 KB Output is correct
35 Correct 2 ms 724 KB Output is correct
36 Correct 2 ms 724 KB Output is correct
37 Correct 2 ms 724 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 1 ms 852 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 3 ms 852 KB Output is correct
42 Correct 3 ms 980 KB Output is correct
43 Correct 3 ms 916 KB Output is correct
44 Correct 3 ms 980 KB Output is correct
45 Correct 16 ms 6680 KB Output is correct
46 Correct 15 ms 6628 KB Output is correct
47 Correct 16 ms 6612 KB Output is correct
48 Correct 21 ms 6688 KB Output is correct
49 Correct 16 ms 6596 KB Output is correct
50 Correct 30 ms 11396 KB Output is correct
51 Correct 31 ms 12084 KB Output is correct
52 Correct 73 ms 14156 KB Output is correct
53 Correct 78 ms 13696 KB Output is correct
54 Correct 72 ms 13740 KB Output is correct
55 Correct 104 ms 19076 KB Output is correct
56 Correct 1258 ms 93356 KB Output is correct
57 Correct 276 ms 29340 KB Output is correct
58 Correct 283 ms 28668 KB Output is correct
59 Correct 255 ms 28500 KB Output is correct