oj.uz

Submission #624694

# Submission time Handle Problem Language Result Execution time Memory
624694 2022-08-08T15:44:20 Z wiwiho Ancient Books (IOI17_books) C++14
100 / 100
 234 ms 64060 KB 
#include "books.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int n;
vector<int> dsu, mx;

int findDSU(int a){
    if(dsu[a] != a) dsu[a] = findDSU(dsu[a]);
    return dsu[a];
}

void unionDSU(int a, int b){
    a = findDSU(a);
    b = findDSU(b);
    if(a > b) swap(a, b);
    if(a == b) return;
    dsu[b] = a;
    mx[a] = max(mx[a], mx[b]);
}

ll minimum_walk(vector<int> arr, int s){
    n = arr.size();
    //printv(arr, cerr);

    dsu.resize(n);
    mx.resize(n);
    iota(iter(dsu), 0);
    iota(iter(mx), 0);

    ll ans = 0;
    for(int i = 0; i < n; i++){
        ans += abs(i - arr[i]);
        unionDSU(i, arr[i]);
    }
    //cerr << ans << "\n";

    vector<int> st;
    vector<int> vst(n);
    vector<int> root;
    vector<vector<int>> child(n);
    vector<int> pr(n);

    for(int i = 0; i < n; i++){
        int p = findDSU(i);
        if(vst[p] == 0){
            vst[p] = 1;
            st.eb(p);
        }
        else{
            while(st.back() != p){
                unionDSU(p, st.back());
                st.pob;
            }
        }
        //cerr << "owo " << i << " " << p << " : ";
        //printv(st, cerr);

        if(mx[p] == i){
            st.pob;
            if(st.empty()) pr[p] = -1;
            else pr[p] = st.back();
        }
    }

    for(int i = 0; i < n; i++){
        if(dsu[i] != i) continue;
        if(pr[i] == -1){
            root.eb(i);
            continue;
        }
        pr[i] = findDSU(pr[i]);
        child[pr[i]].eb(i);
    }

    int now = findDSU(s);
    while(pr[now] != -1){
        int p = pr[now];
        //cerr << "test " << now << " " << p << "\n";
        //printv(child[p], cerr);
        int l = 1, r = 1;
        int pos = -1;
        for(int i = 0; i < (int)child[p].size(); i++){
            if(child[p][i] == now) pos = i;
        }
        
        int lst = now;
        for(int i = pos - 1; i >= 0; i--){
            int c = child[p][i];
            if(mx[c] + 1 != lst) break;
            l++;
            lst = c;
        }

        lst = mx[now];
        for(int i = pos + 1; i < (int)child[p].size(); i++){
            int c = child[p][i];
            if(lst + 1 != c) break;
            r++;
            lst = mx[c];
        }

        ans += min(l, r) * 2;
        now = p;
    }
    //for(int i = 0; i < n; i++) cerr << findDSU(i) << " ";
    //cerr << "\n";

    ans += ((int)root.size() - 1) * 2;
    for(int i = 0; i < now; i++){
        if(arr[i] != i) break;
        ans -= 2;
    }
    for(int i = n - 1; i > mx[now]; i--){
        if(arr[i] != i) break;
        ans -= 2;
    }

	return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 288 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 2 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 234 ms 49824 KB Output is correct
31 Correct 214 ms 49888 KB Output is correct
32 Correct 132 ms 54104 KB Output is correct
33 Correct 152 ms 54980 KB Output is correct
34 Correct 142 ms 54924 KB Output is correct
35 Correct 149 ms 53380 KB Output is correct
36 Correct 161 ms 52252 KB Output is correct
37 Correct 143 ms 50064 KB Output is correct
38 Correct 134 ms 49840 KB Output is correct
39 Correct 144 ms 49868 KB Output is correct
40 Correct 142 ms 49880 KB Output is correct
41 Correct 164 ms 49840 KB Output is correct
42 Correct 158 ms 49920 KB Output is correct
43 Correct 175 ms 58912 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 288 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 2 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 234 ms 49824 KB Output is correct
31 Correct 214 ms 49888 KB Output is correct
32 Correct 132 ms 54104 KB Output is correct
33 Correct 152 ms 54980 KB Output is correct
34 Correct 142 ms 54924 KB Output is correct
35 Correct 149 ms 53380 KB Output is correct
36 Correct 161 ms 52252 KB Output is correct
37 Correct 143 ms 50064 KB Output is correct
38 Correct 134 ms 49840 KB Output is correct
39 Correct 144 ms 49868 KB Output is correct
40 Correct 142 ms 49880 KB Output is correct
41 Correct 164 ms 49840 KB Output is correct
42 Correct 158 ms 49920 KB Output is correct
43 Correct 175 ms 58912 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 304 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 296 KB Output is correct
55 Correct 1 ms 300 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 300 KB Output is correct
62 Correct 1 ms 296 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 167 ms 55436 KB Output is correct
65 Correct 151 ms 55756 KB Output is correct
66 Correct 143 ms 50712 KB Output is correct
67 Correct 137 ms 50628 KB Output is correct
68 Correct 15 ms 5688 KB Output is correct
69 Correct 15 ms 5588 KB Output is correct
70 Correct 16 ms 5780 KB Output is correct
71 Correct 15 ms 5972 KB Output is correct
72 Correct 14 ms 6060 KB Output is correct
73 Correct 13 ms 5500 KB Output is correct
74 Correct 141 ms 55508 KB Output is correct
75 Correct 145 ms 55632 KB Output is correct
76 Correct 177 ms 59216 KB Output is correct
77 Correct 167 ms 59448 KB Output is correct
78 Correct 169 ms 59212 KB Output is correct
79 Correct 176 ms 59276 KB Output is correct
80 Correct 122 ms 54676 KB Output is correct
81 Correct 154 ms 64060 KB Output is correct
82 Correct 154 ms 64016 KB Output is correct
83 Correct 161 ms 54740 KB Output is correct
84 Correct 153 ms 53516 KB Output is correct
85 Correct 147 ms 51508 KB Output is correct
86 Correct 140 ms 50832 KB Output is correct
87 Correct 163 ms 58648 KB Output is correct
88 Correct 153 ms 56532 KB Output is correct
89 Correct 156 ms 55732 KB Output is correct
90 Correct 135 ms 50528 KB Output is correct
91 Correct 130 ms 50480 KB Output is correct
92 Correct 138 ms 50544 KB Output is correct