oj.uz

Submission #827608

# Submission time Handle Problem Language Result Execution time Memory
827608 2023-08-16T15:19:53 Z Darren0724 Editor (BOI15_edi) C++17
100 / 100
 506 ms 29036 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(){
    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)]<<endl;
    }

    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 427 ms 28332 KB Output is correct
2 Correct 424 ms 28376 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 8664 KB Output is correct
2 Correct 252 ms 10216 KB Output is correct
3 Correct 404 ms 22272 KB Output is correct
4 Correct 474 ms 28244 KB Output is correct
5 Correct 430 ms 29036 KB Output is correct
6 Correct 415 ms 26296 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 596 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 8 ms 756 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 7 ms 828 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 7 ms 836 KB Output is correct
10 Correct 427 ms 28332 KB Output is correct
11 Correct 424 ms 28376 KB Output is correct
12 Correct 215 ms 8664 KB Output is correct
13 Correct 252 ms 10216 KB Output is correct
14 Correct 404 ms 22272 KB Output is correct
15 Correct 474 ms 28244 KB Output is correct
16 Correct 430 ms 29036 KB Output is correct
17 Correct 415 ms 26296 KB Output is correct
18 Correct 443 ms 17440 KB Output is correct
19 Correct 425 ms 17128 KB Output is correct
20 Correct 506 ms 27556 KB Output is correct
21 Correct 424 ms 28244 KB Output is correct
22 Correct 425 ms 28988 KB Output is correct