oj.uz

Submission #556015

# Submission time Handle Problem Language Result Execution time Memory
556015 2022-05-02T07:31:21 Z stefantaga Editor (BOI15_edi) C++14
100 / 100
 174 ms 30156 KB 
#include <bits/stdc++.h>

using namespace std;
int rmq[300005][20],n,i,v[300005],lev[300005],sal,j;
int parinte(int x,int nivel)
{
    if (lev[x]<=nivel)
    {
        return x;
    }
    for (int i=19;i>=0;i--)
    {
        if (lev[rmq[x][i]]>nivel)
        {
            x=rmq[x][i];
        }
    }
    return rmq[x][0];
}
int main()
{
    ios_base :: sync_with_stdio(false);
    cin.tie(0);
    #ifdef HOME
    ifstream cin("date.in");
    ofstream cout("date.out");
    #endif // HOME
    cin>>n;
    for (i=1;i<=n;i++)
    {
        cin>>v[i];
        lev[i]=max(0,-v[i]);
        if (v[i]<0)
        {
            sal = parinte(i-1,lev[i]-1);
            assert(sal);
            rmq[i][0]=parinte(sal-1,lev[i]-1);
            assert(lev[i]>lev[rmq[i][0]]);
            for (j=1;j<=19;j++)
            {
                rmq[i][j]=rmq[rmq[i][j-1]][j-1];
            }
        }
        cout<<v[parinte(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 3 ms 724 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 2 ms 724 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 28108 KB Output is correct
2 Correct 115 ms 29468 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 8200 KB Output is correct
2 Correct 59 ms 9784 KB Output is correct
3 Correct 138 ms 21452 KB Output is correct
4 Correct 116 ms 29540 KB Output is correct
5 Correct 112 ms 30156 KB Output is correct
6 Correct 103 ms 27360 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 3 ms 724 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 112 ms 28108 KB Output is correct
11 Correct 115 ms 29468 KB Output is correct
12 Correct 52 ms 8200 KB Output is correct
13 Correct 59 ms 9784 KB Output is correct
14 Correct 138 ms 21452 KB Output is correct
15 Correct 116 ms 29540 KB Output is correct
16 Correct 112 ms 30156 KB Output is correct
17 Correct 103 ms 27360 KB Output is correct
18 Correct 113 ms 18508 KB Output is correct
19 Correct 109 ms 18336 KB Output is correct
20 Correct 174 ms 28712 KB Output is correct
21 Correct 120 ms 29500 KB Output is correct
22 Correct 107 ms 30144 KB Output is correct