oj.uz

Submission #641900

# Submission time Handle Problem Language Result Execution time Memory
641900 2022-09-17T19:40:39 Z Richem Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 933 ms 111112 KB 
#include <iostream>
#include <stack>
using namespace std;

const int MAX_TRAJET = 2e5+42, MAX_POW = 19, MAX_FEUILLE = 262144, INF = 1e9;

int nbPos, distMax;
int nbTrajet;

int arbre[MAX_FEUILLE*2][2][MAX_POW];

int get(int deb, int fin, int id, int type) {
    deb += MAX_FEUILLE; fin += MAX_FEUILLE;

    int rep = INF;

    if(type == 1) rep = 0;

    while(deb <= fin) {
        if(deb % 2 == 1) {
            if(type == 0) rep = min(rep, arbre[deb++][0][id]);
            else rep = max(rep, arbre[deb++][1][id]);
        }
        if(fin % 2 == 0) {
            if(type == 0) rep = min(rep, arbre[fin--][0][id]);
            else rep = max(rep, arbre[fin--][1][id]);
        }

        deb /= 2;
        fin /= 2;
    }

    return rep;
}

void update(int pos, int val, int type, int id) {
    pos += MAX_FEUILLE;
    arbre[pos][type][id] = val;

    for(pos /= 2; pos > 0; pos /= 2) {
        int gauche = arbre[pos*2][type][id];
        int droite = arbre[pos*2+1][type][id];

        if(type == 0)
            arbre[pos][type][id] = min(gauche, droite);
        else
            arbre[pos][type][id] = max(gauche, droite);
    }
}

pair<int, int> posMax[MAX_TRAJET][MAX_POW];

void toutUpdate(int exp) {
    for(int pos = 0; pos < nbPos; pos++) {
        update(pos, posMax[pos][exp].first, 0, exp);
        update(pos, posMax[pos][exp].second, 1, exp);
    }
}

pair<int, int> calcInter(int exp, int deb, int fin) {
    int nouvDeb = get(deb, fin, exp, 0);
    int nouvFin = get(deb, fin, exp, 1);
    if(exp == 0) {
        nouvDeb = get(deb, min(nbPos-1, fin + distMax - 1), exp, 0);
        nouvFin = get(max(0, deb - distMax + 1), fin, exp, 1);
    }

    return {nouvDeb, nouvFin};
}

void input() {
    for(int i = 0; i < MAX_FEUILLE*2; i++) {
        for(int j = 0; j < MAX_POW; j++) {
            arbre[i][0][j] = INF;
            arbre[i][1][j] = 0;
        }    
    }

    for(int i = 0; i < MAX_TRAJET; i++) 
        posMax[i][0].first = posMax[i][0].second = i;

    cin >> nbPos >> distMax >> nbTrajet;

    for(int i = 0; i < nbTrajet; i++) {
        int deb, fin;
        cin >> deb >> fin;
        deb--; fin--;

        if(deb <= fin) 
            posMax[deb][0].second = max(posMax[deb][0].second, fin);
        else
            posMax[deb][0].first = min(posMax[deb][0].first, fin);
    }        

    toutUpdate(0);

    for(int pos = 0; pos < nbPos; pos++) {
        posMax[pos][0].first = posMax[pos][0].second = pos;
        pair<int, int> ah = calcInter(0, pos, pos);

        posMax[pos][0].first = ah.first; posMax[pos][0].second = ah.second;
    }
}

void calcBl() {
    for(int exp = 1; exp < MAX_POW; exp++) {
        for(int pos = 0; pos < nbPos; pos++) {
            pair<int, int> ah = calcInter(exp-1, posMax[pos][exp-1].first, posMax[pos][exp-1].second);
            posMax[pos][exp].first = ah.first; posMax[pos][exp].second = ah.second;
        }

        toutUpdate(exp);
    }
}

int req(int depart, int arrive) {
    int posDeb = depart;

    int deb = depart, fin = depart;
    int rep = 0;

    for(int exp = MAX_POW-1; exp >= 0; exp--) {
        pair<int, int> nouv = calcInter(exp, deb, fin);

        if(arrive > nouv.second || arrive < nouv.first) {
            rep += (1 << exp);
            deb = nouv.first; fin = nouv.second;
        }
    }

    if(arrive < posMax[posDeb][MAX_POW-1].first || arrive > posMax[posDeb][MAX_POW-1].second)
        return -1;
    return rep+1;
}

int nbReq;

int main() {
    input();
    calcBl();

    cin >> nbReq;

    for(int i = 0; i < nbReq; i++) {
        int a,b;
        cin >> a >> b;

        cout << req(a-1, b-1) << endl;
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 107940 KB Output is correct
2 Correct 47 ms 107932 KB Output is correct
3 Correct 45 ms 107996 KB Output is correct
4 Correct 49 ms 107972 KB Output is correct
5 Correct 47 ms 107900 KB Output is correct
6 Correct 46 ms 107928 KB Output is correct
7 Correct 47 ms 107940 KB Output is correct
8 Correct 46 ms 107992 KB Output is correct
9 Correct 46 ms 107908 KB Output is correct
10 Correct 48 ms 107940 KB Output is correct
11 Correct 48 ms 107944 KB Output is correct
12 Correct 47 ms 107980 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 107940 KB Output is correct
2 Correct 47 ms 107932 KB Output is correct
3 Correct 45 ms 107996 KB Output is correct
4 Correct 49 ms 107972 KB Output is correct
5 Correct 47 ms 107900 KB Output is correct
6 Correct 46 ms 107928 KB Output is correct
7 Correct 47 ms 107940 KB Output is correct
8 Correct 46 ms 107992 KB Output is correct
9 Correct 46 ms 107908 KB Output is correct
10 Correct 48 ms 107940 KB Output is correct
11 Correct 48 ms 107944 KB Output is correct
12 Correct 47 ms 107980 KB Output is correct
13 Correct 64 ms 108016 KB Output is correct
14 Correct 58 ms 107940 KB Output is correct
15 Correct 53 ms 107904 KB Output is correct
16 Correct 59 ms 107980 KB Output is correct
17 Correct 59 ms 107932 KB Output is correct
18 Correct 58 ms 107932 KB Output is correct
19 Correct 59 ms 108000 KB Output is correct
20 Correct 55 ms 107980 KB Output is correct
21 Correct 54 ms 107968 KB Output is correct
22 Correct 61 ms 107972 KB Output is correct
23 Correct 57 ms 108008 KB Output is correct
24 Correct 58 ms 107904 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 586 ms 108008 KB Output is correct
2 Correct 570 ms 108016 KB Output is correct
3 Correct 616 ms 108012 KB Output is correct
4 Correct 560 ms 108012 KB Output is correct
5 Correct 538 ms 108048 KB Output is correct
6 Correct 556 ms 107980 KB Output is correct
7 Correct 526 ms 108016 KB Output is correct
8 Correct 481 ms 108008 KB Output is correct
9 Correct 481 ms 108012 KB Output is correct
10 Correct 566 ms 108012 KB Output is correct
11 Correct 577 ms 107928 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 703 ms 108140 KB Output is correct
2 Correct 738 ms 108136 KB Output is correct
3 Correct 794 ms 108372 KB Output is correct
4 Correct 629 ms 108004 KB Output is correct
5 Correct 653 ms 108052 KB Output is correct
6 Correct 618 ms 108076 KB Output is correct
7 Correct 724 ms 108136 KB Output is correct
8 Correct 752 ms 108168 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 875 ms 108044 KB Output is correct
2 Correct 772 ms 108260 KB Output is correct
3 Correct 767 ms 108264 KB Output is correct
4 Correct 784 ms 108388 KB Output is correct
5 Correct 641 ms 108392 KB Output is correct
6 Correct 748 ms 108620 KB Output is correct
7 Correct 752 ms 109840 KB Output is correct
8 Correct 51 ms 108012 KB Output is correct
9 Correct 59 ms 107984 KB Output is correct
10 Correct 687 ms 110232 KB Output is correct
11 Correct 776 ms 110816 KB Output is correct
12 Correct 804 ms 110940 KB Output is correct
13 Correct 789 ms 110864 KB Output is correct
14 Correct 49 ms 107896 KB Output is correct
15 Correct 60 ms 108044 KB Output is correct
16 Correct 624 ms 110248 KB Output is correct
17 Correct 933 ms 111088 KB Output is correct
18 Correct 898 ms 111068 KB Output is correct
19 Correct 899 ms 111092 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 107940 KB Output is correct
2 Correct 47 ms 107932 KB Output is correct
3 Correct 45 ms 107996 KB Output is correct
4 Correct 49 ms 107972 KB Output is correct
5 Correct 47 ms 107900 KB Output is correct
6 Correct 46 ms 107928 KB Output is correct
7 Correct 47 ms 107940 KB Output is correct
8 Correct 46 ms 107992 KB Output is correct
9 Correct 46 ms 107908 KB Output is correct
10 Correct 48 ms 107940 KB Output is correct
11 Correct 48 ms 107944 KB Output is correct
12 Correct 47 ms 107980 KB Output is correct
13 Correct 64 ms 108016 KB Output is correct
14 Correct 58 ms 107940 KB Output is correct
15 Correct 53 ms 107904 KB Output is correct
16 Correct 59 ms 107980 KB Output is correct
17 Correct 59 ms 107932 KB Output is correct
18 Correct 58 ms 107932 KB Output is correct
19 Correct 59 ms 108000 KB Output is correct
20 Correct 55 ms 107980 KB Output is correct
21 Correct 54 ms 107968 KB Output is correct
22 Correct 61 ms 107972 KB Output is correct
23 Correct 57 ms 108008 KB Output is correct
24 Correct 58 ms 107904 KB Output is correct
25 Correct 586 ms 108008 KB Output is correct
26 Correct 570 ms 108016 KB Output is correct
27 Correct 616 ms 108012 KB Output is correct
28 Correct 560 ms 108012 KB Output is correct
29 Correct 538 ms 108048 KB Output is correct
30 Correct 556 ms 107980 KB Output is correct
31 Correct 526 ms 108016 KB Output is correct
32 Correct 481 ms 108008 KB Output is correct
33 Correct 481 ms 108012 KB Output is correct
34 Correct 566 ms 108012 KB Output is correct
35 Correct 577 ms 107928 KB Output is correct
36 Correct 703 ms 108140 KB Output is correct
37 Correct 738 ms 108136 KB Output is correct
38 Correct 794 ms 108372 KB Output is correct
39 Correct 629 ms 108004 KB Output is correct
40 Correct 653 ms 108052 KB Output is correct
41 Correct 618 ms 108076 KB Output is correct
42 Correct 724 ms 108136 KB Output is correct
43 Correct 752 ms 108168 KB Output is correct
44 Correct 875 ms 108044 KB Output is correct
45 Correct 772 ms 108260 KB Output is correct
46 Correct 767 ms 108264 KB Output is correct
47 Correct 784 ms 108388 KB Output is correct
48 Correct 641 ms 108392 KB Output is correct
49 Correct 748 ms 108620 KB Output is correct
50 Correct 752 ms 109840 KB Output is correct
51 Correct 51 ms 108012 KB Output is correct
52 Correct 59 ms 107984 KB Output is correct
53 Correct 687 ms 110232 KB Output is correct
54 Correct 776 ms 110816 KB Output is correct
55 Correct 804 ms 110940 KB Output is correct
56 Correct 789 ms 110864 KB Output is correct
57 Correct 49 ms 107896 KB Output is correct
58 Correct 60 ms 108044 KB Output is correct
59 Correct 624 ms 110248 KB Output is correct
60 Correct 933 ms 111088 KB Output is correct
61 Correct 898 ms 111068 KB Output is correct
62 Correct 899 ms 111092 KB Output is correct
63 Correct 803 ms 109788 KB Output is correct
64 Correct 894 ms 109900 KB Output is correct
65 Correct 786 ms 109652 KB Output is correct
66 Correct 687 ms 111044 KB Output is correct
67 Correct 810 ms 111036 KB Output is correct
68 Correct 639 ms 110872 KB Output is correct
69 Correct 654 ms 110924 KB Output is correct
70 Correct 758 ms 111016 KB Output is correct
71 Correct 832 ms 111112 KB Output is correct