oj.uz

Submission #793818

# Submission time Handle Problem Language Result Execution time Memory
793818 2023-07-26T07:01:13 Z vjudge1 Passport (JOI23_passport) C++17
16 / 100
 2000 ms 5652 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 3010;
const int INF = 1e9;

int dp[N][N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin >> n;
    int L[n + 1], R[n + 1];
    for(int i = 1; i <= n; i++)
        cin >> L[i] >> R[i];
    dp[1][n] = 0;
    for(int len = n - 1; len >= 1; len--) {
        for(int l = 1; l <= n - len + 1; l++) {
            int r = l + len - 1;
            dp[l][r] = INF;
            for(int i = l; i <= r; i++) {
                dp[l][r] = min(dp[l][r], dp[min(l, L[i])][max(r, R[i])] + 1);
            } 
        }
    }   
    int q;
    cin >> q;
    while(q--) {
        int x;
        cin >> x;
        cout << (dp[x][x] == INF ? -1 : dp[x][x]) << '\n';
    }
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Execution timed out 2075 ms 2120 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 11 ms 1604 KB Output is correct
12 Correct 17 ms 1620 KB Output is correct
13 Correct 13 ms 1604 KB Output is correct
14 Correct 12 ms 1564 KB Output is correct
15 Correct 15 ms 1620 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 11 ms 1604 KB Output is correct
12 Correct 17 ms 1620 KB Output is correct
13 Correct 13 ms 1604 KB Output is correct
14 Correct 12 ms 1564 KB Output is correct
15 Correct 15 ms 1620 KB Output is correct
16 Execution timed out 2074 ms 5652 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 11 ms 1604 KB Output is correct
12 Correct 17 ms 1620 KB Output is correct
13 Correct 13 ms 1604 KB Output is correct
14 Correct 12 ms 1564 KB Output is correct
15 Correct 15 ms 1620 KB Output is correct
16 Execution timed out 2074 ms 5652 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Execution timed out 2075 ms 2120 KB Time limit exceeded
5 Halted 0 ms 0 KB -