Submission #54110

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
54110	2018-07-02T11:36:41 Z	chpipis	Ancient Books (IOI17_books)	C++11	50 / 100	347 ms	119360 KB

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back

typedef long long ll;
typedef pair<int, int> ii;

const int MAX_N = 1e6 + 5;

bitset<MAX_N> visit;
vector<int> p, from;
int n;

ll minimum_walk(vector<int> _p, int s) {
    assert(s == 0);
    p = _p;
    n = (int)p.size();
    from.resize(n);
    for (int i = 0; i < n; i++)
        from[p[i]] = i;
    visit.reset();
    vector<ii> temp, segs;
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        if (visit[i]) continue;
        int j = i;
        int mx = j;
        while (!visit[j]) {
            mx = max(mx, j);
            visit[j] = true;
            ans += abs(j - p[j]);
            j = p[j];
        }
        temp.pb(mp(i, mx));
    }
    segs.pb(temp[0]);
    for (auto it : temp) {
        if (it.fi < segs.back().se)
            segs.back().se = max(segs.back().se, it.se);
        else
            segs.pb(it);
    }
    while (segs.size() && segs.back().fi == segs.back().se) segs.pop_back();
    int sz = (int)segs.size();
    for (int i = 0; i < sz - 1; i++) {
        ans += (segs[i + 1].fi - segs[i].se) * 2;
    }
    return ans;
}

Subtask #1

12.0 / 12.0

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

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	616 KB	Output is correct
3	Correct	2 ms	616 KB	Output is correct
4	Correct	2 ms	616 KB	Output is correct
5	Correct	3 ms	616 KB	Output is correct
6	Correct	2 ms	664 KB	Output is correct
7	Correct	2 ms	808 KB	Output is correct
8	Correct	2 ms	808 KB	Output is correct
9	Correct	3 ms	808 KB	Output is correct
10	Correct	2 ms	808 KB	Output is correct
11	Correct	2 ms	808 KB	Output is correct
12	Correct	2 ms	808 KB	Output is correct
13	Correct	2 ms	808 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	2 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	2 ms	848 KB	Output is correct
20	Correct	2 ms	916 KB	Output is correct
21	Correct	2 ms	920 KB	Output is correct
22	Correct	2 ms	924 KB	Output is correct
23	Correct	3 ms	924 KB	Output is correct
24	Correct	3 ms	924 KB	Output is correct
25	Correct	3 ms	936 KB	Output is correct
26	Correct	2 ms	940 KB	Output is correct
27	Correct	3 ms	944 KB	Output is correct
28	Correct	3 ms	948 KB	Output is correct
29	Correct	3 ms	952 KB	Output is correct

Subtask #3

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	616 KB	Output is correct
3	Correct	2 ms	616 KB	Output is correct
4	Correct	2 ms	616 KB	Output is correct
5	Correct	3 ms	616 KB	Output is correct
6	Correct	2 ms	664 KB	Output is correct
7	Correct	2 ms	808 KB	Output is correct
8	Correct	2 ms	808 KB	Output is correct
9	Correct	3 ms	808 KB	Output is correct
10	Correct	2 ms	808 KB	Output is correct
11	Correct	2 ms	808 KB	Output is correct
12	Correct	2 ms	808 KB	Output is correct
13	Correct	2 ms	808 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	2 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	2 ms	848 KB	Output is correct
20	Correct	2 ms	916 KB	Output is correct
21	Correct	2 ms	920 KB	Output is correct
22	Correct	2 ms	924 KB	Output is correct
23	Correct	3 ms	924 KB	Output is correct
24	Correct	3 ms	924 KB	Output is correct
25	Correct	3 ms	936 KB	Output is correct
26	Correct	2 ms	940 KB	Output is correct
27	Correct	3 ms	944 KB	Output is correct
28	Correct	3 ms	948 KB	Output is correct
29	Correct	3 ms	952 KB	Output is correct
30	Correct	218 ms	23228 KB	Output is correct
31	Correct	212 ms	30116 KB	Output is correct
32	Correct	180 ms	57008 KB	Output is correct
33	Correct	173 ms	61268 KB	Output is correct
34	Correct	178 ms	68008 KB	Output is correct
35	Correct	180 ms	69048 KB	Output is correct
36	Correct	168 ms	69048 KB	Output is correct
37	Correct	245 ms	71164 KB	Output is correct
38	Correct	173 ms	77588 KB	Output is correct
39	Correct	169 ms	84068 KB	Output is correct
40	Correct	189 ms	90816 KB	Output is correct
41	Correct	228 ms	97516 KB	Output is correct
42	Correct	347 ms	104464 KB	Output is correct
43	Correct	234 ms	119360 KB	Output is correct

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	3 ms	119360 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	616 KB	Output is correct
3	Correct	2 ms	616 KB	Output is correct
4	Correct	2 ms	616 KB	Output is correct
5	Correct	3 ms	616 KB	Output is correct
6	Correct	2 ms	664 KB	Output is correct
7	Correct	2 ms	808 KB	Output is correct
8	Correct	2 ms	808 KB	Output is correct
9	Correct	3 ms	808 KB	Output is correct
10	Correct	2 ms	808 KB	Output is correct
11	Correct	2 ms	808 KB	Output is correct
12	Correct	2 ms	808 KB	Output is correct
13	Correct	2 ms	808 KB	Output is correct
14	Correct	2 ms	848 KB	Output is correct
15	Correct	2 ms	848 KB	Output is correct
16	Correct	2 ms	848 KB	Output is correct
17	Correct	2 ms	848 KB	Output is correct
18	Correct	2 ms	848 KB	Output is correct
19	Correct	2 ms	848 KB	Output is correct
20	Correct	2 ms	916 KB	Output is correct
21	Correct	2 ms	920 KB	Output is correct
22	Correct	2 ms	924 KB	Output is correct
23	Correct	3 ms	924 KB	Output is correct
24	Correct	3 ms	924 KB	Output is correct
25	Correct	3 ms	936 KB	Output is correct
26	Correct	2 ms	940 KB	Output is correct
27	Correct	3 ms	944 KB	Output is correct
28	Correct	3 ms	948 KB	Output is correct
29	Correct	3 ms	952 KB	Output is correct
30	Correct	218 ms	23228 KB	Output is correct
31	Correct	212 ms	30116 KB	Output is correct
32	Correct	180 ms	57008 KB	Output is correct
33	Correct	173 ms	61268 KB	Output is correct
34	Correct	178 ms	68008 KB	Output is correct
35	Correct	180 ms	69048 KB	Output is correct
36	Correct	168 ms	69048 KB	Output is correct
37	Correct	245 ms	71164 KB	Output is correct
38	Correct	173 ms	77588 KB	Output is correct
39	Correct	169 ms	84068 KB	Output is correct
40	Correct	189 ms	90816 KB	Output is correct
41	Correct	228 ms	97516 KB	Output is correct
42	Correct	347 ms	104464 KB	Output is correct
43	Correct	234 ms	119360 KB	Output is correct
44	Runtime error	3 ms	119360 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
45	Halted	0 ms	0 KB	-