oj.uz

답안 #294769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
294769 2020-09-09T09:26:08 Z amoo_safar 고대 책들 (IOI17_books) C++17
50 / 100
 2000 ms 29400 KB 
#include "books.h"

#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;

const int N = 1e6 + 10;

int mk[N], mk2[N];
int L[N], R[N];
//int mn[N][N], mx[N][N];
//ll dp[N][N];

ll minimum_walk(vector<int> p, int s) {
	int n = p.size();
	ll ans = 0;
	ll near = n;
	for(int i = 0; i < n; i++){
		if(p[i] != i){
			ans += abs(p[i] - i);
		} else {
			//mk[i] = 1;
			R[i] = i;
			L[i] = i;
		}
	}
	cerr << "# " << ans << '\n';
	mk[s] = 0;
	int st = 0, en = n - 1;
	while(p[st] == st && st < s){ mk[st] = 1; st ++; }
	while(p[en] == en && en > s){ mk[en] = 1; en --; }

	int com = 0;
	vector<pii> seg;
	for(int i = st; i < en; i++){
		if(mk[i]) continue;
		com ++;
		vector<int> vis;
		int nw = i;
		while(!mk[nw]){
			mk[nw] = 1;
			vis.pb(nw);
			nw = p[nw];
		}
		sort(all(vis));
		seg.pb({vis[0], vis.back()});
		for(auto x : vis) L[x] = vis[0];
		for(auto x : vis) R[x] = vis.back();
	}
	if(com == 0) return 0;
	sort(all(seg));
	int mxr = st;
	for(int i = 0; i < (int)seg.size(); i++){
		if(mxr < seg[i].F)
			mk2[mxr] = 1, ans += 2;
		mxr = max(mxr, seg[i].S);
	}
	mk2[mxr] = 1;
	/*
	for(int i = 0; i < n; i++) mn[i][i] = L[i];
	for(int i = 0; i < n; i++) mx[i][i] = R[i];
	for(int ln = 1; ln < n; ln ++){
		for(int i = 0; i + ln < n; i++){
			int j = i + ln;
			mn[i][j] = min(mn[i][j - 1], mn[i + 1][j]);
			mx[i][j] = max(mx[i][j - 1], mx[i + 1][j]);
		}
	}
	*/
	//if(ans == 0) return 0;

	int nwl = s;
	int nwr = s;
	int mxl = L[s];
	mxr = R[s];
	cerr << ans << '\n';
	while(!mk2[nwr]){

		int l2 = mxl;
		int r2 = mxr;
		//cerr << "! " << nwl << ' ' << nwr << ' ' << l2 << ' ' << r2 << '\n';
		if(pii(l2, r2) == pii(nwl, nwr) && !mk2[r2]){
			ans += 2;
			l2 --;
			r2 ++;
		}
		while(nwl > l2){nwl --; mxl = min(mxl, L[nwl]);}
		while(nwr < r2){nwr ++; mxr = max(mxr, R[nwr]);}
		//nwl = l2;
		//nwr = r2;
	}

	return ans;
}
/*
4 1
0 3 1 2

*/

Compilation message

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:25:5: warning: unused variable 'near' [-Wunused-variable]
   25 |  ll near = n;
      |     ^~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 394 ms 23136 KB Output is correct
31 Correct 366 ms 21892 KB Output is correct
32 Correct 157 ms 19836 KB Output is correct
33 Correct 253 ms 29400 KB Output is correct
34 Correct 253 ms 29396 KB Output is correct
35 Correct 248 ms 28252 KB Output is correct
36 Correct 238 ms 25960 KB Output is correct
37 Correct 221 ms 24300 KB Output is correct
38 Correct 228 ms 22520 KB Output is correct
39 Correct 240 ms 22264 KB Output is correct
40 Correct 253 ms 20596 KB Output is correct
41 Correct 289 ms 20868 KB Output is correct
42 Correct 278 ms 20908 KB Output is correct
43 Correct 256 ms 27872 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2084 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 394 ms 23136 KB Output is correct
31 Correct 366 ms 21892 KB Output is correct
32 Correct 157 ms 19836 KB Output is correct
33 Correct 253 ms 29400 KB Output is correct
34 Correct 253 ms 29396 KB Output is correct
35 Correct 248 ms 28252 KB Output is correct
36 Correct 238 ms 25960 KB Output is correct
37 Correct 221 ms 24300 KB Output is correct
38 Correct 228 ms 22520 KB Output is correct
39 Correct 240 ms 22264 KB Output is correct
40 Correct 253 ms 20596 KB Output is correct
41 Correct 289 ms 20868 KB Output is correct
42 Correct 278 ms 20908 KB Output is correct
43 Correct 256 ms 27872 KB Output is correct
44 Execution timed out 2084 ms 384 KB Time limit exceeded
45 Halted 0 ms 0 KB -