Submission #790844

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
790844	2023-07-23T08:56:55 Z	NothingXD	Ancient Books (IOI17_books)	C++17	50 / 100	94 ms	16480 KB

books

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

using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> point;

void debug_out(){cerr << endl;}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 1e6 + 10;

int n, cnt[maxn][2];

ll minimum_walk(vector<int> p, int s) {
	n = p.size();
	int mn = s, mx = s;
	for (int i = 0; i < n; i++){
		if (p[i] == i) continue;
		mn = min(mn, i);
		mx = max(mx, i);
		if (p[i] < i){
			//debug(p[i]+1, i);
			cnt[p[i]+1][0]++;;
			cnt[i+1][0]--;
		}
		else{
			//debug(i+1, p[i]);
			cnt[i+1][1]++;
			cnt[p[i]+1][1]--;
		}
	}
	//debug(cnt[mn][0], cnt[mn][1]);
	for (int i = mn+1; i <= mx; i++){
		//debug(i, cnt[i][0], cnt[i][1]);
	}
	//debug(mn, mx);
	ll ans = 0;
	for (int i = mn+1; i <= mx; i++){
		cnt[i][0] += cnt[i-1][0];
		cnt[i][1] += cnt[i-1][1];
		//debug(i, cnt[i][0], cnt[i][1]);
		if (cnt[i][0] == 0){
			cnt[i][0]++;
			cnt[i+1][0]--;
		}
		if (cnt[i][1] == 0){
			cnt[i][1]++;
			cnt[i+1][1]--;
		}
		ans += 2 * max(cnt[i][0], cnt[i][1]);
	}
	return ans;

	return 0;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 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	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 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	1 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 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	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 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	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	312 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	308 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 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	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 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	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	312 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	308 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	89 ms	16368 KB	Output is correct
31	Correct	94 ms	16376 KB	Output is correct
32	Correct	74 ms	8644 KB	Output is correct
33	Correct	84 ms	16368 KB	Output is correct
34	Correct	83 ms	16416 KB	Output is correct
35	Correct	89 ms	16480 KB	Output is correct
36	Correct	91 ms	16392 KB	Output is correct
37	Correct	85 ms	16388 KB	Output is correct
38	Correct	81 ms	16460 KB	Output is correct
39	Correct	82 ms	16424 KB	Output is correct
40	Correct	84 ms	16452 KB	Output is correct
41	Correct	86 ms	16444 KB	Output is correct
42	Correct	82 ms	16340 KB	Output is correct
43	Correct	83 ms	16412 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	1 ms	212 KB	Output is correct
2	Correct	0 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 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	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 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	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	312 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	0 ms	308 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	89 ms	16368 KB	Output is correct
31	Correct	94 ms	16376 KB	Output is correct
32	Correct	74 ms	8644 KB	Output is correct
33	Correct	84 ms	16368 KB	Output is correct
34	Correct	83 ms	16416 KB	Output is correct
35	Correct	89 ms	16480 KB	Output is correct
36	Correct	91 ms	16392 KB	Output is correct
37	Correct	85 ms	16388 KB	Output is correct
38	Correct	81 ms	16460 KB	Output is correct
39	Correct	82 ms	16424 KB	Output is correct
40	Correct	84 ms	16452 KB	Output is correct
41	Correct	86 ms	16444 KB	Output is correct
42	Correct	82 ms	16340 KB	Output is correct
43	Correct	83 ms	16412 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	-

Submission #790844

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