oj.uz

Submission #864221

# Submission time Handle Problem Language Result Execution time Memory
864221 2023-10-22T09:08:57 Z danikoynov Event Hopping (BOI22_events) C++14
10 / 100
 1500 ms 4080 KB 
#include<bits/stdc++.h>

using namespace std;

const int maxn = 1e5 + 10;
     
struct interval
{
    int s, e, idx;
}seg[maxn];
     
int n, q;   
pair < int, int > task[maxn];

void input()
{
    cin >> n >> q;
    for (int i = 1; i <= n; i ++)
    {
        cin >> seg[i].s >> seg[i].e;
        seg[i].idx = i;
    }
    for (int i = 1; i <= q; i ++)
    {
        cin >> task[i].first >> task[i].second;
    }
}


bool cmp_end(interval seg1, interval seg2)
{
    
    return seg1.e < seg2.e;
}

int lf[maxn], rev[maxn], rf[maxn];
void build_graph()
{
    sort(seg + 1, seg + n + 1, cmp_end);
    for (int i = 1; i <= n; i ++)
    {
        rev[seg[i].idx] = i;
    }

    for (int i = 1; i <= n; i ++)
    {
        lf[i] = 1;
        while(seg[lf[i]].e < seg[i].s)
            lf[i] ++;

        rf[i] = n;
        while(seg[rf[i]].e > seg[i].e)
            rf[i] --;
    }
}

void answer_queries()
{
    /**cout << "----------------------" << endl;
    for (int i = 1; i <= n; i ++)
        cout << seg[i].s << " :: " << seg[i].e << endl;*/
    
    for (int i = 1; i <= q; i ++)
    {
        int st = rev[task[i].first], en = rev[task[i].second];

        int steps = 0, last_left = en + 1, last_right = en - 1;
        int bound_left = en, bound_right = en;
        bool done = false;
        while(!(st >= bound_left && st <= bound_right))
        {
            ///cout << last << " " << bound << endl;
            steps ++;
            int new_left = bound_left;
            int new_right = bound_right;
            for (int i = bound_left; i < last_left; i ++)
            {
                new_left = min(new_left, lf[i]);
                new_right = max(new_right, rf[i]);
            }
            for (int i = last_right + 1; i <= bound_right; i ++)
            {
                new_left = min(new_left, lf[i]);
                new_right = max(new_right, rf[i]);
            }
            ///cout << new_bound << endl;
            if (new_left == bound_left && new_right == bound_right)
            {
                done = true;
                break;
            }
            
            last_left = bound_left;
            last_right = bound_right;
            bound_left = new_left;
            bound_right = new_right;
        }

        if (done)
            cout << "impossible" << endl;
        else
            cout << steps << endl;
    }
}
void solve()
{  
    input();
    build_graph();
    answer_queries();
}

int main()
{   
    ///speed();
    solve();

    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 ms 2392 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 949 ms 2960 KB Output is correct
20 Execution timed out 1520 ms 4080 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 3 ms 2392 KB Output is correct
16 Correct 2 ms 2392 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Execution timed out 1570 ms 3412 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1586 ms 3692 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 2396 KB Output is correct
2 Execution timed out 1573 ms 3672 KB Time limit exceeded
3 Halted 0 ms 0 KB -