oj.uz

Submission #876532

# Submission time Handle Problem Language Result Execution time Memory
876532 2023-11-21T22:41:09 Z LucaIlie Passport (JOI23_passport) C++17
48 / 100
 2000 ms 13124 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2e5;
const int INF = 1e9;
int l[MAX_N + 1], r[MAX_N + 1], minL[MAX_N + 1], maxR[MAX_N + 1], minSufL[MAX_N + 1], maxPrefR[MAX_N + 1], dist1[MAX_N + 1], distN[MAX_N + 1], dist1R[MAX_N + 1], distNR[MAX_N + 1], par[MAX_N + 1];

int n;

void calc_dist1() {
    struct dr {
        int i, dist, maxR;

        bool operator < ( const dr &x ) const {
            if ( dist == x.dist )
                return maxR < x.maxR;
            return dist > x.dist;
        }
    };
    for ( int i = 0; i <= n; i++ )
        dist1[i] = INF, maxR[i] = 0;

    priority_queue<dr> pq;
    dist1[1] = 0;
    maxR[1] = 0;
    pq.push( { 1, dist1[1], maxR[1] } );
    while ( !pq.empty() ) {
        auto crt = pq.top();
        pq.pop();

        int i = crt.i;

        for ( int j = 1; j <= n; j++ ) {
            if ( l[j] <= i && i <= r[j] ) {
                if ( dist1[i] + 1 <= dist1[j] && max( maxR[i], r[j] ) > maxR[j] ) {
                    dist1[j] = dist1[i] + 1;
                    par[j] = i;
                    maxR[j] = max( maxR[i], r[j] );
                    pq.push( { j, dist1[j], maxR[j] } );
                }
            }
        }
    }
    dist1[1] = 1;
    maxR[1] = r[1];
}

void calc_distN() {
    struct dr {
        int i, dist, minL;

        bool operator < ( const dr &x ) const {
            if ( dist == x.dist )
                return minL > x.minL;
            return dist > x.dist;
        }
    };
    for ( int i = 0; i <= n; i++ )
        distN[i] = INF, minL[i] = n + 1;

    priority_queue<dr> pq;
    distN[n] = 0;
    minL[n] = n + 1;
    pq.push( { n, distN[n], minL[n] } );
    while ( !pq.empty() ) {
        auto crt = pq.top();
        pq.pop();

        int i = crt.i;

        for ( int j = 1; j <= n; j++ ) {
            if ( l[j] <= i && i <= r[j] ) {
                if ( distN[i] + 1 <= distN[j] && min( minL[i], l[j] ) < minL[j] ) {
                    distN[j] = distN[i] + 1;
                    par[j] = i;
                    minL[j] = min( minL[i], l[j] );
                    pq.push( { j, distN[j], minL[j] } );
                }
            }
        }
    }
    distN[n] = 1;
    minL[n] = r[n];
}

void calc_dist1_rest() {
    for ( int i = 0; i <= n; i++ )
        dist1R[i] = INF;
    minSufL[n] = l[n];
    for ( int i = n - 1; i >= 1; i-- )
        minSufL[i] = min( minSufL[i + 1], l[i] );
    dist1R[1] = 0;
    for ( int i = 2; i <= n; i++ )
        dist1R[i] = dist1R[minSufL[i]] + 1;
}

void calc_distN_rest() {
    for ( int i = n - 1; i >= 0; i-- )
        distNR[i] = INF;
    for ( int i = 1; i <= n; i++ )
        maxPrefR[i] = max( maxPrefR[i - 1], r[i] );
    distNR[n] = 0;
    for ( int i = n - 1; i >= 1; i-- )
        distNR[i] = distNR[maxPrefR[i]] + 1;
}

int main() {
    ios_base::sync_with_stdio( false );
    cin.tie( NULL );
    cout.tie( NULL );

    int q;

    cin >> n;
    for ( int i = 1; i <= n; i++ )
        cin >> l[i] >> r[i];

    calc_dist1();
    calc_distN();
    calc_dist1_rest();
    calc_distN_rest();

    cin >> q;
    while ( q-- ) {
        int x;
        cin >> x;
        int ans = min( distN[x] + dist1R[minL[x]], dist1[x] + distNR[maxR[x]] );
        cout << (ans > n ? -1 : ans) << "\n";
    }

    return 0;
}

Subtask #1
0 / 6.0

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

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8660 KB Output is correct
9 Correct 1 ms 8536 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8536 KB Output is correct
16 Correct 25 ms 8468 KB Output is correct
17 Correct 11 ms 8540 KB Output is correct
18 Correct 13 ms 8536 KB Output is correct
19 Correct 12 ms 8704 KB Output is correct
20 Correct 14 ms 8540 KB Output is correct
21 Correct 11 ms 8540 KB Output is correct
22 Correct 8 ms 8540 KB Output is correct
23 Correct 15 ms 8540 KB Output is correct
24 Correct 9 ms 8536 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8660 KB Output is correct
9 Correct 1 ms 8536 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8536 KB Output is correct
16 Correct 25 ms 8468 KB Output is correct
17 Correct 11 ms 8540 KB Output is correct
18 Correct 13 ms 8536 KB Output is correct
19 Correct 12 ms 8704 KB Output is correct
20 Correct 14 ms 8540 KB Output is correct
21 Correct 11 ms 8540 KB Output is correct
22 Correct 8 ms 8540 KB Output is correct
23 Correct 15 ms 8540 KB Output is correct
24 Correct 9 ms 8536 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 26 ms 8724 KB Output is correct
28 Correct 12 ms 8540 KB Output is correct
29 Correct 15 ms 8532 KB Output is correct
30 Correct 11 ms 8536 KB Output is correct
31 Correct 13 ms 8540 KB Output is correct

Subtask #5
0 / 46.0

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