oj.uz

Submission #1011909

# Submission time Handle Problem Language Result Execution time Memory
1011909 2024-07-01T10:55:23 Z c2zi6 Ancient Books (IOI17_books) C++14
70 / 100
 93 ms 28340 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "books.h"

VI L, R, C;

void extend(int& l, int& r) {
    int ll = min(L[C[l]], L[C[r]]);
    int rr = max(R[C[l]], R[C[r]]);
    while (ll < l || r < rr) {
        if (ll < l) {
            l--;
            setmin(ll, L[C[l]]);
            setmax(rr, R[C[l]]);
        }
        if (r < rr) {
            r++;
            setmin(ll, L[C[r]]);
            setmax(rr, R[C[r]]);
        }
    }
}

ll minimum_walk(VI p, int s) {
    int n = p.size();
    C = VI(n, -1);
    int c = 0;
    ll ans = 0;
    int entl = +2e9, entr = -2e9;
    rep(i, n) if (C[i] == -1) {
        int u = i;
        int l = +2e9, r = -2e9;
        do {
            C[u] = c;
            setmin(l, u);
            setmax(r, u);
            ans += abs(p[u]-u);
            u = p[u];
        } while (u != i);
        L.pb(l);
        R.pb(r);
        if (i != p[i]) {
            setmin(entl, l);
            setmax(entr, r);
        }
        c++;
    }

    int l = s;
    int r = s;
    extend(l, r);
    while (true) {
        bool ardyoq = false;
        int cr = 0;
        int maxr = r;
        replr(i, r+1, entr) {
            if (i > maxr) cr += 2;
            setmax(maxr, R[C[i]]);
            if (L[C[i]] < s) {
                ardyoq = true;
                break;
            }
        }
        int cl = 0;
        int minl = l;
        reprl(i, l-1, entl) {
            if (i < minl) cl += 2;
            setmin(minl, L[C[i]]);
            if (R[C[i]] > s) {
                ardyoq = true;
                break;
            }
        }
        if (!ardyoq) {
            ans += cl + cr;
            break;
        }
        ans += min(cl, cr);
        l = minl, r = maxr;
        extend(l, r);
    }
    return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 440 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 424 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 85 ms 18768 KB Output is correct
31 Correct 89 ms 18900 KB Output is correct
32 Correct 74 ms 26696 KB Output is correct
33 Correct 78 ms 26560 KB Output is correct
34 Correct 77 ms 26296 KB Output is correct
35 Correct 79 ms 28340 KB Output is correct
36 Correct 93 ms 20924 KB Output is correct
37 Correct 73 ms 19284 KB Output is correct
38 Correct 72 ms 18768 KB Output is correct
39 Correct 75 ms 18772 KB Output is correct
40 Correct 74 ms 18768 KB Output is correct
41 Correct 85 ms 18772 KB Output is correct
42 Correct 81 ms 18768 KB Output is correct
43 Correct 78 ms 25268 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 392 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 440 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 432 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 424 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 85 ms 18768 KB Output is correct
31 Correct 89 ms 18900 KB Output is correct
32 Correct 74 ms 26696 KB Output is correct
33 Correct 78 ms 26560 KB Output is correct
34 Correct 77 ms 26296 KB Output is correct
35 Correct 79 ms 28340 KB Output is correct
36 Correct 93 ms 20924 KB Output is correct
37 Correct 73 ms 19284 KB Output is correct
38 Correct 72 ms 18768 KB Output is correct
39 Correct 75 ms 18772 KB Output is correct
40 Correct 74 ms 18768 KB Output is correct
41 Correct 85 ms 18772 KB Output is correct
42 Correct 81 ms 18768 KB Output is correct
43 Correct 78 ms 25268 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 604 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 392 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 79 ms 27828 KB Output is correct
65 Correct 76 ms 27828 KB Output is correct
66 Correct 70 ms 19284 KB Output is correct
67 Incorrect 71 ms 19028 KB 3rd lines differ - on the 1st token, expected: '2408891936', found: '2408891930'
68 Halted 0 ms 0 KB -