oj.uz

Submission #883551

# Submission time Handle Problem Language Result Execution time Memory
883551 2023-12-05T12:02:30 Z vjudge1 Passport (JOI23_passport) C++17
16 / 100
 2000 ms 1048576 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC target("avx,avx2,fma")

#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

using namespace std;
using ll = long long;
using db = long double;  // or double, if TL is tight
using str = string; 
using ii = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;


int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<ii> S;
    for(int i = 0; i < n; ++i) {
        int l, r;
        cin >> l >> r;
        --l; --r;
        S.push_back({l, r});
    }
    int q;
    cin >> q;
    for(int nrq = 0; nrq < q; ++nrq) {
        vector<vi> DP(n, vi(n, -1));
        int x0;
        cin >> x0;
        --x0;
        DP[x0][x0] = 0;
        for(int len = 1; len <= n; ++len) {
            for(int i = 0; i < n; ++i) {
                int j = i + len - 1;
                if(j >= n || DP[i][j] == -1) continue;
                for(int k = i; k <= j; ++k) {
                    int ni = min(i, S[k].first), nj = max(j, S[k].second);
                    if(DP[ni][nj] == -1 || DP[ni][nj] > 1 + DP[i][j]) {
                        DP[ni][nj] = DP[i][j] + 1;
                    }
                }
            }
        }
        cout << DP[0][n - 1] << "\n";
    }

    return 0;
}

Subtask #1
0 / 6.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 Runtime error 501 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 3 ms 704 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 4 ms 712 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 3 ms 704 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 4 ms 712 KB Output is correct
16 Correct 1175 ms 21948 KB Output is correct
17 Correct 938 ms 24772 KB Output is correct
18 Correct 48 ms 24924 KB Output is correct
19 Correct 62 ms 23760 KB Output is correct
20 Execution timed out 2050 ms 24924 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 3 ms 704 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 4 ms 712 KB Output is correct
16 Correct 1175 ms 21948 KB Output is correct
17 Correct 938 ms 24772 KB Output is correct
18 Correct 48 ms 24924 KB Output is correct
19 Correct 62 ms 23760 KB Output is correct
20 Execution timed out 2050 ms 24924 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
0 / 46.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 Runtime error 501 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -