oj.uz

Submission #294940

# Submission time Handle Problem Language Result Execution time Memory
294940 2020-09-09T10:56:17 Z amoo_safar Ancient Books (IOI17_books) C++17
100 / 100
 364 ms 36104 KB 
#include "books.h"

#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()

using namespace std;

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

const int N = 1e6 + 10;

int mk[N], mk2[N];
int L[N], R[N];
//int mn[N][N], mx[N][N];
//ll dp[N][N];

ll minimum_walk(vector<int> p, int s) {
	int n = p.size();
	ll ans = 0;
	ll near = n;
	for(int i = 0; i < n; i++){
		if(p[i] != i){
			ans += abs(p[i] - i);
		} else {
			//mk[i] = 1;
			R[i] = i;
			L[i] = i;
		}
	}
	cerr << "# " << ans << '\n';
	mk[s] = 0;
	int st = 0, en = n - 1;
	while(p[st] == st && st < s){ mk[st] = 1; st ++; }
	while(p[en] == en && en > s){ mk[en] = 1; en --; }

	int com = 0;
	vector<pii> seg;
	for(int i = st; i < en; i++){
		if(mk[i]) continue;
		com ++;
		vector<int> vis;
		int nw = i;
		while(!mk[nw]){
			mk[nw] = 1;
			vis.pb(nw);
			nw = p[nw];
		}
		sort(all(vis));
		seg.pb({vis[0], vis.back()});
		for(auto x : vis) L[x] = vis[0];
		for(auto x : vis) R[x] = vis.back();
	}
	if(com == 0) return 0;
	sort(all(seg));
	int mxr = st;
	for(int i = 0; i < (int)seg.size(); i++){
		if(mxr < seg[i].F)
			mk2[mxr] = 1, ans += 2;
		mxr = max(mxr, seg[i].S);
	}
	mk2[mxr] = 1;
	/*
	for(int i = 0; i < n; i++) mn[i][i] = L[i];
	for(int i = 0; i < n; i++) mx[i][i] = R[i];
	for(int ln = 1; ln < n; ln ++){
		for(int i = 0; i + ln < n; i++){
			int j = i + ln;
			mn[i][j] = min(mn[i][j - 1], mn[i + 1][j]);
			mx[i][j] = max(mx[i][j - 1], mx[i + 1][j]);
		}
	}
	*/
	//if(ans == 0) return 0;

	int nwl = s;
	int nwr = s;
	int mxl = L[s];
	mxr = R[s];
	cerr << ans << '\n';
	while(!mk2[nwr]){
		/*
		mxl = L[nwl];
		for(int i = nwl; i <= nwr; i ++) mxl = min(mxl, L[i]);
		mxr = R[nwl];
		for(int i = nwl; i <= nwr; i ++) mxr = max(mxr, R[i]);
		*/
		//cerr << "! " << nwl << ' ' << nwr << ' ' << l2 << ' ' << r2 << '\n';
		
		int l2 = mxl;
		int r2 = mxr;
		
		if(pii(l2, r2) == pii(nwl, nwr) && !mk2[r2]){
			ans += 2;
			l2 --;
			r2 ++;
		}
		while(nwl > l2){nwl --; mxl = min(mxl, L[nwl]), mxr = max(mxr, R[nwl]);}
		while(nwr < r2){nwr ++; mxl = min(mxl, L[nwr]), mxr = max(mxr, R[nwr]);}
		//nwl = l2;
		//nwr = r2;
	}

	return ans;
}
/*
4 1
0 3 1 2

*/

Compilation message

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:25:5: warning: unused variable 'near' [-Wunused-variable]
   25 |  ll near = n;
      |     ^~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 376 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 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 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 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 384 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 376 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 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 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 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 384 KB Output is correct
30 Correct 354 ms 24612 KB Output is correct
31 Correct 364 ms 23180 KB Output is correct
32 Correct 165 ms 21124 KB Output is correct
33 Correct 267 ms 30548 KB Output is correct
34 Correct 285 ms 30548 KB Output is correct
35 Correct 264 ms 29408 KB Output is correct
36 Correct 238 ms 27124 KB Output is correct
37 Correct 247 ms 25452 KB Output is correct
38 Correct 238 ms 23800 KB Output is correct
39 Correct 248 ms 23416 KB Output is correct
40 Correct 250 ms 21748 KB Output is correct
41 Correct 313 ms 22132 KB Output is correct
42 Correct 294 ms 22204 KB Output is correct
43 Correct 264 ms 29040 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 376 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 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 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 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 384 KB Output is correct
30 Correct 354 ms 24612 KB Output is correct
31 Correct 364 ms 23180 KB Output is correct
32 Correct 165 ms 21124 KB Output is correct
33 Correct 267 ms 30548 KB Output is correct
34 Correct 285 ms 30548 KB Output is correct
35 Correct 264 ms 29408 KB Output is correct
36 Correct 238 ms 27124 KB Output is correct
37 Correct 247 ms 25452 KB Output is correct
38 Correct 238 ms 23800 KB Output is correct
39 Correct 248 ms 23416 KB Output is correct
40 Correct 250 ms 21748 KB Output is correct
41 Correct 313 ms 22132 KB Output is correct
42 Correct 294 ms 22204 KB Output is correct
43 Correct 264 ms 29040 KB Output is correct
44 Correct 1 ms 360 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct
54 Correct 1 ms 384 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 2 ms 380 KB Output is correct
61 Correct 1 ms 384 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 263 ms 28356 KB Output is correct
65 Correct 259 ms 28128 KB Output is correct
66 Correct 227 ms 24372 KB Output is correct
67 Correct 231 ms 24180 KB Output is correct
68 Correct 23 ms 3188 KB Output is correct
69 Correct 22 ms 3064 KB Output is correct
70 Correct 23 ms 3444 KB Output is correct
71 Correct 28 ms 4088 KB Output is correct
72 Correct 28 ms 3964 KB Output is correct
73 Correct 26 ms 2936 KB Output is correct
74 Correct 257 ms 36052 KB Output is correct
75 Correct 277 ms 36104 KB Output is correct
76 Correct 266 ms 34968 KB Output is correct
77 Correct 264 ms 34892 KB Output is correct
78 Correct 249 ms 34336 KB Output is correct
79 Correct 256 ms 34328 KB Output is correct
80 Correct 164 ms 26616 KB Output is correct
81 Correct 251 ms 30688 KB Output is correct
82 Correct 247 ms 30620 KB Output is correct
83 Correct 256 ms 30884 KB Output is correct
84 Correct 232 ms 30880 KB Output is correct
85 Correct 242 ms 28836 KB Output is correct
86 Correct 237 ms 27316 KB Output is correct
87 Correct 291 ms 34980 KB Output is correct
88 Correct 304 ms 34968 KB Output is correct
89 Correct 271 ms 30888 KB Output is correct
90 Correct 243 ms 26872 KB Output is correct
91 Correct 243 ms 26804 KB Output is correct
92 Correct 265 ms 26808 KB Output is correct