oj.uz

Submission #784564

# Submission time Handle Problem Language Result Execution time Memory
784564 2023-07-16T09:18:28 Z MohamedAliSaidane Passport (JOI23_passport) C++14
16 / 100
 2000 ms 18264 KB 
#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;

typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;

#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(),(x).end()

const int nax = 2e5 + 4;
int n, q;
vi L, R, X;
int sp[nax][20], LG[nax];
void build()
{
    for(int i =0 ; i < n;i++)
        sp[i][0] = R[i];
    //cout << "here" << endl;
    for(int j = 1; j < 20; j++)
    {
        //cout << j << endl;
        for(int i = 0; i + (1 << (j - 1)) < n;i ++)
            sp[i][j] = max(sp[i][j - 1], sp[i + (1 << (j - 1))][j - 1]);
    }
}
int RMQ(int l, int r)
{
    int j = LG[r - l + 1];
    return max(sp[l][j], sp[r- (1 << j) + 1][j]);
}
int dp[305][305];
int f(int l, int r)
{
    if(dp[l][r] != -1)
        return dp[l][r];
    if(l == 0 && r == n - 1)
        return dp[l][r] = 0;
    int ans = n + 2;
    for(int j = l; j <= r; j++)
    {
        if(L[j] < l || R[j] > r)
            ans = min(ans, f(min(L[j], l), max(R[j], r)) + 1);
    }
    return dp[l][r] = ans;
}
void solve()
{
    cin >> n;
    memset(dp, -1, sizeof(dp));
    L.resize(n); R.resize(n);
    for(int i =0; i < n; i++)
    {
        cin >> L[i] >> R[i];
        L[i]--; R[i]--;
    }

    build();
    //cout << "here" << endl;
    cin >> q;
    while(q--)
    {
        int X; cin >> X;
        X--;
        int l = L[X], r = R[X];
        int ans = f(l, r) + 1;
        if(ans >= n + 1)
            cout << "-1\n";
        else
            cout << ans << '\n';
    }
}

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    LG[1] = 0;
    for(int i =2; i < nax; i++)
        LG[i] = LG[i/2] + 1;
    int tt = 1;
    while(tt--)
        solve();
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Execution timed out 2089 ms 18264 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 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1368 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1380 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1368 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1380 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Incorrect 1 ms 1656 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Correct 1 ms 1364 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 1 ms 1368 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1380 KB Output is correct
10 Correct 1 ms 1364 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Incorrect 1 ms 1656 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1364 KB Output is correct
2 Correct 1 ms 1364 KB Output is correct
3 Correct 1 ms 1364 KB Output is correct
4 Execution timed out 2089 ms 18264 KB Time limit exceeded
5 Halted 0 ms 0 KB -