oj.uz

Submission #719330

# Submission time Handle Problem Language Result Execution time Memory
719330 2023-04-05T18:32:58 Z Jarif_Rahman Ancient Books (IOI17_books) C++17
22 / 100
 2000 ms 106076 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

struct dsu{
    int n;
    vector<int> sz, p;
    dsu(int nn){
        n = nn;
        sz.resize(n, 1);
        p.resize(n);
        for(int i = 0; i < n; i++) p[i] = i;
    }
    int get(int x){
        if(p[x] != x) p[x] = get(p[x]);
        return p[x];
    }
    void unite(int a, int b){
        a = get(a), b  = get(b);
        if(a == b) return;
        if(sz[b] > sz[a]) swap(a, b);
        sz[a]+=sz[b];
        sz[b] = 0;
        p[b] = a;
    }
};
 
ll minimum_walk(vector<int> p, int s){
    int n = p.size();
    ll ans = 0;
 
    vector<int> C(n, -1), sz;
    int k = 0;
    for(int i = 0; i < n; i++){
        if(C[i] != -1) continue;
        int x = p[i];
        C[i] = k;
        sz.pb(1);
        ans+=abs(i-x);
        while(x != i){
            C[x] = k;
            sz.back()++;
            ans+=abs(p[x]-x);
            x = p[x];
        }
        k++;
    }

    //for(int x: C) cerr << x << " "; cerr << "C1\n";

    vector<int> first(k, -1), last(k);
    for(int i = 0; i < n; i++){
        if(first[C[i]] == -1) first[C[i]] = i;
        last[C[i]] = i;
    }

    int L, R;
    vector<bool> unnecessary(k, 0);
    for(int i = 0; i < n; i++){
        if(sz[C[i]] > 1 || i == s){
            L = i;
            break;
        }
        unnecessary[C[i]] = 1;
    }
    for(int i = n-1; i >= 0; i--){
        if(sz[C[i]] > 1 || i == s){
            R = i;
            break;
        }
        unnecessary[C[i]] = 1;
    }

    vector<set<int>> sth(k);
    for(int i = 0; i < n; i++) sth[C[i]].insert(i);

    dsu ds(k);
    for(int T = 0; T < k-1; T++){
        for(int i = 0; i+1 < n; i++){
            if(unnecessary[C[i]] || unnecessary[i+C[1]]) continue;
            if(C[i] == C[i+1]) continue;
            if(i == last[C[i]] && i+1 == first[C[i+1]]) continue;
            auto it = sth[C[i]].find(i);
            if(it != sth[C[i]].end() && i+1 == first[C[i+1]] && *next(it) > last[C[i+1]])
                continue;
            it = sth[C[i+1]].find(i+1);
            if(it != sth[C[i+1]].begin() && i == last[C[i]] && *prev(it) < first[C[i]])
                continue;
            ds.unite(C[i], C[i+1]);
        }

        for(int &x: C) x = ds.get(x);
        first.assign(k, -1);
        for(int i = 0; i < n; i++){
            if(first[C[i]] == -1) first[C[i]] = i;
            last[C[i]] = i;
        }
        for(int i = 0; i < k; i++){
            if(unnecessary[i] || ds.get(i) == i) continue;
            int p = ds.get(i);
            if(sth[p].size() > sth[i].size()) swap(sth[p], sth[i]);
            for(int x: sth[i]) sth[p].insert(x);
            sth[i].clear();
        }
    }

    //for(int x: C) cerr << x << " "; cerr << "C2\n";

    int l = first[C[s]], r = last[C[s]];
    while(l > L || r < R){
        int in = -1;
        ll lx = 0, rx = 0;
        for(int i = l-1; i >= 0; i--){
            if(unnecessary[C[i]]) break;
            if(C[i] == C[i+1]) continue;
            lx+=2;
            if(i != last[C[i]]){
                in = i;
                break;
            }
            i = first[C[i]];
        }
        for(int i = r+1; i < n; i++){
            if(unnecessary[C[i]]) break;
            if(C[i] == C[i-1]) continue;
            rx+=2;
            if(i != first[C[i]]){
                in = i;
                break;
            }
            i = last[C[i]];
        }

        if(in == -1){
            ans+=lx+rx;
            break;
        }
        ans+=min(lx, rx);
        l = first[C[in]], r = last[C[in]];
    }

    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 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 1 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 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 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 1 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 1 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 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 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 8 ms 400 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 10 ms 420 KB Output is correct
22 Correct 13 ms 404 KB Output is correct
23 Correct 10 ms 340 KB Output is correct
24 Correct 15 ms 340 KB Output is correct
25 Correct 13 ms 340 KB Output is correct
26 Correct 23 ms 368 KB Output is correct
27 Correct 17 ms 340 KB Output is correct
28 Correct 17 ms 340 KB Output is correct
29 Correct 21 ms 340 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 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 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 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 8 ms 400 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 10 ms 420 KB Output is correct
22 Correct 13 ms 404 KB Output is correct
23 Correct 10 ms 340 KB Output is correct
24 Correct 15 ms 340 KB Output is correct
25 Correct 13 ms 340 KB Output is correct
26 Correct 23 ms 368 KB Output is correct
27 Correct 17 ms 340 KB Output is correct
28 Correct 17 ms 340 KB Output is correct
29 Correct 21 ms 340 KB Output is correct
30 Execution timed out 2070 ms 106076 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 340 KB Output is correct
2 Correct 19 ms 392 KB Output is correct
3 Correct 12 ms 400 KB Output is correct
4 Execution timed out 2058 ms 340 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 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 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 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 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 8 ms 400 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 10 ms 420 KB Output is correct
22 Correct 13 ms 404 KB Output is correct
23 Correct 10 ms 340 KB Output is correct
24 Correct 15 ms 340 KB Output is correct
25 Correct 13 ms 340 KB Output is correct
26 Correct 23 ms 368 KB Output is correct
27 Correct 17 ms 340 KB Output is correct
28 Correct 17 ms 340 KB Output is correct
29 Correct 21 ms 340 KB Output is correct
30 Execution timed out 2070 ms 106076 KB Time limit exceeded
31 Halted 0 ms 0 KB -