oj.uz

Submission #1061616

# Submission time Handle Problem Language Result Execution time Memory
1061616 2024-08-16T11:14:47 Z Zicrus Ancient Books (IOI17_books) C++17
22 / 100
 2000 ms 36864 KB 
#include <bits/stdc++.h>
#include "books.h"
using namespace std;

typedef long long ll;

ll minimum_walk(vector<int> p, int s) {
    ll n = p.size();
	ll res = 0;
    for (int i = 0; i < n; i++) res += abs(p[i] - i);
    if (res == 0) return 0;

    vector<bool> vst(n);
    vector<vector<ll>> cyc;
    vector<ll> mxCyc;
    vector<ll> cycId(n);
    for (int i = 0; i < n; i++) {
        if (vst[i] || p[i] == i) continue;
        cyc.push_back(vector<ll>());
        mxCyc.push_back(i);
 
        ll cur = i;
        do {
            cyc.back().push_back(cur);
            mxCyc.back() = max(mxCyc.back(), cur);
            cycId[cur] = cyc.size()-1;
            cur = p[cur];
            vst[cur] = true;
        } while (cur != i);
    }
    ll m = cyc.size();

    vector<pair<ll, ll>> cycMM(m);
    ll allMn = n, allMx = 0;
    for (int i = 0; i < m; i++) {
        cycMM[i] = {cyc[i][0], mxCyc[i]};
        allMn = min(allMn, cycMM[i].first);
        allMx = max(allMx, cycMM[i].second);
    }
    for (int g = 0; g < m+1; g++) {
        for (int i = m-1; i >= 0; i--) {
            for (int j = i+1; j < m && cyc[j][0] < mxCyc[i]; j++) {
                if (mxCyc[j] > mxCyc[i]) {
                    cycMM[i].first = cycMM[j].first = min(cycMM[i].first, cycMM[j].first);
                    cycMM[i].second = cycMM[j].second = max(cycMM[i].second, cycMM[j].second);
                }
            }
        }
    }

    ll left = s, right = s;
    ll mn = left, mx = right;
    if (p[left] != left) {
        mn = min(cycMM[cycId[left]].first, mn);
        mx = max(cycMM[cycId[left]].second, mx);
    }
    if (p[right] != right) {
        mn = min(cycMM[cycId[right]].first, mn);
        mx = max(cycMM[cycId[right]].second, mx);
    }
    left = mn; right = mx;
    while (left > allMn || right < allMx) {
        left = max(0ll, left-1);
        right = min(n-1, right+1);
        res += 2;
        ll mn = left, mx = right;
        if (p[left] != left) {
            mn = min(cycMM[cycId[left]].first, mn);
            mx = max(cycMM[cycId[left]].second, mx);
        }
        if (p[right] != right) {
            mn = min(cycMM[cycId[right]].first, mn);
            mx = max(cycMM[cycId[right]].second, mx);
        }
        left = mn; right = mx;
    }
    return res;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 352 KB Output is correct
28 Correct 1 ms 356 KB Output is correct
29 Correct 2 ms 352 KB Output is correct
30 Correct 120 ms 29516 KB Output is correct
31 Correct 141 ms 30188 KB Output is correct
32 Correct 79 ms 11824 KB Output is correct
33 Execution timed out 2084 ms 36864 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '2094', found: '1592'
5 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 356 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 0 ms 352 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 352 KB Output is correct
28 Correct 1 ms 356 KB Output is correct
29 Correct 2 ms 352 KB Output is correct
30 Correct 120 ms 29516 KB Output is correct
31 Correct 141 ms 30188 KB Output is correct
32 Correct 79 ms 11824 KB Output is correct
33 Execution timed out 2084 ms 36864 KB Time limit exceeded
34 Halted 0 ms 0 KB -