oj.uz

답안 #887093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887093 2023-12-13T18:52:35 Z VerdantGMD Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 794 ms 36560 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int n, k;

int maxs[200003];
int mins[200003];
int minjp[200003][20];
int maxjp[200003][20];
int base = n + 1;

void updmax(int a, int b, int x)
{
    a += base - 1;
    b += base + 1;
    while(a/2 != b/2)
    {
        if(a % 2 == 0)
        {
            maxs[a+1] = max(x, maxs[a+1]);
        }
        if(b % 2 == 1)
        {
            maxs[b-1] = max(x, maxs[b-1]);
        }
        a/=2;
        b/=2;
    }
}
void updmin(int a, int b, int x)
{
    a += base - 1;
    b += base + 1;
    while(a/2 != b/2)
    {
        if(a % 2 == 0)
        {
            if(mins[a+1] != 0)
            {
                mins[a+1] = min(x, mins[a+1]);
            }
            else
            {
                mins[a+1] = x;
            }
        }
        if(b % 2 == 1)
        {
            if(mins[b-1] != 0)
            {
                mins[b-1] = min(x, mins[b-1]);
            }
            else
            {
                mins[b-1] = x;
            }
        }
        a/=2;
        b/=2;
    }
}
int querymin(int a)
{
    a += base;
    int minn = 1e9;
    while(a != 0)
    {
        if(mins[a] != 0)
        {
            minn = min(mins[a], minn);
        }
        a/=2;
    }
    return minn;
}
int querymax(int a)
{
    a += base;
    int maxx = -1e9;
    while(a != 0)
    {
        if(maxs[a] != 0)
        {
            maxx = max(maxs[a], maxx);
        }
        a/=2;
    }
    return maxx;
}

void updmaxjp(int a, int it, int val)
{
    a += base;
    while(a != 0)
    {
        if(maxjp[a][it] != 0)
        {
            maxjp[a][it] = max(val, maxjp[a][it]);
        }
        else
        {
            maxjp[a][it] = val;
        }
        a/=2;
    }

}

void updminjp(int a, int it, int val)
{
    a += base;
    while(a != 0)
    {
        if(minjp[a][it] != 0)
        {
            minjp[a][it] = min(val, minjp[a][it]);
        }
        else
        {
            minjp[a][it] = val;
        }
        a/=2;
    }
}

int querymaxjp(int a, int b, int it)
{
    a += base - 1;
    b += base + 1;
    int maxx = -1e9;
    while(a/2 != b/2)
    {
        if(a % 2 == 0)
        {
            if(maxjp[a+1][it] != 0)
            {
                maxx = max(maxx, maxjp[a+1][it]);
            }
        }
        if(b % 2 == 1)
        {
            if(maxjp[b-1][it] != 0)
            {
                maxx = max(maxx, maxjp[b-1][it]);
            }
        }
        a/=2;
        b/=2;
    }
    return maxx;
}

int queryminjp(int a, int b, int it)
{
    a += base - 1;
    b += base + 1;
    int minn = 1e9;
    while(a/2 != b/2)
    {
        if(a % 2 == 0)
        {
            if(minjp[a+1][it] != 0)
            {
                minn = min(minn, minjp[a+1][it]);
            }
        }
        if(b % 2 == 1)
        {
            if(minjp[b-1][it] != 0)
            {
                minn = min(minn, minjp[b-1][it]);
            }
        }
        a/=2;
        b/=2;
    }
    return minn;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> k;
    int m;
    cin >> m;
    base = n + 1;
    for(int i = base; i <= base + n; i++)
    {
        mins[i] = i - base;
        maxs[i] = i - base;
    }
    for (int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        if(a < b)
        {
            updmax(a, min(a + k-1, b), b);
        }
        else
        {
            updmin(max(a - k+1, b), a, b);
        }
    }

    for(int i = 1; i <= n; i++)
    {
        updminjp(i, 0, querymin(i));
        updmaxjp(i, 0, querymax(i));
        //cout << i << " " << minjp[i+base][0] << " " << maxjp[i+base][0] << endl;
    }
    //cout << endl;
    for(int it = 1; it < 20; it++)
    {
        for (int i = 1; i <= n; i++)
        {
            updmaxjp(i, it, querymaxjp(minjp[i + base][it - 1], maxjp[i + base][it - 1], it - 1));
            updminjp(i, it, queryminjp(minjp[i + base][it - 1], maxjp[i + base][it - 1], it - 1));
            //cout << i << " " << minjp[i+base][it] << " " << maxjp[i+base][it] << endl;
        }

        //cout << endl;
    }

    cin >> m;
    for (int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        if(a == b)
        {
            cout << 0 << endl;
            continue;
        }
        if(a < b)
        {
            int wyn = 0;
            int curl = a;
            int curr = a;
            for(int it = 19; it >= 0; it--)
            {
                if(querymaxjp(curl, curr, it) < b)
                {
                    wyn += pow(2, it);
                    int temp = queryminjp(curl, curr, it);
                    curr = querymaxjp(curl, curr, it);
                    curl = temp;
                }

            }
            if(querymaxjp(curl, curr, 0) >= b)
            {
                cout << wyn + 1 << endl;
            }
            else
            {
                cout << -1 << endl;
            }

        }
        else
        if(a > b)
        {
            int wyn = 0;
            int curl = a;
            int curr = a;
            for(int it = 19; it >= 0; it--)
            {
                if(queryminjp(curl, curr, it) > b)
                {
                    wyn += pow(2, it);
                    int temp = queryminjp(curl, curr, it);
                    curr = querymaxjp(curl, curr, it);
                    curl = temp;
                }

            }
            if(queryminjp(curl, curr, 0) <= b)
            {
                cout << wyn + 1 << endl;
            }
            else
            {
                cout << -1 << endl;
            }

        }
    }

}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 11 ms 1116 KB Output is correct
14 Correct 10 ms 1148 KB Output is correct
15 Correct 5 ms 1112 KB Output is correct
16 Correct 11 ms 1116 KB Output is correct
17 Correct 8 ms 1116 KB Output is correct
18 Correct 8 ms 1112 KB Output is correct
19 Correct 7 ms 1140 KB Output is correct
20 Correct 7 ms 1112 KB Output is correct
21 Correct 5 ms 1116 KB Output is correct
22 Correct 10 ms 1244 KB Output is correct
23 Correct 8 ms 1112 KB Output is correct
24 Correct 9 ms 1116 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 465 ms 33480 KB Output is correct
2 Correct 459 ms 33448 KB Output is correct
3 Correct 560 ms 33648 KB Output is correct
4 Correct 435 ms 33364 KB Output is correct
5 Correct 334 ms 35664 KB Output is correct
6 Correct 445 ms 34900 KB Output is correct
7 Correct 356 ms 35336 KB Output is correct
8 Correct 300 ms 34148 KB Output is correct
9 Correct 355 ms 34464 KB Output is correct
10 Correct 363 ms 35408 KB Output is correct
11 Correct 386 ms 35364 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 512 ms 34920 KB Output is correct
2 Correct 527 ms 36160 KB Output is correct
3 Correct 678 ms 34956 KB Output is correct
4 Correct 420 ms 35828 KB Output is correct
5 Correct 396 ms 35792 KB Output is correct
6 Correct 409 ms 36108 KB Output is correct
7 Correct 499 ms 36436 KB Output is correct
8 Correct 553 ms 36180 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 740 ms 35812 KB Output is correct
2 Correct 689 ms 34444 KB Output is correct
3 Correct 630 ms 33776 KB Output is correct
4 Correct 719 ms 33644 KB Output is correct
5 Correct 467 ms 33600 KB Output is correct
6 Correct 640 ms 33480 KB Output is correct
7 Correct 584 ms 34572 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 10 ms 1116 KB Output is correct
10 Correct 530 ms 35220 KB Output is correct
11 Correct 601 ms 35728 KB Output is correct
12 Correct 599 ms 35260 KB Output is correct
13 Correct 606 ms 35720 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 11 ms 1040 KB Output is correct
16 Correct 494 ms 35056 KB Output is correct
17 Correct 726 ms 35924 KB Output is correct
18 Correct 794 ms 36088 KB Output is correct
19 Correct 699 ms 35668 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 11 ms 1116 KB Output is correct
14 Correct 10 ms 1148 KB Output is correct
15 Correct 5 ms 1112 KB Output is correct
16 Correct 11 ms 1116 KB Output is correct
17 Correct 8 ms 1116 KB Output is correct
18 Correct 8 ms 1112 KB Output is correct
19 Correct 7 ms 1140 KB Output is correct
20 Correct 7 ms 1112 KB Output is correct
21 Correct 5 ms 1116 KB Output is correct
22 Correct 10 ms 1244 KB Output is correct
23 Correct 8 ms 1112 KB Output is correct
24 Correct 9 ms 1116 KB Output is correct
25 Correct 465 ms 33480 KB Output is correct
26 Correct 459 ms 33448 KB Output is correct
27 Correct 560 ms 33648 KB Output is correct
28 Correct 435 ms 33364 KB Output is correct
29 Correct 334 ms 35664 KB Output is correct
30 Correct 445 ms 34900 KB Output is correct
31 Correct 356 ms 35336 KB Output is correct
32 Correct 300 ms 34148 KB Output is correct
33 Correct 355 ms 34464 KB Output is correct
34 Correct 363 ms 35408 KB Output is correct
35 Correct 386 ms 35364 KB Output is correct
36 Correct 512 ms 34920 KB Output is correct
37 Correct 527 ms 36160 KB Output is correct
38 Correct 678 ms 34956 KB Output is correct
39 Correct 420 ms 35828 KB Output is correct
40 Correct 396 ms 35792 KB Output is correct
41 Correct 409 ms 36108 KB Output is correct
42 Correct 499 ms 36436 KB Output is correct
43 Correct 553 ms 36180 KB Output is correct
44 Correct 740 ms 35812 KB Output is correct
45 Correct 689 ms 34444 KB Output is correct
46 Correct 630 ms 33776 KB Output is correct
47 Correct 719 ms 33644 KB Output is correct
48 Correct 467 ms 33600 KB Output is correct
49 Correct 640 ms 33480 KB Output is correct
50 Correct 584 ms 34572 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 10 ms 1116 KB Output is correct
53 Correct 530 ms 35220 KB Output is correct
54 Correct 601 ms 35728 KB Output is correct
55 Correct 599 ms 35260 KB Output is correct
56 Correct 606 ms 35720 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 11 ms 1040 KB Output is correct
59 Correct 494 ms 35056 KB Output is correct
60 Correct 726 ms 35924 KB Output is correct
61 Correct 794 ms 36088 KB Output is correct
62 Correct 699 ms 35668 KB Output is correct
63 Correct 604 ms 34136 KB Output is correct
64 Correct 735 ms 34388 KB Output is correct
65 Correct 654 ms 34184 KB Output is correct
66 Correct 532 ms 36436 KB Output is correct
67 Correct 671 ms 35532 KB Output is correct
68 Correct 388 ms 35800 KB Output is correct
69 Correct 400 ms 36116 KB Output is correct
70 Correct 541 ms 35924 KB Output is correct
71 Correct 559 ms 36560 KB Output is correct