Submission #364741

# Submission time Handle Problem Language Result Execution time Memory
364741 2021-02-09T21:00:44 Z rqi Ancient Books (IOI17_books) C++14
100 / 100
276 ms 26908 KB
#include "books.h"
#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef long long ll;

#define sz(x) (int)(x).size()
#define pb push_back
#define bk back()

const int MOD = 1e9+7;

const int mx = 1000005;
vi p;
int s;
int cycL[mx]; //leftmost of a cycle
int cycR[mx]; //rightmost of a cycle

void popLRSingles(){
	int L = 0;
	for(int i = 0; i < s; i++){
		if(p[i] == i){
			L = i+1;
		}
		else{
			break;
		}
	}

	vi newp;
	for(int i = L; i < sz(p); i++){
		newp.pb(p[i]-L);
	}

	p = newp;
	s = s-L;

	// for(int i = 0; i < sz(p); i++){
	// 	cout << i << " " << p[i] << "\n";
	// }

	while(true){
		if(sz(p)-1 == s) break;
		if(p[sz(p)-1] == sz(p)-1){
			//cout << sz(p)-1 << "\n";
			p.pop_back();
		}
		else{
			break;
		}
	}
}

int curL, curR;

int Lfrees, Rfrees;

void getFrees(){
	while(true){
		bool updated = false;

		while(Lfrees >= 0){
			
			cout.flush();
			int node = Lfrees;
			if(node < curL) break;
			updated = true;
			Lfrees--;
			curL = min(curL, cycL[node]);
			curR = max(curR, cycR[node]);
		}

		while(Rfrees < sz(p)){
			int node = Rfrees;
			if(node > curR) break;
			updated = true;
			Rfrees++;
			curL = min(curL, cycL[node]);
			curR = max(curR, cycR[node]);
		}

		if(!updated) break;
	}
}

long long minimum_walk(vi _p, int _s) {
	p = _p;
	s = _s;
	popLRSingles();
	int n = sz(p);

	for(int i = 0; i < n; i++){
		cycL[i] = MOD;
		cycR[i] = -1;
	}

	for(int i = 0; i < n; i++){
		if(cycR[i] == -1){
			int curnode = i;
			while(true){
				cycL[i] = min(cycL[i], curnode);
				cycR[i] = max(cycR[i], curnode);
				curnode = p[curnode];
				if(curnode == i) break;
			}

			while(true){
				cycL[curnode] = cycL[i];
				cycR[curnode] = cycR[i];
				curnode = p[curnode];
				if(curnode == i) break;
			}
		}
	}

	ll ans = 0;

	for(int i = 0; i < n; i++){
		ans+=abs(p[i]-i);
	}



	curL = s;
	curR = s;

	Lfrees = s;
	Rfrees = s;

	getFrees();

	while(curL > 0 || curR < n-1){
		int prev_curL = curL;
		int prev_curR = curR;

		ll L_cost = 0;
		ll R_cost = 0;
		bool non_boost = false;

		for(int i = curL-1; i >= 0; i--){
			if(i+1 == curL){
				L_cost+=2;
				curL--;
			}

			curL = min(curL, cycL[i]);
			if(cycR[i] > prev_curR){
				//found non boost
				non_boost = true;
				break;
			}
		}

		for(int i = curR+1; i < n; i++){
			if(i-1 == curR){
				R_cost+=2;
				curR++;
			}

			curR = max(curR, cycR[i]);
			if(cycL[i] < prev_curL){
				non_boost = true;
				break;
			}
		}

		if(!non_boost){
			ans+=L_cost+R_cost;
		}
		else{
			ans+=min(L_cost, R_cost);
		}

		getFrees();
	}

	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 242 ms 20372 KB Output is correct
31 Correct 276 ms 20372 KB Output is correct
32 Correct 128 ms 16752 KB Output is correct
33 Correct 147 ms 20372 KB Output is correct
34 Correct 146 ms 20500 KB Output is correct
35 Correct 149 ms 20372 KB Output is correct
36 Correct 153 ms 20372 KB Output is correct
37 Correct 156 ms 20372 KB Output is correct
38 Correct 143 ms 20500 KB Output is correct
39 Correct 143 ms 20500 KB Output is correct
40 Correct 154 ms 20460 KB Output is correct
41 Correct 175 ms 20484 KB Output is correct
42 Correct 169 ms 20460 KB Output is correct
43 Correct 142 ms 20472 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 388 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 242 ms 20372 KB Output is correct
31 Correct 276 ms 20372 KB Output is correct
32 Correct 128 ms 16752 KB Output is correct
33 Correct 147 ms 20372 KB Output is correct
34 Correct 146 ms 20500 KB Output is correct
35 Correct 149 ms 20372 KB Output is correct
36 Correct 153 ms 20372 KB Output is correct
37 Correct 156 ms 20372 KB Output is correct
38 Correct 143 ms 20500 KB Output is correct
39 Correct 143 ms 20500 KB Output is correct
40 Correct 154 ms 20460 KB Output is correct
41 Correct 175 ms 20484 KB Output is correct
42 Correct 169 ms 20460 KB Output is correct
43 Correct 142 ms 20472 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 388 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 144 ms 26772 KB Output is correct
65 Correct 160 ms 26772 KB Output is correct
66 Correct 156 ms 26772 KB Output is correct
67 Correct 183 ms 26876 KB Output is correct
68 Correct 15 ms 3036 KB Output is correct
69 Correct 15 ms 3056 KB Output is correct
70 Correct 16 ms 3036 KB Output is correct
71 Correct 15 ms 3036 KB Output is correct
72 Correct 22 ms 3036 KB Output is correct
73 Correct 16 ms 3036 KB Output is correct
74 Correct 165 ms 26772 KB Output is correct
75 Correct 161 ms 26732 KB Output is correct
76 Correct 157 ms 26772 KB Output is correct
77 Correct 162 ms 26908 KB Output is correct
78 Correct 167 ms 26772 KB Output is correct
79 Correct 168 ms 26772 KB Output is correct
80 Correct 121 ms 18756 KB Output is correct
81 Correct 171 ms 26772 KB Output is correct
82 Correct 162 ms 26772 KB Output is correct
83 Correct 163 ms 26772 KB Output is correct
84 Correct 192 ms 26772 KB Output is correct
85 Correct 156 ms 26772 KB Output is correct
86 Correct 153 ms 26816 KB Output is correct
87 Correct 187 ms 26748 KB Output is correct
88 Correct 176 ms 26772 KB Output is correct
89 Correct 164 ms 26772 KB Output is correct
90 Correct 164 ms 26772 KB Output is correct
91 Correct 167 ms 26772 KB Output is correct
92 Correct 187 ms 26732 KB Output is correct