oj.uz

답안 #69341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
69341 2018-08-20T14:36:30 Z Bruteforceman 고대 책들 (IOI17_books) C++11
0 / 100
 41 ms 5400 KB 
#include "books.h"
#include "bits/stdc++.h"
using namespace std;
int col[1000010];
bool vis[1000010];

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);
	int id = 0;
	for(int i = 0; i < n; i++) {
		if(col[i] != -1 || p[i] == i) continue;
		int cur = i;
		++id;
		while(col[cur] == -1) {
			col[cur] = id;
			cur = p[cur];
		}
	}
	int opt = 1e9;
	for(int i = s; i < n; i++) {
		memset(vis, false, sizeof vis);
		int cnt = 0;
		int add = abs(s - i);
		for(int j = s; j <= i; j++) {
			if(col[j] == -1)  continue;
			if(vis[col[j]] == false) ++cnt;
			vis[col[j]] = true;
		} 
		if(cnt == id) {
			opt = min(opt, 2 * add);
			continue;
		}
		for(int j = s-1; j >= 0; j--) {
			if(col[j] == -1) continue;
			if(vis[col[j]] == false) ++cnt;
			vis[col[j]] = true;
			if(cnt == id) {
				add += abs(s - j);
				break;
			}
		}
		if(cnt == id) {
			opt = min(opt, 2 * add);
		}
	}
	ans += opt;
	return ans;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 6 ms 5344 KB Output is correct
3 Correct 7 ms 5344 KB Output is correct
4 Correct 7 ms 5344 KB Output is correct
5 Correct 7 ms 5344 KB Output is correct
6 Incorrect 8 ms 5396 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 6 ms 5344 KB Output is correct
3 Correct 7 ms 5344 KB Output is correct
4 Correct 7 ms 5344 KB Output is correct
5 Correct 7 ms 5344 KB Output is correct
6 Incorrect 8 ms 5396 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 6 ms 5344 KB Output is correct
3 Correct 7 ms 5344 KB Output is correct
4 Correct 7 ms 5344 KB Output is correct
5 Correct 7 ms 5344 KB Output is correct
6 Incorrect 8 ms 5396 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 41 ms 5400 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4724'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5240 KB Output is correct
2 Correct 6 ms 5344 KB Output is correct
3 Correct 7 ms 5344 KB Output is correct
4 Correct 7 ms 5344 KB Output is correct
5 Correct 7 ms 5344 KB Output is correct
6 Incorrect 8 ms 5396 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
7 Halted 0 ms 0 KB -