oj.uz

Submission #636975

# Submission time Handle Problem Language Result Execution time Memory
636975 2022-08-30T22:20:30 Z danikoynov Railway Trip 2 (JOI22_ho_t4) C++14
27 / 100
 2000 ms 36168 KB 
/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 2e5 + 10;

struct road
{
    int a, b;
} r[maxn];

struct interval
{
    int l, r, idx;

    interval(int _l = 0, int _r = 0, int _idx = 0)
    {
        l = _l;
        r = _r;
        idx = _idx;
    }

    bool operator < (const interval &it) const
    {
        return make_pair(l, r) < make_pair(it.l, it.r);
    }
};

int n, k, m, q;

bool on_train(int pos, int idx)
{
    if (r[idx].a < r[idx].b)
    {
        return (pos >= r[idx].a && pos <= r[idx].a + k - 1);
    }
    else
    {
        return (pos >= r[idx].a - k + 1 && pos <= r[idx].a);
    }
}

int to_left[maxn], to_right[maxn];

int solve_query(int s, int t)
{
    int lf = s, rf = s, len = 0, nlf = min(lf, to_left[lf]), nrf = max(rf, to_right[rf]);
    while(true)
    {
        if (lf <= t && rf >= t)
            return len;

        if (nlf == lf && rf == nrf)
            break;

        int tlf = nlf, trf = nrf;
        for (int j = rf + 1; j <= nrf; j ++)
        {
            tlf = min(tlf, to_left[j]);
            trf = max(trf, to_right[j]);
        }
        for (int j = nlf; j < lf; j ++)
        {
            tlf = min(tlf, to_left[j]);
            trf = max(trf, to_right[j]);
        }

        lf = nlf;
        rf = nrf;
        len ++;
        nlf = tlf;
        nrf = trf;
    }

    return -1;
}
vector < int > tr_add[maxn], tr_rem[maxn];
vector < int > tl_add[maxn], tl_rem[maxn];
void solve()
{
    cin >> n >> k;
    cin >> m;

    for (int i = 1; i <= n; i ++)
    {
        to_left[i] = n + 1;
        to_right[i] = 0;
    }

    for (int i = 1; i <= m; i ++)
    {
        cin >> r[i].a >> r[i].b;
        if (r[i].a < r[i].b)
        {
            if (r[i].a < n)
            {
                tr_add[r[i].a].push_back(r[i].b);
                tr_rem[min(n, r[i].a + k - 1)].push_back(r[i].b);

            }
            ///for (int j = r[i].a; j <= min(n, r[i].a + k - 1); j ++)
            ///to_right[j] = max(to_right[j], r[i].b);
        }
        else
        {
            if (r[i].a > 1)
            {
                tl_add[r[i].a].push_back(r[i].b);
                tl_rem[max(1, r[i].a - k + 1)].push_back(r[i].b);
            }
            ///for (int j = r[i].a; j >= max(1, r[i].a - k + 1); j --)
            /// to_left[j] = min(to_left[j], r[i].b);
        }
    }

    multiset < int > st;
    for (int i = 1; i <= n; i ++)
    {
        for (int v : tr_add[i])
        {
            ///cout << "add " << v << endl;
            st.insert(v);
        }

        if (!st.empty())
            to_right[i] = *st.rbegin();

        for (int v : tr_rem[i])
        {
            ///cout << "rem " << v << endl;
            st.erase(st.find(v));
        }
    }

    st.clear();
    for (int i = n; i > 0; i --)
    {
        for (int v : tl_add[i])
            st.insert(v);

        if (!st.empty())
            to_left[i] = *st.begin();

        for (int v : tl_rem[i])
            st.erase(st.find(v));
    }


    cin >> q;
    for (int i = 1; i <= q; i ++)
    {
        int s, t;
        cin >> s >> t;
        int ans = solve_query(s, t);
        cout << ans << endl;
    }
}

int main()
{
    speed();
    solve();
    return 0;
}
/**
5 2
2
5 1
3 5
1
5 3

*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 10 ms 19068 KB Output is correct
3 Correct 12 ms 19092 KB Output is correct
4 Correct 12 ms 19028 KB Output is correct
5 Correct 11 ms 19028 KB Output is correct
6 Correct 11 ms 19088 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 10 ms 19096 KB Output is correct
10 Correct 10 ms 19080 KB Output is correct
11 Correct 9 ms 19040 KB Output is correct
12 Correct 9 ms 19156 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 10 ms 19068 KB Output is correct
3 Correct 12 ms 19092 KB Output is correct
4 Correct 12 ms 19028 KB Output is correct
5 Correct 11 ms 19028 KB Output is correct
6 Correct 11 ms 19088 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 10 ms 19096 KB Output is correct
10 Correct 10 ms 19080 KB Output is correct
11 Correct 9 ms 19040 KB Output is correct
12 Correct 9 ms 19156 KB Output is correct
13 Correct 15 ms 19192 KB Output is correct
14 Correct 15 ms 19256 KB Output is correct
15 Correct 11 ms 19220 KB Output is correct
16 Correct 13 ms 19156 KB Output is correct
17 Correct 12 ms 19284 KB Output is correct
18 Correct 16 ms 19284 KB Output is correct
19 Correct 13 ms 19156 KB Output is correct
20 Correct 17 ms 19284 KB Output is correct
21 Correct 10 ms 19172 KB Output is correct
22 Correct 14 ms 19156 KB Output is correct
23 Correct 12 ms 19264 KB Output is correct
24 Correct 13 ms 19272 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 25596 KB Output is correct
2 Correct 43 ms 25412 KB Output is correct
3 Correct 73 ms 26672 KB Output is correct
4 Correct 54 ms 25100 KB Output is correct
5 Correct 179 ms 30652 KB Output is correct
6 Correct 128 ms 36168 KB Output is correct
7 Correct 122 ms 35172 KB Output is correct
8 Correct 96 ms 27596 KB Output is correct
9 Correct 89 ms 27000 KB Output is correct
10 Correct 183 ms 31760 KB Output is correct
11 Correct 183 ms 33264 KB Output is correct

Subtask #4
0 / 25.0

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

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1553 ms 31252 KB Output is correct
2 Execution timed out 2076 ms 28788 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 10 ms 19068 KB Output is correct
3 Correct 12 ms 19092 KB Output is correct
4 Correct 12 ms 19028 KB Output is correct
5 Correct 11 ms 19028 KB Output is correct
6 Correct 11 ms 19088 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 12 ms 19156 KB Output is correct
9 Correct 10 ms 19096 KB Output is correct
10 Correct 10 ms 19080 KB Output is correct
11 Correct 9 ms 19040 KB Output is correct
12 Correct 9 ms 19156 KB Output is correct
13 Correct 15 ms 19192 KB Output is correct
14 Correct 15 ms 19256 KB Output is correct
15 Correct 11 ms 19220 KB Output is correct
16 Correct 13 ms 19156 KB Output is correct
17 Correct 12 ms 19284 KB Output is correct
18 Correct 16 ms 19284 KB Output is correct
19 Correct 13 ms 19156 KB Output is correct
20 Correct 17 ms 19284 KB Output is correct
21 Correct 10 ms 19172 KB Output is correct
22 Correct 14 ms 19156 KB Output is correct
23 Correct 12 ms 19264 KB Output is correct
24 Correct 13 ms 19272 KB Output is correct
25 Correct 43 ms 25596 KB Output is correct
26 Correct 43 ms 25412 KB Output is correct
27 Correct 73 ms 26672 KB Output is correct
28 Correct 54 ms 25100 KB Output is correct
29 Correct 179 ms 30652 KB Output is correct
30 Correct 128 ms 36168 KB Output is correct
31 Correct 122 ms 35172 KB Output is correct
32 Correct 96 ms 27596 KB Output is correct
33 Correct 89 ms 27000 KB Output is correct
34 Correct 183 ms 31760 KB Output is correct
35 Correct 183 ms 33264 KB Output is correct
36 Execution timed out 2084 ms 25792 KB Time limit exceeded
37 Halted 0 ms 0 KB -