oj.uz

Submission #565287

# Submission time Handle Problem Language Result Execution time Memory
565287 2022-05-20T15:29:02 Z hoanghq2004 Ancient Books (IOI17_books) C++14
50 / 100
 180 ms 35388 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "books.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

long long minimum_walk(vector<int> p, int s) {
    int n = p.size();
    vector <int> vis(n, 0);
    vector <pair <int, int>> S;
    long long tot = 0;
    int last = 0;
    if (is_sorted(p.begin(), p.end())) return 0;
    for (int i = n - 1; i >= 0; --i) {
        if (p[i] != i) {
            last = i + 1;
            break;
        }
    }
    for (int u = 0; u < n; ++u) {
        tot += abs(u - p[u]);
        if (vis[u]) continue;
        int v = u;
        int mini = 1e9, maxi = - 1e9;
        do {
            mini = min(mini, v);
            maxi = max(maxi, v);
            vis[v] = 1;
            v = p[v];
        } while (u != v);
        S.push_back({mini, -1});
        S.push_back({maxi, 1});
    }
    sort(S.begin(), S.end());
    int cur = 0;
    int E = 0;
    for (auto [x, sign]: S) {
        if (x >= last) break;
        cur -= sign;
        if (cur == 0) ++E;
    }
//    cout << tot << '\n';
    --E;
    return tot + E * 2;
}

//
//int main() {
//	int n, s;
//	assert(2 == scanf("%d %d", &n, &s));
//
//	vector<int> p((unsigned) n);
//	for(int i = 0; i < n; i++)
//		assert(1 == scanf("%d", &p[(unsigned) i]));
//
//	long long res = minimum_walk(p, s);
//	printf("%lld\n", res);
//
//	return 0;
//}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:44:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |     for (auto [x, sign]: S) {
      |               ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 300 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 308 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 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 300 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 300 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 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 340 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 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 300 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 300 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 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 128 ms 18664 KB Output is correct
31 Correct 144 ms 18900 KB Output is correct
32 Correct 146 ms 18656 KB Output is correct
33 Correct 151 ms 35284 KB Output is correct
34 Correct 147 ms 35252 KB Output is correct
35 Correct 144 ms 35284 KB Output is correct
36 Correct 112 ms 22992 KB Output is correct
37 Correct 103 ms 19888 KB Output is correct
38 Correct 133 ms 18928 KB Output is correct
39 Correct 100 ms 18928 KB Output is correct
40 Correct 112 ms 18792 KB Output is correct
41 Correct 115 ms 18656 KB Output is correct
42 Correct 111 ms 18664 KB Output is correct
43 Correct 180 ms 35388 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 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 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 300 KB Output is correct
14 Correct 0 ms 300 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 1 ms 300 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 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 128 ms 18664 KB Output is correct
31 Correct 144 ms 18900 KB Output is correct
32 Correct 146 ms 18656 KB Output is correct
33 Correct 151 ms 35284 KB Output is correct
34 Correct 147 ms 35252 KB Output is correct
35 Correct 144 ms 35284 KB Output is correct
36 Correct 112 ms 22992 KB Output is correct
37 Correct 103 ms 19888 KB Output is correct
38 Correct 133 ms 18928 KB Output is correct
39 Correct 100 ms 18928 KB Output is correct
40 Correct 112 ms 18792 KB Output is correct
41 Correct 115 ms 18656 KB Output is correct
42 Correct 111 ms 18664 KB Output is correct
43 Correct 180 ms 35388 KB Output is correct
44 Incorrect 1 ms 212 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -