Submission #977397

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
977397	2024-05-07T21:17:34 Z	mariaclara	Ancient Books (IOI17_books)	C++17	50 / 100	99 ms	12996 KB

books

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

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

ll minimum_walk(vector<int> p, int s) {
	int n = sz(p);
	vector<bool> vis(n,0);
	vector<pii> aux, range;

	ll ans = 0;
	for(int i = 0; i  < n; i++) {
		int x = i, m = i;
		while(!vis[x]) {
			vis[x] = 1;
			x = p[x];
			m = max(m, x);
		}

		ans += abs(p[i]-i);
		if(i != m) aux.pb({i,m});
	}

	//cout << "ok" << endl;

	for(int i = 0; i < sz(aux);) {
		int l = aux[i].fr, r = aux[i].sc, j = i;
		while(j < sz(aux) and aux[j].fr <= r) {
			//cout << i << " " << j << " " << l << " " << r << endl;
			r = max(r, aux[j].sc);
			j++;
		}
		i=j;
		range.pb({l,r});
	}

	//cout << "ok" << endl;

	for(int i = 1; i < sz(range); i++)
		ans += 2*(range[i].fr - range[i-1].sc);

	int dist = n;
	for(int i = 0; i < n; i++) 
		if(p[i] != i) dist = min(dist, abs(s-i));

	return ans + 2*(dist%n);
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	600 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	344 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	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	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	1 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	600 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	344 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	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	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	1 ms	348 KB	Output is correct
18	Correct	1 ms	344 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	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 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	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	344 KB	Output is correct
2	Correct	1 ms	600 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	344 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	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	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	1 ms	348 KB	Output is correct
18	Correct	1 ms	344 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	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 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	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	98 ms	8176 KB	Output is correct
31	Correct	87 ms	8176 KB	Output is correct
32	Correct	75 ms	8176 KB	Output is correct
33	Correct	85 ms	12736 KB	Output is correct
34	Correct	84 ms	12740 KB	Output is correct
35	Correct	87 ms	12996 KB	Output is correct
36	Correct	88 ms	11204 KB	Output is correct
37	Correct	74 ms	8688 KB	Output is correct
38	Correct	75 ms	8448 KB	Output is correct
39	Correct	82 ms	8448 KB	Output is correct
40	Correct	76 ms	8188 KB	Output is correct
41	Correct	80 ms	8196 KB	Output is correct
42	Correct	80 ms	8280 KB	Output is correct
43	Correct	99 ms	10356 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	344 KB	Output is correct
2	Correct	1 ms	600 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	344 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	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	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	1 ms	348 KB	Output is correct
18	Correct	1 ms	344 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	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 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	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	98 ms	8176 KB	Output is correct
31	Correct	87 ms	8176 KB	Output is correct
32	Correct	75 ms	8176 KB	Output is correct
33	Correct	85 ms	12736 KB	Output is correct
34	Correct	84 ms	12740 KB	Output is correct
35	Correct	87 ms	12996 KB	Output is correct
36	Correct	88 ms	11204 KB	Output is correct
37	Correct	74 ms	8688 KB	Output is correct
38	Correct	75 ms	8448 KB	Output is correct
39	Correct	82 ms	8448 KB	Output is correct
40	Correct	76 ms	8188 KB	Output is correct
41	Correct	80 ms	8196 KB	Output is correct
42	Correct	80 ms	8280 KB	Output is correct
43	Correct	99 ms	10356 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	-