oj.uz

Submission #698976

# Submission time Handle Problem Language Result Execution time Memory
698976 2023-02-15T05:53:29 Z tengiz05 Abduction 2 (JOI17_abduction2) C++17
13 / 100
 5000 ms 113092 KB 
#include <bits/stdc++.h>

using i64 = long long;

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];
    }
    
    while (q--) {
        int s, t;
        std::cin >> s >> t;
        s--;
        t--;
        int ans = 0;
        std::queue<std::array<int, 4>> q;
        q.push({0, s, t, 0});
        q.push({0, s, t, 1});
        while (!q.empty()) {
            auto [dis, x, y, type] = q.front();
            q.pop();
            ans = std::max(ans, dis);
            //~ std::cout << dis << ": " << x << " " << y << "\n";
            if (type == 0) {
                int i = x + 1;
                while (i + 1 < n && a[i] <= b[y]) i++;
                if (i < n && a[i] > b[y]) q.push({dis + i - x, i, y, 1});
                else if (i == n - 1) ans = std::max(ans, dis + i - x);
                i = x - 1;
                while (i > 0 && a[i] <= b[y]) i--;
                if (i >= 0 && a[i] > b[y]) q.push({dis + x - i, i, y, 1});
                else if (i == 0) ans = std::max(ans, dis + x);
            } else {
                int j = y + 1;
                while (j + 1 < m && b[j] <= a[x]) j++;
                if (j < m && b[j] > a[x]) q.push({dis + j - y, x, j, 0});
                else if (j == m - 1) ans = std::max(ans, dis + j - y);
                j = y - 1;
                while (j > 0 && b[j] <= a[x]) j--;
                if (j >= 0 && b[j] > a[x]) q.push({dis + y - j, x, j, 0});
                else if (j == 0) ans = std::max(ans, dis + y);
            }
        }
        std::cout << ans << "\n";
    }
    
    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 380 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Execution timed out 5090 ms 113092 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 380 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Execution timed out 5090 ms 113092 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 492 KB Output is correct
2 Correct 107 ms 392 KB Output is correct
3 Correct 151 ms 500 KB Output is correct
4 Correct 158 ms 396 KB Output is correct
5 Correct 198 ms 504 KB Output is correct
6 Correct 166 ms 356 KB Output is correct
7 Correct 157 ms 460 KB Output is correct
8 Execution timed out 5068 ms 112984 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 380 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 372 KB Output is correct
19 Execution timed out 5090 ms 113092 KB Time limit exceeded
20 Halted 0 ms 0 KB -