oj.uz

Submission #790926

# Submission time Handle Problem Language Result Execution time Memory
790926 2023-07-23T09:29:08 Z NothingXD Ancient Books (IOI17_books) C++17
50 / 100
 101 ms 17916 KB 
#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;
const ll inf = 1e18;
int n, mn, mx, cnt[maxn][2];
bool mark[maxn][2];

ll Calc(){
	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]--;
			mark[i][0] = true;
		}
		if (cnt[i][1] == 0){
			cnt[i][1]++;
			cnt[i+1][1]--;
			mark[i][1] = true;
		}
		if (cnt[i][0] < cnt[i][1]){
			mark[i][0] = true;
		}
		if (cnt[i][0] > cnt[i][1]){
			mark[i][1] = true;
		}
		//debug(i, cnt[i][0], cnt[i][1]);
		ans += 2 * max(cnt[i][0], cnt[i][1]);
	}
	debug(ans);
	return ans;
}

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

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 212 KB Output is correct
3 Correct 1 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 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 1 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 212 KB Output is correct
3 Correct 1 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 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 1 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 0 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 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 212 KB Output is correct
3 Correct 1 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 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 1 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 0 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 98 ms 15864 KB Output is correct
31 Correct 84 ms 15872 KB Output is correct
32 Correct 72 ms 8052 KB Output is correct
33 Correct 96 ms 17916 KB Output is correct
34 Correct 101 ms 17868 KB Output is correct
35 Correct 91 ms 17800 KB Output is correct
36 Correct 84 ms 17792 KB Output is correct
37 Correct 84 ms 17868 KB Output is correct
38 Correct 83 ms 17668 KB Output is correct
39 Correct 81 ms 17400 KB Output is correct
40 Correct 90 ms 16248 KB Output is correct
41 Correct 84 ms 15876 KB Output is correct
42 Correct 80 ms 16004 KB Output is correct
43 Correct 81 ms 15872 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 212 KB Output is correct
3 Correct 1 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 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 1 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 0 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 98 ms 15864 KB Output is correct
31 Correct 84 ms 15872 KB Output is correct
32 Correct 72 ms 8052 KB Output is correct
33 Correct 96 ms 17916 KB Output is correct
34 Correct 101 ms 17868 KB Output is correct
35 Correct 91 ms 17800 KB Output is correct
36 Correct 84 ms 17792 KB Output is correct
37 Correct 84 ms 17868 KB Output is correct
38 Correct 83 ms 17668 KB Output is correct
39 Correct 81 ms 17400 KB Output is correct
40 Correct 90 ms 16248 KB Output is correct
41 Correct 84 ms 15876 KB Output is correct
42 Correct 80 ms 16004 KB Output is correct
43 Correct 81 ms 15872 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 -