oj.uz

Submission #69450

# Submission time Handle Problem Language Result Execution time Memory
69450 2018-08-20T23:46:18 Z Bruteforceman Ancient Books (IOI17_books) C++11
0 / 100
 11 ms 9380 KB 
#include "books.h"
#include "bits/stdc++.h"
using namespace std;
int col[1000010];
bool vis[1000010];

bool v[1000010];
int l[1000010], r[1000010];
int cmp[1000010];

void dfs(int x, int c) {
	v[x] = true;
	for(int i = l[x]; i <= r[x]; i++) {
		cmp[i] = c;
		if(col[i] != -1 && v[col[i]] == false) {
			dfs(col[i], c);
		}
	}
}

long long minimum_walk(std::vector<int> p, int s) {
	long long ans = 0;
	int n = p.size();
	for(int i = 0; i < n-1; i++) {
		int go_left = 0;
		int go_right = 0;
		for(int j = 0; j <= i; j++) {
			if(p[j] > i) {
				++go_left;
			}
		}
		for(int j = i + 1; j < n; j++) {
			if(p[j] < i+1) {
				++go_right;
			}
		}
		assert(go_left == go_right);
		ans += go_left + go_right;
	}
	memset(col, -1, sizeof col);
	memset(v, false, sizeof v);
	int id = 0;
	for(int i = 0; i < n; i++) {
		if(col[i] != -1 || p[i] == i) continue;
		int cur = i;
		++id;
		l[id] = n;
		r[id] = 0; 
		while(col[cur] == -1) {
			l[id] = min(l[id], cur);
			r[id] = max(r[id], cur);
			col[cur] = id;
			cur = p[cur];
		}
	}
	memset(cmp, -1, sizeof cmp);
	int c = 0;
	for(int i = 0; i < n; i++) {
		if(col[i] != -1 && v[col[i]] == false) {
			dfs(col[i], ++c);
		}	
	}
	if(cmp[s] != -1) {
		int lft = 0;
		int ryt = 0;
		int cur = s;
		while(col[cur] == -1) {
			++cur;
			lft += 2;
		}
		cur = s;
		while(col[cur] == -1) {
			--cur;
			ryt += 2;
		}
		ans += min(lft, ryt);
	}
	int p1 = 0;
	int p2 = n-1;
	while(col[p1] == -1 && p1 < s) {
		++p1;
	}
	while(col[p2] == -1 && p2 > s) {
		--p2;
	}
	for(int i = p1; i < p2; i++) {
		if(col[i] != col[i + 1] || col[i] == -1 || col[i + 1] == -1) {
			ans += 2;
		}
	}
	return ans;
}

// 30 0
// 17 28 26 18 29 8 23 9 22 20 16 3 7 24 5 19 4 2 11 25 0 14 6 13 1 12 21 27 15 10 
// for(int i = 1; i <= c; i++) {
// 	l[i] = n;
// 	r[i] = 0;
// }
// for(int i = 0; i < n; i++) {
// 	if(cmp[i] != -1) {
// 		l[cmp[i]] = min(l[cmp[i]], i);
// 		r[cmp[i]] = max(r[cmp[i]], i);
// 	}
// }
// int rightmost = s;
// int leftmost = s;
// for(int i = 1; i <= c; i++) {
// 	if(l[i] <= s && s <= r[i]) continue;
// 	if(r[i] < s) {
// 		leftmost = min(leftmost, r[i]);
// 	}
// 	if(s < l[i]) {
// 		rightmost = max(rightmost, l[i]);
// 	}
// }
// ans += abs(leftmost - rightmost) * 2;

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9080 KB Output is correct
2 Incorrect 11 ms 9316 KB 3rd lines differ - on the 1st token, expected: '6', found: '10'
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9080 KB Output is correct
2 Incorrect 11 ms 9316 KB 3rd lines differ - on the 1st token, expected: '6', found: '10'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9080 KB Output is correct
2 Incorrect 11 ms 9316 KB 3rd lines differ - on the 1st token, expected: '6', found: '10'
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 9380 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4334'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9080 KB Output is correct
2 Incorrect 11 ms 9316 KB 3rd lines differ - on the 1st token, expected: '6', found: '10'
3 Halted 0 ms 0 KB -