oj.uz

답안 #782494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782494 2023-07-14T03:09:05 Z GusterGoose27 고대 책들 (IOI17_books) C++17
50 / 100
 191 ms 68920 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();
			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 12 ms 23764 KB Output is correct
2 Correct 12 ms 23800 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23800 KB Output is correct
6 Correct 12 ms 23732 KB Output is correct
7 Correct 12 ms 23796 KB Output is correct
8 Correct 12 ms 23800 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23796 KB Output is correct
11 Correct 12 ms 23800 KB Output is correct
12 Correct 12 ms 23808 KB Output is correct
13 Correct 15 ms 23744 KB Output is correct
14 Correct 16 ms 23796 KB Output is correct
15 Correct 12 ms 23740 KB Output is correct
16 Correct 12 ms 23796 KB Output is correct
17 Correct 12 ms 23796 KB Output is correct
18 Correct 12 ms 23692 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23800 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23800 KB Output is correct
6 Correct 12 ms 23732 KB Output is correct
7 Correct 12 ms 23796 KB Output is correct
8 Correct 12 ms 23800 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23796 KB Output is correct
11 Correct 12 ms 23800 KB Output is correct
12 Correct 12 ms 23808 KB Output is correct
13 Correct 15 ms 23744 KB Output is correct
14 Correct 16 ms 23796 KB Output is correct
15 Correct 12 ms 23740 KB Output is correct
16 Correct 12 ms 23796 KB Output is correct
17 Correct 12 ms 23796 KB Output is correct
18 Correct 12 ms 23692 KB Output is correct
19 Correct 12 ms 23764 KB Output is correct
20 Correct 11 ms 23800 KB Output is correct
21 Correct 12 ms 23764 KB Output is correct
22 Correct 12 ms 23816 KB Output is correct
23 Correct 12 ms 23836 KB Output is correct
24 Correct 12 ms 23808 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 12 ms 23764 KB Output is correct
28 Correct 12 ms 23752 KB Output is correct
29 Correct 12 ms 23796 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23800 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23800 KB Output is correct
6 Correct 12 ms 23732 KB Output is correct
7 Correct 12 ms 23796 KB Output is correct
8 Correct 12 ms 23800 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23796 KB Output is correct
11 Correct 12 ms 23800 KB Output is correct
12 Correct 12 ms 23808 KB Output is correct
13 Correct 15 ms 23744 KB Output is correct
14 Correct 16 ms 23796 KB Output is correct
15 Correct 12 ms 23740 KB Output is correct
16 Correct 12 ms 23796 KB Output is correct
17 Correct 12 ms 23796 KB Output is correct
18 Correct 12 ms 23692 KB Output is correct
19 Correct 12 ms 23764 KB Output is correct
20 Correct 11 ms 23800 KB Output is correct
21 Correct 12 ms 23764 KB Output is correct
22 Correct 12 ms 23816 KB Output is correct
23 Correct 12 ms 23836 KB Output is correct
24 Correct 12 ms 23808 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 12 ms 23764 KB Output is correct
28 Correct 12 ms 23752 KB Output is correct
29 Correct 12 ms 23796 KB Output is correct
30 Correct 138 ms 47828 KB Output is correct
31 Correct 127 ms 49804 KB Output is correct
32 Correct 86 ms 33320 KB Output is correct
33 Correct 183 ms 66808 KB Output is correct
34 Correct 186 ms 66728 KB Output is correct
35 Correct 175 ms 63060 KB Output is correct
36 Correct 160 ms 55488 KB Output is correct
37 Correct 121 ms 49864 KB Output is correct
38 Correct 115 ms 49008 KB Output is correct
39 Correct 111 ms 49196 KB Output is correct
40 Correct 112 ms 48204 KB Output is correct
41 Correct 128 ms 47528 KB Output is correct
42 Correct 120 ms 48184 KB Output is correct
43 Correct 191 ms 68920 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 23764 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 12 ms 23764 KB Output is correct
2 Correct 12 ms 23800 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23800 KB Output is correct
6 Correct 12 ms 23732 KB Output is correct
7 Correct 12 ms 23796 KB Output is correct
8 Correct 12 ms 23800 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 12 ms 23796 KB Output is correct
11 Correct 12 ms 23800 KB Output is correct
12 Correct 12 ms 23808 KB Output is correct
13 Correct 15 ms 23744 KB Output is correct
14 Correct 16 ms 23796 KB Output is correct
15 Correct 12 ms 23740 KB Output is correct
16 Correct 12 ms 23796 KB Output is correct
17 Correct 12 ms 23796 KB Output is correct
18 Correct 12 ms 23692 KB Output is correct
19 Correct 12 ms 23764 KB Output is correct
20 Correct 11 ms 23800 KB Output is correct
21 Correct 12 ms 23764 KB Output is correct
22 Correct 12 ms 23816 KB Output is correct
23 Correct 12 ms 23836 KB Output is correct
24 Correct 12 ms 23808 KB Output is correct
25 Correct 12 ms 23764 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 12 ms 23764 KB Output is correct
28 Correct 12 ms 23752 KB Output is correct
29 Correct 12 ms 23796 KB Output is correct
30 Correct 138 ms 47828 KB Output is correct
31 Correct 127 ms 49804 KB Output is correct
32 Correct 86 ms 33320 KB Output is correct
33 Correct 183 ms 66808 KB Output is correct
34 Correct 186 ms 66728 KB Output is correct
35 Correct 175 ms 63060 KB Output is correct
36 Correct 160 ms 55488 KB Output is correct
37 Correct 121 ms 49864 KB Output is correct
38 Correct 115 ms 49008 KB Output is correct
39 Correct 111 ms 49196 KB Output is correct
40 Correct 112 ms 48204 KB Output is correct
41 Correct 128 ms 47528 KB Output is correct
42 Correct 120 ms 48184 KB Output is correct
43 Correct 191 ms 68920 KB Output is correct
44 Incorrect 14 ms 23764 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45 Halted 0 ms 0 KB -