oj.uz

Submission #617719

# Submission time Handle Problem Language Result Execution time Memory
617719 2022-08-01T12:58:53 Z AbdelmagedNour Ancient Books (IOI17_books) C++17
50 / 100
 271 ms 31724 KB 
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>st1;
tree<int,null_type,greater<int>,rb_tree_tag,tree_order_statistics_node_update>st2;
#include "books.h"
struct BIT{
    vector<long long>Tree;
    int n;
    void init(int N){
        n=N;
        Tree.assign(n+3,0);
    }
    void update(int i,int val){
        i++;
        for(;i<=n;i+=i&-i)Tree[i]+=val;
    }
    long long get(int i){
        long long res=0;
        for(;i;i-=i&-i)res+=Tree[i];
        return res;
    }
    long long gte(int i){
        i++;
        return get(n)-get(i);
    }
    long long lte(int i){
        i++;
        return get(i);
    }
}Tree;
long long minimum_walk(vector<int> p, int s) {
    int n=p.size();
    Tree.init(n+5);
    vector<int>seg1(n),seg2(n+1),mx1(n+1),mx2(n+1);
    long long res=0;
    for(int i=0;i<n;i++){
        Tree.update(p[i],1);
        seg1[i]=Tree.gte(i);
    }
    for(int i=0;i<n;i++){
        Tree.update(p[i],-1);
        seg2[i]=Tree.lte(i);
    }
    for(int i=n-1;i>=0;i--)mx1[i]=max(mx1[i+1],seg1[i]);
    for(int i=0;i<n;i++)mx2[i]=max((i?mx2[i-1]:0),seg1[i]);
    for(int i=0;i<n;i++){
        if(seg1[i]==0&&seg2[i]==0){
            if(i>=s&&mx1[i])res+=2;
            else if(i<s&&mx2[i])res+=2;
        }
        else res+=seg1[i]+seg2[i];
    }
    return res;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 263 ms 31724 KB Output is correct
31 Correct 271 ms 31564 KB Output is correct
32 Correct 217 ms 31564 KB Output is correct
33 Correct 200 ms 31616 KB Output is correct
34 Correct 215 ms 31616 KB Output is correct
35 Correct 216 ms 31612 KB Output is correct
36 Correct 202 ms 31608 KB Output is correct
37 Correct 204 ms 31616 KB Output is correct
38 Correct 211 ms 31608 KB Output is correct
39 Correct 200 ms 31612 KB Output is correct
40 Correct 214 ms 31692 KB Output is correct
41 Correct 220 ms 31724 KB Output is correct
42 Correct 213 ms 31616 KB Output is correct
43 Correct 210 ms 31608 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 263 ms 31724 KB Output is correct
31 Correct 271 ms 31564 KB Output is correct
32 Correct 217 ms 31564 KB Output is correct
33 Correct 200 ms 31616 KB Output is correct
34 Correct 215 ms 31616 KB Output is correct
35 Correct 216 ms 31612 KB Output is correct
36 Correct 202 ms 31608 KB Output is correct
37 Correct 204 ms 31616 KB Output is correct
38 Correct 211 ms 31608 KB Output is correct
39 Correct 200 ms 31612 KB Output is correct
40 Correct 214 ms 31692 KB Output is correct
41 Correct 220 ms 31724 KB Output is correct
42 Correct 213 ms 31616 KB Output is correct
43 Correct 210 ms 31608 KB Output is correct
44 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -