oj.uz

답안 #782496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782496 2023-07-14T03:10:04 Z GusterGoose27 고대 책들 (IOI17_books) C++17
70 / 100
 230 ms 67780 KB 
#include "books.h"

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e6+5;

typedef long long ll;
typedef pair<int, int> pii;
bool vis[MAXN];
int uf[MAXN];
vector<int> cont[MAXN];
// pii range[MAXN];
// vector<int> in_comp[MAXN];
int par[MAXN];
int dist[MAXN];

int n;

int _abs(int v) {
	return v < 0 ? -v : v;
}

int find(int i) {
	return uf[i] == i ? i : uf[i] = find(uf[i]);
}

void merge(int i, int j) {
	i = find(i);
	j = find(j);
	// if (i == j) return;
	assert(i != j);
	if (cont[i].size() < cont[j].size()) swap(i, j);
	for (int v: cont[j]) {
		cont[i].push_back(v);
		uf[v] = i;
	}
	cont[j].clear();
	uf[j] = i;
	// range[i].first = min(range[i].first, range[j].first);
	// range[i].second = max(range[i].second, range[j].second);
}

void upd(int cur, queue<int> &q) {
	int cdist = 1+dist[find(cur)];
	if (cur && dist[find(cur-1)] > cdist) {
		assert(dist[find(cur-1)] == MAXN);
		dist[find(cur-1)] = cdist;
		q.push(find(cur-1));
	}
	if (cur < n-1 && dist[find(cur+1)] > cdist) {
		assert(dist[find(cur+1)] == MAXN);
		dist[find(cur+1)] = cdist;
		q.push(find(cur+1));
	}
}

ll minimum_walk(vector<int> p, int s) {
	ll ans = 0;
	n = p.size();
	for (int i = 0; i < n; i++) ans += _abs(p[i]-i);
	if (ans == 0) return 0;
	vector<pii> intervals;
	for (int i = 0; i < n; i++) {
		if (vis[i]) continue;
		int cur = i;
		int l = i, r = i;
		do {
			l = min(l, cur);
			r = max(r, cur);
			uf[cur] = i;
			cont[i].push_back(cur);
			vis[cur] = 1;
			cur = p[cur];
		} while (cur != i);
		if (r > l || i == s) intervals.push_back(pii(l, r));
		// range[i] = pii(l, r);
	}
	sort(intervals.begin(), intervals.end()); // they are probably already sorted
	fill(dist, dist+n, MAXN);
	int curr = intervals[0].second;
	vector<int> stck;
	for (int i = 0; i < intervals.size(); i++) {
		while (!stck.empty() && stck.back() < intervals[i].first) {
			int v = stck.back(); stck.pop_back();
			if (stck.empty()) dist[find(v)] = 0;
			// else par[find(v)] = find(stck.back());
		}
		while (!stck.empty() && stck.back() < intervals[i].second) {
			int v = stck.back(); stck.pop_back();
			merge(v, intervals[i].second);
		}
		stck.push_back(intervals[i].second);
		// assert(curr != intervals[i].first);
		if (curr > intervals[i].first) {
			curr = max(curr, intervals[i].second);
			continue;
		}
		ans += 2*(intervals[i].first-curr);
		curr = intervals[i].second;
	}
	// for (int i = 1; i < stck.size(); i++) par[find(stck[i])] = find(stck[i-1]);
	dist[find(stck[0])] = 0;
	queue<int> q;
	for (int i = 0; i < n; i++) {
		if (dist[i] == 0) dist[find(i)] = 0;
	}
	for (int i = 0; i < n; i++) {
		if (i == find(i) && dist[i] == 0) q.push(i);
	}
	while (!q.empty()) {
		int v = q.front(); q.pop();
		for (int e: cont[v]) upd(e, q);
	}
	// return 0;
	// int dist = 0;
	// s = find(s);
	// while (par[s] != -1) {
	// 	int nxt = find(par[s]);
	// 	dist += min(range[nxt].second-range[s].second, range[s].first-range[nxt].first);
	// 	s = nxt;
	// }
	return ans+2*dist[find(s)];
}

Compilation message

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:84:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |  for (int i = 0; i < intervals.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23704 KB Output is correct
2 Correct 12 ms 23748 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 11 ms 23776 KB Output is correct
6 Correct 15 ms 23840 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23704 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 11 ms 23764 KB Output is correct
12 Correct 11 ms 23804 KB Output is correct
13 Correct 11 ms 23764 KB Output is correct
14 Correct 12 ms 23752 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23780 KB Output is correct
17 Correct 12 ms 23744 KB Output is correct
18 Correct 12 ms 23804 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23704 KB Output is correct
2 Correct 12 ms 23748 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 11 ms 23776 KB Output is correct
6 Correct 15 ms 23840 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23704 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 11 ms 23764 KB Output is correct
12 Correct 11 ms 23804 KB Output is correct
13 Correct 11 ms 23764 KB Output is correct
14 Correct 12 ms 23752 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23780 KB Output is correct
17 Correct 12 ms 23744 KB Output is correct
18 Correct 12 ms 23804 KB Output is correct
19 Correct 11 ms 23764 KB Output is correct
20 Correct 14 ms 23784 KB Output is correct
21 Correct 12 ms 23876 KB Output is correct
22 Correct 12 ms 23764 KB Output is correct
23 Correct 12 ms 23764 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 14 ms 23764 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 11 ms 23764 KB Output is correct
28 Correct 12 ms 23764 KB Output is correct
29 Correct 12 ms 23764 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23704 KB Output is correct
2 Correct 12 ms 23748 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 11 ms 23776 KB Output is correct
6 Correct 15 ms 23840 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23704 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 11 ms 23764 KB Output is correct
12 Correct 11 ms 23804 KB Output is correct
13 Correct 11 ms 23764 KB Output is correct
14 Correct 12 ms 23752 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23780 KB Output is correct
17 Correct 12 ms 23744 KB Output is correct
18 Correct 12 ms 23804 KB Output is correct
19 Correct 11 ms 23764 KB Output is correct
20 Correct 14 ms 23784 KB Output is correct
21 Correct 12 ms 23876 KB Output is correct
22 Correct 12 ms 23764 KB Output is correct
23 Correct 12 ms 23764 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 14 ms 23764 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 11 ms 23764 KB Output is correct
28 Correct 12 ms 23764 KB Output is correct
29 Correct 12 ms 23764 KB Output is correct
30 Correct 129 ms 46116 KB Output is correct
31 Correct 134 ms 48052 KB Output is correct
32 Correct 88 ms 31556 KB Output is correct
33 Correct 207 ms 64936 KB Output is correct
34 Correct 181 ms 65060 KB Output is correct
35 Correct 184 ms 61316 KB Output is correct
36 Correct 158 ms 53668 KB Output is correct
37 Correct 123 ms 48056 KB Output is correct
38 Correct 120 ms 47292 KB Output is correct
39 Correct 115 ms 47416 KB Output is correct
40 Correct 117 ms 46392 KB Output is correct
41 Correct 131 ms 45512 KB Output is correct
42 Correct 120 ms 46396 KB Output is correct
43 Correct 230 ms 65660 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 13 ms 23820 KB Output is correct
3 Correct 12 ms 23784 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 12 ms 23796 KB Output is correct
8 Correct 13 ms 23796 KB Output is correct
9 Correct 13 ms 23824 KB Output is correct
10 Correct 13 ms 23792 KB Output is correct
11 Correct 12 ms 23756 KB Output is correct
12 Correct 12 ms 23832 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 12 ms 23764 KB Output is correct
15 Correct 11 ms 23800 KB Output is correct
16 Correct 14 ms 23796 KB Output is correct
17 Correct 12 ms 23912 KB Output is correct
18 Correct 14 ms 23844 KB Output is correct
19 Correct 12 ms 23800 KB Output is correct
20 Correct 14 ms 23800 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23704 KB Output is correct
2 Correct 12 ms 23748 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 11 ms 23776 KB Output is correct
6 Correct 15 ms 23840 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23704 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 11 ms 23764 KB Output is correct
12 Correct 11 ms 23804 KB Output is correct
13 Correct 11 ms 23764 KB Output is correct
14 Correct 12 ms 23752 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23780 KB Output is correct
17 Correct 12 ms 23744 KB Output is correct
18 Correct 12 ms 23804 KB Output is correct
19 Correct 11 ms 23764 KB Output is correct
20 Correct 14 ms 23784 KB Output is correct
21 Correct 12 ms 23876 KB Output is correct
22 Correct 12 ms 23764 KB Output is correct
23 Correct 12 ms 23764 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 14 ms 23764 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 11 ms 23764 KB Output is correct
28 Correct 12 ms 23764 KB Output is correct
29 Correct 12 ms 23764 KB Output is correct
30 Correct 129 ms 46116 KB Output is correct
31 Correct 134 ms 48052 KB Output is correct
32 Correct 88 ms 31556 KB Output is correct
33 Correct 207 ms 64936 KB Output is correct
34 Correct 181 ms 65060 KB Output is correct
35 Correct 184 ms 61316 KB Output is correct
36 Correct 158 ms 53668 KB Output is correct
37 Correct 123 ms 48056 KB Output is correct
38 Correct 120 ms 47292 KB Output is correct
39 Correct 115 ms 47416 KB Output is correct
40 Correct 117 ms 46392 KB Output is correct
41 Correct 131 ms 45512 KB Output is correct
42 Correct 120 ms 46396 KB Output is correct
43 Correct 230 ms 65660 KB Output is correct
44 Correct 12 ms 23764 KB Output is correct
45 Correct 13 ms 23820 KB Output is correct
46 Correct 12 ms 23784 KB Output is correct
47 Correct 12 ms 23764 KB Output is correct
48 Correct 12 ms 23764 KB Output is correct
49 Correct 12 ms 23764 KB Output is correct
50 Correct 12 ms 23796 KB Output is correct
51 Correct 13 ms 23796 KB Output is correct
52 Correct 13 ms 23824 KB Output is correct
53 Correct 13 ms 23792 KB Output is correct
54 Correct 12 ms 23756 KB Output is correct
55 Correct 12 ms 23832 KB Output is correct
56 Correct 12 ms 23764 KB Output is correct
57 Correct 12 ms 23764 KB Output is correct
58 Correct 11 ms 23800 KB Output is correct
59 Correct 14 ms 23796 KB Output is correct
60 Correct 12 ms 23912 KB Output is correct
61 Correct 14 ms 23844 KB Output is correct
62 Correct 12 ms 23800 KB Output is correct
63 Correct 14 ms 23800 KB Output is correct
64 Incorrect 187 ms 67780 KB 3rd lines differ - on the 1st token, expected: '9339550', found: '9339552'
65 Halted 0 ms 0 KB -