oj.uz

답안 #613966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
613966 2022-07-30T15:02:57 Z thezomb1e 고대 책들 (IOI17_books) C++17
50 / 100
 510 ms 71180 KB 
#include "books.h"
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#define eb emplace_back
#define pb push_back
#define ft first
#define sd second
#define pi pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(...) dbg_out(__VA_ARGS__)
 
using ll = long long;
using ld = long double;
using namespace std;
using namespace __gnu_pbds;
 
//Constants
const ll INF = 5 * 1e18;
const int IINF = 2 * 1e9;
// const ll MOD = 1e9 + 7;
const ll MOD = 998244353;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ld PI = 3.14159265359;
 
//Templates
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) {return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '['; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << ']';}
void dbg_out() {cerr << endl;}
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ' '; dbg_out(T...); }
template<typename T> void mins(T& x, T y) {x = min(x, y);}
template<typename T> void maxs(T& x, T y) {x = max(x, y);}
template<typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using omset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

long long minimum_walk(vector<int> p, int s) {
	int n = p.size();
	vector<int> min(n, 1 << 30);
	vector<int> max(n, -1);
	vector<int> col(n, -1);
	for (int i = 0, cnt = 0; i < n; i++) {
		if (col[i] != -1) {
			continue;
		}
		int u = i;
		do {
			min[cnt] = std::min(min[cnt], u);
			max[cnt] = std::max(max[cnt], u);
			col[u] = cnt;
			u = p[u];
		} while (u != i);
		cnt++;
	}
	int l = 0, r = n - 1;
	while (l < s && l == p[l]) {
		l++;
	}
	while (r > s && r == p[r]) {
		r--;
	}
	set<int> st;
	for (int i = l; i <= r; i++) {
		st.insert(i);
	}
	int dr = 0;
	vector<int> dis(n, 1 << 30);
	deque<pi> q;
	q.emplace_back(col[s], dis[col[s]] = 0);
	while (q.size()) {
		int v = q.front().first;
		int d = q.front().second;
		q.pop_front();
		if (d != dis[v]) {
			continue;
		}
		int mn = min[v];
		int mx = max[v];
		dr = s >= mn && s <= mx ? d : dr;
		while (true) {
			int u;
			auto it = st.lower_bound(mn);
			if (it == st.end() || (u = *it) > mx) {
				break;
			}
			st.erase(it);
			if (d < dis[col[u]]) {
				q.emplace_front(col[u], dis[col[u]] = d);
			}
		}
		if (v < r && d + 1 < dis[col[v + 1]]) {
			q.emplace_back(col[v + 1], dis[col[v + 1]] = d + 1);
		}
		if (v > l && d + 1 < dis[col[v - 1]]) {
			q.emplace_back(col[v - 1], dis[col[v - 1]] = d + 1);
		}
	}
	ll ans = 0;
	for (int i = l; i <= r; i++) {
		ans += abs(i - p[i]);
	}
	int cnt = 0;
	for (int i = l; i <= r; i++) {
		dr += !cnt && s < i;
		cnt += max[col[i]] == i;
		cnt -= min[col[i]] == i;
	}
	cnt = 0;
	for (int i = r; i >= l; i--) {
		dr += !cnt && s > i;
		cnt += max[col[i]] == i;
		cnt -= min[col[i]] == i;
	}
	return ans + dr * 2;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 483 ms 70992 KB Output is correct
31 Correct 510 ms 71020 KB Output is correct
32 Correct 93 ms 24064 KB Output is correct
33 Correct 374 ms 71020 KB Output is correct
34 Correct 366 ms 70936 KB Output is correct
35 Correct 372 ms 71180 KB Output is correct
36 Correct 385 ms 70908 KB Output is correct
37 Correct 370 ms 70972 KB Output is correct
38 Correct 379 ms 70972 KB Output is correct
39 Correct 385 ms 71160 KB Output is correct
40 Correct 384 ms 71012 KB Output is correct
41 Correct 408 ms 71136 KB Output is correct
42 Correct 382 ms 71032 KB Output is correct
43 Correct 475 ms 71140 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 483 ms 70992 KB Output is correct
31 Correct 510 ms 71020 KB Output is correct
32 Correct 93 ms 24064 KB Output is correct
33 Correct 374 ms 71020 KB Output is correct
34 Correct 366 ms 70936 KB Output is correct
35 Correct 372 ms 71180 KB Output is correct
36 Correct 385 ms 70908 KB Output is correct
37 Correct 370 ms 70972 KB Output is correct
38 Correct 379 ms 70972 KB Output is correct
39 Correct 385 ms 71160 KB Output is correct
40 Correct 384 ms 71012 KB Output is correct
41 Correct 408 ms 71136 KB Output is correct
42 Correct 382 ms 71032 KB Output is correct
43 Correct 475 ms 71140 KB Output is correct
44 Incorrect 1 ms 340 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2766'
45 Halted 0 ms 0 KB -