oj.uz

Submission #970888

# Submission time Handle Problem Language Result Execution time Memory
970888 2024-04-27T13:09:41 Z 12345678 Rainforest Jumps (APIO21_jumps) C++17
48 / 100
 832 ms 73652 KB 
#include "jumps.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5, kx=18;

int l[nx], r[nx], deg[nx], lvl[nx], p[kx][nx], pa[nx][kx], rt, mn[nx], mx[nx];
vector<int> d[nx], g[nx];

void dfs(int u, int p)
{
    //cout<<"dfs "<<u<<'\n';
    mn[u]=mx[u]=u;
    pa[u][0]=p;
    for (int i=1; i<kx; i++) pa[u][i]=pa[pa[u][i-1]][i-1];
    for (auto v:g[u]) dfs(v, u), mn[u]=min(mn[u], mn[v]), mx[u]=max(mx[u], mx[v]);
}

int lca(int u, int v)
{
    if (lvl[u]>lvl[v]) swap(u, v);
    for (int i=kx-1; i>=0; i--) if (lvl[pa[v][i]]>=lvl[u]) v=pa[v][i];
    if (u==v) return v;
    for (int i=kx-1; i>=0; i--) if (pa[u][i]!=pa[v][i]) u=pa[u][i], v=pa[v][i];
    return pa[u][0];
}

void init(int N, std::vector<int> H) {
    stack<int> s;
    for (int i=0; i<N; i++) l[i]=r[i]=N;
    for (int i=0; i<N; i++)
    {
        while (!s.empty()&&H[s.top()]<H[i]) s.pop();
        if (!s.empty()) l[i]=s.top(), d[s.top()].push_back(i), deg[i]++;
        s.push(i);
    }
    while (!s.empty()) s.pop();
    for (int i=N-1; i>=0; i--)
    {
        while (!s.empty()&&H[s.top()]<H[i]) s.pop();
        if (!s.empty()) r[i]=s.top(), d[s.top()].push_back(i), deg[i]++;
        s.push(i);
    }
    queue<int> q;
    for (int i=0; i<N; i++) if (l[i]==N&&r[i]==N) q.push(i), rt=i;
    while (!q.empty())
    {
        auto u=q.front();
        q.pop();
        for (auto x:d[u]) if (--deg[x]==0) q.push(x);
        lvl[u]=max(lvl[l[u]], lvl[r[u]])+1;
    }
    for (int i=0; i<N; i++)
    {
        if (lvl[l[i]]>lvl[r[i]]) g[l[i]].push_back(i);
        else g[r[i]].push_back(i);
    }
    for (int i=0; i<kx; i++) p[i][N]=N;
    for (int i=0; i<N; i++) p[0][i]=(lvl[l[i]]<lvl[r[i]])?l[i]:r[i];
    for (int i=1; i<kx; i++) for (int j=0; j<N; j++) p[i][j]=p[i-1][p[i-1][j]];
    dfs(rt, rt);
}

int minimum_jumps(int A, int B, int C, int D) {
    if (B<mn[C]) return -1;
    A=max(A, mn[C]);
    A=lca(A, B);
    int res=0;
    for (int i=kx-1; i>=0; i--) if (lvl[p[i][A]]>=lvl[C]) res+=(1<<i), A=p[i][A];
    return res+lvl[A]-lvl[C];
}

/*
7 6
3 2 1 6 4 5 7
1 2 5 5
1 2 6 6
0 3 6 6
1 4 6 6
2 3 4 4
4 5 6 6

*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 27224 KB Output is correct
2 Correct 6 ms 27224 KB Output is correct
3 Correct 121 ms 64636 KB Output is correct
4 Correct 793 ms 73096 KB Output is correct
5 Correct 600 ms 51212 KB Output is correct
6 Correct 756 ms 73652 KB Output is correct
7 Correct 597 ms 58772 KB Output is correct
8 Correct 832 ms 73200 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 27224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 27224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 27224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 27224 KB Output is correct
2 Correct 5 ms 27224 KB Output is correct
3 Correct 4 ms 27224 KB Output is correct
4 Correct 188 ms 40528 KB Output is correct
5 Correct 689 ms 53140 KB Output is correct
6 Correct 414 ms 33028 KB Output is correct
7 Correct 621 ms 53196 KB Output is correct
8 Correct 353 ms 37168 KB Output is correct
9 Correct 622 ms 53124 KB Output is correct
10 Correct 684 ms 73084 KB Output is correct
11 Correct 682 ms 71920 KB Output is correct
12 Correct 700 ms 71064 KB Output is correct
13 Correct 639 ms 53876 KB Output is correct
14 Correct 740 ms 72528 KB Output is correct
15 Correct 599 ms 72588 KB Output is correct
16 Correct 606 ms 72436 KB Output is correct
17 Correct 4 ms 27224 KB Output is correct
18 Correct 4 ms 27224 KB Output is correct
19 Correct 5 ms 27224 KB Output is correct
20 Correct 6 ms 27236 KB Output is correct
21 Correct 6 ms 27224 KB Output is correct
22 Correct 5 ms 27236 KB Output is correct
23 Correct 5 ms 27268 KB Output is correct
24 Correct 6 ms 27224 KB Output is correct
25 Correct 4 ms 27224 KB Output is correct
26 Correct 5 ms 27224 KB Output is correct
27 Correct 17 ms 27236 KB Output is correct
28 Correct 15 ms 27480 KB Output is correct
29 Correct 14 ms 27224 KB Output is correct
30 Correct 13 ms 27480 KB Output is correct
31 Correct 13 ms 27480 KB Output is correct
32 Correct 4 ms 27224 KB Output is correct
33 Correct 51 ms 44080 KB Output is correct
34 Correct 76 ms 53116 KB Output is correct
35 Correct 66 ms 70792 KB Output is correct
36 Correct 75 ms 53384 KB Output is correct
37 Correct 72 ms 72328 KB Output is correct
38 Correct 70 ms 72664 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 27224 KB Output is correct
2 Correct 5 ms 27224 KB Output is correct
3 Correct 4 ms 27224 KB Output is correct
4 Correct 188 ms 40528 KB Output is correct
5 Correct 689 ms 53140 KB Output is correct
6 Correct 414 ms 33028 KB Output is correct
7 Correct 621 ms 53196 KB Output is correct
8 Correct 353 ms 37168 KB Output is correct
9 Correct 622 ms 53124 KB Output is correct
10 Correct 684 ms 73084 KB Output is correct
11 Correct 682 ms 71920 KB Output is correct
12 Correct 700 ms 71064 KB Output is correct
13 Correct 639 ms 53876 KB Output is correct
14 Correct 740 ms 72528 KB Output is correct
15 Correct 599 ms 72588 KB Output is correct
16 Correct 606 ms 72436 KB Output is correct
17 Correct 4 ms 27224 KB Output is correct
18 Correct 4 ms 27224 KB Output is correct
19 Correct 5 ms 27224 KB Output is correct
20 Correct 6 ms 27236 KB Output is correct
21 Correct 6 ms 27224 KB Output is correct
22 Correct 5 ms 27236 KB Output is correct
23 Correct 5 ms 27268 KB Output is correct
24 Correct 6 ms 27224 KB Output is correct
25 Correct 4 ms 27224 KB Output is correct
26 Correct 5 ms 27224 KB Output is correct
27 Correct 17 ms 27236 KB Output is correct
28 Correct 15 ms 27480 KB Output is correct
29 Correct 14 ms 27224 KB Output is correct
30 Correct 13 ms 27480 KB Output is correct
31 Correct 13 ms 27480 KB Output is correct
32 Correct 4 ms 27224 KB Output is correct
33 Correct 51 ms 44080 KB Output is correct
34 Correct 76 ms 53116 KB Output is correct
35 Correct 66 ms 70792 KB Output is correct
36 Correct 75 ms 53384 KB Output is correct
37 Correct 72 ms 72328 KB Output is correct
38 Correct 70 ms 72664 KB Output is correct
39 Correct 4 ms 27224 KB Output is correct
40 Correct 4 ms 27224 KB Output is correct
41 Correct 4 ms 27224 KB Output is correct
42 Correct 163 ms 40672 KB Output is correct
43 Correct 611 ms 53156 KB Output is correct
44 Correct 409 ms 33112 KB Output is correct
45 Correct 655 ms 53128 KB Output is correct
46 Correct 359 ms 37348 KB Output is correct
47 Correct 678 ms 53072 KB Output is correct
48 Correct 704 ms 73080 KB Output is correct
49 Correct 724 ms 71880 KB Output is correct
50 Correct 732 ms 71048 KB Output is correct
51 Correct 617 ms 53584 KB Output is correct
52 Correct 653 ms 72272 KB Output is correct
53 Correct 629 ms 72572 KB Output is correct
54 Correct 631 ms 72328 KB Output is correct
55 Correct 4 ms 27224 KB Output is correct
56 Correct 118 ms 53148 KB Output is correct
57 Correct 602 ms 53128 KB Output is correct
58 Correct 300 ms 33292 KB Output is correct
59 Correct 595 ms 53116 KB Output is correct
60 Correct 256 ms 37260 KB Output is correct
61 Correct 642 ms 53128 KB Output is correct
62 Correct 770 ms 73040 KB Output is correct
63 Correct 761 ms 69100 KB Output is correct
64 Correct 748 ms 67320 KB Output is correct
65 Correct 641 ms 53644 KB Output is correct
66 Correct 795 ms 72420 KB Output is correct
67 Correct 706 ms 72700 KB Output is correct
68 Correct 654 ms 72272 KB Output is correct
69 Correct 4 ms 27224 KB Output is correct
70 Correct 5 ms 27224 KB Output is correct
71 Correct 6 ms 27224 KB Output is correct
72 Correct 5 ms 27224 KB Output is correct
73 Correct 5 ms 27224 KB Output is correct
74 Correct 6 ms 27232 KB Output is correct
75 Correct 5 ms 27224 KB Output is correct
76 Correct 4 ms 27224 KB Output is correct
77 Correct 4 ms 27224 KB Output is correct
78 Correct 5 ms 27224 KB Output is correct
79 Correct 5 ms 27224 KB Output is correct
80 Correct 6 ms 27224 KB Output is correct
81 Correct 6 ms 27224 KB Output is correct
82 Correct 5 ms 27224 KB Output is correct
83 Correct 5 ms 27224 KB Output is correct
84 Correct 5 ms 27224 KB Output is correct
85 Correct 6 ms 27244 KB Output is correct
86 Correct 12 ms 27224 KB Output is correct
87 Correct 14 ms 27732 KB Output is correct
88 Correct 13 ms 27224 KB Output is correct
89 Correct 14 ms 27480 KB Output is correct
90 Correct 14 ms 27480 KB Output is correct
91 Correct 5 ms 27224 KB Output is correct
92 Correct 5 ms 27324 KB Output is correct
93 Correct 13 ms 27224 KB Output is correct
94 Correct 13 ms 27480 KB Output is correct
95 Correct 15 ms 27224 KB Output is correct
96 Correct 12 ms 27480 KB Output is correct
97 Correct 13 ms 27480 KB Output is correct
98 Correct 5 ms 27224 KB Output is correct
99 Correct 81 ms 53132 KB Output is correct
100 Correct 76 ms 53168 KB Output is correct
101 Correct 63 ms 69324 KB Output is correct
102 Correct 75 ms 53632 KB Output is correct
103 Correct 75 ms 72336 KB Output is correct
104 Correct 66 ms 72448 KB Output is correct
105 Correct 4 ms 27224 KB Output is correct
106 Correct 48 ms 44112 KB Output is correct
107 Correct 75 ms 53196 KB Output is correct
108 Correct 62 ms 70852 KB Output is correct
109 Correct 75 ms 53636 KB Output is correct
110 Correct 73 ms 72328 KB Output is correct
111 Correct 69 ms 72764 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 27224 KB Output is correct
2 Correct 6 ms 27224 KB Output is correct
3 Correct 121 ms 64636 KB Output is correct
4 Correct 793 ms 73096 KB Output is correct
5 Correct 600 ms 51212 KB Output is correct
6 Correct 756 ms 73652 KB Output is correct
7 Correct 597 ms 58772 KB Output is correct
8 Correct 832 ms 73200 KB Output is correct
9 Incorrect 4 ms 27224 KB Output isn't correct
10 Halted 0 ms 0 KB -