Submission #270857

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
270857	2020-08-18T03:34:35 Z	hamerin	Ancient Books (IOI17_books)	C++17	50 / 100	1315 ms	160948 KB

books

#include "books.h"

#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

using i64 = long long;
using d64 = long double;
using pi = pair<int, int>;
using pli = pair<i64, i64>;
using ti = tuple<int, int, int>;
using tli = tuple<i64, i64, i64>;

#define iterall(cont) cont.begin(), cont.end()
#define prec(n) setprecision(n) << fixed

i64 minimum_walk(vector<int> p, int s) {
    const int N = p.size();

    vector<vector<int>> cycles;
    vector<set<int>> cyc_st;
    vector<int> cyc(N);

    vector<bool> vst(N);
    for (int i = 0; i < N; i++) {
        if (vst[i]) continue;

        cycles.emplace_back(vector<int>());
        cyc_st.emplace_back(set<int>());

        int cur = i;
        while (cycles.back().empty() || cur != i) {
            cycles.back().emplace_back(cur);
            cyc_st.back().emplace(cur);
            cyc[cur] = cycles.size() - 1;
            vst[cur] = true;
			cur = p[cur];
        }
    }

    i64 ans = 0;
    for (int i = 0; i < N; i++) ans += abs(i - p[i]);

    vector<pi> intervals;
    for (auto &st : cyc_st)
        if (st.size() > 1 || *st.begin() == s)
            intervals.emplace_back(*st.begin(), *prev(st.end()));

    sort(iterall(intervals));

    int M = 0;
    for (auto [l, r] : intervals) {
		if (l > M) ans += 2 * (l - M);
        M = max(r, M);
    }

    return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	512 KB	Output is correct
22	Correct	1 ms	512 KB	Output is correct
23	Correct	1 ms	512 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	512 KB	Output is correct
30	Correct	1315 ms	63172 KB	Output is correct
31	Correct	1038 ms	63208 KB	Output is correct
32	Correct	411 ms	160948 KB	Output is correct
33	Correct	422 ms	133300 KB	Output is correct
34	Correct	434 ms	133380 KB	Output is correct
35	Correct	431 ms	135660 KB	Output is correct
36	Correct	389 ms	91056 KB	Output is correct
37	Correct	369 ms	68188 KB	Output is correct
38	Correct	411 ms	65788 KB	Output is correct
39	Correct	450 ms	65276 KB	Output is correct
40	Correct	489 ms	63932 KB	Output is correct
41	Correct	874 ms	63148 KB	Output is correct
42	Correct	638 ms	63340 KB	Output is correct
43	Correct	417 ms	138532 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	512 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	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	512 KB	Output is correct
22	Correct	1 ms	512 KB	Output is correct
23	Correct	1 ms	512 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	512 KB	Output is correct
30	Correct	1315 ms	63172 KB	Output is correct
31	Correct	1038 ms	63208 KB	Output is correct
32	Correct	411 ms	160948 KB	Output is correct
33	Correct	422 ms	133300 KB	Output is correct
34	Correct	434 ms	133380 KB	Output is correct
35	Correct	431 ms	135660 KB	Output is correct
36	Correct	389 ms	91056 KB	Output is correct
37	Correct	369 ms	68188 KB	Output is correct
38	Correct	411 ms	65788 KB	Output is correct
39	Correct	450 ms	65276 KB	Output is correct
40	Correct	489 ms	63932 KB	Output is correct
41	Correct	874 ms	63148 KB	Output is correct
42	Correct	638 ms	63340 KB	Output is correct
43	Correct	417 ms	138532 KB	Output is correct
44	Incorrect	1 ms	512 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #270857

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0