답안 #69359 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69359	2018-08-20T15:40:24 Z	Bruteforceman	고대 책들 (IOI17_books)	C++11	12 / 100	13 ms	9456 KB

books

#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 = 1; i <= id; i++) {
		if(v[i] == false) {
			dfs(i, ++c);
		}	
	}
	for(int i = 0; i < n; i++) {
		col[i] = cmp[i];
	}
	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] == -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

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	9080 KB	Output is correct
2	Correct	10 ms	9192 KB	Output is correct
3	Correct	10 ms	9352 KB	Output is correct
4	Correct	9 ms	9352 KB	Output is correct
5	Correct	10 ms	9352 KB	Output is correct
6	Correct	9 ms	9456 KB	Output is correct
7	Correct	10 ms	9456 KB	Output is correct
8	Correct	9 ms	9456 KB	Output is correct
9	Correct	10 ms	9456 KB	Output is correct
10	Correct	9 ms	9456 KB	Output is correct
11	Correct	9 ms	9456 KB	Output is correct
12	Correct	11 ms	9456 KB	Output is correct
13	Correct	12 ms	9456 KB	Output is correct
14	Correct	12 ms	9456 KB	Output is correct
15	Correct	9 ms	9456 KB	Output is correct
16	Correct	10 ms	9456 KB	Output is correct
17	Correct	9 ms	9456 KB	Output is correct
18	Correct	10 ms	9456 KB	Output is correct

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	9080 KB	Output is correct
2	Correct	10 ms	9192 KB	Output is correct
3	Correct	10 ms	9352 KB	Output is correct
4	Correct	9 ms	9352 KB	Output is correct
5	Correct	10 ms	9352 KB	Output is correct
6	Correct	9 ms	9456 KB	Output is correct
7	Correct	10 ms	9456 KB	Output is correct
8	Correct	9 ms	9456 KB	Output is correct
9	Correct	10 ms	9456 KB	Output is correct
10	Correct	9 ms	9456 KB	Output is correct
11	Correct	9 ms	9456 KB	Output is correct
12	Correct	11 ms	9456 KB	Output is correct
13	Correct	12 ms	9456 KB	Output is correct
14	Correct	12 ms	9456 KB	Output is correct
15	Correct	9 ms	9456 KB	Output is correct
16	Correct	10 ms	9456 KB	Output is correct
17	Correct	9 ms	9456 KB	Output is correct
18	Correct	10 ms	9456 KB	Output is correct
19	Correct	10 ms	9456 KB	Output is correct
20	Correct	13 ms	9456 KB	Output is correct
21	Correct	10 ms	9456 KB	Output is correct
22	Incorrect	12 ms	9456 KB	3rd lines differ - on the 1st token, expected: '2082', found: '2002'
23	Halted	0 ms	0 KB	-

Subtask #3
0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	9080 KB	Output is correct
2	Correct	10 ms	9192 KB	Output is correct
3	Correct	10 ms	9352 KB	Output is correct
4	Correct	9 ms	9352 KB	Output is correct
5	Correct	10 ms	9352 KB	Output is correct
6	Correct	9 ms	9456 KB	Output is correct
7	Correct	10 ms	9456 KB	Output is correct
8	Correct	9 ms	9456 KB	Output is correct
9	Correct	10 ms	9456 KB	Output is correct
10	Correct	9 ms	9456 KB	Output is correct
11	Correct	9 ms	9456 KB	Output is correct
12	Correct	11 ms	9456 KB	Output is correct
13	Correct	12 ms	9456 KB	Output is correct
14	Correct	12 ms	9456 KB	Output is correct
15	Correct	9 ms	9456 KB	Output is correct
16	Correct	10 ms	9456 KB	Output is correct
17	Correct	9 ms	9456 KB	Output is correct
18	Correct	10 ms	9456 KB	Output is correct
19	Correct	10 ms	9456 KB	Output is correct
20	Correct	13 ms	9456 KB	Output is correct
21	Correct	10 ms	9456 KB	Output is correct
22	Incorrect	12 ms	9456 KB	3rd lines differ - on the 1st token, expected: '2082', found: '2002'
23	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	9080 KB	Output is correct
2	Correct	10 ms	9192 KB	Output is correct
3	Correct	10 ms	9352 KB	Output is correct
4	Correct	9 ms	9352 KB	Output is correct
5	Correct	10 ms	9352 KB	Output is correct
6	Correct	9 ms	9456 KB	Output is correct
7	Correct	10 ms	9456 KB	Output is correct
8	Correct	9 ms	9456 KB	Output is correct
9	Correct	10 ms	9456 KB	Output is correct
10	Correct	9 ms	9456 KB	Output is correct
11	Correct	9 ms	9456 KB	Output is correct
12	Correct	11 ms	9456 KB	Output is correct
13	Correct	12 ms	9456 KB	Output is correct
14	Correct	12 ms	9456 KB	Output is correct
15	Correct	9 ms	9456 KB	Output is correct
16	Correct	10 ms	9456 KB	Output is correct
17	Correct	9 ms	9456 KB	Output is correct
18	Correct	10 ms	9456 KB	Output is correct
19	Correct	10 ms	9456 KB	Output is correct
20	Correct	13 ms	9456 KB	Output is correct
21	Correct	10 ms	9456 KB	Output is correct
22	Incorrect	12 ms	9456 KB	3rd lines differ - on the 1st token, expected: '2082', found: '2002'
23	Halted	0 ms	0 KB	-

답안 #69359

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 0 / 10.0

Subtask #3 0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
0 / 10.0

Subtask #3
0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0