oj.uz

Submission #991014

# Submission time Handle Problem Language Result Execution time Memory
991014 2024-06-01T04:13:38 Z Pacybwoah Passport (JOI23_passport) C++17
48 / 100
 432 ms 1048576 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,bmi2")
#include<iostream>
#include<vector>
#include<utility>
#include<map>
using namespace std;
struct st{
    vector<int> vec;
    st(int n){
        vec.resize(4 * n + 4);
    }
    void build(int l, int r, int ind, vector<int>& sr){
        if(l == r){
            vec[ind] = sr[l];
        }
        else{
            int mid = (l + r) >> 1;
            build(l, mid, ind * 2, sr);
            build(mid + 1, r, ind * 2 + 1, sr);
            vec[ind] = min(vec[ind * 2], vec[ind * 2 + 1]);
        }
    }
    void modify(int l, int r, int num, int pos, int ind){
        if(l == r){
            vec[ind] = num;
            return;
        }
        int mid = (l + r) >> 1;
        if(pos <= mid) modify(l, mid, num, pos, ind * 2);
        else modify(mid + 1, r, num, pos, ind * 2 + 1);
        vec[ind] = min(vec[ind * 2], vec[ind * 2 + 1]);
    }
    int query(int l, int r, int start, int end, int ind){
        if(r < start || end < l) return 1e9;
        if(start <= l && r <= end) return vec[ind];
        int mid = (l + r) >> 1;
        return min(query(l, mid, start, end, ind * 2), query(mid + 1, r, start, end, ind * 2 + 1));
    }
};
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<pair<int, int>> vec(n + 1);
    for(int i = 1; i <= n; i++) cin >> vec[i].first >> vec[i].second;
    vector<vector<vector<int>>> m(n + 1, vector<vector<int>>(n + 1));
    for(int i = 1; i <= n; i++){
        m[vec[i].first][vec[i].second].push_back(i);
    }
    vector<vector<int>> dp(n + 1, vector<int>(n + 1, 1e9));
    dp[1][n] = 0;
    st mindp(n);
    vector<int> tmp(n + 1);
    vector<vector<int>> minl(n + 1, vector<int>(n + 1)), maxr(n + 1, vector<int>(n + 1));
    for(int i = 1; i <= n; i++) minl[i][i] = vec[i].first, maxr[i][i] = vec[i].second;
    for(int i = 1; i <= n; i++) for(int j = i + 1; j <= n; j++) minl[i][j] = min(minl[i][j - 1], vec[j].first), maxr[i][j] = max(maxr[i][j - 1], vec[j].second);
    for(int i = 1; i <= n; i++) tmp[i] = 1e9;
    mindp.build(1, n, 1, tmp);
    for(auto x: m[1][n]){
        mindp.modify(1, n, dp[1][n], x, 1);
    }
    for(int l = n - 1; l > 0; l--){
        for(int i = 1; i + l - 1 <= n; i++){
            int j = i + l - 1;
            dp[i][j] = min(dp[i][j], dp[minl[i][j]][j] + 1);
            dp[i][j] = min(dp[i][j], dp[i][maxr[i][j]] + 1);
            dp[i][j] = min(dp[i][j], mindp.query(1, n, i, j, 1) + 1);
            for(auto x: m[i][j]){
                mindp.modify(1, n, dp[i][j], x, 1);
            }
        }
    }
    int q;
    cin >> q;
    while(q--){
        int a;
        cin >> a;
        if(dp[a][a] == 1e9) cout << "-1\n";
        else cout << dp[a][a] << "\n";
    }
}
// g++ -std=gnu++20 pC.cpp -o run -Wall -Wextra -fsanitize=undefined -fsanitize=address

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Runtime error 432 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 0 ms 348 KB Output is correct
4 Correct 0 ms 376 KB Output is correct
5 Correct 0 ms 348 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 4 ms 3164 KB Output is correct
12 Correct 5 ms 3540 KB Output is correct
13 Correct 7 ms 3676 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 5 ms 3584 KB Output is correct

Subtask #3
24.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 0 ms 348 KB Output is correct
4 Correct 0 ms 376 KB Output is correct
5 Correct 0 ms 348 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 4 ms 3164 KB Output is correct
12 Correct 5 ms 3540 KB Output is correct
13 Correct 7 ms 3676 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 5 ms 3584 KB Output is correct
16 Correct 349 ms 193364 KB Output is correct
17 Correct 416 ms 219068 KB Output is correct
18 Correct 379 ms 221268 KB Output is correct
19 Correct 356 ms 209484 KB Output is correct
20 Correct 402 ms 221288 KB Output is correct
21 Correct 379 ms 221264 KB Output is correct
22 Correct 369 ms 221260 KB Output is correct
23 Correct 359 ms 221268 KB Output is correct
24 Correct 374 ms 221204 KB Output is correct

Subtask #4
8.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 0 ms 348 KB Output is correct
4 Correct 0 ms 376 KB Output is correct
5 Correct 0 ms 348 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 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 4 ms 3164 KB Output is correct
12 Correct 5 ms 3540 KB Output is correct
13 Correct 7 ms 3676 KB Output is correct
14 Correct 4 ms 3420 KB Output is correct
15 Correct 5 ms 3584 KB Output is correct
16 Correct 349 ms 193364 KB Output is correct
17 Correct 416 ms 219068 KB Output is correct
18 Correct 379 ms 221268 KB Output is correct
19 Correct 356 ms 209484 KB Output is correct
20 Correct 402 ms 221288 KB Output is correct
21 Correct 379 ms 221264 KB Output is correct
22 Correct 369 ms 221260 KB Output is correct
23 Correct 359 ms 221268 KB Output is correct
24 Correct 374 ms 221204 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 347 ms 207092 KB Output is correct
28 Correct 400 ms 221108 KB Output is correct
29 Correct 376 ms 221268 KB Output is correct
30 Correct 382 ms 221264 KB Output is correct
31 Correct 375 ms 207756 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Runtime error 432 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -