oj.uz

Submission #1073856

# Submission time Handle Problem Language Result Execution time Memory
1073856 2024-08-25T00:08:38 Z ArthuroWich Ancient Books (IOI17_books) C++17
50 / 100
 105 ms 32704 KB 
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
long long minimum_walk(vector<int> p, int s) {
    long long int ans = 0, n = p.size();
    for (int i = 0; i < n; i++) {
        ans += abs(i-p[i]);
    }
    vector<pair<int, int>> cycles;
    vector<int> vis(n, 0);
    for (int i = 0; i < n; i++) {
        if (p[i] == i || vis[i]) {
            continue;
        }
        int a = i, l = i, r = i;
        vis[i] = 1;
        a = p[i];
        vis[a] = 1;
        l = min(l, a);
        r = max(r, a);
        while(a != i) {
            a = p[a];
            vis[a] = 1;
            l = min(l, a);
            r = max(r, a);
        }
        cycles.push_back({min(l, r), max(l, r)});
    }
    vector<int> pref(n+1, 0), f1(n, 0), f2(n, 0);
    for (auto [i, j] : cycles) {
        pref[i] += 1;
        pref[j] -= 1; 
    }
    for (int i = 1; i < n; i++) {
        pref[i] += pref[i-1];
    }
    for (int i = n-1; i >= 0; i--) {
        if (pref[i] > 0) {
            f2[i] = 1;
        }
        if (i < n-1) {
            f2[i] |= f2[i+1];
        }
    }
    for (int i = n-1; i >= 0; i--) {
        if (f2[i] && pref[i] == 0) {
            ans += 2;
        }
    }
    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 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 1 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 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 348 KB Output is correct
17 Correct 0 ms 352 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 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 1 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 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 348 KB Output is correct
17 Correct 0 ms 352 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
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 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 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 1 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 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 348 KB Output is correct
17 Correct 0 ms 352 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
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 97 ms 23888 KB Output is correct
31 Correct 105 ms 30480 KB Output is correct
32 Correct 70 ms 30548 KB Output is correct
33 Correct 84 ms 32196 KB Output is correct
34 Correct 90 ms 32200 KB Output is correct
35 Correct 87 ms 32448 KB Output is correct
36 Correct 88 ms 31960 KB Output is correct
37 Correct 78 ms 30928 KB Output is correct
38 Correct 82 ms 30544 KB Output is correct
39 Correct 76 ms 30704 KB Output is correct
40 Correct 86 ms 30584 KB Output is correct
41 Correct 96 ms 30568 KB Output is correct
42 Correct 89 ms 30548 KB Output is correct
43 Correct 81 ms 32704 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2 Halted 0 ms 0 KB -

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 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 1 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 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 348 KB Output is correct
17 Correct 0 ms 352 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
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 97 ms 23888 KB Output is correct
31 Correct 105 ms 30480 KB Output is correct
32 Correct 70 ms 30548 KB Output is correct
33 Correct 84 ms 32196 KB Output is correct
34 Correct 90 ms 32200 KB Output is correct
35 Correct 87 ms 32448 KB Output is correct
36 Correct 88 ms 31960 KB Output is correct
37 Correct 78 ms 30928 KB Output is correct
38 Correct 82 ms 30544 KB Output is correct
39 Correct 76 ms 30704 KB Output is correct
40 Correct 86 ms 30584 KB Output is correct
41 Correct 96 ms 30568 KB Output is correct
42 Correct 89 ms 30548 KB Output is correct
43 Correct 81 ms 32704 KB Output is correct
44 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -