oj.uz

Submission #613939

# Submission time Handle Problem Language Result Execution time Memory
613939 2022-07-30T13:53:40 Z Mr_Husanboy Ancient Books (IOI17_books) C++14
50 / 100
 168 ms 16964 KB 
#include "books.h"
#include<bits/stdc++.h>

using namespace std;
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define ff first
#define ss second
#define ll long long


struct Fenwick{
    vector<int> t;
    void init(int n){
        t.resize(n);
    }
    void inc(int i, int d = 1){
        for(; i<t.size(); i|=i+1) t[i] += d;
    }

    int get(int i){
        int res = 0;
        for(; i>=0; i = (i&(i+1))-1) res += t[i];
        return res;
    }

    int get(int l, int r){
        return get(r) - get(l-1);
    }
};

long long minimum_walk(vector<int> p, int s) {
    int n = p.size();
    ll tot = 0;
    Fenwick tr;
    tr.init(n);
    for(int i=0; i<n; i++){
        tot += abs(i - p[i]);
        int mn = min(i, p[i]);
        int mx = max(i, p[i]);
        tr.inc(mn,1); tr.inc(mx,-1);
    }
    int r = n-1;
    while(r >=0 && tr.get(r)==0) r--;
    //cout << r << endl;
 //   cout << "done" << endl;
    ll cnt = 0;
    for(int i = 0; i <=r; i ++){
        cnt += tr.get(i)==0;
    }
    return tot + cnt*2;
}

Compilation message

books.cpp: In member function 'void Fenwick::inc(int, int)':
books.cpp:18:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for(; i<t.size(); i|=i+1) t[i] += d;
      |               ~^~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 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 0 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 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 0 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 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 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 1 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 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 0 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 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 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 1 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 168 ms 12052 KB Output is correct
31 Correct 160 ms 16860 KB Output is correct
32 Correct 159 ms 16796 KB Output is correct
33 Correct 129 ms 16900 KB Output is correct
34 Correct 132 ms 16880 KB Output is correct
35 Correct 133 ms 16964 KB Output is correct
36 Correct 138 ms 16900 KB Output is correct
37 Correct 136 ms 16852 KB Output is correct
38 Correct 151 ms 16780 KB Output is correct
39 Correct 137 ms 16896 KB Output is correct
40 Correct 136 ms 16852 KB Output is correct
41 Correct 146 ms 16812 KB Output is correct
42 Correct 157 ms 16896 KB Output is correct
43 Correct 128 ms 16896 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 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 0 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 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 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 1 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 168 ms 12052 KB Output is correct
31 Correct 160 ms 16860 KB Output is correct
32 Correct 159 ms 16796 KB Output is correct
33 Correct 129 ms 16900 KB Output is correct
34 Correct 132 ms 16880 KB Output is correct
35 Correct 133 ms 16964 KB Output is correct
36 Correct 138 ms 16900 KB Output is correct
37 Correct 136 ms 16852 KB Output is correct
38 Correct 151 ms 16780 KB Output is correct
39 Correct 137 ms 16896 KB Output is correct
40 Correct 136 ms 16852 KB Output is correct
41 Correct 146 ms 16812 KB Output is correct
42 Correct 157 ms 16896 KB Output is correct
43 Correct 128 ms 16896 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 -