oj.uz

Submission #799500

# Submission time Handle Problem Language Result Execution time Memory
799500 2023-07-31T15:20:59 Z PixelCat Ancient Books (IOI17_books) C++14
50 / 100
 2000 ms 48084 KB 
#include "books.h"

#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 1'000'000;
const int INF = 1e18;

LL minimum_walk(vector<i32> p, i32 s) {
    assert(s >= 0);
    int n = sz(p);

    int ans = 0;
    vector<int> cid(n, -1);
    vector<pii> range;
    For(i, 0, n - 1) if(p[i] != i && cid[i] == -1) {
        int cur = i;
        int l = n + 1;
        int r = -1;
        do {
            l = min(l, cur);
            r = max(r, cur);
            ans += abs(p[cur] - cur);
            cur = p[cur];
            cid[cur] = sz(range);
        } while(cur != i);
        range.eb(l, r);
    }
    if(sz(range) == 0) return 0;

    int L = 0, R = n - 1;
    while(cid[L] == -1) L++;
    while(cid[R] == -1) R--;
    L = min(L, (int)s);
    R = max(R, (int)s);
    cerr << L << " " << R << "\n";

    vector<int> nxtl(n), nxtr(n);
    nxtl[0] = -INF;
    For(i, 1, n - 1) {
        if(cid[i - 1] != -1) nxtl[i] = i - 1;
        else nxtl[i] = nxtl[i - 1];
    }
    nxtr[n - 1] = INF;
    Forr(i, n - 2, 0) {
        if(cid[i + 1] != -1) nxtr[i] = i + 1;
        else nxtr[i] = nxtr[i + 1];
    }

    int l = s, r = s;
    queue<int> que;
    if(cid[s] != -1) que.emplace(cid[s]);
    while(l > L || r < R) {
        pii rg;
        if(sz(que)) {
            int id = que.front(); que.pop();
            rg = range[id];
        } else {
            int l2, r2;

            int cl = 0;
            l2 = l; r2 = r;
            if(l2 == L) cl = INF;
            while(r2 == r && l2 != L) {
                cl += (l2 - nxtl[l2]) * 2;
                l2 = nxtl[l2];
                int l3 = range[cid[l2]].F;
                int r3 = range[cid[l2]].S;
                while(l2 > l3 || r2 < r3) {
                    if(r2 < r3) {
                        l2 = l3; r2 = r3;
                        break;
                    }
                    l2--;
                    if(cid[l2] != -1) {
                        l3 = min(l3, range[cid[l2]].F);
                        r3 = max(r3, range[cid[l2]].S);
                    }
                }
            }

            int cr = 0;
            l2 = l; r2 = r;
            if(r2 == R) cr = INF;
            while(l2 == l && r2 != R) {
                cr += (nxtr[r2] - r2) * 2;
                r2 = nxtr[r2];
                int l3 = range[cid[r2]].F;
                int r3 = range[cid[r2]].S;
                while(l2 > l3 || r2 < r3) {
                    if(l2 > l3) {
                        l2 = l3; r2 = r3;
                        break;
                    }
                    r2++;
                    if(cid[r2] != -1) {
                        l3 = min(l3, range[cid[r2]].F);
                        r3 = max(r3, range[cid[r2]].S);
                    }
                }
            }

            ans += min(cl, cr);
            rg = pii(l2, r2);
        }
        while(l > rg.F) {
            l--;
            if(cid[l] != -1) que.emplace(cid[l]);
        }
        while(r < rg.S) {
            r++;
            if(cid[r] != -1) que.emplace(cid[r]);
        }
    }
    return ans;
}

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 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 0 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 1 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 0 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 340 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 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 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 304 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 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 0 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 340 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 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 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 128 ms 46444 KB Output is correct
31 Correct 117 ms 46428 KB Output is correct
32 Correct 82 ms 22616 KB Output is correct
33 Correct 109 ms 45396 KB Output is correct
34 Correct 108 ms 45396 KB Output is correct
35 Correct 113 ms 47168 KB Output is correct
36 Correct 104 ms 48084 KB Output is correct
37 Correct 101 ms 46816 KB Output is correct
38 Correct 98 ms 46576 KB Output is correct
39 Correct 101 ms 46500 KB Output is correct
40 Correct 97 ms 46392 KB Output is correct
41 Correct 110 ms 44364 KB Output is correct
42 Correct 110 ms 46428 KB Output is correct
43 Correct 118 ms 46292 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Execution timed out 2079 ms 300 KB Time limit exceeded
5 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 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 0 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 340 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 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 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 128 ms 46444 KB Output is correct
31 Correct 117 ms 46428 KB Output is correct
32 Correct 82 ms 22616 KB Output is correct
33 Correct 109 ms 45396 KB Output is correct
34 Correct 108 ms 45396 KB Output is correct
35 Correct 113 ms 47168 KB Output is correct
36 Correct 104 ms 48084 KB Output is correct
37 Correct 101 ms 46816 KB Output is correct
38 Correct 98 ms 46576 KB Output is correct
39 Correct 101 ms 46500 KB Output is correct
40 Correct 97 ms 46392 KB Output is correct
41 Correct 110 ms 44364 KB Output is correct
42 Correct 110 ms 46428 KB Output is correct
43 Correct 118 ms 46292 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Execution timed out 2079 ms 300 KB Time limit exceeded
48 Halted 0 ms 0 KB -