oj.uz

Submission #827621

# Submission time Handle Problem Language Result Execution time Memory
827621 2023-08-16T15:23:39 Z Darren0724 Editor (BOI15_edi) C++17
100 / 100
 123 ms 26944 KB 
#include<bits/stdc++.h>
using namespace std;

int v[300005];
int jump[20][300005];
int Find(int k,int lv){
    if(-v[k]<=lv)return k;
    for(int j=19;j>=0;j--){
        if(-v[jump[j][k]]>lv){
            k=jump[j][k];
        }
    }
    return jump[0][k];
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;cin>>n;
    for(int i=1;i<=n;i++){
        cin>>v[i];
        if(v[i]<0){
            int tmp=Find(i-1,-v[i]-1)-1;
            int pa=Find(tmp,-v[i]-1);
            jump[0][i]=pa;
            for(int j=1;j<20;j++){
                jump[j][i]=jump[j-1][jump[j-1][i]];
            }
        }
        cout<<v[Find(i,0)]<<'\n';
    }

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 2 ms 852 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 26924 KB Output is correct
2 Correct 82 ms 26944 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 7652 KB Output is correct
2 Correct 40 ms 9164 KB Output is correct
3 Correct 114 ms 20596 KB Output is correct
4 Correct 82 ms 26896 KB Output is correct
5 Correct 76 ms 26904 KB Output is correct
6 Correct 75 ms 25528 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 81 ms 26924 KB Output is correct
11 Correct 82 ms 26944 KB Output is correct
12 Correct 40 ms 7652 KB Output is correct
13 Correct 40 ms 9164 KB Output is correct
14 Correct 114 ms 20596 KB Output is correct
15 Correct 82 ms 26896 KB Output is correct
16 Correct 76 ms 26904 KB Output is correct
17 Correct 75 ms 25528 KB Output is correct
18 Correct 78 ms 15292 KB Output is correct
19 Correct 68 ms 15308 KB Output is correct
20 Correct 123 ms 25528 KB Output is correct
21 Correct 82 ms 26868 KB Output is correct
22 Correct 77 ms 26880 KB Output is correct