oj.uz

Submission #937705

# Submission time Handle Problem Language Result Execution time Memory
937705 2024-03-04T11:40:56 Z LucaIlie Event Hopping (BOI22_events) C++17
0 / 100
 1500 ms 9428 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e5;
const int MAX_LOG_N = 16;
const int MAX_T = 2e5;

struct event {
    int i, s, e;
};

int prv[MAX_LOG_N + 1][MAX_N + 1];
event events[MAX_N + 1];
map<int, int> nrm;

bool canSwitch( event a, event b ) {
    return (b.s <= a.e && a.e <= b.e);
}

int main() {
    int n, q;

    cin >> n >> q;
    for ( int i = 1; i <= n; i++ ) {
        cin >> events[i].s >> events[i].e;
        nrm[events[i].s] = nrm[events[i].e] = 1;
        events[i].i = i + 1;
    }
    int t = 0;
    for ( auto p: nrm )
        nrm[p.first] = ++t;
    for ( int i = 1; i <= n; i++ ) {
        events[i].s = nrm[events[i].s];
        events[i].e = nrm[events[i].e];
    }

    for ( int i = 1; i <= n; i++ ) {
        prv[0][i] = i;
        for ( int j = 1; j <= n; j++ ) {
            if ( canSwitch( events[j], events[i] )  ) {
                if ( events[j].s < events[prv[0][i]].s )
                    prv[0][i] = j;
            }
        }
    }

    for ( int p = 1; (1 << p) <= n; p++ ) {
        for ( int i = 1; i <= n; i++ )
            prv[p][i] = prv[p - 1][prv[p - 1][i]];
    }

    while ( q-- ) {
        int s, e, x = 1;
        cin >> s >> e;

        int i = e;
        for ( int p = log2( n ); p >= 0; p-- ) {
            if ( events[prv[p][i]].s > events[s].e ) {
                i = prv[p][i];
                x += (1 << p);
            }
        }
        i = prv[0][i];
        x++;


        if ( s == e )
            cout << 0 << "\n";
        else if ( canSwitch( events[s], events[i] ) )
            cout << x << "\n";
        else
            cout << "impossible\n";
    }

    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Execution timed out 1580 ms 9388 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Incorrect 5 ms 6492 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Incorrect 5 ms 6492 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 5 ms 6492 KB Output is correct
4 Incorrect 5 ms 6492 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1586 ms 9428 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Execution timed out 1580 ms 9388 KB Time limit exceeded
3 Halted 0 ms 0 KB -