oj.uz

답안 #338222

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338222 2020-12-22T18:40:23 Z pit4h 고대 책들 (IOI17_books) C++14
50 / 100
 329 ms 35800 KB 
#include "books.h"
#include "bits/stdc++.h"
#define st first
#define nd second
#define mp make_pair
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 1e6+1;
struct DSU {
	int f[N], cnt[N], l[N], r[N];
	DSU() {
		for(int i=0; i<N; ++i) {
			f[i] = l[i] = r[i] = i;
			cnt[i] = 1;
		}
	}
	int Find(int x) {
		if(f[x]==x) return x;
		f[x] = Find(f[x]);
		return f[x];
	}
	void Union(int x, int y) {
		x = Find(x), y = Find(y);
		if(x==y) return;
		if(cnt[x] < cnt[y]) swap(x, y);
		cnt[x] += cnt[y];
		l[x] = min(l[x], l[y]);
		r[x] = max(r[x], r[y]);
		f[y] = x;
	}
	int getl(int x) { return l[Find(x)]; }
	int getr(int x) { return r[Find(x)]; }
};
DSU dsu;
int segments[2][N];

bool in_range(bool dir, int pos, int le, int ri) {
	if(!dir) return pos > le;
	else return pos < ri;
}
bool overlap(int l1, int r1, int l2, int r2) {
	return (l1<l2 && r1>r2) || (l1>r2 && r1<l2);
}

ll minimum_walk(vector<int> p, int s) {
	int n = p.size();
	ll ans = 0;
	for(int i=0; i<n; ++i) {
		ans += abs(p[i] - i);
		dsu.Union(i, p[i]);
	}
	//cerr<<ans<<'\n';

	vector<int> vec;
	for(int i=n-1; i>=0; --i) {
		while(vec.size() && dsu.getr(i) >= vec.back()) {
			if(dsu.getl(vec.back()) < i) {
				dsu.Union(i, vec.back());
			}
			vec.pop_back();
		}
		vec.push_back(i);
	}
	
	for(int i=0; i<n; ++i) {
		segments[0][i] = segments[1][i] = i;
	}
	
	for(int i=0; i<n; ++i) {
		if(dsu.Find(i)==i && dsu.getl(i)!=dsu.getr(i)) {
			segments[0][dsu.getl(i)] = dsu.getr(i);
			segments[1][dsu.getr(i)] = dsu.getl(i);
		}
	}

	int le=0, ri=n-1;
	while(le<s && dsu.getl(le)==dsu.getr(le)) {
		le++;
	}
	while(ri>s && dsu.getl(ri)==dsu.getr(ri)) {
		ri--;
	}

	/*int pos[2] = {dsu.getl(s), dsu.getr(s)}, move[2] = {-1, 1};
	while(pos[0]>le || pos[1]<ri) {
		int cost[2] = {0, 0}, lim[2] = {pos[0], pos[1]};	
		pos[0]--; pos[1]++;
		for(int dir=0; dir<2; ++dir) {
			while(in_range(dir, pos[dir], le, ri) && !overlap(pos[dir], segments[dir][pos[dir]], lim[0], lim[1]) ) {
				cost[dir] -= abs(pos[dir] - segments[!dir][pos[dir]]);
				pos[dir] = segments[!dir][pos[dir]] + move[dir];
			}
		}
		pos[0] = max(pos[0], le), pos[1] = min(pos[1], ri);
		cost[0] += lim[0] - pos[0];
		cost[1] += pos[1] - lim[1];
		if(segments[0][pos[0]] == pos[1]) {
			ans += min(cost[0], cost[1]) * 2;
		}
		else {
			ans += (cost[0] + cost[1]) * 2;
		}
	}*/
	while(true) {
		int cur = -1;
		for(int i=dsu.getl(s)-1; i>=le; --i) {
			if(overlap(i, dsu.getr(i), s, s)) {
				cur = i;	
				break;
			}
		}
		int cost1=1, cost2=1;
		int start = cur+1;
		if(cur==-1) start = le, cost1=0;
		for(int i=start; i<dsu.getl(s); ++i) {
			cost1++;
			i = dsu.getr(i);
		}
		if(cur==-1) start=ri, cost2=0;
		else start=dsu.getr(cur)-1;
		for(int i=start; i>dsu.getr(s); --i) {
			cost2++;
			i = dsu.getl(i);
		}
		if(cur==-1) {
			ans += (cost1+cost2)*2;	
			break;
		}
		ans += min(cost1, cost2)*2;
		dsu.Union(cur, s);
	}
	return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 15980 KB Output is correct
2 Correct 11 ms 15980 KB Output is correct
3 Correct 10 ms 15980 KB Output is correct
4 Correct 10 ms 15980 KB Output is correct
5 Correct 10 ms 15980 KB Output is correct
6 Correct 11 ms 15980 KB Output is correct
7 Correct 11 ms 16000 KB Output is correct
8 Correct 11 ms 15980 KB Output is correct
9 Correct 10 ms 15980 KB Output is correct
10 Correct 10 ms 15980 KB Output is correct
11 Correct 10 ms 15980 KB Output is correct
12 Correct 10 ms 15980 KB Output is correct
13 Correct 10 ms 15980 KB Output is correct
14 Correct 11 ms 15980 KB Output is correct
15 Correct 10 ms 15980 KB Output is correct
16 Correct 10 ms 16108 KB Output is correct
17 Correct 10 ms 15980 KB Output is correct
18 Correct 10 ms 15980 KB Output is correct
19 Correct 10 ms 15980 KB Output is correct
20 Correct 11 ms 16000 KB Output is correct
21 Correct 11 ms 15980 KB Output is correct
22 Correct 11 ms 16108 KB Output is correct
23 Correct 11 ms 15980 KB Output is correct
24 Correct 11 ms 16000 KB Output is correct
25 Correct 11 ms 15980 KB Output is correct
26 Correct 11 ms 15980 KB Output is correct
27 Correct 11 ms 15980 KB Output is correct
28 Correct 11 ms 16000 KB Output is correct
29 Correct 11 ms 15980 KB Output is correct
30 Correct 329 ms 31800 KB Output is correct
31 Correct 326 ms 31600 KB Output is correct
32 Correct 162 ms 35800 KB Output is correct
33 Correct 185 ms 34280 KB Output is correct
34 Correct 182 ms 34264 KB Output is correct
35 Correct 187 ms 33500 KB Output is correct
36 Correct 195 ms 32352 KB Output is correct
37 Correct 195 ms 31724 KB Output is correct
38 Correct 195 ms 31596 KB Output is correct
39 Correct 200 ms 31724 KB Output is correct
40 Correct 203 ms 31596 KB Output is correct
41 Correct 260 ms 31596 KB Output is correct
42 Correct 237 ms 31596 KB Output is correct
43 Correct 187 ms 31596 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 15980 KB Output is correct
2 Correct 11 ms 15980 KB Output is correct
3 Correct 10 ms 15980 KB Output is correct
4 Correct 10 ms 15980 KB Output is correct
5 Correct 10 ms 15980 KB Output is correct
6 Correct 11 ms 15980 KB Output is correct
7 Correct 11 ms 16000 KB Output is correct
8 Correct 11 ms 15980 KB Output is correct
9 Correct 10 ms 15980 KB Output is correct
10 Correct 10 ms 15980 KB Output is correct
11 Correct 10 ms 15980 KB Output is correct
12 Correct 10 ms 15980 KB Output is correct
13 Correct 10 ms 15980 KB Output is correct
14 Correct 11 ms 15980 KB Output is correct
15 Correct 10 ms 15980 KB Output is correct
16 Correct 10 ms 16108 KB Output is correct
17 Correct 10 ms 15980 KB Output is correct
18 Correct 10 ms 15980 KB Output is correct
19 Correct 10 ms 15980 KB Output is correct
20 Correct 11 ms 16000 KB Output is correct
21 Correct 11 ms 15980 KB Output is correct
22 Correct 11 ms 16108 KB Output is correct
23 Correct 11 ms 15980 KB Output is correct
24 Correct 11 ms 16000 KB Output is correct
25 Correct 11 ms 15980 KB Output is correct
26 Correct 11 ms 15980 KB Output is correct
27 Correct 11 ms 15980 KB Output is correct
28 Correct 11 ms 16000 KB Output is correct
29 Correct 11 ms 15980 KB Output is correct
30 Correct 329 ms 31800 KB Output is correct
31 Correct 326 ms 31600 KB Output is correct
32 Correct 162 ms 35800 KB Output is correct
33 Correct 185 ms 34280 KB Output is correct
34 Correct 182 ms 34264 KB Output is correct
35 Correct 187 ms 33500 KB Output is correct
36 Correct 195 ms 32352 KB Output is correct
37 Correct 195 ms 31724 KB Output is correct
38 Correct 195 ms 31596 KB Output is correct
39 Correct 200 ms 31724 KB Output is correct
40 Correct 203 ms 31596 KB Output is correct
41 Correct 260 ms 31596 KB Output is correct
42 Correct 237 ms 31596 KB Output is correct
43 Correct 187 ms 31596 KB Output is correct
44 Incorrect 11 ms 15980 KB 3rd lines differ - on the 1st token, expected: '3304', found: '2748'
45 Halted 0 ms 0 KB -